Advanced Methods Summary

Intro to Proofs · Axiom Academy

SUMMARY Advanced Proof Methods A recap of the specialized techniques — well-ordering, invariants, infinite descent, and extremal arguments — that solve problems beyond standard proofs. The power of minimality: taking the smallest counterexample turns many hard problems into clean contradictions — the engine behind well-ordering and infinite descent. Hidden structure: invariants expose constraints a system can never escape, making impossible states provably unreachable. Descent's elegance: infinite descent proves impossibility through self-reference — any solution would force a strictly smaller one, forever. Method selection is a skill: recognizing which technique fits a problem is itself a proof move, sharpened by practice. Beyond the basics: these methods extend far past direct proof, contraposition, and simple induction — essential tools for higher mathematics. Core Concept Well-Ordering Principle Every nonempty set of positive integers has a smallest element. To use it, assume a counterexample exists, take the smallest one, then derive a contradiction by producing an even smaller counterexample. Equivalent to induction: two views of the same structural property of . Choose the right order: success often hinges on what quantity you minimize — size, sum, denominator, etc. Core Concept Invariants & Monovariants

This is the written version of the interactive lesson above. See the full Intro to Proofs course.