# Complement of a Set — Definition, Symbol, Examples

TL;DR

The complement of a set AAA, written A′ (or Ac, or A‾), is the set of all elements in the universal set U that are not in AAA. This article covers the definition, the symbol, three worked examples, the properties, and the common slips students make when working with complements.

## 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 AAA. The **complement of a set** AAA is everything _outside_ the circle but still inside the rectangle.

The complement is always relative to a chosen universal set. _"Everything not in AAA"_ 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 AAA contained in a universal set U:

A′ = {x ∈ U : x ∉ A}.

Three common notations are used for "complement of AAA":

| Notation | Used in | Reads as |
| --- | --- | --- |
| A′ | Most school textbooks (CBSE, NCERT, ICSE) | "AAA prime" or "AAA complement" |
| Ac | Probability theory; many US textbooks | "AAA complement" |
| A‾ | Logic and computer science; some IB textbooks | "AAA 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′ = ∅ | The universal set's complement is empty |
| **Complement of empty** | ∅′ = U | The empty set's complement is the entire universe |
| **Union with complement** | A∪A′ = U | A set and its complement together fill the universe |
| **Intersection with complement** | A∩A′ = ∅ | A set and its complement share no elements |
| **De Morgan — for union** | (A∪B)′ = A′∩B′ | The complement of a union is the intersection of complements |
| **De Morgan — for intersection** | (A∩B)′ = A′∪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}.

### **Standard.** Given U = {x ∈ N : x ≤ 20}, A = {x ∈ U : x is even}, B = {x ∈ U : x > 12}, find (A∪B)′.

**The wrong path.** A student finds A∪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∪B = {2, 4, 6, 8, 10, 12, 13, 14, 15, 16, 17, 18, 19, 20}.
Then (A∪B)′ = U − (A∪B) = {1, 3, 5, 7, 9, 11}.

**Final answer:** (A∪B)′ = {1, 3, 5, 7, 9, 11}.

### **Stretch.** Show that for any sets A and B: A−B = A∩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 ∈ A−B. By definition, x ∈ A and x ∉ B. The second condition is exactly x ∈ B′. So x ∈ A and x ∈ B′, which means x ∈ A∩B′.

- Conversely, suppose x ∈ A∩B′. Then x ∈ A and x ∈ B′, i.e., x ∈ A and x ∉ B. That's the definition of x ∈ A−B.

Both inclusions hold, so the sets are equal: A−B = A∩B′.

**Final answer:** A−B = A∩B′.

## 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.

- **Database queries.** SQL's `NOT IN` clause is set complement.

- **Logic and proof.** Negation in propositional logic and complement in set theory are the same operation viewed from two angles. De Morgan's laws apply equally in both.

- **Computer science.** The bitwise NOT operator (`~` in C, Python, JavaScript) is set complement on the bits of an integer.

- **Statistics.** "Reject the null hypothesis" means the data falls in the _complement_ of the null-acceptance region.

## The Mathematician Behind De Morgan's Laws

The two De Morgan's laws — (A∪B)′ = A′∩B′ and (A∩B)′ = A′∪B′ — are named after Augustus De Morgan, an English mathematician and logician who formalised them in his 1847 book _Formal Logic_.

## The Mistakes Students Make Most Often on Complements

### **Mistake 1: Forgetting to declare the universe.**

The complement is always relative to a universal set. 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.**

A′ contains only elements that are in U _and_ not in A.

### **Mistake 3: Misapplying De Morgan.**

Apply the complement to the parts without changing the connective.

## 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′, Ac, A are equivalent.

- Key properties: (A′)′ = A, A∪A′ = U, A∩A′ = ∅.

- De Morgan's laws — (A∪B)′ = A′∩B′ and (A∩B)′ = A′∪B′ — flip union and intersection under complementation.