Equivalent Sets Sets Universal Set

Just Cardinality Collection of Well Defined Contains all elements in

is Same and Distinct Objects a given context

Equal Sets
Super Sets[⊇,⊃]
Same Cardinality Representation Contains all elements of
and same elements
1. Descriptive another set within it
(Words, Description)
Finite Sets 2. Tabular Power Sets[P(A)]
(Finite # of Elements) SubSets [⊂,⊂ ] contains all subsets,
(Values)
Contains elements all including itself and the
3. Set Builder
(Condition or Property with found in Superset empty set
Infinite Sets Symbols)
Infinite # of elements

Venn Diagrams Proper SubSet [⊂]

Countable Infinite Improper Subset [ ⊂ ,= ]
( A visual representation using circles Contains some, but not all,
Uncountable Infinite identical to the original set
(1-1 Correspondence to depict sets and their relationships) elements of the original set.
(1-1 Correspondence
with Natural #) Disjoint:
can't be established)
e.g N, W , Z , Q Venn diagrams with non-touching circles,
e.g R , Q'
Cardinality = indicating no shared elements between sets.
Overlapping:
Venn diagrams with intersecting circles,
showing common elements between sets.
Subsets:
One circle entirely inside another ,
representing one set as a subset of the other.

Cartesian Product:
Properties and Laws of Sets Opertaions Operations on Sets
The set of all ordered pairs from
1. Commutative Law: 1. Union (AUB):
two sets A×B.
AUB = BUA & A ∩ B=A ∩ B Combines all elements of two sets, excluding
2. Associative Law: duplicates.
AU(BUC) = (AUB)UC & A∩(B∩C)=(A∩B)∩C 2. Intersection (A∩B):
Binary Relation: Cardinality of a Relation
3. Distributive Law: Contains only common elements
A subset of the Cartesian product, Total pairs in A×B, given by n(A)×n(B)
AU(B∩C) = (AUB)∩(AUC) and A∩(BUC) = (A∩B)U(ANC) 3. Difference (A-B):
signifying n(AxB)
4. Identity Law: Elements present in one set but not in the other. 2 , representing all Realtions
a connection between two sets
AU∅ = A and A∩U = A (where U is the universal set). 4. Complement (A'=U-A):
5. Complement Law: Elements not present in the given set, relative
AUA' = U & A∩A' = 0. to a universal set
6. Double Complement Law:
A" = A Range:[Actual Output]
Domain [Input] Co-Domain:[Possible Output]
7. Idempotent Law: The set of all second
The set of all first elements from The total set of potential outputs,
AUA= A and A∩A = A. elements derived from the
ordered pairs in a relation. not necessarily in the relation
8. Universal Bound Law: ordered pairs in a relation
AUU = U and A∩∅ = ∅.
9. DeMorgan's Law: Representations of Relations:
(AUB)' = A'∩B' and (A∩B)' = A' ∪ B' 1. Tables: Displaying relations in a table
10. Absorption Law: 2. Graphs: Visualising relations using points
AU (A ∩ B) = A and A∩(AUB)=A. and curves.
3. Arrow Diagrams: Connecting elements of
two sets with arrows to
illustrate relations.
4. Set Builder Notation: Expressing relations
with a rule and a
condition