Comprehensive Study Guide on Set Theory, Set Operations, and Relations
Introduction to Sets
Definition of a Set: A set is a collection of well-defined objects. The criteria used to define a set makes it possible to decide conclusively whether a given object is an element of the set.
Elements: The individual objects contained within a set are referred to as the elements of the set.
Set Naming Notation: Capital letters (such as , , , ) are used to denote or refer to sets.
Element Membership Notation:
- The symbol indicates that an object belongs to a set. For example, means "2 belongs to the set ".
- The symbol indicates that an object does not belong to a set. For example, means "7 does not belong to the set ".
Concrete Example:
- Consider the set of natural numbers between and . This set is written as .
- In this set, , whereas .
Empty Set:
- An empty set is defined as a set that contains no elements.
- The notations used to represent an empty set are or .
Methods of Defining Sets
Sets can be defined and represented using three primary methods:
1. List Method (Roster Method):
- Elements are listed individually inside curly braces separated by commas.
- Example: .
- Limitation: It is not always possible to display or represent a set using the list method (for example, in cases of uncountable sets or continuous infinite sets).
2. Rule Method (Set-Builder Notation):
- A set is described by declaring a property or condition that determines membership.
- Example: .
- Evaluating this rule yields the explicit set .
- Order Invariance: The order in which elements are listed in a set does not matter. For example, represents the exact same set.
3. Visual / Diagram Method (Venn Diagram):
- Sets are depicted graphically using a closed curve (such as a circle or oval), with elements represented as points labeled inside the boundary.

Subsets, Proper Subsets, and Power Sets
Subset:
- If all elements of set are also elements of set , then set is called a subset of set
- Notation:
- Logical Definition:
- Key Subset Properties:
- Every set is a subset of itself:
- The empty set is a subset of every set: for any set
Proper Subset:
- The set is called a proper subset of if contains at least one element that is not contained in
- Notation:
- Rule: The proper subsets of a set consist of all of its subsets except the set itself.
Power Set:
- The collection of all possible subsets of a set is defined as the power set of
- Notation:

Complement of a Set, Power Set Calculations, and Set Equality
Complement of a Set:
- The complement of a set is the set of elements contained in the universal set that are not contained in set
- Universal Set Symbol:
- Equivalent Notations for Complement: , , ,
- Set-Builder Definition:
- Example in Continuous Contexts: If universal context encompasses intervals like and , the complement represents all external real numbers.
Power Set Formulas and Calculations:
- If the number of elements in a set is , denoted as :
- Total number of subsets of (cardinality of ):
- Total number of proper subsets of :
- Worked Example:
- Let
- Element count: , so
- Power Set
- Number of subsets:
- Number of proper subsets:
Definition of Set Equality:
- Two sets and are equal if and only if is a subset of and is a subset of
- Formal Logical Statement:

Set Operations and Cardinality Formulas
Number of Elements in a Set (Cardinality):
- The notation specifies the number of elements in set
- Example: If , then
- Cardinality Rule for Empty Set: The number of elements in an empty set is always accepted as , expressed as
Cardinality Formulas for Union Sets:
- 1. For non-disjoint sets (where ):
- 2. For disjoint sets (where ):
Fundamental Operations on Sets:
- Intersection:
- Notation:
- Definition:
- Represents elements common to both set and set
- Union:
- Notation:
- Definition:
- Represents elements belonging to set , set , or both
- Difference:
- Notation:
- Definition:
- Represents elements belonging to set but excluded from set
- Symmetric Difference:
- Notation:
- Definition Formula:
- Represents elements that belong to either set or set , but not both

Cartesian Product, Ordered 2-Tuples, and Properties of Intersection
Cartesian Product of Two Sets:
- Definition: The Cartesian product is the set of all ordered pairs such that and
- Set-Builder Definition:
- Non-Commutativity Property: In general,
- Worked Example:
- Let and
- Elements of these resulting sets are termed ordered 2-tuples
Equality of 2-Tuples:
- Two ordered pairs and are equal if and only if their respective elements are equal:
Properties of Intersection:
- 1. Idempotent Law:
- 2. Empty Set Law:
- 3. Universal Set Law: (where is the universal set)
- 4. Commutative Law:
- 5. Subset Equivalence:
- 6. Associative Law:
- 7. Inclusion Properties: and
