Scribd
Upload
25 views6 pages

Notes Set Theory

The document provides an overview of set theory, defining sets, their types, and operations such as union, intersection, and difference. It includes important laws like the commutative and distributive laws, along with applications of set theory in various fields. Additionally, it discusses cardinality and the concept of power sets.

Uploaded by

dominegang09
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
25 views6 pages

Notes Set Theory

The document provides an overview of set theory, defining sets, their types, and operations such as union, intersection, and difference. It includes important laws like the commutative and distributive laws, along with applications of set theory in various fields. Additionally, it discusses cardinality and the concept of power sets.

Uploaded by

dominegang09
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
You are on page 1/ 6

Set Theory – Class 11 Notes

1. Introduction to Sets
A set is a well-defined collection of distinct objects.

Elements: The objects in a set are called its elements/members.

Notation:

Sets are denoted by capital letters (A, B, C…).

Elements are listed in curly braces { } or described by a rule.

Example:

Roster form:
A
=
{
1
,
2
,
3
}
A={1,2,3}

Set-builder form:
B
=
{
x
∣
x
is an even number
}
B={x∣x is an even number}

2. Types of Sets
Empty (Null) Set (∅ or { }): A set with no elements.

Singleton Set: A set with only one element.

Finite Set: A set with a countable number of elements.

Infinite Set: A set with an unlimited number of elements (e.g., natural numbers).

Equal Sets: Two sets with exactly the same elements.

Equivalent Sets: Two sets with the same number of elements.

Subset (A ⊆ B): All elements of A are in B.

Proper Subset (A ⊂ B): A is a subset of B but A ≠ B.

Power Set (P(A)): The set of all subsets of A.

Universal Set (U): A set containing all objects under consideration.

3. Operations on Sets
Union (A ∪ B): All elements in A or B or both.

Intersection (A ∩ B): Common elements in A and B.

Difference (A – B): Elements in A but not in B.

Complement (A’ or
A
‾
A
): Elements in U but not in A.

Symmetric Difference (A Δ B): Elements in A or B but not in both.

4. Venn Diagrams
Visual representation of sets using overlapping circles.

Helps illustrate unions, intersections, and differences.

5. Important Laws
Commutative Law:

A
∪
B
=
B
∪
A
A∪B=B∪A

A
∩
B
=
B
∩
A
A∩B=B∩A

Associative Law:

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

Distributive Law:

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

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

De Morgan’s Law:

(
A
∪
B
)
’
=
A
’
∩
B
’
(A∪B)’=A’∩B’

(
A
∩
B
)
’
=
A
’
∪
B
’
(A∩B)’=A’∪B’

Complement Law:

A
∪
A
’
=
U
A∪A’=U

A
∩
A
’
=
∅
A∩A’=∅

6. Cardinality of Sets
Number of elements in a finite set A: Denoted by
n
(
A
)
n(A).

For two finite sets:


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

For three sets:


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

7. Applications of Set Theory


Used in probability, logic, database queries, and computer science.

Key Points to Remember:


✔ Empty set has no elements.
✔ Power set of a set with
n
n elements has
2
n
2
n
subsets.
✔ De Morgan’s Laws relate complements of unions and intersections.
✔ Venn diagrams help visualize set operations.

You might also like