Trace it. Derive it. Know it.
Every cluster below maps one schematic path โ from first principles to the final equation. Expand a node to follow the full derivation trace.
Definition of Sets, Representations & Classification of Set Types
2 concepts ยท 1.1What constitutes a mathematically well-defined collection, how do roster and set-builder forms represent sets, and what distinguishes empty, finite, infinite, equal, and equivalent sets?
A set is a well-defined collection of distinct objects, meaning that an unambiguous objective rule exists to determine whether any given entity belongs to the set (e.g. 'vowels in the English alphabet' is a set, whereas 'good cricketers' is subjective and not a set). Sets are denoted by capital letters and their elements by lowercase letters, with membership denoted by x in A and non-membership by x not in A. Sets are represented via Roster (Tabular) form, listing distinct elements separated by commas within braces { }, or Set-Builder form, stating a characteristic property P(x) satisfied exclusively by its elements. Sets are classified as: Empty / Null / Void set (empty set or { }, containing no elements, cardinality 0); Singleton set (containing exactly one element); Finite set (having a countable whole number of elements, cardinality n(A)); and Infinite set (elements cannot be listed exhaustively). Two sets are Equal (A = B) if and only if they possess identical elements (A subset of B and B subset of A), whereas they are Equivalent (A approx B) if they possess identical cardinality (n(A) = n(B)).
Well-Defined Collections & Representation Notations
A set is a well-defined collection. Roster form explicitly lists elements {1, 2, 3}; Set-Builder form states common property {x : P(x)}.
Taxonomy of Sets: Empty, Finite, Infinite, Equal & Equivalent
Empty set โ has 0 elements. Singleton set has 1 element. Finite sets have n(A) in W. Equal sets have identical elements; equivalent sets have equal cardinality.
Subsets, Proper Subsets, Power Set & Intervals as Subsets of R
2 concepts ยท 1.2How are subsets and proper subsets mathematically defined, why does a finite set of n elements have 2^n subsets, and how do open and closed intervals represent continuous subsets of R?
A set A is a subset of B (A subset of B) if every element of A is also an element of B: for all x in A, x in B. If A subset of B and A != B, then A is a proper subset of B (A subset B), and B is a superset of A. Fundamental subset theorems establish that the empty set is a subset of every set (โ subset of A) and every set is a subset of itself (A subset of A). A finite set with n elements has 2^n total subsets, 2^n - 1 proper subsets, and 2^n - 2 non-empty proper subsets (proven via the binomial theorem sum of nC_r from r=0 to n). The collection of all subsets of A is the Power Set P(A), with cardinality n(P(A)) = 2^n. Subsets of the real line R are represented by intervals: Open interval (a, b) = {x in R : a < x < b} (endpoints excluded); Closed interval [a, b] = {x in R : a <= x <= b} (endpoints included); and Semi-open / Semi-closed intervals [a, b) and (a, b]. The Universal Set U serves as the overarching context containing all elements under consideration.
Subsets, Proper Subsets & Power Set Cardinality
A subset of B iff x in A implies x in B. A set with n elements has 2^n subsets and 2^n - 1 proper subsets. Power set P(A) contains all subsets of A.
Intervals as Subsets of Real Numbers (R)
Open interval (a, b) excludes endpoints. Closed interval [a, b] includes endpoints. Semi-open intervals [a, b) and (a, b] include one endpoint.
Venn Diagrams & Set Operations: Union, Intersection & Disjoint Sets
2 concepts ยท 1.3How do Venn diagrams geometrically model set relationships, how are Union and Intersection formally defined, and what algebraic laws govern their interaction?
Venn diagrams represent mathematical sets geometrically: the Universal Set U is depicted as an outer rectangle, while its subsets are represented by closed curves (usually circles or ellipses) inside it. (1) Union of Sets (A union B): The set of all elements belonging to A OR B OR both: A union B = {x : x in A or x in B}. It satisfies Commutative (A union B = B union A), Associative ((A union B) union C = A union (B union C)), Identity (A union โ = A), Idempotent (A union A = A), and Domination (A union U = U) laws. (2) Intersection of Sets (A intersect B): The set of all elements belonging to BOTH A AND B: A intersect B = {x : x in A and x in B}. It satisfies Commutative, Associative, Identity (A intersect U = A, A intersect โ = โ ), and Idempotent (A intersect A = A) laws. (3) Distributive Laws: Intersection distributes over union: A intersect (B union C) = (A intersect B) union (A intersect C); and Union distributes over intersection: A union (B intersect C) = (A union B) intersect (A union C). (4) Disjoint Sets: Two sets A and B are disjoint (mutually exclusive) if they have no common elements: A intersect B = โ (n(A intersect B) = 0).
Union and Intersection Operations and Properties
A union B = {x : x in A or x in B}. A intersect B = {x : x in A and x in B}. Both satisfy commutative, associative, and idempotent laws.
Disjoint Sets & Distributive Laws
Disjoint sets have A intersect B = โ . Distributive laws: A intersect (B union C) = (A intersect B) union (A intersect C) and A union (B intersect C) = (A union B) intersect (A union C).
Set Difference, Symmetric Difference & De Morgan's Laws
2 concepts ยท 1.4How are relative and absolute complements defined, what is the geometric meaning of symmetric difference, and why are De Morgan's laws fundamental to logic?
Beyond union and intersection, three difference-based operations govern set algebra: (1) Difference of Sets (Relative Complement): A - B is the set of elements belonging to A but NOT to B: A - B = {x : x in A and x not in B} = A intersect B'. Difference is NOT commutative (A - B != B - A in general). The three sets (A - B), (A intersect B), and (B - A) are mutually disjoint, and their union equals A union B. (2) Symmetric Difference (A Delta B): The set of elements that belong to either A or B, but NOT to both: A Delta B = (A - B) union (B - A) = (A union B) - (A intersect B). It satisfies Commutative and Associative laws. (3) Absolute Complement (A' or U - A): The set of all elements in the universal set U that do not belong to A: A' = {x in U : x not in A}. Complement properties: Complement laws (A union A' = U, A intersect A' = โ ), Involution law ((A')' = A), and Laws of โ and U (โ ' = U, U' = โ ). (4) De Morgan's Laws: The complement of the union of two sets is the intersection of their complements: (A union B)' = A' intersect B'; and the complement of the intersection of two sets is the union of their complements: (A intersect B)' = A' union B'.
Set Difference and Symmetric Difference
A - B = {x : x in A and x not in B}. Symmetric difference A Delta B = (A - B) union (B - A) = (A union B) - (A intersect B).
Complements of Sets and De Morgan's Laws
A' = U - A. De Morgan's Laws: (A union B)' = A' intersect B' and (A intersect B)' = A' union B'. (A')' = A.
Principle of Inclusion-Exclusion & Cardinality Problems
2 concepts ยท 1.5How does the Principle of Inclusion-Exclusion prevent double-counting in multi-set systems, and how are practical survey problems solved using region-by-region decomposition?
Practical cardinality problems quantify the number of elements in compound set configurations without double-counting overlaps. (1) Two-Set Cardinality Formula: For any two finite sets A and B, n(A union B) = n(A) + n(B) - n(A intersect B). Subtracting n(A intersect B) corrects for the common elements counted twice. Derived 2-set formulas include: n(only A) = n(A - B) = n(A) - n(A intersect B); n(exactly one set) = n(A Delta B) = n(A) + n(B) - 2n(A intersect B); and n(neither A nor B) = n((A union B)') = n(U) - n(A union B). (2) Three-Set Principle of Inclusion-Exclusion (PIE): For finite sets A, B, and C, n(A union B union C) = [n(A) + n(B) + n(C)] - [n(A intersect B) + n(B intersect C) + n(C intersect A)] + n(A intersect B intersect C). The pairwise intersections are subtracted because they were counted twice, but this subtracts the central triple intersection three times, requiring n(A intersect B intersect C) to be added back once. (3) 8-Zone Decomposition: A 3-set Venn diagram partitions U into 8 disjoint zones: 1 central triple overlap, 3 two-set-only overlaps, 3 single-set-only regions, and 1 exterior region.
Two-Set Cardinality Formulas & Practical Problems
n(A union B) = n(A) + n(B) - n(A intersect B). n(A - B) = n(A) - n(A intersect B). n(neither) = n(U) - n(A union B).
Three-Set Principle of Inclusion-Exclusion & 8-Zone Analysis
n(A union B union C) = sum n(A) - sum n(A intersect B) + n(A intersect B intersect C). Solve 3-set problems from inside out.