Sets — Class 11 Maths

Section 1

📚 What are Sets?

🎉 Welcome to the World of Sets!

A set is like a guest list — you're either on it, or you're not. No maybes, no "sort of." This simple but powerful idea is the very foundation of modern mathematics!

In everyday language, we often talk about collections: a pack of cards, a bouquet of flowers, a team of players. Mathematics takes this idea and sharpens it into something precise — a set.

The Definition

A set is a well-defined collection of distinct objects. The objects that belong to a set are called its elements or members.

But what does "well-defined" really mean? It means that given any object, there must be no ambiguity — we can always decide with certainty whether that object belongs to the collection or not.

✅ Examples of Well-Defined Collections (Sets)

The collection of vowels in the English alphabet: {a, e, i, o, u}
The collection of natural numbers less than 10: {1, 2, 3, 4, 5, 6, 7, 8, 9}
The collection of all even prime numbers: {2}
The collection of planets in our solar system

❌ Examples That Are NOT Sets

"The collection of beautiful flowers" — beauty is subjective
"The collection of talented singers" — talent is a matter of opinion
"The collection of difficult problems" — difficulty varies from person to person

Is "the collection of tall people in your class" a set? No! "Tall" is subjective. But "the collection of people in your class whose height exceeds 170 cm" is a set — it has a clear, measurable criterion.

Notation & Symbols

Sets are conventionally denoted by capital letters: A, B, C, X, Y, Z, etc. Elements are typically represented by lowercase letters: a, b, c, x, y, z, etc.

If an element a belongs to a set A, we write:

Membership Notation

a ∈ A (read: "a belongs to A" or "a is an element of A")

b ∉ A (read: "b does not belong to A")

Example: If A = {1, 3, 5, 7}, then 3 ∈ A but 4 ∉ A

Standard Number Sets

Mathematics uses special symbols for commonly used sets of numbers. You will encounter these throughout your studies:

ℕ

Natural Numbers

{1, 2, 3, 4, ...}

𝕎

Whole Numbers

{0, 1, 2, 3, ...}

ℤ

Integers

{..., −2, −1, 0, 1, 2, ...}

ℚ

Rational Numbers

p/q where p, q ∈ ℤ, q ≠ 0

ℝ

Real Numbers

All rationals & irrationals

The symbol ℤ comes from the German word "Zahlen", meaning "numbers." The symbol ℚ comes from the Italian/German word "Quoziente" (quotient), since every rational number can be expressed as a quotient of two integers!

Section 2

📝 Representing Sets

There are two principal ways to describe a set: by explicitly listing every element, or by stating the rule that determines membership.

1. Roster (Tabular) Form

In roster form, we list all the elements of the set, separated by commas, enclosed in curly braces { }.

Roster Form Examples

{2, 4, 6, 8, 10}

The set of even natural numbers less than 12

{M, I, S, P}

The set of distinct letters in the word "MISSISSIPPI"

2. Set-Builder Form

In set-builder form, we describe the set by stating the property that its elements must satisfy:

Set-Builder Form Examples

{x : x is an even natural number, x < 12}

Read as: "the set of all x such that x is an even natural number less than 12"

The colon ":" (or vertical bar "|") is read as "such that"

Converting Between Forms

Roster → Set-Builder

{3, 6, 9, 12, 15}
= {x : x = 3n, n ∈ ℕ, 1 ≤ n ≤ 5}

Set-Builder → Roster

{x : x² − 5x + 6 = 0}
= {2, 3}

Roster → Set-Builder

{1, 4, 9, 16, 25}
= {x : x = n², n ∈ ℕ, 1 ≤ n ≤ 5}

Set-Builder → Roster

{x ∈ ℕ : x divides 12}
= {1, 2, 3, 4, 6, 12}

Key Rules to Remember

Order does not matter: {1, 2, 3} = {3, 1, 2} = {2, 3, 1}. The arrangement of elements is irrelevant — only membership counts.

Repetition is ignored: {1, 1, 2, 2, 3} = {1, 2, 3}. Each element is listed only once. Writing duplicates does not create a "larger" set!

The word "MISSISSIPPI" has 11 letters, but the set of letters in "MISSISSIPPI" is just {M, I, S, P} — a set with only 4 elements. The set strips away repetition and keeps only the distinct members.

Section 3

🔢 Types of Sets

Sets come in many flavours. Understanding these different types is essential before we can work with operations on sets.

Empty Set (Null Set)

A set that contains no elements is called the empty set (or null set). It is denoted by ∅ or { }.

Empty Set Examples

A = {x ∈ ℝ : x² = −1} = ∅

No real number has a negative square

B = {x ∈ ℕ : 5 < x < 6} = ∅

There is no natural number between 5 and 6

{∅} is NOT the same as ∅! The set {∅} contains one element — the empty set itself. So {∅} is a singleton set, not an empty set. Be very careful with this distinction.

Singleton Set

A set with exactly one element is called a singleton set.

{0} — the set containing only zero
{x ∈ ℕ : x is even and prime} = {2}

Finite and Infinite Sets

A set is finite if its elements can be counted (the counting process terminates). Otherwise, it is infinite.

Finite Sets	Infinite Sets
{a, e, i, o, u}	ℕ = {1, 2, 3, ...}
{x ∈ ℤ : −3 ≤ x ≤ 3}	ℤ = {..., −1, 0, 1, ...}
Set of days in a week	Set of points on a line

Cardinality (Order) of a Finite Set

The number of elements in a finite set A is called its cardinality (or order), denoted n(A) or |A|.

If A = {2, 4, 6, 8}, then n(A) = 4
n(∅) = 0

Equal Sets

Two sets A and B are said to be equal (written A = B) if they have exactly the same elements.

Checking Equality

A = {1, 2, 3, 4} B = {4, 3, 2, 1}

A = B ✓ (same elements, order doesn't matter)

C = {1, 2, 3} D = {1, 2, 3, 4}

C ≠ D ✗ (D has the element 4, which C does not)

Equivalent Sets

Two sets are equivalent if they have the same number of elements (same cardinality), even if the elements themselves are different.

A = {1, 2, 3} and B = {a, b, c} are equivalent since n(A) = n(B) = 3
Equal sets are always equivalent, but equivalent sets are not necessarily equal!

Power Set

The power set of a set A, denoted P(A), is the set of all subsets of A (including ∅ and A itself).

If a set A has n elements, then P(A) has exactly 2ⁿ elements. A set with 3 elements has 2³ = 8 subsets. A set with 10 elements has 2¹⁰ = 1024 subsets. The numbers grow incredibly fast!

Power Set Example

A = {p, q}

P(A) = { ∅, {p}, {q}, {p, q} }

n(A) = 2, so |P(A)| = 2² = 4 ✓

Section 4

⊂ Subsets & Intervals

Subset

A set A is a subset of set B (written A ⊆ B) if every element of A is also an element of B.

Subset Notation

A ⊆ B means: if x ∈ A, then x ∈ B

A ⊄ B means: there exists some x ∈ A such that x ∉ B

Proper Subset

A set A is a proper subset of B (written A ⊂ B) if A ⊆ B and A ≠ B. In other words, B contains at least one element not in A.

Example

{1, 3} ⊂ {1, 2, 3, 4}

{1, 3} is a proper subset — {1, 2, 3, 4} has elements 2 and 4 not in {1, 3}

{1, 2, 3} ⊆ {1, 2, 3}

{1, 2, 3} is a subset of itself, but NOT a proper subset

Important Subset Facts

🔑 Key Properties of Subsets

∅ ⊆ A for every set A — the empty set is a subset of every set
A ⊆ A for every set A — every set is a subset of itself
If A ⊆ B and B ⊆ A, then A = B
If A ⊆ B and B ⊆ C, then A ⊆ C (transitivity)
A set with n elements has 2ⁿ subsets and 2ⁿ − 1 proper subsets

Listing All Subsets

Let us find all subsets of A = {1, 2}:

Subset	Type
∅	Proper subset (has no elements)
{1}	Proper subset
{2}	Proper subset
{1, 2}	Subset (equals A, so not proper)

Total subsets = 2² = 4. Proper subsets = 4 − 1 = 3. ✓

Intervals on the Real Number Line

When working with subsets of ℝ, we often describe sets using interval notation. There are four types:

Interval	Notation	Description	Endpoints
Open	(a, b)	{x ∈ ℝ : a < x < b}	Neither a nor b included
Closed	[a, b]	{x ∈ ℝ : a ≤ x ≤ b}	Both a and b included
Half-open (left)	[a, b)	{x ∈ ℝ : a ≤ x < b}	a included, b excluded
Half-open (right)	(a, b]	{x ∈ ℝ : a < x ≤ b}	a excluded, b included

Visualizing Intervals

On a number line, a filled circle ● means the endpoint is included, and an open circle ○ means it is excluded.

[2, 7) — Includes 2, excludes 7

(−3, 5] — Excludes −3, includes 5

−3

Memory trick for intervals: Square brackets [ and ] "grab" the endpoint (included). Round parentheses ( and ) "push away" the endpoint (excluded). Think: brackets = closed fist = holding on; parentheses = open palm = letting go.

Section 5

∪ Union & Intersection

Now we arrive at the heart of set theory — operations on sets. Just as we add and multiply numbers, we combine sets using union and intersection.

Union of Sets

The union of sets A and B, written A ∪ B, is the set of all elements that belong to A or B (or both).

Union — Definition

A ∪ B = {x : x ∈ A or x ∈ B}

If A = {1, 2, 3} and B = {3, 4, 5}, then A ∪ B = {1, 2, 3, 4, 5}

A ∪ B — The entire shaded region (both circles combined)

Intersection of Sets

The intersection of sets A and B, written A ∩ B, is the set of all elements that belong to both A and B simultaneously.

Intersection — Definition

A ∩ B = {x : x ∈ A and x ∈ B}

If A = {1, 2, 3, 4} and B = {3, 4, 5, 6}, then A ∩ B = {3, 4}

A∩B

A ∩ B — Only the overlapping region

Disjoint Sets

Two sets A and B are called disjoint if they have no elements in common, i.e., A ∩ B = ∅.

Example: A = {1, 3, 5} and B = {2, 4, 6} are disjoint since they share no elements.

Properties of Union and Intersection

Commutative

A ∪ B = B ∪ A
A ∩ B = B ∩ A

Associative

(A ∪ B) ∪ C = A ∪ (B ∪ C)
(A ∩ B) ∩ C = A ∩ (B ∩ C)

Distributive

A ∪ (B ∩ C) = (A ∪ B) ∩ (A ∪ C)
A ∩ (B ∪ C) = (A ∩ B) ∪ (A ∩ C)

Identity Laws

A ∪ ∅ = A
A ∩ U = A

Idempotent

A ∪ A = A
A ∩ A = A

Domination Laws

A ∩ ∅ = ∅
A ∪ U = U

Counting Formula

Inclusion–Exclusion Principle (for Two Sets)

n(A ∪ B) = n(A) + n(B) − n(A ∩ B)

We subtract the intersection to avoid counting shared elements twice

If n(A) = 12, n(B) = 8, n(A ∩ B) = 5, then n(A ∪ B) = 12 + 8 − 5 = 15

Why do we subtract n(A ∩ B)? Because elements in the overlap are counted once in n(A) and once again in n(B) — so they get counted twice if we simply add. Subtracting corrects this double-counting.

Section 6

➖ Difference of Sets

Sometimes we want to know what's in one set but not in another. This is where the difference operation comes in.

Set Difference (A − B)

The difference of sets A and B, written A − B (or A \ B), is the set of elements that are in A but not in B.

Difference — Definition

A − B = {x : x ∈ A and x ∉ B}

If A = {a, b, c, d, e} and B = {b, d, f, g}, then A − B = {a, c, e}

A − B — The part of A that does NOT overlap with B

A − B ≠ B − A in general! Using the same example: B − A = {f, g}. The difference operation is not commutative. Always pay attention to the order.

Worked Example

Let A = {1, 2, 3, 4, 5} and B = {4, 5, 6, 7, 8}.

A − B = {1, 2, 3} — elements in A but not in B
B − A = {6, 7, 8} — elements in B but not in A
Notice: A − B and B − A are completely different sets!

Symmetric Difference

The symmetric difference of A and B, written A △ B, contains elements that are in either A or B, but not in both.

Symmetric Difference — Definition

A △ B = (A − B) ∪ (B − A)

Equivalently: A △ B = (A ∪ B) − (A ∩ B)

With A = {1,2,3,4,5} and B = {4,5,6,7,8}: A △ B = {1,2,3} ∪ {6,7,8} = {1,2,3,6,7,8}

The symmetric difference is like an "exclusive or" (XOR) for sets. An element is included if it appears in exactly one of the two sets, but not if it appears in both. Programmers will recognise this as the XOR logic gate!

Section 7

🔄 Complement of a Set

Every discussion of complements requires a universal set — the "universe" of all objects under consideration, denoted U.

Definition

The complement of set A (with respect to U), written A' or A^c or Ā, is the set of all elements in U that are not in A.

Complement — Definition

A' = U − A = {x : x ∈ U and x ∉ A}

If U = {1,2,3,4,5,6,7,8,9,10} and A = {2,4,6,8,10}, then A' = {1,3,5,7,9}

Properties of Complements

Complement Laws

A ∪ A' = U
A ∩ A' = ∅

Double Complement

(A')' = A

Empty & Universal

∅' = U
U' = ∅

De Morgan's Laws

These are among the most important and elegant results in set theory. They tell us how complements interact with union and intersection.

✨ De Morgan's Laws

1 (A ∪ B)' = A' ∩ B'

2 (A ∩ B)' = A' ∪ B'

In words: the complement of a union is the intersection of complements, and vice versa.

Verifying De Morgan's First Law with an Example

Let U = {1, 2, 3, 4, 5, 6, 7, 8, 9}, A = {1, 3, 5, 7}, B = {2, 3, 4, 5}.

Left Side: (A ∪ B)'

A ∪ B = {1, 2, 3, 4, 5, 7}

(A ∪ B)' = U − {1,2,3,4,5,7} = {6, 8, 9}

Right Side: A' ∩ B'

A' = {2, 4, 6, 8, 9}

B' = {1, 6, 7, 8, 9}

A' ∩ B' = {6, 8, 9}

✅ (A ∪ B)' = A' ∩ B' = {6, 8, 9} — De Morgan's Law verified!

How to remember De Morgan's Laws: "When you take the complement, the operation flips." Union (∪) becomes intersection (∩), and intersection becomes union. It's like looking in a mirror — everything gets reversed!

Section 8

🧩 Practice Problems — Set 1

Test your understanding with these problems. Try to solve each one before revealing the answer!

QUESTION 1

Write in set-builder form: {3, 6, 9, 12, 15}

Answer: {x : x = 3n, n ∈ ℕ, 1 ≤ n ≤ 5}
Each element is a positive multiple of 3, starting from 3×1 = 3 up to 3×5 = 15.

QUESTION 2

List all elements of the set: {x : x is a prime number less than 20}

Answer: {2, 3, 5, 7, 11, 13, 17, 19}
Remember: 1 is NOT a prime number. A prime must have exactly two distinct divisors: 1 and itself.

QUESTION 3

Is {1, 2, 3} = {3, 2, 1}? Justify your answer.

Answer: Yes, {1, 2, 3} = {3, 2, 1}.
Order does not matter in a set. Both sets contain exactly the same elements: 1, 2, and 3. Hence they are equal.

QUESTION 4

List all subsets of {a, b}.

Answer: The subsets are: ∅, {a}, {b}, {a, b}
Total = 2² = 4 subsets. The empty set and the set itself are always included.

QUESTION 5

If A = {1, 2, 3, 4} and B = {3, 4, 5, 6}, find A ∪ B.

Answer: A ∪ B = {1, 2, 3, 4, 5, 6}
The union combines all elements from both sets (without repetition). Elements 3 and 4 appear in both but are listed only once.

QUESTION 6

If A = {1, 2, 3, 4} and B = {3, 4, 5, 6}, find A ∩ B.

Answer: A ∩ B = {3, 4}
The intersection contains only the elements common to both A and B. Only 3 and 4 appear in both sets.

QUESTION 7

Find A − B where A = {a, b, c, d} and B = {b, d, f}.

Answer: A − B = {a, c}
We remove from A all elements that also appear in B. Since b and d are in B, they are removed, leaving {a, c}.

QUESTION 8

How many subsets does a set with 5 elements have?

Answer: 2⁵ = 32 subsets.
For each element, there are 2 choices: include it or exclude it. With 5 elements, this gives 2 × 2 × 2 × 2 × 2 = 32 possible subsets.

QUESTION 9

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

Answer: A' = {2, 4, 6, 8, 10}
The complement consists of all elements in U that are not in A. A contains the odd numbers from 1–10, so A' contains the even numbers.

QUESTION 10

Verify the formula n(A ∪ B) = n(A) + n(B) − n(A ∩ B) for A = {1, 2, 3, 4} and B = {3, 4, 5, 6}.

Answer:
A ∪ B = {1, 2, 3, 4, 5, 6}, so n(A ∪ B) = 6
n(A) = 4, n(B) = 4, A ∩ B = {3, 4}, so n(A ∩ B) = 2
RHS = 4 + 4 − 2 = 6 = LHS ✓ — Formula verified!

Section 9

🧩 Practice Problems — Set 2 (Advanced)

These problems are more challenging. Take your time and think through each step carefully.

QUESTION 1

If A has 6 elements and B has 8 elements, and A ∩ B has 3 elements, find n(A ∪ B).

Answer: n(A ∪ B) = n(A) + n(B) − n(A ∩ B) = 6 + 8 − 3 = 11

QUESTION 2

How many elements does the power set of {1, 2, 3} have? List all of them.

Answer: |P({1,2,3})| = 2³ = 8 elements.
P({1,2,3}) = { ∅, {1}, {2}, {3}, {1,2}, {1,3}, {2,3}, {1,2,3} }

QUESTION 3

Show that if A ⊂ B, then A ∩ B = A.

Proof: We need to show A ∩ B = A, i.e., both sets contain the same elements.

Part 1 (A ∩ B ⊆ A): If x ∈ A ∩ B, then x ∈ A and x ∈ B. In particular, x ∈ A. So A ∩ B ⊆ A. ✓

Part 2 (A ⊆ A ∩ B): If x ∈ A, then since A ⊂ B, we know x ∈ B as well. So x ∈ A and x ∈ B, meaning x ∈ A ∩ B. So A ⊆ A ∩ B. ✓

Since A ∩ B ⊆ A and A ⊆ A ∩ B, we conclude A ∩ B = A. □

QUESTION 4

Let U = {1,2,3,4,5,6,7,8,9}, A = {2,4,6,8}, B = {2,3,5,7}. Verify De Morgan's Law: (A ∪ B)' = A' ∩ B'.

Verification:
A ∪ B = {2, 3, 4, 5, 6, 7, 8}
(A ∪ B)' = U − {2,3,4,5,6,7,8} = {1, 9}

A' = U − {2,4,6,8} = {1, 3, 5, 7, 9}
B' = U − {2,3,5,7} = {1, 4, 6, 8, 9}
A' ∩ B' = {1, 9}

(A ∪ B)' = A' ∩ B' = {1, 9} ✓ — De Morgan's Law verified!

QUESTION 5

Is the empty set a subset of {∅}? Explain.

Answer: Yes! The empty set ∅ is a subset of every set — including {∅}.

Reason: The statement "every element of ∅ is in {∅}" is vacuously true because ∅ has no elements at all. There is no element in ∅ that could fail to be in {∅}, so the subset condition is satisfied.

QUESTION 6

Find sets A, B, C such that A ∩ B, B ∩ C, and A ∩ C are all non-empty, but A ∩ B ∩ C = ∅.

Answer: One possibility: A = {1, 2}, B = {2, 3}, C = {1, 3}.

A ∩ B = {2} ≠ ∅ ✓
B ∩ C = {3} ≠ ∅ ✓
A ∩ C = {1} ≠ ∅ ✓
A ∩ B ∩ C = ∅ ✓ (no element is in all three sets)

QUESTION 7

Write the interval (−3, 5] in set-builder notation.

Answer: {x ∈ ℝ : −3 < x ≤ 5}
The round bracket at −3 means −3 is excluded (strict inequality), and the square bracket at 5 means 5 is included (≤).

QUESTION 8

If n(A) = 10, n(B) = 15, n(A ∪ B) = 20, find n(A ∩ B).

Answer: Using n(A ∪ B) = n(A) + n(B) − n(A ∩ B):
20 = 10 + 15 − n(A ∩ B)
n(A ∩ B) = 25 − 20 = 5

QUESTION 9

How many proper subsets does {a, b, c, d} have?

Answer: Total subsets = 2⁴ = 16. A proper subset excludes the set itself.
Proper subsets = 16 − 1 = 15

QUESTION 10

Verify the distributive law A ∪ (B ∩ C) = (A ∪ B) ∩ (A ∪ C) using A = {1, 2}, B = {2, 3}, C = {1, 3}.

Verification:
LHS: B ∩ C = {3}. So A ∪ (B ∩ C) = {1, 2} ∪ {3} = {1, 2, 3}

RHS: A ∪ B = {1, 2, 3}. A ∪ C = {1, 2, 3}. So (A ∪ B) ∩ (A ∪ C) = {1,2,3} ∩ {1,2,3} = {1, 2, 3}

LHS = RHS = {1, 2, 3} ✓ — Distributive law verified!

Section 10

🎯 Quick Quiz — 10 MCQs

Select the correct option for each question. Your score will be calculated at the end!

QUESTION 1 OF 10

Which of the following is NOT a well-defined set?

AThe collection of vowels in the English alphabet

BThe collection of even numbers less than 100

CThe collection of good books in a library

DThe collection of multiples of 5

QUESTION 2 OF 10

In roster form, {x : x² = 4, x ∈ ℤ} equals:

A{2}

B{−2}

C{−2, 2}

D{4}

QUESTION 3 OF 10

The number of subsets of a set with 4 elements is:

C16

D32

QUESTION 4 OF 10

If A ∩ B = B, then which of the following is true?

AA ⊂ B

BB ⊆ A

CA = B always

DA ∪ B = B

QUESTION 5 OF 10

(A ∪ B)' is equal to:

AA' ∪ B'

BA' ∩ B'

CA ∩ B

DA − B

QUESTION 6 OF 10

The empty set ∅ is a subset of:

AOnly the empty set itself

BEvery set

CNo set

DOnly the universal set

QUESTION 7 OF 10

If n(A) = 5, n(B) = 7, and n(A ∩ B) = 3, then n(A ∪ B) = ?

B12

C15

QUESTION 8 OF 10

The interval [2, 5) contains:

A2 but not 5

B5 but not 2

CBoth 2 and 5

DNeither 2 nor 5

QUESTION 9 OF 10

A − A = ?

C∅

DA'

QUESTION 10 OF 10

U' (complement of the universal set) = ?

C∅

DA'

🏆 Your Quiz Result

Section 11

📋 Chapter Summary

🔑 Key Concepts at a Glance

1. Sets — The Basics

A set is a well-defined collection of distinct objects, called elements.
a ∈ A means a belongs to A; a ∉ A means it does not.
Standard number sets: ℕ (naturals), ℤ (integers), ℚ (rationals), ℝ (reals).

2. Representing Sets

Roster form: list elements inside { }. Example: {1, 2, 3, 4, 5}.
Set-builder form: describe a property. Example: {x ∈ ℕ : x ≤ 5}.
Order and repetition do not matter in sets.

3. Types of Sets

Empty set (∅): no elements. Singleton: exactly one element.
Finite vs. Infinite sets. Cardinality n(A) = number of elements.
Equal sets: same elements. Equivalent sets: same cardinality.
Power set P(A): set of all subsets. |P(A)| = 2ⁿ.

4. Subsets & Intervals

A ⊆ B: every element of A is in B. A ⊂ B: proper subset (A ≠ B).
∅ is a subset of every set. Every set is a subset of itself.
Intervals on ℝ: (a,b) open, [a,b] closed, [a,b) and (a,b] half-open.

5. Set Operations

Union: A ∪ B = {x : x ∈ A or x ∈ B}
Intersection: A ∩ B = {x : x ∈ A and x ∈ B}
Difference: A − B = {x : x ∈ A and x ∉ B}
Symmetric Difference: A △ B = (A − B) ∪ (B − A)
Complement: A' = U − A

6. Key Formulas & Laws

Inclusion–Exclusion: n(A ∪ B) = n(A) + n(B) − n(A ∩ B)
De Morgan's Laws: (A ∪ B)' = A' ∩ B' and (A ∩ B)' = A' ∪ B'
Complement Laws: A ∪ A' = U, A ∩ A' = ∅, (A')' = A
Identity: A ∪ ∅ = A, A ∩ U = A
Domination: A ∩ ∅ = ∅, A ∪ U = U
Idempotent: A ∪ A = A, A ∩ A = A

🎓 You've Completed Chapter 1: Sets!

Sets are the building blocks of mathematics — every structure you encounter in higher mathematics rests on this foundation. From functions and relations to probability and calculus, the language of sets will be your constant companion. Keep practising, and these concepts will become second nature!