EduProd
EduProd
JEE PCM PLATFORM
๐Ÿ“Š Dashboard
LEARN MODULE ยท SCHEMATIC MODE

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.

// CHAPTER_OVERVIEW Set theory forms the universal foundational language of modern mathematics, underpinning relations, functions, probability, real analysis, and algebraic structures. Master the rigorous criteria of well-defined collections, notation conventions in roster and set-builder formats, subset logic, power sets with binomial cardinality proofs, real intervals as subsets of R, Venn diagram topologies, fundamental set operations (union, intersection, difference, symmetric difference, and complementation), De Morgan's dual laws, and the Principle of Inclusion-Exclusion (PIE) for solving complex 2-set and 3-set survey problems.
โšก INTEGRATED VIRTUAL LABORATORIES (10)
Open Subject Labs Catalog โ†—
Chain Rule
Stage โ†—
Counting Tree
Stage โ†—
Induction Domino
Stage โ†—
Integration By Parts
Stage โ†—
Integration Substitution
Stage โ†—
Quadratic Equations
Stage โ†—
Riemann Sum
Stage โ†—
Set Operations
Stage โ†—
Truth Table
Stage โ†—
Venn Diagram
Stage โ†—
01

Definition of Sets, Representations & Classification of Set Types

2 concepts ยท 1.1
2 nodes

What 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)).

01

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)}.

Key Idea
Subjective attributes (e.g. 'talented artists') cannot define a mathematical set.
Why It Works
Mathematical logic requires the law of excluded middle: every proposition 'x in A' must possess a determinate truth value.
Boundary Trap
Writing elements repeatedly in roster form or confusing set symbols with intervals.
Application Note
The set of divisors of 12 in roster form is {1, 2, 3, 4, 6, 12}; in set-builder form: {x in N : x divides 12}.
Derivation Trace ยท Well-Defined Collections & Representation Notations
Well-Defined Test: Ask whether membership can be universally decided without personal opinion. Words like 'best', 'intelligent', 'rich', 'famous' create non-sets.
Order & Repetition Invariance: In roster form, order is immaterial ({1, 2, 3} = {3, 1, 2}) and repeating an element does not change the set ({1, 2, 2, 3} = {1, 2, 3}).
Empty Set Traps: The empty set is denoted by the symbol โˆ… or {}. Never write {โˆ…} (which is a singleton set containing the empty set) or {0} (a singleton set containing the integer zero).
Equal vs Equivalent: Equal sets are ALWAYS equivalent (since A = B implies n(A) = n(B)), but equivalent sets are NOT necessarily equal ({1, 2} and {a, b} are equivalent but not equal).
๐Ÿ”ฌ VIRTUAL LAB Chain Rule
Full Stage โ†—
? Quick Concept Check

Is the collection of all intelligent students in your school a set? Justify your answer.

Answer: No. The term 'intelligent' is vague and subjective without an objective, standardized criterion; hence, the collection is not well-defined.

02

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.

Key Idea
Equal sets are always equivalent, but equivalent sets are not necessarily equal.
Why It Works
Set equality requires mutual subset inclusion (A subset of B and B subset of A), whereas equivalence requires only a bijection between the sets.
Boundary Trap
Writing {โˆ…} to represent an empty set. {โˆ…} is a singleton set whose sole element is the empty set!
Application Note
A = {x in N : x is even prime} = {2} (singleton). B = {x in N : x^2 = 9 and 2x = 4} = โˆ… (empty set, no number satisfies both).
Derivation Trace ยท Taxonomy of Sets: Empty, Finite, Infinite, Equal & Equivalent
Well-Defined Test: Ask whether membership can be universally decided without personal opinion. Words like 'best', 'intelligent', 'rich', 'famous' create non-sets.
Order & Repetition Invariance: In roster form, order is immaterial ({1, 2, 3} = {3, 1, 2}) and repeating an element does not change the set ({1, 2, 2, 3} = {1, 2, 3}).
Empty Set Traps: The empty set is denoted by the symbol โˆ… or {}. Never write {โˆ…} (which is a singleton set containing the empty set) or {0} (a singleton set containing the integer zero).
Equal vs Equivalent: Equal sets are ALWAYS equivalent (since A = B implies n(A) = n(B)), but equivalent sets are NOT necessarily equal ({1, 2} and {a, b} are equivalent but not equal).
๐Ÿ”ฌ VIRTUAL LAB Chain Rule
Full Stage โ†—
? Quick Concept Check

State whether the pair of sets A = {x : x is a letter in 'FOLLOW'} and B = {y : y is a letter in 'WOLF'} are equal.

Answer: Yes. In roster form, A = {F, O, L, W} and B = {W, O, L, F}. Because both sets contain precisely the same distinct elements, A = B.

02

Subsets, Proper Subsets, Power Set & Intervals as Subsets of R

2 concepts ยท 1.2
2 nodes

How 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.

01

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.

Key Idea
Empty set โˆ… is a subset of every set; every set is a subset of itself.
Why It Works
The implication 'if x in โˆ… then x in A' is vacuously true because the antecedent 'x in โˆ…' is universally false.
Boundary Trap
Confusing 'in' and 'subset of'. An element belongs to a set; a subset is contained in a set.
Application Note
If A = {a, b}, then P(A) = {โˆ…, {a}, {b}, {a, b}} with n(P(A)) = 2^2 = 4.
Derivation Trace ยท Subsets, Proper Subsets & Power Set Cardinality
Subset vs Element Symbolism: 'in' links an ELEMENT to a set (2 in {1, 2}); 'subset of' links a SUBSET to a set ({2} subset of {1, 2}). Never write 2 subset of {1, 2}!
Nested Power Set Rule: If n(A) = 0 (A = โˆ…), then n(P(A)) = 2^0 = 1; n(P(P(A))) = 2^1 = 2; n(P(P(P(A)))) = 2^2 = 4; n(P(P(P(P(A))))) = 2^4 = 16.
Binomial Proof of 2^n Subsets: Choosing a subset of r elements from n elements is nC_r. Summing across all possible sizes: nC_0 + nC_1 + ... + nC_n = (1 + 1)^n = 2^n.
Interval Notation Conventions: Hollow circle on number line denotes excluded endpoint (strict inequality, round bracket); solid circle denotes included endpoint (weak inequality, square bracket).
๐Ÿ”ฌ VIRTUAL LAB Chain Rule
Full Stage โ†—
? Quick Concept Check

If set A has 5 elements, how many non-empty proper subsets does A have?

Answer: 2^5 - 2 = 32 - 2 = 30. (Total subsets = 2^5 = 32; subtracting the empty set and the set itself yields 30).

02

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.

Key Idea
Intervals represent uncountable infinite subsets of real numbers geometrically bounded on the real line.
Why It Works
Between any two distinct real numbers a and b, there exist infinitely many rational and irrational numbers (density of R).
Boundary Trap
Treating (a, b) as an ordered pair instead of an open interval; context determines whether (a, b) denotes a coordinate or a real interval.
Application Note
[3, 7) = {x in R : 3 <= x < 7}. Includes 3, excludes 7.
Derivation Trace ยท Intervals as Subsets of Real Numbers (R)
Subset vs Element Symbolism: 'in' links an ELEMENT to a set (2 in {1, 2}); 'subset of' links a SUBSET to a set ({2} subset of {1, 2}). Never write 2 subset of {1, 2}!
Nested Power Set Rule: If n(A) = 0 (A = โˆ…), then n(P(A)) = 2^0 = 1; n(P(P(A))) = 2^1 = 2; n(P(P(P(A)))) = 2^2 = 4; n(P(P(P(P(A))))) = 2^4 = 16.
Binomial Proof of 2^n Subsets: Choosing a subset of r elements from n elements is nC_r. Summing across all possible sizes: nC_0 + nC_1 + ... + nC_n = (1 + 1)^n = 2^n.
Interval Notation Conventions: Hollow circle on number line denotes excluded endpoint (strict inequality, round bracket); solid circle denotes included endpoint (weak inequality, square bracket).
๐Ÿ”ฌ VIRTUAL LAB Chain Rule
Full Stage โ†—
? Quick Concept Check

Write the set {x in R : -5 <= x <= 7} in interval notation, and state the length of this interval.

Answer: Interval notation: [-5, 7]. Length of the interval = b - a = 7 - (-5) = 12.

03

Venn Diagrams & Set Operations: Union, Intersection & Disjoint Sets

2 concepts ยท 1.3
2 nodes

How 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).

01

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.

Key Idea
If A subset of B, then A union B = B and A intersect B = A.
Why It Works
Since every element of A is already in B, combining them adds nothing new to B, and their common elements are precisely all of A.
Boundary Trap
Assuming A intersect B = โˆ… implies either A = โˆ… or B = โˆ…. Two non-empty sets can be completely disjoint ({1, 2} and {3, 4})!
Application Note
If A = {2, 4, 6, 8} and B = {6, 8, 10, 12}, then A union B = {2, 4, 6, 8, 10, 12} and A intersect B = {6, 8}.
Derivation Trace ยท Union and Intersection Operations and Properties
Logical Connective Mapping: Union corresponds to logical OR (disjunction, v); Intersection corresponds to logical AND (conjunction, ^).
Subset Absorption Laws: If A subset of B, then A union B = B (the larger set absorbs the smaller), and A intersect B = A (the smaller set is the common overlap).
Dual Distributive Symmetry: Unlike elementary arithmetic where multiplication distributes over addition [a*(b+c) = ab+ac] but addition does NOT distribute over multiplication [a+(b*c) != (a+b)*(a+c)], in set algebra BOTH union and intersection distribute over each other!
Idempotent Laws: A union A = A and A intersect A = A. Set operations do not duplicate elements.
๐Ÿ”ฌ VIRTUAL LAB Set Operations
Full Stage โ†—
? Quick Concept Check

Let A = {x in N : x is a multiple of 3} and B = {x in N : x is a multiple of 5}. Find A intersect B.

Answer: A intersect B = {x in N : x is a multiple of both 3 and 5} = {x in N : x is a multiple of 15} = {15, 30, 45, 60, ...}.

02

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).

Key Idea
In set theory, both operations (union and intersection) distribute over each other.
Why It Works
Logical conjunction (AND) distributes over disjunction (OR), and disjunction (OR) distributes over conjunction (AND) in Boolean algebra.
Boundary Trap
Applying arithmetic intuition and forgetting that A union (B intersect C) distributes into (A union B) intersect (A union C).
Application Note
Let A = {1, 2}, B = {2, 3}, C = {3, 4}. B union C = {2, 3, 4}. A intersect (B union C) = {2}. Also, A intersect B = {2}, A intersect C = โˆ… -> {2} union โˆ… = {2}.
Derivation Trace ยท Disjoint Sets & Distributive Laws
Logical Connective Mapping: Union corresponds to logical OR (disjunction, v); Intersection corresponds to logical AND (conjunction, ^).
Subset Absorption Laws: If A subset of B, then A union B = B (the larger set absorbs the smaller), and A intersect B = A (the smaller set is the common overlap).
Dual Distributive Symmetry: Unlike elementary arithmetic where multiplication distributes over addition [a*(b+c) = ab+ac] but addition does NOT distribute over multiplication [a+(b*c) != (a+b)*(a+c)], in set algebra BOTH union and intersection distribute over each other!
Idempotent Laws: A union A = A and A intersect A = A. Set operations do not duplicate elements.
๐Ÿ”ฌ VIRTUAL LAB Venn Diagram
Full Stage โ†—
? Quick Concept Check

Are the sets A = {x : x is an even natural number} and B = {x : x is a prime number greater than 2} disjoint? Explain.

Answer: Yes. The only even prime number is 2. Since B contains only primes greater than 2, all elements of B are odd. Hence, A intersect B = โˆ…, and they are disjoint.

04

Set Difference, Symmetric Difference & De Morgan's Laws

2 concepts ยท 1.4
2 nodes

How 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'.

01

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).

Key Idea
The sets (A - B), (A intersect B), and (B - A) are pairwise disjoint.
Why It Works
No element can simultaneously belong to only A, both A and B, or only B.
Boundary Trap
Assuming A - B = B - A. Difference is non-commutative unless A = B.
Application Note
If A = {1, 2, 3, 4} and B = {3, 4, 5, 6}, then A - B = {1, 2}, B - A = {5, 6}, and A Delta B = {1, 2, 5, 6}.
Derivation Trace ยท Set Difference and Symmetric Difference
Three Mutually Disjoint Regions: A union B decomposes into three pairwise disjoint sets: (A - B), (A intersect B), and (B - A). Thus, n(A union B) = n(A - B) + n(A intersect B) + n(B - A).
Symmetric Difference Cardinality: n(A Delta B) = n(A - B) + n(B - A) = n(A) + n(B) - 2n(A intersect B).
De Morgan's Mnemonic: 'Break the line, change the sign.' Complementing an expression flips the union to intersection and vice-versa, distributing primes to each set.
Involution Principle: Taking the complement twice restores the original set: (A')' = A.
๐Ÿ”ฌ VIRTUAL LAB Chain Rule
Full Stage โ†—
? Quick Concept Check

If U = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}, A = {1, 3, 5, 7, 9}, and B = {2, 3, 5, 7}, find A - B and B - A.

Answer: A - B = {1, 9} (elements in A not in B). B - A = {2} (elements in B not in A). Clearly, A - B != B - A.

02

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.

Key Idea
Complementing inverts the operational sign: union becomes intersection, and intersection becomes union.
Why It Works
x not in (A union B) iff not (x in A or x in B) iff (x not in A and x not in B) iff x in A' intersect B'.
Boundary Trap
Writing (A union B)' = A' union B'. The operation MUST switch from union to intersection!
Application Note
If U = {1, 2, 3, 4, 5}, A = {2, 3}, B = {3, 4}. A union B = {2, 3, 4} -> (A union B)' = {1, 5}. A' = {1, 4, 5}, B' = {1, 2, 5} -> A' intersect B' = {1, 5}.
Derivation Trace ยท Complements of Sets and De Morgan's Laws
Three Mutually Disjoint Regions: A union B decomposes into three pairwise disjoint sets: (A - B), (A intersect B), and (B - A). Thus, n(A union B) = n(A - B) + n(A intersect B) + n(B - A).
Symmetric Difference Cardinality: n(A Delta B) = n(A - B) + n(B - A) = n(A) + n(B) - 2n(A intersect B).
De Morgan's Mnemonic: 'Break the line, change the sign.' Complementing an expression flips the union to intersection and vice-versa, distributing primes to each set.
Involution Principle: Taking the complement twice restores the original set: (A')' = A.
๐Ÿ”ฌ VIRTUAL LAB Chain Rule
Full Stage โ†—
? Quick Concept Check

State the algebraic expression for 'neither A nor B occurs' in terms of complement and union.

Answer: (A union B)' or equivalently A' intersect B' (by De Morgan's first law).

05

Principle of Inclusion-Exclusion & Cardinality Problems

2 concepts ยท 1.5
2 nodes

How 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.

01

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).

Key Idea
The intersection must be subtracted once because it is counted in both n(A) and n(B).
Why It Works
n(A) = n(A - B) + n(A intersect B) and n(B) = n(B - A) + n(A intersect B). Adding them gives n(A union B) + n(A intersect B).
Boundary Trap
Adding n(A) and n(B) directly without subtracting the overlap, assuming sets are disjoint when they are not.
Application Note
In a group of 50 people, 35 speak Hindi, 25 speak English, and all speak at least one. n(H union E) = 50. n(H intersect E) = 35 + 25 - 50 = 10.
Derivation Trace ยท Two-Set Cardinality Formulas & Practical Problems
Inclusion-Exclusion Intuition: Add singletons (include) -> Subtract pairs (exclude) -> Add triples (include) -> Subtract quadruples (exclude) -> ... Alternating signs compensate for multiple overlaps.
8-Zone Fill Strategy: Always start from the INSIDE OUT! Fill Zone 1 (the central intersection of all three sets, n(A intersect B intersect C)) FIRST, then calculate the two-set-only zones, then the single-set zones, and finally the exterior.
Exactly One Set Formula (3 Sets): Number of elements belonging to exactly one set = sum(n(A)) - 2*sum(n(A intersect B)) + 3*n(A intersect B intersect C).
Exactly Two Sets Formula (3 Sets): Number of elements belonging to exactly two sets = sum(n(A intersect B)) - 3*n(A intersect B intersect C).
๐Ÿ”ฌ VIRTUAL LAB Chain Rule
Full Stage โ†—
? Quick Concept Check

If X and Y are two sets such that X union Y has 18 elements, X has 8 elements, and Y has 15 elements, how many elements does X intersect Y have?

Answer: n(X intersect Y) = n(X) + n(Y) - n(X union Y) = 8 + 15 - 18 = 23 - 18 = 5.

02

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.

Key Idea
Exactly one = sum n(A) - 2 sum n(A intersect B) + 3 n(A intersect B intersect C). Exactly two = sum n(A intersect B) - 3 n(A intersect B intersect C).
Why It Works
Alternating signs correctly ensure that each element belonging to k sets is counted exactly once overall (by binomial coefficient identity sum((-1)^(r-1) * kC_r) = 1).
Boundary Trap
Adding pairwise intersections instead of subtracting them, or forgetting to add back the triple intersection.
Application Note
In a class: 25 play football, 20 play basketball, 15 play cricket; 10 play F & B, 8 play F & C, 5 play B & C; 3 play all three. Total playing at least one = (25+20+15) - (10+8+5) + 3 = 60 - 23 + 3 = 40.
Derivation Trace ยท Three-Set Principle of Inclusion-Exclusion & 8-Zone Analysis
Inclusion-Exclusion Intuition: Add singletons (include) -> Subtract pairs (exclude) -> Add triples (include) -> Subtract quadruples (exclude) -> ... Alternating signs compensate for multiple overlaps.
8-Zone Fill Strategy: Always start from the INSIDE OUT! Fill Zone 1 (the central intersection of all three sets, n(A intersect B intersect C)) FIRST, then calculate the two-set-only zones, then the single-set zones, and finally the exterior.
Exactly One Set Formula (3 Sets): Number of elements belonging to exactly one set = sum(n(A)) - 2*sum(n(A intersect B)) + 3*n(A intersect B intersect C).
Exactly Two Sets Formula (3 Sets): Number of elements belonging to exactly two sets = sum(n(A intersect B)) - 3*n(A intersect B intersect C).
๐Ÿ”ฌ VIRTUAL LAB Chain Rule
Full Stage โ†—
? Quick Concept Check

In a survey of 60 people, 25 read magazine H, 26 read T, 26 read I; 9 read H & I, 11 read H & T, 8 read T & I; 3 read all three. How many read exactly one magazine?

Answer: Using the formula: Exactly one = sum n(A) - 2 sum n(A intersect B) + 3 n(A intersect B intersect C) = (25 + 26 + 26) - 2(9 + 11 + 8) + 3(3) = 77 - 2(28) + 9 = 77 - 56 + 9 = 30 people.