Jump to content

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

From UBC Wiki

We want to show that

f(CD)f(C)f(D)

and that

f(C)f(D)f(CD)

Let us start with the first.

Suppose that yf(CD); that is, there is some xCD such that f(x)=y. Since xC and xD, it follows that yf(C) and that yf(D), i.e. that yf(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 yf(C)f(D). That is, yf(C) and yf(D). Equivalently, there is some x1C such that f(x1)=y, and some x2D such that f(x2)=y. We claim that x1=x2, and hence x1=x2CD. But this follows immediately from the injectivity of f. It follows now, since f(x1)=y and x1CD that yf(CD) as claimed.