- Set well-defined collection distinct objects everyone agrees belongs or not elements members small letter ∈ belongs ∉ not belongs Set capital letter A={a,e,i,o,u} a∈A b∉A well-defined students class XI yes beautiful girls no opinion not set intelligent students no WhatsApp groups family set cricket team 11 set shopping cart set Instagram followers set clear labelled box red pens well-defined beautiful pens not set opinion box items inside elements.
- Roster listing method curly {} commas order no matter no repetition A={1,2,3,4} vowels {a,e,i,o,u} even <10 {2,4,6,8} ... dots repetition not counted {a,b,b,c}={a,b,c} distinct only order no matter {1,2,3}={3,2,1} Set-builder {x: condition} {x|condition} such that A={x: x∈N x<5} vowels {x: x is vowel} even {x: x even natural x<10} conversion roster {1,4,9,16} builder {x²: x=1,2,3,4} {x: x=n² n≤4} attendance roster list names admission criteria set-builder property marks>90 full guest list names vs invitation rule All marks>90 property not names both describe same party.
- Types empty null φ {} no elements talking unicorns φ natural between 2 and 3 φ subset of every set singleton one element {5} {penguin} one and only finite countable limited done counting {apple,banana,orange} 3 items finite infinite endless forever cannot count end {1,2,3,4,...} natural numbers ∞ real between 0 and 1 infinite equal same elements same set order no matter {2,4,6}={6,2,4} A=B same members equivalent same number elements different may be A≈B {a,b,c}≈{x,y,z} both 3 same size equal always equivalent equivalent not always equal universal U big set contains all possible everything relevant inside U numbers shapes animals objects classroom box holds everything empty pocket no money φ singleton you alone {you} finite 5 subjects infinite stars sky infinite universal whole school all classes empty lunchbox nothing inside single candy finite 5 fingers countable infinite stars never ends same lunchbox contents equal same number items different items equivalent whole cafeteria contains all lunchboxes universal.
- Subset A⊆B every element A also in B {1,2}⊆{1,2,3} ⊆ subset ⊇ superset proper A⊂B A⊆B A≠B strictly inside {1,2}⊂{1,2,3} extra 3 empty φ subset of every set every set subset of itself A⊆A power set P(A) set of all subsets including φ and A Example A={1,2} subsets φ {1} {2} {1,2} 4 P(A)={φ,{1},{2},{1,2}} 4 elements formula n(A)=n subsets 2^n proper 2^n-1 exclude A non-empty 2^n-1 exclude φ power set 2^n elements Example {a,b,c} n=3 subsets 8 φ {a} {b} {c} {a,b} {a,c} {b,c} {a,b,c} proper 7 {1,2,3,4,5} n=5 subsets 32 φ n=0 subsets 1 only φ P(φ)={φ} 1 element pizza toppings {cheese,tomato,onion} n=3 choices 8 including no topping empty all possible pizzas power set small group inside big group all friends small also in big all possible teams from players including no player φ and all players each element two choices take or leave 2×2×2 n times =2^n.
- Venn diagram visual representation circles inside rectangle U universal John Venn rectangle big U contains all circles sets inside union A∪B all in A or B or both OR combined {1,2,3}∪{3,4,5}={1,2,3,4,5} 3 once no repetition shading both circles full cricket fans football fans all sports fans intersection A∩B common both A and B AND both {1,2,3}∩{3,4,5}={3} common shading overlapping lens middle friends like both cricket and football difference A-B in A not in B subtraction remove B from A {1,2,3}-{3,4,5}={1,2} remove 3 B-A={4,5} shading only A not overlapping complement A' Aᶜ in U not in A NOT opposite U={1,2,3,4,5} A={1,2,3} A'={4,5} U except A shading outside circle inside rectangle properties A∪A'=U A∩A'=φ (A')'=A double complement back disjoint no common A∩B=φ no overlap separate circles {1,2} {3,4} disjoint combining two friend groups all friends together common friends both groups friends only in your group not theirs everyone in school except your group two groups no common friends separate circles map of sets rectangle whole school circles classes inside.
- Laws commutative order no matter A∪B=B∪A A∩B=B∩A associative grouping can change answer stays (A∪B)∪C=A∪(B∪C) (A∩B)∩C=A∩(B∩C) distributive one spreads over other sharing A∪(B∩C)=(A∪B)∩(A∪C) A∩(B∪C)=(A∩B)∪(A∩C) De Morgan complement union is intersection complements outside flips to inside (A∪B)'=A'∩B' (A∩B)'=A'∪B' break bar changes ∪ to ∩ ∩ to ∪ Example U={1,2,3,4,5} A={1,2} B={2,3} A∪B={1,2,3} (A∪B)'={4,5} A'={3,4,5} B'={1,4,5} A'∩B'={4,5} matches idempotent doing again changes nothing A∪A=A A∩A=A counting formula most important practical n(A∪B)=n(A)+n(B)-n(A∩B) total sum minus common no double-counting Example class 12 cricket 9 football both 5 total 12+9-5=16 3 sets n(A∪B∪C)=n(A)+n(B)+n(C)-n(A∩B)-n(B∩C)-n(A∩C)+n(A∩B∩C) add all subtract pairwise add triple back other n(A-B)=n(A)-n(A∩B) only A n(A')=n(U)-n(A) complement n(AΔB) symmetric difference exactly one =n(A)+n(B)-2n(A∩B)=n(A-B)+n(B-A) trick Union OR Intersection AND Complement NOT n(.) count order no matter grouping can change answer stays one spreads over other sharing outside flips to inside break bar changes union to intersection doing again changes nothing no double-counting friends who like cricket or football don't double count both subtract common add all subtract pairwise add triple back included thrice subtracted thrice exactly one both minus twice common.
- Practical real life shopping set items {milk,bread,eggs} finite roster union two lists combines both intersection common both lists social media Instagram followers set following set mutual = intersection followers∩following both follow each other non-mutual = difference Facebook groups sets sports team selection set players bat set players bowl all-rounders = intersection bat∩bowl both skills database Google cats OR dogs union cats AND dogs intersection both NOT cats complement Email filters school students passed maths passed science passed both = intersection passed at least one = union failed both = complement of union kitchen vegetarian dishes spicy dishes vegetarian and spicy = intersection real problem 100 students 60 cricket 50 football 30 both at least one n(C∪F)=60+50-30=80 none n(U)=100 none=100-80=20 complement only cricket n(C-F)=60-30=30 only cricket shopping finite roster union combines intersection common followers following mutual intersection bat bowl all-rounders intersection Google OR union AND intersection NOT complement school both intersection at least one union failed both complement union kitchen vegetarian spicy intersection 100 students 60 cricket 50 football 30 both at least one 80 none 20 only cricket 30 shopping list finite roster Instagram followers set mutual intersection bat bowl both skills Google OR AND NOT union intersection complement school passed both intersection at least one union failed both complement union kitchen vegetarian spicy intersection Venn diagram problem solving.
- All formulas short tricks gold exam ready subsets n elements => subsets 2^n each element two choices take or leave multiply 2x2x2 n times proper subsets 2^n-1 exclude original set non-empty 2^n-1 exclude φ proper non-empty 2^n-2 exclude both φ and A union intersection counting n(A∪B)=n(A)+n(B)-n(A∩B) always subtract common avoid double count only A = n(A)-n(A∩B)=n(A-B) only B = n(B)-n(A∩B) neither = n(U)-n(A∪B) De Morgan (A∪B)'=A'∩B' (A∩B)'=A'∪B' bar breaks union becomes intersection complement n(A')=n(U)-n(A) symmetric difference AΔB=(A-B)∪(B-A)=(A∪B)-(A∩B) elements in exactly one If A⊆B then A∪B=B and A∩B=A short trick subset union is superset intersection is subset each element two options take or leave yes/no choice for each friend invite or not total 2^n parties NOT (A OR B) = NOT A AND NOT B not tea or coffee means no tea and no coffee both no subsets 2^n proper 2^n-1 non-empty 2^n-1 proper non-empty 2^n-2 union n(A∪B)=n(A)+n(B)-n(A∩B) subtract common avoid double count only A n(A)-n(A∩B) only B n(B)-n(A∩B) neither n(U)-n(A∪B) De Morgan bar breaks union to intersection complement n(A')=n(U)-n(A) symmetric difference exactly one If A⊆B then A∪B=B A∩B=A subset trick small inside big union is big intersection is small.
Chapter 1 - Sets
Beginner
Topper
1. Introduction - What is a Set? Well-Defined Collection
A set is a well-defined collection of distinct objects. Well-defined means everyone agrees whether an object belongs or not no confusion.
Examples around you: Set of all students in your class XI - clear who is in class. Set of all cricket bats in your house. Set of vowels a e i o u. Set of all months January to December.
Not a set: Set of beautiful girls in class - not well-defined beautiful is opinion different people different opinions confusion. Set of intelligent students - not well-defined.
Elements: objects in set called elements members denoted by small letter a b x. Set denoted by capital letter A B. Symbol ∈ belongs to ∉ not belongs to. Example A = {a,e,i,o,u} then a ∈ A but b ∉ A.
Real life: WhatsApp groups are sets - Group of family members, group of cricket team 11 players set, shopping cart items set, Instagram followers set.
Visual Learning Method: Well-defined collection distinct objects, elements a ∈ A b ∉ A, examples vowels {a,e,i,o,u}, students in class XI cricket bats months, not well-defined beautiful girls intelligent students not set, WhatsApp groups family set cricket team 11 shopping cart Instagram followers.
Daily Analogy: Set like a clear labelled box. If box says "All red pens" everyone agrees which pens belong red pens yes blue no well-defined. If box says "beautiful pens" confusion not well-defined opinion. Elements are items inside box.
Introduction - What is Set?
Revision Points - Easy:
- Set well-defined collection distinct objects everyone agrees belongs or not.
- Elements members small letter ∈ belongs ∉ not belongs Set capital letter.
- A={a,e,i,o,u} a∈A b∉A.
- Well-defined students class XI yes beautiful girls no not set.
- Real life WhatsApp groups family set cricket team 11 set shopping cart set Instagram followers set.
2. Representation - Roster and Set-Builder - Two Ways to Write
Roster form listing method: list all elements inside curly brackets {} separated by commas order does not matter no repetition. Example set of natural numbers less than 5 A={1,2,3,4}. Set of vowels B={a,e,i,o,u}. Set of even numbers less than 10 C={2,4,6,8}. Short trick: if many elements use ... dots but list enough to understand.
Set-builder form: describe property of elements using variable x and condition. Format {x: condition} or {x | condition} colon or | means such that. Example A={1,2,3,4} set-builder A={x: x∈N x<5}. B vowels B={x: x is vowel in English}. C even less than 10 C={x: x is even natural x<10}.
Conversion: roster {1,4,9,16} set-builder {x²: x=1,2,3,4} or {x: x=n² n∈N n≤4}. Real life: attendance register roster lists names, admission criteria set-builder describes property like "all students with marks >90".
Important: repetition not counted in set {a,b,b,c} same as {a,b,c} distinct only. Order does not matter {1,2,3} same as {3,2,1}.
Visual Learning Method: Roster {1,2,3,4} {a,e,i,o,u} {2,4,6,8} order no matter no repetition {a,b,b,c}={a,b,c}, Set-builder {x: x∈N x<5} {x: x is vowel} {x: x even x<10} {x²: x=1,2,3,4} {x: x=n² n≤4}, attendance roster vs admission criteria set-builder property.
Daily Analogy: Roster like writing full guest list names all invited. Set-builder like invitation rule "All who scored >90" property not names. Both describe same party.
Representation - Roster Set-Builder
Revision Points - Easy:
- Roster listing {} commas order no matter no repetition {1,2,3,4} vowels {a,e,i,o,u} even <10 {2,4,6,8}.
- Set-builder {x: condition} such that {x: x∈N x<5} {x: x is vowel} {x: x even x<10}.
- {1,4,9,16} builder {x²: x=1,2,3,4}.
- Repetition not counted {a,b,b,c}={a,b,c} order no matter {1,2,3}={3,2,1}.
- Real life attendance roster list names admission criteria set-builder property marks>90.
3. Types of Sets - Empty Finite Infinite Equal etc.
Empty set null set φ or {} set with no elements nothing inside. Example set of talking unicorns = φ, set of natural numbers between 2 and 3 = φ no natural between. Important φ is subset of every set.
Singleton set only one element. Example {5}, {penguin}. Finite set countable limited you can count all elements done counting. Example {apple, banana, orange} 3 items finite, {1,2,3,4} finite.
Infinite set endless goes on forever cannot count to end. Example natural numbers {1,2,3,4,...} endless ∞, real numbers between 0 and 1 infinite.
Equal sets same elements same set order doesn't matter If A and B have exactly same members then A=B. Example {2,4,6} = {6,2,4} equal order doesn't matter.
Equivalent sets same number of elements but elements may be different notation A≈B. Example {a,b,c} ≈ {x,y,z} both have 3 elements same size but different elements. So equal sets are always equivalent but equivalent may not be equal.
Universal set U big set that contains all possible elements we are discussing everything relevant is inside U. Example if discussing numbers 1-10 U={1,2,3,...,10} whole classroom box holds everything. Subsets are inside U.
Real life: empty set your pocket with no money φ, singleton set you alone {you}, finite set your 5 subjects, infinite set stars in sky infinite, universal set whole school contains all classes.
Visual Learning Method: Empty φ {} nothing inside talking unicorns, singleton one element {penguin}, finite countable limited apple banana orange 3 items done counting, infinite endless {1,2,3,4,...} → ∞, equal same elements order no matter {2,4,6}={6,2,4}, equivalent same size A≈B {a,b,c}≈{x,y,z} both 3, universal U big set contains all numbers shapes animals objects everything relevant inside U, pocket no money φ you alone singleton 5 subjects finite stars infinite school universal.
Daily Analogy: Empty set like empty lunchbox nothing inside φ. Singleton like single candy {penguin}. Finite like your 5 fingers countable. Infinite like counting stars never ends. Equal like same lunchbox contents same. Equivalent like two lunchboxes same number of items but different items. Universal like whole cafeteria contains all lunchboxes.
Types of Sets
Revision Points - Easy:
- Empty null φ {} no elements talking unicorns φ subset of every set.
- Singleton one element {5} {penguin} one and only.
- Finite countable limited {apple,banana,orange} 3 items finite infinite endless {1,2,3,4,...} ∞.
- Equal same elements order no matter {2,4,6}={6,2,4} equal always equivalent equivalent not always equal.
- Equivalent same number elements {a,b,c}≈{x,y,z} both 3.
- Universal U big set contains all possible everything relevant inside U classroom box.
4. Subsets Power Set - 2^n Formula Short Trick
Subset A⊆B if every element of A is also in B. Example A={1,2} B={1,2,3} then A⊆B because 1 in B 2 in B. Symbol ⊆ subset ⊇ superset. If A⊆B and A≠B then proper subset A⊂B strictly inside. Example {1,2} ⊂ {1,2,3} proper because B has extra 3.
Important: empty set φ is subset of every set, every set is subset of itself A⊆A.
Power set P(A) set of all subsets of A including φ and A itself. Example A={1,2} subsets: φ, {1}, {2}, {1,2} total 4 subsets so P(A) = {φ,{1},{2},{1,2}} 4 elements.
Formula short trick: If A has n elements n(A)=n then number of subsets = 2^n, number of proper subsets = 2^n -1 exclude A itself, number of non-empty subsets = 2^n -1 exclude φ, power set has 2^n elements.
Examples: A={a,b,c} n=3 subsets 2³=8 list φ {a} {b} {c} {a,b} {a,c} {b,c} {a,b,c} 8. Proper subsets 7 exclude {a,b,c}. A={1,2,3,4,5} n=5 subsets 2^5=32. If n=0 empty set φ n=0 subsets 2^0=1 only φ itself P(φ)={φ} 1 element.
Real life: subsets like toppings choices pizza: set of toppings {cheese,tomato,onion} n=3 choices 8 including no topping empty. Power set all possible pizzas you can order.
Visual Learning Method: Subset A⊆B every element A also in B {1,2}⊆{1,2,3}, proper subset A⊂B {1,2}⊂{1,2,3} strictly inside extra element, φ subset every set A⊆A itself, power set P(A) all subsets φ {1} {2} {1,2} 4 elements, formula n elements subsets 2^n proper 2^n-1 non-empty 2^n-1 power set 2^n, A={a,b,c} n=3 subsets 8 list φ {a} {b} {c} {a,b} {a,c} {b,c} {a,b,c} proper 7, A={1,2,3,4,5} n=5 subsets 32, φ n=0 subsets 1 P(φ)={φ} 1 element, pizza toppings {cheese,tomato,onion} n=3 choices 8 including no topping power set all possible pizzas.
Daily Analogy: Subset like small group inside big group all friends of small group also in big group. Power set like all possible teams you can make from players including no player φ and all players. Formula 2^n trick each element two choices take or leave 2×2×2... n times =2^n.
Subsets Power Set 2^n Trick
Revision Points - Easy:
- Subset A⊆B every element A also in B {1,2}⊆{1,2,3} proper A⊂B strictly inside A≠B {1,2}⊂{1,2,3}.
- φ subset of every set every set subset of itself A⊆A.
- Power set P(A) all subsets including φ and A A={1,2} subsets φ {1} {2} {1,2} 4 P(A)={φ,{1},{2},{1,2}}.
- Formula n elements subsets 2^n proper 2^n-1 non-empty 2^n-1 power set 2^n elements.
- A={a,b,c} n=3 subsets 8 proper 7 A={1,2,3,4,5} n=5 subsets 32 φ n=0 subsets 1.
- Real life pizza toppings {cheese,tomato,onion} n=3 choices 8 power set all possible pizzas.
5. Venn Diagrams & Operations - Union Intersection Difference Complement
Venn diagram visual representation of sets using circles inside rectangle universal set U. Rectangle big U contains all, circles sets inside. John Venn invented.
Union A∪B all elements in A or B or both combined together OR. Example A={1,2,3} B={3,4,5} A∪B={1,2,3,4,5} 3 taken once no repetition. Venn shading both circles full. Real life union of cricket fans and football fans all sports fans.
Intersection A∩B common elements in both A and B both AND. Example A={1,2,3} B={3,4,5} A∩B={3} only common. Venn shading overlapping lens middle. Real life friends who like both cricket and football.
Difference A-B elements in A but not in B subtraction remove B from A. Example A={1,2,3} B={3,4,5} A-B={1,2} remove 3 because in B, B-A={4,5} remove 3. Venn shading only A part not overlapping.
Complement A' or Aᶜ elements in U but not in A NOT opposite. Example U={1,2,3,4,5} A={1,2,3} A'={4,5} everything in U except A. Venn shading outside circle inside rectangle. Properties: A∪A'=U, A∩A'=φ, (A')'=A double complement back.
Disjoint sets no common element A∩B=φ no overlap Venn separate circles. Example A={1,2} B={3,4} disjoint.
Visual Learning Method: Venn rectangle U big contains all circles sets John Venn, union A∪B OR all in A or B both {1,2,3}∪{3,4,5}={1,2,3,4,5} shading both circles full cricket fans football fans all sports, intersection A∩B AND common both {1,2,3}∩{3,4,5}={3} shading lens middle both cricket football, difference A-B in A not B {1,2,3}-{3,4,5}={1,2} shading only A not overlapping, complement A' NOT U but not A U={1,2,3,4,5} A={1,2,3} A'={4,5} shading outside circle inside rectangle A∪A'=U A∩A'=φ (A')'=A, disjoint no common A∩B=φ separate circles {1,2} {3,4}.
Daily Analogy: Union like combining two friend groups all friends together. Intersection like common friends both groups. Difference like friends only in your group not theirs. Complement like everyone in school except your group. Disjoint like two groups with no common friends separate circles.
Venn Diagrams & Operations
Revision Points - Easy:
- Venn rectangle U big all circles sets inside John Venn.
- Union A∪B OR all in A or B or both {1,2,3}∪{3,4,5}={1,2,3,4,5} shading both circles full.
- Intersection A∩B AND common both {1,2,3}∩{3,4,5}={3} shading lens middle overlapping.
- Difference A-B in A not B {1,2,3}-{3,4,5}={1,2} B-A={4,5} shading only A not overlapping.
- Complement A' in U not in A NOT U={1,2,3,4,5} A={1,2,3} A'={4,5} shading outside circle inside rectangle A∪A'=U A∩A'=φ (A')'=A.
- Disjoint no common A∩B=φ separate circles {1,2} {3,4}.
6. Laws of Sets & Counting Formulas - Short Tricks for Exams
Laws help simplify:
Commutative law order doesn't matter A∪B = B∪A union same both ways, A∩B = B∩A intersection same.
Associative law grouping can change answer stays same (A∪B)∪C = A∪(B∪C) same for intersection (A∩B)∩C = A∩(B∩C).
Distributive law one spreads over other like sharing A∪(B∩C) = (A∪B)∩(A∪C) union distributes over intersection, A∩(B∪C) = (A∩B)∪(A∩C) intersection distributes over union.
De Morgan's law very important complement of union is intersection of complements outside flips to inside (A∪B)' = A'∩B', (A∩B)' = A'∪B' complement of intersection is union of complements. Trick: break bar changes ∪ to ∩ and ∩ to ∪. Example U={1,2,3,4,5} A={1,2} B={2,3} A∪B={1,2,3} (A∪B)'={4,5} A'={3,4,5} B'={1,4,5} A'∩B'={4,5} matches.
Idempotent law doing again changes nothing A∪A = A, A∩A = A.
Counting formula most important for practical: n(A∪B) = n(A)+n(B)-n(A∩B) total = sum minus common double-counted no double-counting. Example class 12 like cricket 12 like football 9 both 5 total sports fans 12+9-5=16.
For 3 sets: n(A∪B∪C) = n(A)+n(B)+n(C)-n(A∩B)-n(B∩C)-n(A∩C)+n(A∩B∩C) add all subtract pairwise intersections add triple intersection back included thrice subtracted thrice need add back.
Other formulas: n(A-B) = n(A)-n(A∩B) only A, n(A' ) = n(U)-n(A) complement, n(AΔB) symmetric difference elements in exactly one of A or B = n(A)+n(B)-2n(A∩B) = n(A-B)+n(B-A).
Short trick: Union = OR, Intersection = AND, Complement = NOT, n(.) = count of elements.
Visual Learning Method: Commutative A∪B=B∪A order doesn't matter, associative (A∪B)∪C=A∪(B∪C) grouping can change answer stays, distributive A∪(B∩C)=(A∪B)∩(A∪C) one spreads over other sharing, De Morgan (A∪B)'=A'∩B' (A∩B)'=A'∪B' outside flips to inside break bar changes ∪ to ∩, idempotent A∪A=A doing again changes nothing, counting n(A∪B)=n(A)+n(B)-n(A∩B) no double-counting total 12+9-5=16, 3 sets n(A∪B∪C)=n(A)+n(B)+n(C)-n(A∩B)-n(B∩C)-n(A∩C)+n(A∩B∩C) add subtract pairwise add triple, n(A-B)=n(A)-n(A∩B) n(A')=n(U)-n(A) symmetric difference n(AΔB)=n(A)+n(B)-2n(A∩B), union OR intersection AND complement NOT.
Daily Analogy: Commutative like friends meeting A meets B same as B meets A order doesn't matter. Associative like grouping teams (A and B) then C same as A and (B and C). Distributive like sharing chocolates A shares with (B and C) group. De Morgan like NOT (A OR B) = NOT A AND NOT B outside flips. Counting formula like counting friends who like cricket or football don't double count those who like both subtract common.
Laws of Sets & Formulas
Revision Points - Easy:
- Commutative order no matter A∪B=B∪A A∩B=B∩A.
- Associative grouping can change answer stays (A∪B)∪C=A∪(B∪C) (A∩B)∩C=A∩(B∩C).
- Distributive one spreads over other A∪(B∩C)=(A∪B)∩(A∪C) A∩(B∪C)=(A∩B)∪(A∩C).
- De Morgan (A∪B)'=A'∩B' (A∩B)'=A'∪B' break bar changes ∪ to ∩ outside flips to inside.
- Idempotent A∪A=A A∩A=A doing again changes nothing.
- Counting n(A∪B)=n(A)+n(B)-n(A∩B) no double-counting 12+9-5=16.
- 3 sets n(A∪B∪C)=n(A)+n(B)+n(C)-n(A∩B)-n(B∩C)-n(A∩C)+n(A∩B∩C).
- n(A-B)=n(A)-n(A∩B) n(A')=n(U)-n(A) symmetric difference n(AΔB)=n(A)+n(B)-2n(A∩B).
7. Practical Real Life Usage - Where Sets Used Daily?
Shopping: set of items to buy {milk,bread,eggs} finite set roster, union of two shopping lists combines both, intersection common items both lists.
Social media: Instagram followers set, following set, mutual followers = intersection followers ∩ following both follow each other, non-mutual = difference. Facebook groups sets.
Sports team selection: set of players who can bat set of players who can bowl all-rounders = intersection bat ∩ bowl both skills.
Database searching: Google search "cats OR dogs" union, "cats AND dogs" intersection both, "NOT cats" complement. Email filters.
School: set of students who passed maths, set who passed science, passed both = intersection, passed at least one = union, failed both = complement of union.
Kitchen: set of vegetarian dishes set of spicy dishes vegetarian and spicy = intersection.
Real life problem: 100 students 60 like cricket 50 like football 30 like both how many like at least one? n(C∪F)=60+50-30=80. How many like none? n(U)=100 none =100-80=20 complement. How many like only cricket? n(C-F)=60-30=30 only cricket.
Visual Learning Method: Shopping {milk,bread,eggs} finite roster union two lists combines intersection common, social media followers following mutual intersection followers∩following non-mutual difference, sports bat set bowl set all-rounders intersection bat∩bowl both skills, database Google cats OR union cats AND intersection both NOT complement email filters, school passed maths passed science both intersection at least one union failed both complement union, kitchen vegetarian spicy intersection, 100 students 60 cricket 50 football 30 both at least one 60+50-30=80 none 100-80=20 only cricket 60-30=30.
Daily Analogy: Sets everywhere daily: shopping list finite set, Instagram followers set, cricket team selection bat and bowl sets all-rounders intersection both skills, Google OR AND NOT uses union intersection complement same as sets.
Practical Real Life Usage
Revision Points - Easy:
- Shopping {milk,bread,eggs} finite roster union two lists combines intersection common.
- Instagram followers set following set mutual = intersection followers∩following non-mutual = difference.
- Sports bat set bowl set all-rounders = intersection bat∩bowl both skills.
- Google cats OR union cats AND intersection both NOT complement email filters.
- School passed maths passed science both intersection at least one union failed both complement of union.
- 100 students 60 cricket 50 football 30 both at least one 60+50-30=80 none 100-80=20 only cricket 60-30=30.
8. All Formulas Short Tricks Gold Table - Exam Ready
Short tricks for fast solving:
1. Subsets: n elements => subsets 2^n trick each element two choices take or leave multiply.
2. Proper subsets 2^n -1 exclude original set, non-empty 2^n -1 exclude φ, proper non-empty 2^n -2 exclude both φ and A.
3. Union intersection counting n(A∪B)=n(A)+n(B)-n(A∩B) always subtract common avoid double count.
4. Only A = n(A)-n(A∩B) = n(A-B), only B = n(B)-n(A∩B), neither = n(U)-n(A∪B).
5. De Morgan: (A∪B)' = A'∩B' , (A∩B)' = A'∪B' remember bar breaks union becomes intersection.
6. Complement: n(A')=n(U)-n(A).
7. Symmetric difference AΔB = (A-B)∪(B-A) = (A∪B)-(A∩B) elements in exactly one.
8. If A⊆B then A∪B=B and A∩B=A short trick subset union is superset intersection is subset.
Visual Learning Method: Subsets 2^n each element two choices take or leave, proper 2^n-1 exclude original non-empty 2^n-1 exclude φ proper non-empty 2^n-2 exclude both, union n(A∪B)=n(A)+n(B)-n(A∩B) subtract common avoid double count, only A n(A)-n(A∩B) only B n(B)-n(A∩B) neither n(U)-n(A∪B), De Morgan (A∪B)'=A'∩B' (A∩B)'=A'∪B' bar breaks union intersection, complement n(A')=n(U)-n(A), symmetric difference AΔB=(A-B)∪(B-A)=(A∪B)-(A∩B) exactly one, A⊆B then A∪B=B A∩B=A.
Daily Analogy: Subsets trick each element two options take or leave like yes/no choice for each friend invite or not total 2^n parties. De Morgan trick NOT (A OR B) = NOT A AND NOT B like saying not (tea or coffee) means no tea and no coffee both no.
All Formulas Short Tricks
Revision Points - Easy:
- n elements subsets 2^n proper 2^n-1 non-empty 2^n-1 proper non-empty 2^n-2.
- n(A∪B)=n(A)+n(B)-n(A∩B) subtract common avoid double count.
- Only A n(A)-n(A∩B)=n(A-B) only B n(B)-n(A∩B) neither n(U)-n(A∪B).
- De Morgan (A∪B)'=A'∩B' (A∩B)'=A'∪B' bar breaks union to intersection.
- n(A')=n(U)-n(A) complement.
- AΔB=(A-B)∪(B-A)=(A∪B)-(A∩B) exactly one.
- If A⊆B then A∪B=B A∩B=A subset trick.
Gold Reference Table - Every Concept Formula Trick Real Life - High Quality No Limit
| Concept | Formula / Trick / Fact | Real Life Visual / Use |
|---|---|---|
| Definition | Well-defined collection distinct objects ∈ belongs ∉ not belongs Set capital A B elements small a b x | Clear labelled box red pens well-defined beautiful girls not set opinion box items inside elements |
| Roster | Listing {} commas order no matter no repetition {1,2,3,4} {a,e,i,o,u} {2,4,6,8} ... dots {a,b,b,c}={a,b,c} {1,2,3}={3,2,1} | Full guest list names attendance register roster list names |
| Set-builder | {x: condition} {x|condition} such that {x: x∈N x<5} {x: x is vowel} {x²: x=1,2,3,4} {x: x=n² n≤4} | Invitation rule All marks>90 property not names admission criteria property |
| Empty null φ {} | No elements talking unicorns φ natural between 2 and 3 φ subset of every set φ ⊆ every set | Empty lunchbox nothing inside empty pocket no money φ |
| Singleton | One element {5} {penguin} one and only | Single candy {penguin} you alone {you} |
| Finite Infinite | Finite countable limited done counting {apple,banana,orange} 3 finite Infinite endless forever cannot count end {1,2,3,...} ∞ real 0-1 infinite | 5 fingers countable finite stars sky infinite never ends |
| Equal Equivalent Universal | Equal same elements same set order no matter {2,4,6}={6,2,4} A=B same members Equivalent same number size A≈B {a,b,c}≈{x,y,z} both 3 equal always equivalent equivalent not always equal Universal U big set contains all possible everything relevant inside U classroom box holds everything | Same lunchbox contents equal same number items different items equivalent two lunchboxes same number different items whole cafeteria contains all lunchboxes universal |
| Subset Proper | A⊆B every element A also in B {1,2}⊆{1,2,3} ⊆ subset ⊇ superset Proper A⊂B A⊆B A≠B strictly inside {1,2}⊂{1,2,3} extra 3 φ subset every set A⊆A itself | Small group inside big group all friends small also in big proper strictly inside extra friend |
| Power Set | P(A) set of all subsets including φ and A Example A={1,2} subsets φ {1} {2} {1,2} 4 P(A)={φ,{1},{2},{1,2}} 4 elements | All possible teams from players including no player φ and all players |
| Number Subsets Formula | n(A)=n subsets 2^n proper 2^n-1 exclude A non-empty 2^n-1 exclude φ proper non-empty 2^n-2 exclude both φ and A power set 2^n elements Example {a,b,c} n=3 subsets 8 list φ {a} {b} {c} {a,b} {a,c} {b,c} {a,b,c} proper 7 {1,2,3,4,5} n=5 subsets 32 φ n=0 subsets 1 P(φ)={φ} 1 element | Each element two choices take or leave 2×2×2 n times =2^n pizza toppings {cheese,tomato,onion} n=3 choices 8 including no topping empty all possible pizzas power set |
| Venn Diagram | Visual representation circles inside rectangle U universal John Venn Rectangle big U contains all circles sets inside | Map of sets rectangle whole school circles classes inside |
| Union A∪B OR | All in A or B or both OR combined Example {1,2,3}∪{3,4,5}={1,2,3,4,5} 3 once no repetition Venn shading both circles full | Combining two friend groups all friends together cricket fans football fans all sports fans |
| Intersection A∩B AND | Common both A and B AND both Example {1,2,3}∩{3,4,5}={3} common Venn shading overlapping lens middle | Common friends both groups both cricket and football friends like both |
| Difference A-B | In A not in B subtraction remove B from A {1,2,3}-{3,4,5}={1,2} remove 3 B-A={4,5} Venn shading only A not overlapping | Friends only in your group not theirs |
| Complement A' Aᶜ NOT | In U not in A NOT opposite U={1,2,3,4,5} A={1,2,3} A'={4,5} U except A Venn shading outside circle inside rectangle Properties A∪A'=U A∩A'=φ (A')'=A double complement back | Everyone in school except your group outside circle inside rectangle |
| Disjoint | No common A∩B=φ no overlap separate circles {1,2} {3,4} disjoint | Two groups no common friends separate circles |
| Commutative | Order no matter A∪B=B∪A A∩B=B∩A | Friends meeting A meets B same as B meets A order no matter |
| Associative | Grouping can change answer stays (A∪B)∪C=A∪(B∪C) (A∩B)∩C=A∩(B∩C) | Grouping teams (A and B) then C same as A and (B and C) |
| Distributive | One spreads over other sharing A∪(B∩C)=(A∪B)∩(A∪C) A∩(B∪C)=(A∩B)∪(A∩C) | Sharing chocolates A shares with (B and C) group |
| De Morgan | (A∪B)'=A'∩B' (A∩B)'=A'∪B' break bar changes ∪ to ∩ ∩ to ∪ complement union is intersection complements outside flips to inside Example U={1,2,3,4,5} A={1,2} B={2,3} A∪B={1,2,3} (A∪B)'={4,5} A'={3,4,5} B'={1,4,5} A'∩B'={4,5} matches | NOT (A OR B) = NOT A AND NOT B not tea or coffee means no tea and no coffee outside flips to inside bar breaks union to intersection |
| Idempotent | Doing again changes nothing A∪A=A A∩A=A | Doing again same result |
| Counting Union 2 sets | n(A∪B)=n(A)+n(B)-n(A∩B) total sum minus common no double-counting Example 12 cricket 9 football both 5 total 12+9-5=16 | Counting friends who like cricket or football don't double count both subtract common |
| Counting 3 sets | n(A∪B∪C)=n(A)+n(B)+n(C)-n(A∩B)-n(B∩C)-n(A∩C)+n(A∩B∩C) add all subtract pairwise add triple back | Add all subtract pairwise intersections add triple back included thrice subtracted thrice |
| Other formulas | n(A-B)=n(A)-n(A∩B) only A n(A')=n(U)-n(A) complement n(AΔB) symmetric difference exactly one =n(A)+n(B)-2n(A∩B)=n(A-B)+n(B-A) | Only A = A minus common, complement = universal minus A, exactly one = both minus twice common |
| Subset trick | If A⊆B then A∪B=B and A∩B=A union superset intersection subset | Small inside big union is big intersection is small |
| Real life applications | Shopping {milk,bread,eggs} finite roster union two lists combines intersection common Social media followers following mutual=intersection followers∩following non-mutual=difference Sports bat set bowl set all-rounders=intersection bat∩bowl both skills Database Google cats OR union cats AND intersection NOT complement Email filters School passed maths passed science both=intersection at least one=union failed both=complement of union Kitchen vegetarian spicy intersection | Shopping list finite roster, Instagram mutual intersection followers∩following, cricket bat bowl all-rounders intersection, Google OR AND NOT union intersection complement, school passed both intersection at least one union failed both complement union, kitchen vegetarian spicy intersection |
| Real problem trick | 100 students 60 cricket 50 football 30 both at least one n(C∪F)=60+50-30=80 none n(U)=100 none=100-80=20 complement only cricket n(C-F)=60-30=30 only cricket only football 20 both 30 | 100 students 60 cricket 50 football 30 both at least one 80 none 20 only cricket 30 Venn diagram problem solving |
Final Exam Ready Revision - Every Concept Formula Trick Real Life - High Quality: