A proof-by-contradiction strategy that assumes there exists a smallest (minimal) counterexample to a universal statement with respect to a chosen well-founded measure, and then derives a contradiction by producing an even smaller counterexample or showing the minimal object must satisfy the statement.

Principle

Well-founded minimality: in a well-ordered or well-founded domain any nonempty collection has a minimal element; assuming a minimal counterexample allows one to use its minimality to restrict structure and force contradictions under reduction operations.

Demonstration

To prove a property for all positive integers n, assume n0 is the smallest integer for which the property fails. Use algebraic decomposition or induction on smaller indices to construct n'

Misapplication

Using the method without a genuine well-founded size measure, or reducing a purported minimal counterexample to incomparable objects (so there is no strictly smaller counterexample), invalidates the argument; also misuse arises if the reduction does not respect the measure.

Consequence

Produces concise inductive or structural proofs that preclude infinite descent; often yields elegant nonconstructive existence proofs and can simplify complex case analyses by focusing on minimal obstructions.

Reversal

A constructive proof builds explicit witnesses for all cases rather than arguing by impossibility of minimal counterexamples; this direct approach often gives bounds and algorithms the minimal-counterexample method does not.

Boundary

Requires a well-founded ordering or size function compatible with the reductions used; it does not by itself provide effective bounds, quantitative rates, or constructive examples unless additional work is done.

Semantic Tension

Closely related to (strong) induction and infinite descent; tension arises when multiple incomparable minimal elements exist or when the notion of 'smaller' is ambiguous, making the choice of measure critical.

Synthesis

Assume a least counterexample under a well-founded measure, exploit its minimality to derive a strictly smaller counterexample or contradiction, and thus eliminate the possibility of any counterexample, proving the universal claim.