Problem Solving

Inductive Step

Students add a new block above a staircase step.

Inductive Step definition

The inductive step proves that a claim at an arbitrary allowed index leads to the claim at the next index.

In Spanish
paso inductivo
Topic
Proof techniques

Inductive Step in a picture

Inductive Step diagramIn a sum proof, the next case adds k + 1 to the sum already covered by the hypothesis.Assume the sum through k is k(k + 1)/2This is the induction hypothesisAdd the next term k + 1The new sum is k(k + 1)/2 + k + 1Factor to get (k + 1)(k + 2)/2This is the required formula for k + 1
In a sum proof, the next case adds k + 1 to the sum already covered by the hypothesis.

How it works

For ordinary induction, assume P(k) and derive P(k + 1). Prove this implication for every k from the starting index onward. Combined with a true base case, it carries the truth to each later integer.

Worked examples

Write the ordinary induction step for P(n).

For arbitrary allowed k, show that P(k) implies P(k + 1).

Why is proving only P(3) ⇒ P(4) insufficient for an unlimited range?

It covers only one link. The step has to work for every allowed k.

If a step works for all k ≥ 5 and P(5) is true, which cases follow?

Every integer case starting at 5.

Common mistake

Use an arbitrary index in the range. Checking a few numerical transitions does not prove the general step.

Quick check

What is the target statement in the ordinary step?

Does the step alone establish the base case?

Show answer

No.

What does the step prove logically?

Show answer

An implication from earlier cases to the next one.

Sources

Flashcard

Inductive Step

Reveal the definition

The inductive step proves that a claim at an arbitrary allowed index leads to the claim at the next index.

Effortless Math. “Inductive Step.” Math Dictionary.