Proofs Involving The Addition of Natural Numbers - Proof of Associativity

Proof of Associativity

We prove associativity by first fixing natural numbers a and b and applying induction on the natural number c.

For the base case c = 0,

Each equation follows by definition ; the first with a + b, the second with b.

Now, for the induction. We assume the induction hypothesis, namely we assume that for some natural number c,

Then it follows,

(a + b) + S(c)
= S((a + b) + c)
= S(a + (b + c))
= a + S(b + c)
= a + (b + S(c))

In other words, the induction hypothesis holds for S(c). Therefore, the induction on c is complete.

Read more about this topic:  Proofs Involving The Addition Of Natural Numbers

Famous quotes containing the words proof of and/or proof:

    “There are some persons in this world, who, unable to give better proof of being wise, take a strange delight in showing what they think they have sagaciously read in mankind by uncharitable suspicions of them.”
    —Herman Melville (1819–1891)

    “If we view our children as stupid, naughty, disturbed, or guilty of their misdeeds, they will learn to behold themselves as foolish, faulty, or shameful specimens of humanity. They will regard us as judges from whom they wish to hide, and they will interpret everything we say as further proof of their unworthiness. If we view them as innocent, or at least merely ignorant, they will gain understanding from their experiences, and they will continue to regard us as wise partners.”
    —Polly Berrien Berends (20th century)