We test each power-set identity. Recall X∈P(S)⟺X⊆S.
Option 1 & 2 — the intersection identity. The equality P(A)∩P(B)=P(A∩B) is a standard theorem:
X∈P(A)∩P(B)⟺X⊆A and X⊆B⟺X⊆A∩B⟺X∈P(A∩B).
So option 2 (the equality) is always true, and option 1 (the ⊆ half) is therefore also always true.
Option 4 — the union inclusion. If X∈P(A)∪P(B), then X⊆A or X⊆B; either way X⊆A∪B, so X∈P(A∪B). Thus P(A)∪P(B)⊆P(A∪B) is always true. (The reverse fails — e.g. A={1},B={2} gives {1,2}∈P(A∪B) but {1,2}∈/P(A)∪P(B) — but the printed direction holds.)
Option 3 — the difference inclusion. Claim: P(A)−P(B)⊆P(A−B). Take X∈P(A)−P(B), i.e. X⊆A but X⊆B. We would need X⊆A−B. This fails.
Counterexample: let A={1,2} and B={2}.
- X={1,2}=A satisfies X⊆A and X⊆B, so X∈P(A)−P(B).
- But A−B={1}, and {1,2}⊆{1}, so X∈/P(A−B).
Hence the inclusion of option 3 can be violated. The correct answer is option 3.
Pitfall: P commutes with ∩ but not with − or ∪. The reason A−B misbehaves is that subtracting from A only removes elements, while a subset X of A may still keep elements of B — so X⊆A and X⊆B does not force X to avoid B entirely.