27.12.2013 Views

Book of Proof - Amazon S3

Book of Proof - Amazon S3

Book of Proof - Amazon S3

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

289<br />

7. A function f : Z × Z → Z is defined as f ((m, n)) = 2n − 4m. Verify whether this<br />

function is injective and whether it is surjective.<br />

This is not injective because (0,2) ≠ (−1,0), yet f ((0,2)) = f ((−1,0)) = 4. This is<br />

not surjective because f ((m, n)) = 2n − 4m = 2(n − 2m) is always even. If b ∈ Z<br />

is odd, then f ((m, n)) ≠ b, for all (m, n) ∈ Z × Z.<br />

9. Prove that the function f : R − {2} → R − {5} defined by f (x) = 5x+1<br />

x−2<br />

Pro<strong>of</strong>. First, let’s check that f is injective. Suppose f (x) = f (y). Then<br />

5x + 1<br />

= 5y + 1<br />

x − 2 y − 2<br />

(5x + 1)(y − 2) = (5y + 1)(x − 2)<br />

5xy − 10x + y − 2 = 5yx − 10y + x − 2<br />

−10x + y = −10y + x<br />

11y = 11x<br />

y = x.<br />

is bijective.<br />

Since f (x) = f (y) implies x = y, it follows that f is injective.<br />

Next, let’s check that f is surjective. For this, take an arbitrary element<br />

b ∈ R − {5}. We want to see if there is an x ∈ R − {2} for which f (x) = b, or 5x+1<br />

x−2 = b.<br />

Solving this for x, we get:<br />

5x + 1 = b(x − 2)<br />

5x + 1 = bx − 2b<br />

5x − xb = −2b − 1<br />

x(5 − b) = −2b − 1.<br />

Since we have assumed b ∈ R − {5}, the term (5 − b) is not zero, and we can<br />

divide with impunity to get x = −2b − 1 . This is an x for which f (x) = b, so f is<br />

5 − b<br />

surjective.<br />

Since f is both injective and surjective, it is bijective.<br />

■<br />

11. Consider the function θ : {0,1} × N → Z defined as θ(a, b) = (−1) a b. Is θ injective?<br />

Is it surjective? Explain.<br />

First we show that θ is injective. Suppose θ(a, b) = θ(c, d). Then (−1) a b = (−1) c d.<br />

Since b and d are both in N, they are both positive. Therefore since (−1) a b =<br />

(−1) c d it follows that (−1) a and (−1) b have the same sign. Since each <strong>of</strong> (−1) a<br />

and (−1) b equals ±1, we have (−1) a = (−1) b , so then (−1) a b = (−1) c d implies b = d.<br />

But also (−1) a = (−1) b means a and b have the same parity, and since a, b ∈ {0,1}<br />

if that follows a = b. Thus (a, b) = (c, d), so θ is injective.<br />

Next note that θ is not surjective because θ(a, b) = (−1) a b is either positive or<br />

negative, but never zero. Therefore there exist no element (a, b) ∈ {0,1} × N for<br />

which θ(a, b) = 0 ∈ Z.

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!