Intuition: Write P(k+1) Explicitly on a Fresh Line Before Starting the Inductive Step

Here is a classroom observation. A student writes the inductive hypothesis: "assume P(k): 1 + 2 + \dots + k = \frac{k(k+1)}{2}." Then they immediately start algebraic manipulation, confidently moving symbols around, and five minutes later they are stuck. They have simplified the inductive hypothesis in ten different ways, but nowhere on the page is the thing they are trying to prove.

The fix is a single habit, and it costs one extra line of writing.

Before you manipulate anything in the inductive step, write P(k+1) explicitly — the exact statement you are trying to prove — on a fresh line. Label it: "Goal: prove ..." or "Want to show: ...".

This line has no mathematical content beyond what is already in the problem. It cannot be "wrong." But its presence transforms the inductive step from a blind search into a guided derivation — you now know exactly where you are heading.

Why the habit matters

An induction proof has two things happening in your head: the inductive hypothesis (P(k), which you assume true) and the goal (P(k+1), which you want to derive). Without writing the goal down, you hold it in working memory while simultaneously manipulating algebra — a cognitive load that frequently exceeds what a 15-year-old can sustain during a timed exam. Things slip. You start manipulating the hypothesis without knowing why. You stop knowing which direction is "progress."

Writing the goal on a fresh line externalises it. Your eyes can flick between "what I have" (P(k)) and "what I want" (P(k+1)). Each algebraic step can be judged against the target. When you finally reach the target, you know immediately — and when you drift, you notice.

Why externalising the goal works: it is a standard cognitive-load reduction technique. The human working memory holds roughly four chunks at a time. In an induction proof, those chunks are easily used up by the hypothesis, the goal, the current line of algebra, and the overall structure. Writing the goal to paper removes one chunk from memory, freeing cognitive bandwidth for the actual algebra. This is not a mathematical technique; it is a study-habit technique, and it is the difference between a clean proof and a stuck one.

The template, demonstrated

Problem. Prove 1 + 2 + \dots + n = \frac{n(n+1)}{2} for all n \geq 1.

Step 1: base case. n = 1: LHS = 1, RHS = 1. \checkmark

Step 2: inductive hypothesis. Assume the formula holds at n = k:

1 + 2 + \dots + k = \frac{k(k+1)}{2}. \quad (P(k))

Step 3: write P(k+1) explicitly. (This is the habit.)

Goal: prove 1 + 2 + \dots + k + (k+1) = \frac{(k+1)(k+2)}{2}. \quad (P(k+1))

You have written the target on the page, with its own label, before touching any algebra. Notice what you just did: you replaced n with k+1 in the original statement, and wrote the result verbatim. This is a mechanical substitution — no creativity required — and it gives you a target to aim at.

Step 4: derive P(k+1) from P(k).

Start with the LHS of P(k+1):

1 + 2 + \dots + k + (k+1)

= \underbrace{(1 + 2 + \dots + k)}_{= \frac{k(k+1)}{2} \text{ by } P(k)} + (k+1)

= \frac{k(k+1)}{2} + (k+1) = \frac{k(k+1) + 2(k+1)}{2} = \frac{(k+1)(k+2)}{2}.

This equals the RHS of P(k+1). Done. The fact that you had the target written down made it obvious when to stop.

Compare this to the student who did not write P(k+1) down. They might simplify the hypothesis three different ways, expand various products, and have no way to know when they have arrived. With the target visible, "arrived" is a simple pattern match.

What goes on the "goal" line

The goal line is a mechanical substitution of k+1 (or n+1, depending on your notation) into the original statement. It has no interpretive step. Examples:

Original P(n)	P(k+1) to write down
\sum_{i=1}^{n} i^2 = \frac{n(n+1)(2n+1)}{6}	\sum_{i=1}^{k+1} i^2 = \frac{(k+1)(k+2)(2k+3)}{6}
2^n > n^2 for n \geq 5	2^{k+1} > (k+1)^2
n! > 2^n for n \geq 4	(k+1)! > 2^{k+1}
a_n = 2^n - 1 (with a_1 = 1, a_{n+1} = 2 a_n + 1)	a_{k+1} = 2^{k+1} - 1

In each case you literally rewrite the statement with k+1 in place of n. No simplification — just substitution. The goal line is a statement, not an algebraic simplification. Simplification happens in step 4.

A visual: working with the goal visible

Two workspace layouts. With the goal line (left slider position), your eyes can flick between hypothesis and target; each algebraic step can be judged immediately against the destination. Without the goal line, the target lives in your head while you manipulate algebra — and it slips.

Three common mistakes that the habit prevents

Mistake 1: manipulating the hypothesis instead of the goal.

Without the goal line, students often spend the inductive step simplifying P(k). But P(k) is assumed — it does not need simplifying. The work of the inductive step is to transform the LHS of P(k+1) until it matches the RHS. Writing P(k+1) down keeps this focus.

Mistake 2: circular proofs.

"Assume \sum_{i=1}^{k} i = \frac{k(k+1)}{2}. Then \sum_{i=1}^{k+1} i = \frac{(k+1)(k+2)}{2}. So \sum_{i=1}^{k+1} i = \frac{(k+1)(k+2)}{2}." The middle step is the thing being claimed. Without writing the goal down, students sometimes assert it as an intermediate step. With the goal written separately, it is obvious you have to derive it, not assert it.

Mistake 3: wrong goal.

Students occasionally substitute k+1 into the statement incorrectly — for instance, replacing n with k+1 on the LHS but leaving n alone on the RHS, or substituting but forgetting to simplify. Writing the goal line carefully, as a separate step, catches these errors before they propagate.

When the goal line is tricky to write

For inequalities, the goal line requires thought. "Prove 2^n > n^2 for n \geq 5" translates to: Goal: prove 2^{k+1} > (k+1)^2. You must be careful not to pre-simplify — for instance, writing "prove 2^{k+1} > k^2 + 2k + 1" is fine, but writing "prove 2 \cdot 2^k > (k+1)^2" sneaks in a manipulation of the LHS that you have not yet justified. Keep the goal statement clean and non-simplified; let simplification happen in the working area.

For recursively defined sequences, the goal line uses the next index: if P(n) is "a_n = f(n)," then P(k+1) is "a_{k+1} = f(k+1)." You then use the recurrence to express a_{k+1} in terms of a_k, apply the hypothesis to a_k, and simplify. Having the goal line a_{k+1} = f(k+1) on the page tells you exactly what a_{k+1} should equal.

Applying the habit to a non-trivial inductive step

Problem. Prove that n^3 + 2n is divisible by 3 for all n \geq 1.

Base case. n = 1: 1 + 2 = 3 = 3 \cdot 1. \checkmark

Inductive hypothesis. Assume k^3 + 2k = 3m for some integer m. \quad (P(k))

Goal line.

Goal: show (k+1)^3 + 2(k+1) = 3 \ell for some integer \ell. \quad (P(k+1))

Notice: the goal line specifies both the exact expression and what it means to be divisible by 3 (equals 3 times an integer). Writing it this way makes the target concrete.

Working area.

(k+1)^3 + 2(k+1) = k^3 + 3k^2 + 3k + 1 + 2k + 2 = (k^3 + 2k) + (3k^2 + 3k + 3)

= (k^3 + 2k) + 3(k^2 + k + 1)

= 3m + 3(k^2 + k + 1) \quad \text{(by } P(k)\text{)}

= 3 (m + k^2 + k + 1).

Check against goal. We wanted "(k+1)^3 + 2(k+1) = 3 \ell for some integer \ell." We got 3 (m + k^2 + k + 1) — which is 3 \ell with \ell = m + k^2 + k + 1, an integer. \checkmark

Conclusion. By induction, n^3 + 2n is divisible by 3 for all n \geq 1.

Lesson. The goal line "(k+1)^3 + 2(k+1) = 3 \ell" told us exactly what to factor out at the end — a 3. Without it, we might have simplified the expanded expression in ten different ways without recognising when we had landed.

The one-line takeaway

Before manipulating anything in the inductive step, write P(k+1) explicitly on its own line as "Goal: prove ...". This one habit externalises the target, reduces cognitive load, and prevents the three most common induction mistakes: manipulating the wrong thing, asserting the goal circularly, and mis-substituting k+1.

It costs one line of writing. It saves you from an entire class of errors. It is the single most effective habit you can form for induction proofs.