# Well-Ordering Axiom - Strong Induction

Prove the well-ordering Axiom by strong induction.

Â© BrainMass Inc. brainmass.com February 24, 2021, 2:18 pm ad1c9bdddfhttps://brainmass.com/math/basic-algebra/well-ordering-axiom-strong-induction-12808

#### Solution Preview

Strong induction:

Assume there is a proposition that is a function of a single natural number, that is P(x).

If P(1) is true

and

P(1) and P(2) and so on through P(n) imply P(n+1)

then

P(i) is true for all natural numbers.

Proof of Well-ordering axiom by strong induction:

We will do induction based on the size of the subset.

That is, the property P(i) in strong induction will ...

#### Solution Summary

The well-ordering axiom is proven by strong induction is examined.

$2.19