example of well-founded induction
This proof of the fundamental theorem of arithmetic (every natural number has a prime factorization) affords an example of proof by well-founded induction over a well-founded relation that is not a linear order.
If is prime, then is its own factorization into primes, so the assertion is true for the -minimal elements.
|Title||example of well-founded induction|
|Date of creation||2013-03-22 12:42:23|
|Last modified on||2013-03-22 12:42:23|
|Last modified by||CWoo (3771)|