Algebra

Set operations

Set operations such as union, intersection, complement, and relative difference form the foundational algebra of classes and collections, providing a rigorous framework for logic and probability.

For: UP PGT Mathematics UP TGT Mathematics DSSSB PGT / TGT KVS / NVS PGT LT Grade
📖 Topic progress
○ Mark as complete

Definition and statement

Algebra of Sets & Principle of Duality
Let $U$ be a universal set and let $A, B, C \subseteq U$. The operations of union ($A \cup B$) and intersection ($A \cap B$) satisfy algebraic laws including idempotence, commutativity, associativity, distributivity, and De Morgan's Laws: $(A \cup B)' = A' \cap B'$ and $(A \cap B)' = A' \cup B'$; furthermore, the Principle of Duality states that any true set-theoretic identity remains true if $\cup$ and $\cap$ are interchanged, and $\emptyset$ and $U$ are interchanged.

📐 Geometric Interpretation

Represented via Venn diagrams where the universal set $U$ is a rectangular bounding box, and sets $A$ and $B$ are closed geometric regions (typically circles). Union corresponds to the total shaded area of both regions, intersection to the overlapping lens-shaped region, and complement to the region outside the set within $U$.

⚙️ Algebraic & Structural Meaning

Establishes a Boolean algebra structure on the power set $\mathcal{P}(U)$ under the operations of join ($\cup$), meet ($\cap$), and complementation $('$), mirroring propositional logic where sets correspond to predicates and inclusion corresponds to implication.

Conditions and hypotheses

Check each condition and what changes when it is omitted:

Hypothesis / Condition Domain / Interval Necessity What Fails If Condition Dropped
Universal Set Containment Subsets $A, B \subseteq U$ Strictly Mandatory Operations like complementation $A'$ become undefined or ambiguous if the universal set $U$ is not explicitly specified.
Disjointness / Mutually Exclusive Sets $A \cap B = \emptyset$ Conditional / Optional for specific identities Assuming disjointness when sets overlap leads to overcounting in cardinality formulas such as $|A \cup B| = |A| + |B|$.
Power Set Domain Domain $\mathcal{P}(U)$ Essential for closure Without restriction to subsets of a common universal set, set operations can lead to Russell-like paradoxes or out-of-domain structures.

Useful results and shortcuts

Use these identities and results when their conditions apply:

01

Principle of Inclusion-Exclusion for Two & Three Sets

$$\begin{aligned} |A \cup B| &= |A| + |B| - |A \cap B| \\ |A \cup B \cup C| &= |A| + |B| + |C| - |A \cap B| - |B \cap C| - |C \cap A| + |A \cap B \cap C| \end{aligned}$$

Rule: Use direct cardinality formulas to bypass sketching large Venn diagrams when numerical counts of surveys or intersections are requested.

02

Set Difference expressed via Intersection

$$A - B = A \cap B'$$

Rule: Convert relative difference into intersection with a complement to instantly simplify complex expression proofs.

Application: Frequently used in matching list questions and algebraic simplification of set expressions.
03

Symmetric Difference Expansion

$$A \Delta B = (A - B) \cup (B - A) = (A \cup B) - (A \cap B)$$

Rule: Replace symmetric difference with union minus intersection for rapid numerical or algebraic evaluation.

04

Cardinality Bounds via Subset Inclusion

$$A \subseteq B \implies |A| \le |B| \text{ and } A \cap B = A$$

Rule: Instantly substitute intersection terms when subset relations are given in the problem statement.

Application: Used to eliminate options in abstract algebra and set property questions.
05

De Morgan's Law Rapid Simplification

$$(A \cup B)' \cap C = (A' \cap B') \cap C$$

Rule: Distribute primes across parentheses by flipping union to intersection and vice versa in single-stroke mental math.

Application: Standard simplification format in UP TGT objective problems.
06

Rapid Elimination via Null Set Test

$$A \cap \emptyset = \emptyset, \quad A \cup U = U$$

Rule: Test extreme sets ($U$ and $\emptyset$) on algebraic formulas to eliminate 2 wrong options instantly.

Common errors and counterexamples

These examples show how a conclusion can fail when a condition is missing:

⚠️ COMMON ERROR #01

Confusing Proper Subset with Subset

Common Pitfall: Candidates assume $A \subset B$ implies $A \neq B$, forgetting that standard inclusion $\subseteq$ allows equality.

Counterexample: If $A = \{1, 2\}$ and $B = \{1, 2\}$, then $A \subseteq B$ is true, but $A \subset B$ depends on author notation conventions.

Why it fails: Misinterpreting strict vs non-strict inequality of sets leads to incorrect power set count calculations.

🛡️ Exam Defense: Always check whether the question uses $\subset$ (strict) or $\subseteq$ (inclusive) notation.
⚠️ COMMON ERROR #02

Misapplication of Cardinality Formula for Non-Disjoint Sets

Common Pitfall: Applying $|A \cup B| = |A| + |B|$ without subtracting $|A \cap B|$ when sets are overlapping.

Counterexample: Let $A = \{1, 2, 3\}, B = \{2, 3, 4\}$. Here $|A|=3, |B|=3$, but $|A \cup B| = 4 \neq 6$.

Why it fails: Fails to account for double-counting elements in the intersection.

🛡️ Exam Defense: Always verify whether sets are disjoint before adding their cardinalities.

Comparison

Concept / TheoremHypotheses / AssumptionsKey Formula / OutcomeGeometric MeaningExam Identification Clue
Union ($A \cup B$)Subsets of $U$$x \in A \lor x \in B$Combined shaded regionsKeywords: 'at least one', 'or'
Intersection ($A \cap B$)Subsets of $U$$x \in A \land x \in B$Overlapping region onlyKeywords: 'both', 'and'
Complement ($A'$)$A \subseteq U$$x \in U \land x \notin A$Everything outside $A$ in $U$Keywords: 'not', 'complement'
Symmetric Difference ($A \Delta B$)Subsets of $U$$(A \cup B) - (A \cap B)$Union minus intersectionKeywords: 'either but not both'

Solved examples

Each problem includes a full solution and a shorter method:

CANONICAL PROBLEM 01 Dual-Method Breakdown

If $A$ and $B$ are two sets such that $n(A) = 17$, $n(B) = 23$, and $n(A \cup B) = 38$, find $n(A \cap B)$.

(A) 2(B) 3(C) 4(D) 5
✓ Correct Answer: (A)
📚 Method A: Formal Textbook Derivation
Step 1: Write the inclusion-exclusion formula $n(A \cup B) = n(A) + n(B) - n(A \cap B)$. Step 2: Substitute given values: $38 = 17 + 23 - n(A \cap B)$. Step 3: Simplify: $38 = 40 - n(A \cap B)$. Step 4: Solve for $n(A \cap B) = 40 - 38 = 2$.
⚡ Method B: 25-Second Exam Shortcut
Mental addition: $17 + 23 = 40$. Difference from 38 is 2. Mark (A) in 10 seconds.
💡 Tip: Direct formula application frequently seen in UP TGT math section.
CANONICAL PROBLEM 02 Dual-Method Breakdown

For any sets $A$ and $B$, the set $A - (A - B)$ is equal to:

(A) $A - B$(B) $A \cap B$(C) $B - A$(D) $A \cup B$
✓ Correct Answer: (B)
📚 Method A: Formal Textbook Derivation
Step 1: Rewrite set difference using intersection and complement: $A - B = A \cap B'$. Step 2: Substitute into expression: $A - (A \cap B') = A \cap (A \cap B')'$. Step 3: Apply De Morgan's Law: $A \cap (A' \cup (B')') = A \cap (A' \cup B)$. Step 4: Apply distributive law: $(A \cap A') \cup (A \cap B) = \emptyset \cup (A \cap B) = A \cap B$.
⚡ Method B: 25-Second Exam Shortcut
Use a Venn diagram with regions numbered 1, 2, 3. Set $A = \{1, 2\}$, $B = \{2, 3\}$. $A - B = \{1\}$. $A - (A - B) = \{1, 2\} - \{1\} = \{2\}$, which is $A \cap B$.
💡 Tip: Venn region numbering is the fastest way to verify set identity questions in PGT exams.

Practice questions

Choose an answer to check it and see the solution:

Q1
MCQ 1: If $A \subset B$, then what is $A \cup B$ equal to?
A $A$
B $B$
C $A \cap B$
D $\emptyset$
Derivation & Analysis:

If $A$ is a subset of $B$, every element of $A$ is already in $B$, so their union is simply the larger set $B$.

Q2
MCQ 2: For any two sets $A$ and $B$, $A \cup (A \cap B)$ is equal to:
A $B$
B $A \cap B$
C $A$
D $A \cup B$
Derivation & Analysis:

By the absorption law of set theory, $A \cup (A \cap B) = A$ because the intersection is entirely contained within $A$.

Q3
MCQ 3: If $A$ and $B$ are disjoint sets, then $A \cap B$ is:
A $U$
B $A$
C $B$
D $\emptyset$
Derivation & Analysis:

By definition, disjoint sets have no elements in common, meaning their intersection is the empty set $\emptyset$.

Q4
MCQ 4: What is the simplification of $(A \cup B) \cap (A \cup B')$?
A $A$
B $B$
C $U$
D $\emptyset$
Derivation & Analysis:

Using distributive law: $A \cup (B \cap B') = A \cup \emptyset = A$.

Q5
MCQ 5: If $P$ and $Q$ are two sets such that $P \cup Q$ has 50 elements, $P$ has 28 elements, and $Q$ has 32 elements, how many elements does $P \cap Q$ have?
A 8
B 10
C 12
D 14
Derivation & Analysis:

$n(P \cap Q) = n(P) + n(Q) - n(P \cup Q) = 28 + 32 - 50 = 60 - 50 = 10$.

Q6
MCQ 6: The symmetric difference $A \Delta A$ for any set $A$ is equal to:
A $A$
B $U$
C $\emptyset$
D $A'$
Derivation & Analysis:

$A \Delta A = (A - A) \cup (A - A) = \emptyset \cup \emptyset = \emptyset$.

Q7
MCQ 7: Which of the following is equivalent to $(A' \cup B')'$?
A $A \cup B$
B $A \cap B$
C $A' \cap B'$
D $A - B$
Derivation & Analysis:

By De Morgan's Law, $(A' \cup B')' = (A')' \cap (B')' = A \cap B$.

Q8
MCQ 8: If $U = \{1, 2, 3, 4, 5, 6, 7, 8, 9, 10\}$, $A = \{2, 4, 6, 8, 10\}$, then $A'$ is:
A \{1, 3, 5, 7, 9\}
B \{2, 4, 6, 8, 10\}
C $U$
D $\emptyset$
Derivation & Analysis:

The complement $A'$ consists of all elements in $U$ that are not in $A$, giving the set of odd integers up to 10.

Q9
MCQ 9: If $A \subseteq B$, which of the following is always true?
A $B' \subseteq A'$
B $A' \subseteq B'$
C $A \cap B = B$
D $A \cup B = A$
Derivation & Analysis:

If $A$ is contained in $B$, everything outside $B$ ($B'$) is also outside $A$ ($A'$), hence $B' \subseteq A'$.

Q10
MCQ 10: The power set of the empty set $\mathcal{P}(\emptyset)$ has cardinality:
A 0
B 1
C 2
D Not defined
Derivation & Analysis:

Since $|\emptyset| = 0$, the cardinality of its power set is $2^0 = 1$, which is $\mathcal{P}(\emptyset) = \{\emptyset\}$.

Common questions

Set difference $A - B$ removes elements of $B$ specifically from $A$, whereas complement $A'$ removes all elements of $A$ from the universal set $U$. Remember that $A - B = A \cap B'$.

Misinterpreting word problems involving survey data by forgetting to subtract the triple intersection when applying the three-set inclusion-exclusion formula.

Use the Venn region numbering method or test trivial sets like $U$, $\emptyset$, and subsets to eliminate incorrect options within seconds.