Set Language — Class 9 Maths (Samacheer Kalvi)
TN State Board (Samacheer Kalvi) Class 9 Mathematics, Chapter 1. The language of collections — sets, operations and Venn diagrams.
1. About this chapter
This chapter introduces sets, their representation and types, the set operations, De Morgan's laws, and cardinality with Venn diagrams.
2. Sets and their representation
- A set is a well-defined collection of objects. Elements: a ∈ A (belongs), b ∉ A (does not belong).
- Representations: descriptive form, roster (tabular) form { … }, and set-builder form { x : property }.
3. Types of sets
- Empty/null set (∅): no elements. Singleton: one element.
- Finite / infinite sets; equal sets (same elements); equivalent sets (same number of elements).
- Subset (⊆), proper subset (⊂), power set P(A) (all subsets; if n(A) = n then n(P(A)) = 2ⁿ), and the universal set (U).
4. Set operations and laws
- Union (A ∪ B): elements in A or B. Intersection (A ∩ B): elements in both.
- Difference (A − B): in A but not B. Complement (A′ = U − A).
- Properties: commutative, associative and distributive laws hold for ∪ and ∩.
- De Morgan's laws: (A ∪ B)′ = A′ ∩ B′ and (A ∩ B)′ = A′ ∪ B′.
5. Cardinality
- n(A) = number of elements. n(A ∪ B) = n(A) + n(B) − n(A ∩ B).
6. Worked examples
Example 1. If A = {1, 2, 3} and B = {2, 3, 4}, find A ∪ B and A ∩ B. A ∪ B = {1, 2, 3, 4}; A ∩ B = {2, 3}.
Example 2. If n(A) = 4, find the number of subsets of A. 2ⁿ = 2⁴ = 16.
Example 3. If n(A) = 20, n(B) = 15, n(A ∩ B) = 5, find n(A ∪ B). = 20 + 15 − 5 = 30.
7. Common mistakes
- Mistake: Confusing subset (⊆) and element (∈). Fix: ∈ relates an element to a set; ⊆ relates a set to a set.
- Mistake: Forgetting to subtract n(A ∩ B). Fix: n(A ∪ B) = n(A) + n(B) − n(A ∩ B).
- Mistake: Wrong De Morgan form. Fix: (A ∪ B)′ = A′ ∩ B′ (the operation flips).
8. Practice (book-back style)
- Write {x : x is a natural number less than 5} in roster form.
- If n(A) = 5, find the number of subsets and proper subsets.
- State De Morgan's laws.
- If A = {a, b, c}, B = {b, c, d}, find A − B.
- If n(A) = 12, n(B) = 8, n(A ∪ B) = 16, find n(A ∩ B).
9. Answer key
- {1, 2, 3, 4}.
- Subsets = 2⁵ = 32; proper subsets = 32 − 1 = 31.
- (A ∪ B)′ = A′ ∩ B′; (A ∩ B)′ = A′ ∪ B′.
- A − B = {a}.
- n(A ∩ B) = n(A) + n(B) − n(A ∪ B) = 12 + 8 − 16 = 4.
10. Quick revision
- Chapter 1 · sets, operations, De Morgan, cardinality.
- Roster and set-builder forms; types of sets; power set has 2ⁿ subsets.
- ∪ (or), ∩ (and), A − B, complement A′.
- De Morgan: (A ∪ B)′ = A′ ∩ B′; (A ∩ B)′ = A′ ∪ B′.
- n(A ∪ B) = n(A) + n(B) − n(A ∩ B).
