Mathematical induction

Textbook reading

The problem that opens the lesson

Prove $1+3+5+...+(2n-1)=n^2$ .

Solution

Begin by identifying the mathematical object and the information that fixes it. State the proposition clearly, prove the base case, write the hypothesis, transform the $k+1$ case using that hypothesis, and conclude for all permitted integers. The relevant conditions are not optional bookkeeping: Strong induction and multiple base cases are useful when a step depends on several earlier cases, but ordinary induction is the main spine here. Following that structure gives Verify $n=1$ ; assume sum to $k$ is $k^2$ ; add $2k+1$ to obtain $(k+1)^2$ .

Why this works

The method does not verify examples one by one; it proves a mechanism that carries truth forward indefinitely. The calculation and the representation should agree, so a graph, diagram, table, or substitution check should support the same conclusion.

Textbook reading

What this lesson is really about

Mathematical induction proves a statement for every integer in a sequence of allowed values.

The base case establishes the first link. The inductive hypothesis assumes one arbitrary case $k$ only for the purpose of proving the next case $k+1$ . Together, these create an unbroken logical chain.

The point is not merely to reproduce a formula. A learner should be able to identify the quantities or geometric objects involved, explain why the relationship has its stated form, and recognize when the same idea appears in a graph, table, diagram, or model.

Textbook reading

Why the relationship works

The method does not verify examples one by one; it proves a mechanism that carries truth forward indefinitely.

Textbook reading

A reliable way to work

State the proposition clearly, prove the base case, write the hypothesis, transform the $k+1$ case using that hypothesis, and conclude for all permitted integers.

Strong induction and multiple base cases are useful when a step depends on several earlier cases, but ordinary induction is the main spine here.

After the symbolic work is complete, check the result. Depending on the lesson, this may mean substituting into an original equation, comparing coordinates, examining a graph, checking units, testing an interval, or confirming that every branch of a periodic solution has been included.

Textbook reading

What commonly goes wrong

A common error is assuming the $k+1$ statement or failing to use the inductive hypothesis.

The repair is to return to the definition and identify the first step where the invalid solution stops describing the original mathematical object. Later algebra cannot rescue a first step that changed the domain, orientation, branch, or meaning of the problem.

Textbook reading

Worked examples

Worked example 1

Prove $1+3+5+...+(2n-1)=n^2$ .

Solution

Begin by identifying the mathematical object and the information that fixes it. State the proposition clearly, prove the base case, write the hypothesis, transform the $k+1$ case using that hypothesis, and conclude for all permitted integers. The relevant conditions are not optional bookkeeping: Strong induction and multiple base cases are useful when a step depends on several earlier cases, but ordinary induction is the main spine here. Following that structure gives Verify $n=1$ ; assume sum to $k$ is $k^2$ ; add $2k+1$ to obtain $(k+1)^2$ .

Why this works

The method does not verify examples one by one; it proves a mechanism that carries truth forward indefinitely. The calculation and the representation should agree, so a graph, diagram, table, or substitution check should support the same conclusion.

Transfer example

Problem

Prove an arithmetic-series identity.

Worked development

State the proposition clearly, prove the base case, write the hypothesis, transform the $k+1$ case using that hypothesis, and conclude for all permitted integers. In this example, the first useful move is to make the defining structure visible rather than to search for a memorized answer. The base case establishes the first link. The inductive hypothesis assumes one arbitrary case $k$ only for the purpose of proving the next case $k+1$ . Together, these create an unbroken logical chain. Then apply the conditions explicitly: Strong induction and multiple base cases are useful when a step depends on several earlier cases, but ordinary induction is the main spine here. Finish by checking the result in a second representation and explaining what the result means.

Interpretation

Induction proves sum formulas, divisibility, inequalities, and recursive identities.

Reasoning example

Problem

Prove divisibility by induction.

Worked development

State the proposition clearly, prove the base case, write the hypothesis, transform the $k+1$ case using that hypothesis, and conclude for all permitted integers. In this example, the first useful move is to make the defining structure visible rather than to search for a memorized answer. The base case establishes the first link. The inductive hypothesis assumes one arbitrary case $k$ only for the purpose of proving the next case $k+1$ . Together, these create an unbroken logical chain. Then apply the conditions explicitly: Strong induction and multiple base cases are useful when a step depends on several earlier cases, but ordinary induction is the main spine here. Finish by checking the result in a second representation and explaining what the result means.

Interpretation

Induction proves sum formulas, divisibility, inequalities, and recursive identities.

Worked example 4: quick check

What does the inductive hypothesis allow you to assume?

Solution

Begin by identifying the mathematical object and the information that fixes it. State the proposition clearly, prove the base case, write the hypothesis, transform the $k+1$ case using that hypothesis, and conclude for all permitted integers. The relevant conditions are not optional bookkeeping: Strong induction and multiple base cases are useful when a step depends on several earlier cases, but ordinary induction is the main spine here. Following that structure gives The statement is true for one arbitrary allowed integer k, solely to prove the $k+1$ case.

Why this works

The method does not verify examples one by one; it proves a mechanism that carries truth forward indefinitely. The calculation and the representation should agree, so a graph, diagram, table, or substitution check should support the same conclusion.

Textbook reading

Application and interpretation

Induction proves sum formulas, divisibility, inequalities, and recursive identities.

A contextual answer must include units, a meaningful domain, and the assumptions that make the model plausible. An exact mathematical relationship should not be diluted into a decimal unless a measurement or comparison requires it.

Practice