Everything in the Universe — Except That
Picture the universal set $U$ as a rectangle containing every relevant element. Now draw a circle inside it for some set $A$. The complement of a set $A$ is everything outside the circle but still inside the rectangle.
The complement is always relative to a chosen universal set. "Everything not in $A$" makes no sense without first agreeing on the universe of possibilities. In a Class 11 problem set, the universe is usually declared in the problem statement.
The Symbol and Formal Definition
For a set $A$ contained in a universal set $U$:
$$A' = {x \in U : x \notin A}.$$
Three common notations are used for "complement of $A$":
Notation | Used in | Reads as |
|---|---|---|
$A'$ | Most school textbooks (CBSE, NCERT, ICSE) | "$A$ prime" or "$A$ complement" |
$A^c$ | Probability theory; many US textbooks | "$A$ complement" |
$\overline{A}$ | Logic and computer science; some IB textbooks | "$A$ bar" |
All three mean the same thing. The CBSE Grade 11 convention is $A'$, so that's what we'll use here.
Properties of the Complement
The complement satisfies a clean set of identities — six of which together with intersection and union give a complete algebra of sets.
Property | Statement | Reads as |
|---|---|---|
Double complement | $(A')' = A$ | The complement of the complement is the original set |
Complement of universe | $U' = \emptyset$ | The universal set's complement is empty |
Complement of empty | $\emptyset' = U$ | The empty set's complement is the entire universe |
Union with complement | $A \cup A' = U$ | A set and its complement together fill the universe |
Intersection with complement | $A \cap A' = \emptyset$ | A set and its complement share no elements |
De Morgan — for union | $(A \cup B)' = A' \cap B'$ | The complement of a union is the intersection of complements |
De Morgan — for intersection | $(A \cap B)' = A' \cup B'$ | The complement of an intersection is the union of complements |
The last two — De Morgan's laws — are the most-tested identities in the Class 11 sets chapter. They convert "not (this OR that)" into "(not this) AND (not that)" and vice versa, which is exactly the logic move used in proofs and in writing search queries.
Three Worked Examples — Quick, Standard, Stretch
Quick. Given $U = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}$ and $A = {2, 4, 6, 8, 10}$, find $A'$.
The complement contains every element of $U$ that is not in $A$ — i.e., the odd numbers from 1 to 10.
$$A' = {1, 3, 5, 7, 9}.$$
Final answer: $A' = {1, 3, 5, 7, 9}$.
Sanity check: $A \cup A' = {1, 2, 3, \dots, 10} = U$ ✓ and $A \cap A' = \emptyset$ ✓.
Standard (Reading the Wrong Cue — Complement Edition). Given $U = {x \in \mathbb{N} : x \leq 20}$, $A = {x \in U : x \text{ is even}}$, $B = {x \in U : x > 12}$. Find $(A \cup B)'$.
The wrong path. A student finds $A \cup B$ first, then takes the complement of the resulting set, then writes down a long list. The arithmetic is right but the work is long.
$A = {2, 4, 6, 8, 10, 12, 14, 16, 18, 20}$. $B = {13, 14, 15, 16, 17, 18, 19, 20}$. $A \cup B = {2, 4, 6, 8, 10, 12, 13, 14, 15, 16, 17, 18, 19, 20}$. Then $(A \cup B)' = U - (A \cup B) = {1, 3, 5, 7, 9, 11}$.
The rescue using De Morgan. By De Morgan, $(A \cup B)' = A' \cap B'$. Compute the complements first:
$A'$ = odd numbers from 1 to 20 = ${1, 3, 5, 7, 9, 11, 13, 15, 17, 19}$.
$B'$ = numbers from 1 to 20 that are not greater than 12, i.e., 1 to 12 = ${1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12}$.
Intersection $A' \cap B'$ = odd numbers from 1 to 12 = ${1, 3, 5, 7, 9, 11}$.
Final answer: $(A \cup B)' = {1, 3, 5, 7, 9, 11}$.
The lesson — when an expression involves the complement of a union or intersection, De Morgan can shorten the computation. The two routes give the same answer; the De Morgan route is faster on the exam.
Stretch. Show that for any sets $A$ and $B$: $A - B = A \cap B'$.
This is a useful identity — it rewrites set difference in terms of intersection and complement.
Proof by element-chasing. Take any element $x$.
Suppose $x \in A - B$. By definition, $x \in A$ and $x \notin B$. The second condition is exactly $x \in B'$. So $x \in A$ and $x \in B'$, which means $x \in A \cap B'$.
Conversely, suppose $x \in A \cap B'$. Then $x \in A$ and $x \in B'$, i.e., $x \in A$ and $x \notin B$. That's the definition of $x \in A - B$.
Both inclusions hold, so the sets are equal: $A - B = A \cap B'$.
Final answer: $A - B = A \cap B'$. The identity is the bridge between "set difference" notation and the intersection-and-complement notation used in formal proofs.
Why the Complement Matters
The complement is the set-theoretic mirror of logical negation — and that connection is what makes it useful far beyond sets themselves.
Probability. $P(A') = 1 - P(A)$ — the most-used identity in introductory probability. Instead of computing "at least one" directly (which gets messy), you compute "exactly zero" (which is one term) and subtract from 1.
Database queries. SQL's
NOT INclause is set complement. "Find users not in the cancelled-subscriptions list" is the complement of one set relative to the universe of users.Logic and proof. Negation in propositional logic ($\neg P$) and complement in set theory are the same operation viewed from two angles. De Morgan's laws apply equally in both — and that's why the same students who master set complements also tend to master truth tables quickly.
Computer science. The bitwise NOT operator (
~in C, Python, JavaScript) is set complement on the bits of an integer — flipping every 0 to 1 and vice versa.Statistics. "Reject the null hypothesis" means the data falls in the complement of the null-acceptance region — the rejection region is, literally, a complement.
The Mathematician Behind De Morgan's Laws
The two De Morgan's laws — $(A \cup B)' = A' \cap B'$ and $(A \cap B)' = A' \cup B'$ — are named after Augustus De Morgan (England, 1806–1871), an English mathematician and logician who formalised them in his 1847 book Formal Logic. The laws were known in some form to medieval logicians (William of Ockham used them in the 14th century) and to George Boole, but it was De Morgan who stated them in the algebraic form recognisable today.
De Morgan's broader project was to make logic mathematical — to write logical inference in symbolic form so it could be manipulated like algebra. That project's full success arrived a generation later with Gottlob Frege and Bertrand Russell, but De Morgan's laws were the entry point. Without them, set theory's most-used proof technique (push the complement inside, swap union and intersection) doesn't exist as a single line.
The reason it's worth knowing the name: De Morgan's laws appear in nearly every Class 11 Indian board paper on sets, and they appear under exactly that name. A student who can quote "by De Morgan's law" in a proof step earns the mark; one who derives the same identity from first principles takes longer and risks an error.
The Mistakes Students Make Most Often on Complements
Mistake 1: Forgetting to declare the universe.
Where it slips in: A student writes "Find $A'$" and computes the complement without first identifying $U$.
Don't do this: Treat the complement as a free-standing operation.
The correct way: The complement is always relative to a universal set. $A = {2, 4}$ has different complements depending on whether $U = {1, 2, 3, 4, 5}$ or $U = \mathbb{N}$ or $U = \mathbb{Z}$. Always declare $U$ — explicitly in your working, even if it's implied in the problem.
Mistake 2: Treating the complement as the rest of the union — losing the universe constraint.
Where it slips in: With $U = {1, 2, \dots, 10}$ and $A = {1, 2, 3}$, a student writes $A' = {4, 5, 6, \dots}$ — and continues past 10.
Don't do this: Let the complement spill outside the universal set.
The correct way: $A'$ contains only elements that are in $U$ and not in $A$. With $U$ capped at 10, $A' = {4, 5, 6, 7, 8, 9, 10}$ — seven elements, not infinitely many.
Mistake 3: Misapplying De Morgan.
Where it slips in: A student writes $(A \cup B)' = A' \cup B'$ — keeping the union when De Morgan flips it to intersection.
Don't do this: Apply the complement to the parts without changing the connective.
The correct way: Complement of a union becomes intersection of complements; complement of an intersection becomes union of complements. The connective flips. $(A \cup B)' = A' \cap B'$ and $(A \cap B)' = A' \cup B'$.
Conclusion
The complement $A'$ of a set $A$ contains all elements in the universal set $U$ that are not in $A$.
The complement is always defined relative to a chosen universe — declare $U$ before computing.
Notation varies: $A'$, $A^c$, $\overline{A}$ are equivalent.
Key properties: $(A')' = A$, $A \cup A' = U$, $A \cap A' = \emptyset$, $U' = \emptyset$, $\emptyset' = U$.
De Morgan's laws — $(A \cup B)' = A' \cap B'$ and $(A \cap B)' = A' \cup B'$ — are the most-used identities and flip union and intersection under complementation.
Practice These Three Before Moving On
Given $U = {1, 2, 3, \dots, 12}$ and $A = {x \in U : x \text{ is a multiple of } 3}$, find $A'$.
Use De Morgan's law to find $(A \cap B)'$ for $A = {1, 2, 3, 4}$, $B = {3, 4, 5, 6}$, $U = {1, 2, 3, \dots, 10}$.
Prove that $A \subseteq B$ if and only if $B' \subseteq A'$.
If Problem 3 looks intimidating, sketch a two-set Venn diagram and shade the relevant regions before writing the proof.
Was this article helpful?
Your feedback helps us write better content