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:
“When children feel good about themselves, its like a snowball rolling downhill. They are continually able to recognize and integrate new proof of their value as they grow and mature.”
—Stephanie Martson (20th century)
“O, popular applause! what heart of man
Is proof against thy sweet, seducing charms?”
—William Cowper (17311800)