15.08.2013 Views

General Computer Science 320201 GenCS I & II Lecture ... - Kwarc

General Computer Science 320201 GenCS I & II Lecture ... - Kwarc

General Computer Science 320201 GenCS I & II Lecture ... - Kwarc

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

Theorem 36 is a very useful fact to know, it tells us something about the form of unary natural<br />

numbers, which lets us streamline induction proofs and bring them more into the form you may<br />

know from school: to show that some property P holds for every natural number, we analyze an<br />

arbitrary number n by its form in two cases, either it is zero (the base case), or it is a successor of<br />

another number (the step case). In the first case we prove the base condition and in the latter, we<br />

prove the step condition and use the induction axiom to conclude that all natural numbers have<br />

property P . We will show the form of this proof in the domino-induction below.<br />

The Domino Theorem<br />

Theorem 37 Let S0, S1, . . . be a linear sequence of dominos, such that for any unary natural<br />

number i we know that<br />

1. the distance between Si and S s(i) is smaller than the height of Si,<br />

2. Si is much higher than wide, so it is unstable, and<br />

3. Si and S s(i) have the same weight.<br />

If S0 is pushed towards S1 so that it falls, then all dominos will fall.<br />

The Domino Induction<br />

• • • • • •<br />

c○: Michael Kohlhase 36<br />

Proof: We prove the assertion by induction over i with the property P that “Si falls in the<br />

direction of S s(i)”.<br />

P.1 We have to consider two cases<br />

P.1.1 base case: i is zero:<br />

P.1.1.1 We have assumed that “S0 is pushed towards S1, so that it falls”<br />

P.1.2 step case: i = s(j) for some unary natural number j:<br />

P.1.2.1 We assume that P holds for Sj, i.e. Sj falls in the direction of S s(j) = Si.<br />

P.1.2.2 But we know that Sj has the same weight as Si, which is unstable,<br />

P.1.2.3 so Si falls into the direction opposite to Sj, i.e. towards S s(i) (we have a linear<br />

sequence of dominos)<br />

P.2 We have considered all the cases, so we have proven that P holds for all unary natural<br />

numbers i. (by induction)<br />

P.3 Now, the assertion follows trivially, since if “Si falls in the direction of S s(i)”, then in<br />

particular “Si falls”.<br />

c○: Michael Kohlhase 37<br />

If we look closely at the proof above, we see another recurring pattern. To get the proof to go<br />

through, we had to use a property P that is a little stronger than what we need for the assertion<br />

alone. In effect, the additional clause “... in the direction ...” in property P is used to make the<br />

22

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

Saved successfully!

Ooh no, something went wrong!