Homepage Solution manuals Terence Tao Analysis I Exercise 2.3.3 (Multiplication is associative)

Exercise 2.3.3 (Multiplication is associative)

Prove Proposition 2.3.5. (Hint: modify the proof of Proposition 2.2.5 and use the distributive law.)

Proposition 2.3.5 (Multiplication is associative) For any natural numbers a,b,c, we have (a × b) × c = a × (b × c).

Answers

We keep b,c fixed and induct on a. For the base case, we have to show (0 × b) × c = 0 × (b × c). The left hand side is 0 × c = 0 and the right hand side is 0 so the two sides are equal.

Now suppose inductively that (a × b) × c = a × (b × c). We want to show that ((a++) × b) × c = (a++) × (b × c). Starting from the left hand side, ((a++) × b) × c equals (a × b + b) × c by the definition of multiplication, which equals (a × b) × c + b × c by the distributive law, which equals a × (b × c) + b × c by the inductive hypothesis, which equals (a++) × (b × c) by the definition of multiplication. Thus, the two sides are equal, which closes the induction.

Source: Issa Rice’s blog.

User profile picture
2020-04-04 00:00
Comments

Proof. We induct on c (keeping a,b fixed). We first verify the base case c = 0 :

(a × b) × 0 = a × (b × 0).

By commutativity law and definition of multiplication, we have:

0 = a × 0.

By commutativity law and definition of multiplication, again:

0 = 0.

Thus, we’ve proven the base case. Now suppose inductively that (a × b) × c = a × (b × c) is true for some natural number c. We now prove P(c + +), which is:

(a × b) × (c + +) = a × (b × (c + +)).

We now keep changing the left hand side until we get the right-hand side. By commutativity law for multiplication,

(a × b) × (c + +) = (c + +) × (a × b).

By definition of multiplication:

(c + +) × (a × b) = cab + ab.

By distributive law,

cab + ab = a(cb + b).

By distributive law, again:

a(cb + b) = a(b(c + 1)).

Since c + 1 = c + + (see page 26), we have

a(b(c + 1)) = a(b(c + +)).

User profile picture
2022-07-17 09:14
Comments