Ladder Method of Proof

December 24, 2020

Why Ladder Method of proof is Valid - Well
Ordered Sets
Step 1: Consider an initial value for which the
statement is true. It is to be shown that the statement
is true for n = initial value e.g. taking first step on the
ladder.

Step 2: Assume the statement is true for any value of

n = k. Suppose a person is at the Kth step on the
ladder.

Step 3: Now prove the statement is true for n = k+1.

The proof will use what we know about the
proposition at n=k.
Principle of Ladder Method

Principle of ladder method: To prove that P(n) is true for all positive integers n
including zero, where P(n) is a propositional function, we complete two steps:

Step 1: We verify the expression P(1st) is true

Step 2: We suppose that the function is true for some n=k, that is, we assume
that P(k) is true.

Step 2: We have to prove that the conditional statement

P(Kth) ⇾ P[(K+ 1)th] is true for all positive integers K.

The formal form of the ladder method: ( P(1st) ^ ∀K(P(Kth) ⇾ P(K+1)th) ) ⇾ ∀nP(n)
Proof By Ladder Method

Example 1:
Proof By Ladder Method

Domain Set is Z+ = {1, 2, 3, 4, … }

Step 1: If n = 1,

LHS = 1

RHS = 1(1+1)/2 = 2/2 = 1 So, LHS = RHS

Step 2: Suppose the given expression is true for certain value of n = k

1+2+3+4+ … +k = k(k+1)/2

Now we have to prove P(k) ⇾ P(k+1)

Proof By Ladder Method

Step 3: Now Let us prove that the expression is also true for n = k+1

Put n = k + 1 in the expression:

So we have to prove that 1 + 2 + 3 + ... + k + (k+1) = (k + 1)[(k + 1)+ 1] / 2

LHS = 1 + 2 + 3 + ... + k + (k+1)

From Step 2, we know the value of 1 + 2 + 3 + ... + k , that is, k (k + 1) / 2

LHS = k (k + 1) / 2 + (k + 1) = [k ( k + 1) + 2 ( k + 1)] / 2 = (k + 1)(k + 2) / 2

= (k + 1)[(k + 1)+ 1] / 2
Proof By Ladder Method

Form Step 2, we know the value of 1 + 2 + 3 + ... + k

k (k + 1) / 2 + (k + 1) = [k ( k + 1) + 2 ( k + 1)] / 2 = (k + 1)(k + 2) / 2

= (k + 1)[(k + 1)+ 1] / 2 = RHS

Hence, LHS = RHS

The given expression is true, with n = k + 1

Hence, the proposition is true, 1+2+3+4+ … + n = n (n + 1) / 2, where n is a

positive integer.
Proof By Ladder Method

Example 2:
Proof By Ladder Method

Our domain set is W = { 0, 1, 2, 3, 4, ⋯}

Base Case: If n = ?
Proof By Ladder Method

Our domain set is{ 0, 1, 2, 3, 4, ⋯}

Step 1: If n = 0,

LHS = 20 = 1

RHS = 20 + 1 - 1 = 2 - 1 = 1 So, LHS = RHS

Step 2: Suppose the given expression is true for certain value of n = k

1+ 2+ 22 + 23 + 24 + … + 2k = 2k + 1 - 1

Now we have to prove P(K) ⇾ P(K+1)

Proof By Ladder Method
Step 3: Now Let us prove that the expression is also true for n = k+1

Put n = k + 1

So we have to prove that 1+ 2+ 22 + 23 + 24 + … + 2k + 2k + 1= 2(k + 1) + 1 - 1

LHS = 1+ 2+ 22 + 23 + 24 + … + 2k + 2k + 1

From step 2, we know the value of 1+ 2+ 22 + 23 + 24 + … + 2k , that is, 2k + 1 - 1

So, LHS = 2k + 1 - 1 + 2k + 1 = 2k + 1 + 2k + 1 - 1 = 21 * 2k+1 - 1 = 2(k + 1 ) + 1 - 1

Hence LHS = RHS

The given expression is true with n=0 and if true for n=k, it is true for n = k + 1.
Class activity

Question 1:

12 + 22 + 32 + … + n2 = ⅙(n)(n+1)(2n+1)