Jump to content

Science:Math Exam Resources/Courses/MATH220/December 2011/Question 04/Solution 1

From UBC Wiki

We want to show that

f(C∩D)⊆f(C)∩f(D)

and that

f(C)∩f(D)⊆f(C∩D)

Let us start with the first.

Suppose that y∈f(C∩D); that is, there is some x∈C∩D such that f(x)=y. Since x∈C and x∈D, it follows that y∈f(C) and that y∈f(D), i.e. that y∈f(C)∩f(D) as desired.

Note: This proof in no way uses injectivity; this is a general statement about all functions.

Now we prove the second statement. Suppose that y∈f(C)∩f(D). That is, y∈f(C) and y∈f(D). Equivalently, there is some x1∈C such that f(x1)=y, and some x2∈D such that f(x2)=y. We claim that x1=x2, and hence x1=x2∈C∩D. But this follows immediately from the injectivity of f. It follows now, since f(x1)=y and x1∈C∩D that y∈f(C∩D) as claimed.