A foundational proof principle stating that a property P(n) of natural numbers holds for every n∈ℕ if (i) P(0) holds (base case) and (ii) for every k, P(k)⇒P(k+1) holds (successor closure). In this dictionary it is presented as the basic schema that transfers local successor reasoning into a universal claim over the natural-number sequence.

Principle

If a set S⊆ℕ contains 0 and is closed under the successor operation (k∈S⇒k+1∈S), then S=ℕ; equivalently, proving a base case and a preservation step yields a proof for all natural numbers.

Demonstration

To prove that every natural number n satisfies n+0=n, show base case n=0: 0+0=0, and assume n+k=k+n for arbitrary n and show n+ (k+1)=(k+1)+n using the definition of successor and previously assumed equality; the base and step combine to cover all n by induction.

Misapplication

Applying the scheme without verifying a valid base case or using an induction hypothesis that depends on more than what is permitted (e.g., assuming P(m) for some m>k when proving P(k+1)), or using ordinary induction on domains that lack the natural-number successor structure (such as non-well-founded sets) leads to unsound conclusions.

Consequence

A correct application converts a finite verification (base and step) into an infinite family of theorems about all natural numbers; it underpins countless definitions and proofs across arithmetic, combinatorics, and computer science, and yields tools like strong induction and structural induction as variants.

Reversal

The inverse idea is a counterexample existence principle: finding a single n with ¬P(n) refutes P for all n; conceptually, negating induction yields finite refutation rather than universal proof. Another contrast is infinite descent, which proves impossibility by showing any counterexample yields a smaller one ad infinitum.

Boundary

Applies to properties defined over ℕ (or any Peano-style inductive structure) with a well-defined zero and successor; it does not automatically transfer to arbitrary ordered sets, to propositions parametrized by real numbers, or to domains lacking well-foundedness without replacing it by an appropriate well-founded/structural induction principle.

Semantic Tension

Tension arises with strong (complete) induction and structural/well-founded induction: ordinary induction uses the immediate successor step, while strong induction permits assuming all smaller cases; both are equivalent over ℕ but differ in method and convenience, causing confusion about which form is assumed by 'induction'.

Synthesis

Principle of Mathematical Induction ties a local verification pattern (base and successor step) to a global universal claim on ℕ: by checking the base and showing closure under successor, one converts stepwise reasoning into proofs that hold for every natural number, with controlled variants (strong, structural) when the domain or hypothesis form demands them.