Supplementary material for Chapter 3

This proves two results in Chapter 3.

Proof of Proposition 3.7 (1)

Proof of Proposition 3.9 (1)

Proof of Proposition 3.7 (1) We look at the parts of Proposition 3.7 not proved in the
book. We wish to prove that if f : X → Y is a map and for each i in some indexing set I we
are given a subset Ai of X and a subset Ci of Y , then




     
f Ai = f (Ai ), f Ai ⊆ f (Ai ), f −1 Ci = f −1 (Ci).
i∈I i∈I i∈I i∈I i∈I i∈I


 
Let y ∈ f Ai . Then y = f (x) for some x ∈ Ai , so x ∈ Ai0 for some i0 ∈ I . Then
i∈I  i∈I
y = f (x) ∈ f (Ai0 ) so y ∈ f (Ai ). This argument may be run backwards, so we get the first
i∈I
equality.


 
Now let y ∈ f Ai . Then y = f (x) for some x ∈ Ai . So x ∈ Ai for every i ∈ I , hence
i∈I i∈I
y ∈ f (Ai ) for every i ∈ I , and the second identity is proved.


 
Finally, x ∈ X is in f −1 Ci iff f (x) ∈ Ci iff f (x) ∈ Ci0 for some i0 ∈ I iff
i∈I  i∈I
x ∈ f −1 (Ci0 ) for some io ∈ I iff x ∈ f −1 (Ci ). So the third identity also holds.

i∈I

Proof of Proposition 3.9 (1) We recall the setting for Proposition 3.9: f : X → Y is a map,
A, B are subsets of X , and C, D are subsets of Y . We want to prove that f (A\B) ⊇ f (A)\f (B)
and f −1 (C \ D) = f −1 (C) \ f −1 (D).

Let y ∈ f (A) \ f (B). Then y = f (a) for some a ∈ A, but y = f (b) for any b ∈ B . Hence we
must have a ∈ A \ B , so y ∈ f (A \ B) as required.

Suppose that x ∈ f −1 (C \ D). Then f (x) ∈ C \ D . So f (x) ∈ C but f (x) ∈ D . Hence

x ∈ f −1 (C) but x ∈ f −1 (D), so x ∈ f −1 (C)\f −1 (D). This proves f −1 (C \D) ⊆ f −1 (C)\f −1 (D).

Suppose x ∈ f −1 (C) \ f −1 (D). Then x ∈ f −1 (C) but x ∈ f −1 (D). So f (x) ∈ C but f (x) ∈ D .
Hence f (x) ∈ C \ D , so x ∈ f −1 (C \ D). This proves f −1 (C) \ f −1 (D) ⊆ f −1 (C \ D).
These two together give f −1 (C) \ f −1 (D) = f −1 (C \ D) as required.