An Initiative by SAARTHI IAS
Maarg Manthan · Topic 23.8

De Morgan’s Laws Applied to Set Operations

Quantitative Aptitude › Set Theory, Functions and Graphs · Topic 23.8

De Morgan's laws connect union, intersection and complement. The complement of a union equals the intersection of the complements, (A ∪ B)′ = A′ ∩ B′, and the complement of an intersection equals the union of the complements, (A ∩ B)′ = A′ ∪ B′.

Share:
De Morgan’s Laws Applied to Set Operations - Quantitative Aptitude - MaargX UPSC Maarg Manthan

Quick Answer

De Morgan’s laws connect union, intersection and complement. The complement of a union equals the intersection of the complements, (A ∪ B)′ = A′ ∩ B′, and the complement of an intersection equals the union of the complements, (A ∩ B)′ = A′ ∪ B′.

At a Glance

  • First law (A ∪ B)′ = A′ ∩ B′
  • Second law (A ∩ B)′ = A′ ∪ B′
  • Rule of thumb Flip the sign and complement each set
  • Three sets (A ∪ B ∪ C)′ = A′ ∩ B′ ∩ C′
  • Use Counting ‘neither’ and simplifying

Where Does It Fit?

This topic uses the operations in Set Theory – Union, Intersection, Complement and Venn Diagram Problems and the counting in Set Theory Problems Involving Three Overlapping Sets. It also mirrors the complementary-event rule in Probability Using the Complementary Event Rule.

What Are De Morgan’s Laws?

In short: to complement a union or an intersection, complement each set and change the union to an intersection, or the intersection to a union.

Law Statement In words
First law (A ∪ B)′ = A′ ∩ B′ Not in A or B means not in A and not in B
Second law (A ∩ B)′ = A′ ∪ B′ Not in both means not in A or not in B
Three sets (A ∪ B ∪ C)′ = A′ ∩ B′ ∩ C′ Outside all three circles

Both laws can be seen on a Venn diagram by shading the two sides and checking that they match.

How Do You Use the Laws to Count?

In short: the number outside both sets is the size of A′ ∩ B′, and the number not in both is the size of A′ ∪ B′.

Counting forms

  • n(A′ ∩ B′) = n(U) – n(A ∪ B).
  • n(A′ ∪ B′) = n(U) – n(A ∩ B).
  • n(A′) = n(U) – n(A).
  • n(A′ ∪ B′) = n(A′) + n(B′) – n(A′ ∩ B′).

These are the same results used in Set Theory – Union, Intersection, Complement and Venn Diagram Problems, written in complement language.

How Do You Simplify Set Expressions?

In short: apply the laws to remove the outer complement, then use the basic facts about sets.

  • Double complement: (A′)′ = A.
  • Contradiction: A ∩ A′ is the empty set.
  • Complement of the universal set: U′ is empty, and the complement of the empty set is U.
  • Example: (A′ ∪ B′)′ = A ∩ B.

Solved Examples

Example 1

Question: U = {1, 2, …, 10}, A = {1, 2, 3, 4}, B = {3, 4, 5, 6}. Verify (A ∪ B)′ = A′ ∩ B′.

  1. A ∪ B = {1, 2, 3, 4, 5, 6}, so (A ∪ B)′ = {7, 8, 9, 10}.
  2. A′ = {5, 6, 7, 8, 9, 10} and B′ = {1, 2, 7, 8, 9, 10}.
  3. A′ ∩ B′ = {7, 8, 9, 10}.

Answer: Both sides equal {7, 8, 9, 10}, so the law holds.

Example 2

Question: For the same sets, verify (A ∩ B)′ = A′ ∪ B′.

  1. A ∩ B = {3, 4}, so (A ∩ B)′ = {1, 2, 5, 6, 7, 8, 9, 10}.
  2. A′ ∪ B′ = {5, 6, 7, 8, 9, 10} ∪ {1, 2, 7, 8, 9, 10} = {1, 2, 5, 6, 7, 8, 9, 10}.

Answer: Both sides are equal, so the second law holds.

Example 3

Question: n(U) = 100, n(A′) = 40, n(B′) = 55 and n(A′ ∩ B′) = 25. Find n(A ∪ B) and n(A ∩ B).

  1. n(A ∪ B) = n(U) – n(A′ ∩ B′) = 100 – 25 = 75.
  2. n(A′ ∪ B′) = 40 + 55 – 25 = 70.
  3. n(A ∩ B) = 100 – 70 = 30.

Answer: n(A ∪ B) = 75 and n(A ∩ B) = 30.

Example 4

Question: Simplify (A ∪ B)′ ∩ A.

  1. (A ∪ B)′ = A′ ∩ B′.
  2. A′ ∩ B′ ∩ A contains the factor A ∩ A′, which is empty.

Answer: The result is the empty set.

Example 5

Question: Simplify (A′ ∪ B′)′.

  1. Apply the second law in reverse: (A′ ∪ B′)′ = (A′)′ ∩ (B′)′.
  2. Double complements cancel.

Answer: The result is A ∩ B.

Shortcuts and Tricks

  • Break the bar, change the sign: union becomes intersection, and the reverse.
  • For counting, use n(U) minus the union to get ‘neither’.
  • Verify a law with a small numeric example if in doubt.
  • Remember that a set and its complement are disjoint and together make U.
  • Apply the law to three sets by repeating it.

Common Mistakes

  • Keeping the same sign: (A ∪ B)′ is not A′ ∪ B′.
  • Forgetting to complement each set inside the bracket.
  • Confusing n(A′ ∩ B′), meaning neither, with n(A ∩ B).
  • Using the wrong universal set.
  • Forgetting that (A′)′ = A.

Practice Questions

  1. If n(U) = 120 and n(A ∪ B) = 85, find n(A′ ∩ B′).
  2. Simplify (A ∩ B)′ ∪ A.
  3. If n(U) = 50, n(A) = 30 and n(B) = 25 with n(A ∩ B) = 10, find n(A′ ∩ B′).
  4. Write (A ∪ B ∪ C)′ in complements.
  5. Find n(A′ ∪ B′) if n(U) = 80 and n(A ∩ B) = 20.
  6. Simplify ((A′)′)′.

Answers: 1) 35; 2) U; 3) 5; 4) A′ ∩ B′ ∩ C′; 5) 60; 6) A′.

Why Is This Topic Important?

  • Simplification The laws shorten set expressions.
  • Exam use Counting questions use ‘neither’ often.
  • Link They parallel Probability Using the Complementary Event Rule.

What Comes Next?

The next topic is Functional Equations and Their Solutions (CAT-Level), which solves functional equations.

Key Terms and Formulas

  • Complement Everything in the universal set outside the given set
  • De Morgan’s laws Rules for complementing unions and intersections
  • Empty set The set with no elements
  • Double complement The complement of the complement, equal to the set
  • Even, Odd and Periodic Functions (CAT-Level)
  • Functional Equations and Their Solutions (CAT-Level)
  • Set Theory – Union, Intersection, Complement and Venn Diagram Problems
  • Set Theory Problems Involving Three Overlapping Sets

Exam Corner

Points to Remember

  • (A∪B)′ = A′∩B′; (A∩B)′ = A′∪B′.
  • Neither = n(U) – n(A∪B).
  • A ∩ A′ is empty; A ∪ A′ = U.
  • (A′)′ = A.

Do Not Confuse With

  • (A∪B)′ vs A′∪B′ The first equals A′∩B′; the second equals (A∩B)′.
  • Complement vs difference The complement uses the universal set.
  • Neither vs both Neither is outside both circles; both is the overlap.

Memory Hook

Break the bar, change the sign.

GS Relevance

De Morgan's laws for SSC CGL and CAT quantitative aptitude: statements, verification with sets and counting problems with complements.

Frequently Asked Questions

What are De Morgan's laws for sets?

De Morgan's laws say that the complement of a union is the intersection of the complements, and the complement of an intersection is the union of the complements. In symbols, A union B complement equals A complement intersection B complement, and the second law swaps the signs.

How do you remember De Morgan's laws?

Remember the phrase break the bar, change the sign. When you break the complement bar over a union or an intersection, you complement each set and switch union to intersection or intersection to union, so the sign flips in each case.

How are De Morgan's laws used in counting?

They show that the number in neither set is the size of A complement intersection B complement, which equals the universal set size minus the size of the union. This is the standard step for finding people outside both circles in a Venn survey problem.

What is the complement of the complement of A?

The complement of the complement of A is A itself. Taking the complement twice returns to the original set, so the double complement cancels, which is used when De Morgan's laws are applied in reverse to remove a bar from a set expression.

What is A intersection A complement?

The intersection of a set and its complement is the empty set, because no element can belong to A and also be outside A. The union of A and its complement is the universal set, since every element is either in A or not in A.

PYQ Practice — Statement Analysis

1 (A ∪ B)′ = A′ ∩ B′.
True

This is the first of De Morgan's laws.

2 (A ∩ B)′ = A′ ∩ B′.
False

The correct result is A′ ∪ B′.

3 A ∩ A′ is the empty set.
True

No element can be in A and outside A.

4 If n(U) = 120 and n(A ∪ B) = 85, then n(A′ ∩ B′) = 35.
True

120 - 85 = 35.

Share: