1.1 Introduction to Set Theory

A
B

Welcome to the magical world of set theory! Sets are one of the most fundamental concepts in mathematics, and they're all around us in daily life.

Real World Examples

  • Your collection of favorite songs is a set of music tracks
  • All students in your class form a set of students
  • The colors in a rainbow make up a set of colors

Why Learn Sets?

  • Foundation for advanced math
  • Used in computer science
  • Helps in logical reasoning
  • Essential for data organization

Fun Fact!

The concept of sets was first developed by German mathematician Georg Cantor in the 1870s while he was studying trigonometric series!

1.2 What is a Set?

A = {1, 2, 3}

Definition

A set is a well-defined collection of distinct objects, considered as an object in its own right. The objects in a set are called elements or members.

Examples of Sets

Set of vowels: V = {a, e, i, o, u}

Set of single-digit prime numbers: P = {2, 3, 5, 7}

Set of colors in Indian flag: C = {Saffron, White, Green}

Key Characteristics

  • Elements: The objects in a set are called elements or members.
  • Uniqueness: Each element is unique - no duplicates allowed!
  • Unordered: The order of elements doesn't matter. {1,2,3} is same as {3,2,1}

Notation

We usually denote sets by capital letters (A, B, C,...) and elements by lowercase letters (a, b, c,...).

The symbol ∈ means "is an element of". For example: a ∈ A means "a is an element of set A".

1.3 Representation of a Set

1
2
3
A = {1, 2, 3}

Set Representation Methods

There are three main ways to represent sets in mathematics:

1. Roster (Tabular) Form

All elements are listed, separated by commas, and enclosed in curly braces {}.

Example: V = {a, e, i, o, u}

2. Set-Builder Form

Describes the properties that elements must satisfy.

Example: V = {x | x is a vowel in English alphabet}

Read as: "V is the set of all x such that x is a vowel in English alphabet"

3. Venn Diagram

A visual representation using circles or other shapes to show relationships between sets.

The diagram above shows set A with elements 1, 2, and 3.

Interactive Challenge!

Try representing these in both roster and set-builder forms:

  1. Set of even numbers less than 10
  2. Set of planets in our solar system

1.4 Types of Sets

Universal Set
Finite
Infinite
Singleton
Empty

Classification of Sets

Sets can be categorized based on their size and relationship to other sets:

1. Empty (Null) Set

∅ or { }

Example: The set of humans living on Mars = ∅

Properties: Unique, subset of every set, identity element for union

2. Singleton Set

{a}

Example: The set of natural satellites of Earth = {Moon}

Properties: Cardinality of 1, can be element of other sets

3. Finite Set

|A| = n where n ∈ ℕ

Example: Set of fingers on one hand = {1, 2, 3, 4, 5}

Properties: Countable elements, can be listed completely

4. Infinite Set

|A| is unlimited

Example: Set of natural numbers = {1, 2, 3, 4, ...}

Properties: Cannot be listed completely, may be countable or uncountable

5. Universal Set

U

Example: When discussing numbers, U might be all real numbers

Properties: Contains all objects under consideration, complement is empty set

1.5 Set Operations

A
B

Basic Set Operations

Just like numbers, we can perform operations on sets to create new sets:

1. Union (A ∪ B)

A ∪ B = {x | x ∈ A or x ∈ B}

Example: If A = {1,2,3} and B = {3,4,5}, then A ∪ B = {1,2,3,4,5}

Properties: Commutative, associative, A ∪ ∅ = A, A ∪ U = U

2. Intersection (A ∩ B)

A ∩ B = {x | x ∈ A and x ∈ B}

Example: If A = {1,2,3} and B = {3,4,5}, then A ∩ B = {3}

Properties: Commutative, associative, A ∩ ∅ = ∅, A ∩ U = A

3. Difference (A - B)

A - B = {x | x ∈ A and x ∉ B}

Example: If A = {1,2,3} and B = {3,4,5}, then A - B = {1,2}

Properties: Not commutative, A - ∅ = A, A - A = ∅

4. Complement (A')

A' = {x | x ∈ U and x ∉ A}

Example: If U = {1,2,3,4,5} and A = {1,2,3}, then A' = {4,5}

Properties: (A')' = A, U' = ∅, ∅' = U

Real World Connection

Set operations are used in database searches, digital logic circuits, and even in your phone's contact list when you combine groups!

1.6 Properties of Set Operations

A
B
C

Fundamental Properties

Set operations follow important algebraic properties that make working with them easier:

1. Commutative Laws

A ∪ B = B ∪ A

A ∩ B = B ∩ A

Meaning: The order of sets doesn't matter for union and intersection

2. Associative Laws

(A ∪ B) ∪ C = A ∪ (B ∪ C)

(A ∩ B) ∩ C = A ∩ (B ∩ C)

Meaning: Grouping of sets doesn't matter for union and intersection

3. Distributive Laws

A ∪ (B ∩ C) = (A ∪ B) ∩ (A ∪ C)

A ∩ (B ∪ C) = (A ∩ B) ∪ (A ∩ C)

Meaning: Union distributes over intersection and vice versa

4. Identity Laws

A ∪ ∅ = A

A ∩ U = A

Meaning: Empty set is identity for union, universal set for intersection

5. Complement Laws

A ∪ A' = U

A ∩ A' = ∅

Meaning: A set combined with its complement gives universal or empty set

Interactive Example

Let's verify the commutative law with A = {1,2,3} and B = {3,4,5}:

A ∪ B = {1,2,3,4,5}

B ∪ A = {3,4,5,1,2} = {1,2,3,4,5} (same!)

1.7 De Morgan's Laws

A
B

De Morgan's Laws

These fundamental rules relate the union and intersection of sets through their complements:

First Law: Complement of Union

(A ∪ B)' = A' ∩ B'

Visualization: The area outside both circles is the intersection of the areas outside each circle

Application: Used in digital logic to convert OR gates to AND gates with inverted inputs

Second Law: Complement of Intersection

(A ∩ B)' = A' ∪ B'

Visualization: The area outside the overlapping region is the union of the areas outside each circle

Application: Used in probability theory to calculate probabilities of combined events

Example Verification

Let U = {1,2,3,4,5,6,7,8}, A = {1,2,3,4}, B = {3,4,5,6}

A ∪ B = {1,2,3,4,5,6}

(A ∪ B)' = {7,8}

A' = {5,6,7,8}, B' = {1,2,7,8}

A' ∩ B' = {7,8}

Thus, (A ∪ B)' = A' ∩ B'

Applications

De Morgan's Laws are extensively used in digital electronics, computer programming, and probability theory!

1.8 Application on Cardinality of Sets

A
B
5
3
4

Cardinality of Sets

The cardinality of a set is the number of elements in the set, denoted by |A| or n(A). Cardinality formulas help count elements in combined sets.

Formula for Union of Two Sets

n(A ∪ B) = n(A) + n(B) - n(A ∩ B)

Explanation: We add both sets' sizes but subtract the intersection to avoid double-counting shared elements

Example: If n(A)=20, n(B)=25, n(A∩B)=10, then n(A∪B)=20+25-10=35

Formula for Three Sets

n(A ∪ B ∪ C) = n(A) + n(B) + n(C) - n(A ∩ B) - n(B ∩ C) - n(A ∩ C) + n(A ∩ B ∩ C)

Explanation: This accounts for all overlaps between the three sets

Application: Used in survey analysis when respondents can select multiple options

Example Problem

In a class of 40 students, 20 play cricket, 25 play football, and 10 play both. How many play at least one sport?

Solution:

Let C = cricket players, F = football players

n(C ∪ F) = n(C) + n(F) - n(C ∩ F) = 20 + 25 - 10 = 35

So, 35 students play at least one sport.

Practical Use

Cardinality formulas help in survey analysis, database queries, and probability calculations where overlaps occur.