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 AA, BB, CC, EE) are used to denote or refer to sets.

  • Element Membership Notation:

    • The symbol ∈\in indicates that an object belongs to a set. For example, 2∈A2 \in A means "2 belongs to the set AA".
    • The symbol ∉\notin indicates that an object does not belong to a set. For example, 7∉A7 \notin A means "7 does not belong to the set AA".
  • Concrete Example:

    • Consider the set of natural numbers between 11 and 55. This set is written as A={2,3,4}A = \{2, 3, 4\}.
    • In this set, 2∈A2 \in A, whereas 7∉A7 \notin A.
  • Empty Set:

    • An empty set is defined as a set that contains no elements.
    • The notations used to represent an empty set are ∅\emptyset 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: A={a,b,c,d,e}A = \{a, b, c, d, e\}.
    • 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: A={x∣x is the first five letters of the alphabet}A = \{x \mid x \text{ is the first five letters of the alphabet}\}.
    • Evaluating this rule yields the explicit set A={a,b,c,d,e}A = \{a, b, c, d, e\}.
    • Order Invariance: The order in which elements are listed in a set does not matter. For example, {a,b,c,d}={b,a,c,d}\{a, b, c, d\} = \{b, a, c, d\} 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.

Introduction to sets and methods of defining sets

Subsets, Proper Subsets, and Power Sets

  • Subset:

    • If all elements of set BB are also elements of set AA, then set BB is called a subset of set AA
    • Notation: B⊆AB \subseteq A
    • Logical Definition: B⊆A  ⟺  (x∈B  ⟹  x∈A)B \subseteq A \iff (x \in B \implies x \in A)
    • Key Subset Properties:
    • Every set is a subset of itself: A⊆AA \subseteq A
    • The empty set is a subset of every set: ∅⊆A\emptyset \subseteq A for any set AA
  • Proper Subset:

    • The set BB is called a proper subset of AA if AA contains at least one element that is not contained in BB
    • Notation: B⊂AB \subset A
    • 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 AA is defined as the power set of AA
    • Notation: P(A)P(A)

Subsets, proper subsets, and power set diagrams

Complement of a Set, Power Set Calculations, and Set Equality

  • Complement of a Set:

    • The complement of a set AA is the set of elements contained in the universal set EE that are not contained in set AA
    • Universal Set Symbol: EE
    • Equivalent Notations for Complement: A′A', E∖AE \setminus A, E−AE - A, AcA^c
    • Set-Builder Definition: A′={x∣x∈E∧x∉A}A' = \{x \mid x \in E \land x \notin A\}
    • Example in Continuous Contexts: If universal context encompasses intervals like (−∞,3)∪(7,∞)(-\infty, 3) \cup (7, \infty) and A=[3,7]A = [3, 7], the complement represents all external real numbers.
  • Power Set Formulas and Calculations:

    • If the number of elements in a set AA is nn, denoted as n(A)=nn(A) = n:
    • Total number of subsets of AA (cardinality of P(A)P(A)): 2n2^n
    • Total number of proper subsets of AA: 2n−12^n - 1
    • Worked Example:
    • Let A={a,b,c}A = \{a, b, c\}
    • Element count: n=3n = 3, so n(A)=3n(A) = 3
    • Power Set P(A)={∅,{a},{b},{c},{a,b},{b,c},{a,c},{a,b,c}}P(A) = \{\emptyset, \{a\}, \{b\}, \{c\}, \{a, b\}, \{b, c\}, \{a, c\}, \{a, b, c\}\}
    • Number of subsets: n(P(A))=23=8n(P(A)) = 2^3 = 8
    • Number of proper subsets: 23−1=8−1=72^3 - 1 = 8 - 1 = 7
  • Definition of Set Equality:

    • Two sets AA and BB are equal if and only if AA is a subset of BB and BB is a subset of AA
    • Formal Logical Statement: A=B  ⟺  (A⊆B∧B⊆A)A = B \iff (A \subseteq B \land B \subseteq A)

Complement of a set, power set subset formulas, and set equality

Set Operations and Cardinality Formulas

  • Number of Elements in a Set (Cardinality):

    • The notation n(A)n(A) specifies the number of elements in set AA
    • Example: If A={0,1,2}A = \{0, 1, 2\}, then n(A)=3n(A) = 3
    • Cardinality Rule for Empty Set: The number of elements in an empty set is always accepted as 00, expressed as n(∅)=0n(\emptyset) = 0
  • Cardinality Formulas for Union Sets:

    • 1. For non-disjoint sets (where A∩B≠∅A \cap B \neq \emptyset):     n(A∪B)=n(A)+n(B)−n(A∩B)n(A \cup B) = n(A) + n(B) - n(A \cap B)
    • 2. For disjoint sets (where A∩B=∅A \cap B = \emptyset):     n(A∪B)=n(A)+n(B)n(A \cup B) = n(A) + n(B)
  • Fundamental Operations on Sets:

    • Intersection:
    • Notation: A∩BA \cap B
    • Definition: A∩B={x∣x∈A∧x∈B}A \cap B = \{x \mid x \in A \land x \in B\}
    • Represents elements common to both set AA and set BB
    • Union:
    • Notation: A∪BA \cup B
    • Definition: A∪B={x∣x∈A∨x∈B}A \cup B = \{x \mid x \in A \lor x \in B\}
    • Represents elements belonging to set AA, set BB, or both
    • Difference:
    • Notation: A−BA - B
    • Definition: A−B={x∣x∈A∧x∉B}A - B = \{x \mid x \in A \land x \notin B\}
    • Represents elements belonging to set AA but excluded from set BB
    • Symmetric Difference:
    • Notation: AΔBA \Delta B
    • Definition Formula: AΔB=(A−B)∪(B−A)A \Delta B = (A - B) \cup (B - A)
    • Represents elements that belong to either set AA or set BB, but not both

Cardinality formulas and set operation definitions

Cartesian Product, Ordered 2-Tuples, and Properties of Intersection

  • Cartesian Product of Two Sets:

    • Definition: The Cartesian product A×BA \times B is the set of all ordered pairs (x,y)(x, y) such that x∈Ax \in A and y∈By \in B
    • Set-Builder Definition: A×B={(x,y)∣x∈A∧y∈B}A \times B = \{(x, y) \mid x \in A \land y \in B\}
    • Non-Commutativity Property: In general, A×B≠B×AA \times B \neq B \times A
    • Worked Example:
    • Let A={a,b,c}A = \{a, b, c\} and B={2,5}B = \{2, 5\}
    • A×B={(a,2),(a,5),(b,2),(b,5),(c,2),(c,5)}A \times B = \{(a, 2), (a, 5), (b, 2), (b, 5), (c, 2), (c, 5)\}
    • B×A={(2,a),(2,b),(2,c),(5,a),(5,b),(5,c)}B \times A = \{(2, a), (2, b), (2, c), (5, a), (5, b), (5, c)\}
    • Elements of these resulting sets are termed ordered 2-tuples
  • Equality of 2-Tuples:

    • Two ordered pairs (x,y)(x, y) and (u,v)(u, v) are equal if and only if their respective elements are equal:     (x,y)=(u,v)  ⟺  (x=u∧y=v)(x, y) = (u, v) \iff (x = u \land y = v)
  • Properties of Intersection:

    • 1. Idempotent Law: A∩A=AA \cap A = A
    • 2. Empty Set Law: A∩∅=∅A \cap \emptyset = \emptyset
    • 3. Universal Set Law: A∩E=AA \cap E = A (where EE is the universal set)
    • 4. Commutative Law: A∩B=B∩AA \cap B = B \cap A
    • 5. Subset Equivalence: A∩B=A  ⟺  A⊆BA \cap B = A \iff A \subseteq B
    • 6. Associative Law: (A∩B)∩C=A∩(B∩C)(A \cap B) \cap C = A \cap (B \cap C)
    • 7. Inclusion Properties: A∩B⊆AA \cap B \subseteq A and A∩B⊆BA \cap B \subseteq B

Cartesian product, ordered tuples, and properties of intersection