Unit 1-Lecture 3：Well Order Principle (WOP)

Well Order Principle :
Every nonempty set of nonnegative integers has a smallest element.
Template for Well Ordering Proofs :
To prove that “P(n) is true for all nonnegative integer n $\subset \mathbb N$ , using the Well Ordering Principle:

• Define the set C, of counterexamples to P being true. Specifically, define:
  $$C ::= \{ n \subset \mathbb N \ | \ NOT\ p(n)\ is\ true \}$$
• Assume for proof by contradiction that C is nonempty.
• By the Well Ordering Principle, there will be a smallest element n, in C .
• Reach a contradiction somehow—often by showing that P(n) is actually true or by showing that there is another member of C that is smaller than n. This is the open-ended part of the proof task.
• Conclude that C must be empty, that is, no counterexamples exist.

Examlpe :
Prime Factorization Theorem:

• Every positive integer greater than one can be factored as a product of primes.

---

Reference

[1] Lehman E, Leighton F H, Meyer A R. Mathematics for Computer Science[J]. 2015.