De Vera, Katrina M.

CS 30 – WFW

EXERCISE:

2. Let 3ℤ = {n ∈ ℤ | n = 3k, for some integer k}. Prove that ℤ and 3ℤ are equivalent.

Proof:

Let : ℤ → 3ℤ be a function defined as f(k) = 3k. We must show that  is a bijection.

( is one-to-one) Suppose that k1, k2 ∈ ℤ and that  (k1) =  (k2). We must show that k1 = k2.

By definition of , 3k1 = 3k2. Multiplying both sides by 1/3, we get k1 = k2.

Hence,  is one-to-one.

( is onto) Suppose that n ∈ 3ℤ and n ∈ ℤ and n = 3k . We must show that there exists k ∈ ℤ such that

 (k) = n.

n
Since n = 3k, by algebra: k = .
3
By definition of divisibility, k is an integer because 3 and n is an integer and 3|n iff n = 3k for some
interger k. By definition, n = 3k, therefore k ∈ ℤ.
By substitution:

 (k) = 3k

n n
 ( ) = 3( )
3 3
n
( )=n
3
 (k) = n

Hence,  is onto.

Since  is both one-to-one and onto, then  is bijective. Therefore, ℤ and 3ℤ have the same cardinality.
Hence ℤ and 3ℤ are equivalent.

Q.E.D