A proof technique that derives a contradiction by assuming a minimal counterexample in a well-ordered domain (typically the positive integers) and then constructing a strictly smaller counterexample ad infinitum, contradicting minimality.

Principle

Use the well-ordering of the positive integers: if a minimal counterexample exists, produce from it another valid counterexample of strictly smaller size, creating an infinite strictly decreasing sequence in a well-ordered set, which is impossible.

Demonstration

Classic demonstration: to show √2 is irrational, assume integers a,b>0 with a^2=2b^2 in lowest terms; one constructs smaller integers a',b' with a'^2=2b'^2 (by parity argument and halving), contradicting minimality, hence no such (a,b) exists.

Misapplication

Applying infinite descent in domains that are not well-ordered (e.g., the integers without a positivity constraint, or the reals), or failing to ensure the constructed counterexample is strictly smaller in the same ordering, invalidates the reasoning.

Consequence

Provides a robust method for impossibility proofs in number theory and Diophantine problems, often producing simple, elementary contradictions without requiring heavy machinery.

Reversal

The conceptual reversal is proof by infinite ascent or constructive existence via building an unbounded increasing chain; descent shows nonexistence by contradiction, while ascent attempts constructive existence by iteration.

Boundary

Requires a well-founded ordering (usually the natural numbers) and a means to produce a strictly smaller element of the same domain; it does not directly prove quantitative bounds or existence results outside well-founded contexts.

Semantic Tension

Closely related to, and often interchangeable with, proofs by minimal counterexample and the well-ordering principle or strong induction; the tension is stylistic—descent is constructive in producing smaller witnesses, while well-ordering/induction often argue more abstractly.

Synthesis

Infinite descent leverages well-ordering: assuming a minimal counterexample and exhibiting an even smaller one yields a contradiction, giving an elementary, often constructive, path to impossibility results in arithmetic and beyond.