Proof of Existence and Uniqueness of the Nonnegative Square Root of a Nonnegative Real Number
theoremthm:real-nonnegative-square-root-2026aAxiom numbers below refer to Field, and conditions 1 and 2 are the two order-compatibility conditions of Ordered Field. Claims of Elementary Arithmetic in an Ordered Field and of Zero Products and Elementary Identities in a Field are cited by number. The order is a total order, so it is reflexive, antisymmetric, transitive and total, and these four properties are used by name. Rearrangements of sums are made freely using axioms 1, 2, 3 and 4.
Preliminary (halving). Put . Claim 1 of Elementary Arithmetic in an Ordered Field gives , so claim 2 gives ; and , so claim 3 gives . If , then , and antisymmetry with would give , contradicting axiom 6. Hence , and claim 4 of Elementary Arithmetic in an Ordered Field gives and . Moreover, for every , axioms 6, 9, 5 and 7 give
Uniqueness. Let satisfy , , and . Claim 4 of Zero Products and Elementary Identities in a Field gives
so claim 3 of Zero Products and Elementary Identities in a Field gives or .
If , then adding to both sides gives .
If , then adding to both sides of and using condition 1 gives ; with , antisymmetry gives , and then .
In both cases , so there is at most one such .
Existence. Put
Step 1 ( is nonempty). Reflexivity gives , and by claim 1 of Zero Products and Elementary Identities in a Field, so by hypothesis. Hence .
Step 2 ( is an upper bound for ). Let . By totality either , and there is nothing to prove, or ; assume the latter. Since , claim 5 of Elementary Arithmetic in an Ordered Field gives , and , so by transitivity. Since and , claim 3 gives , and claim 5 with gives ; as by axioms 6 and 8, transitivity yields . Combined with this gives by transitivity. Adding to both sides and using condition 1 gives , and antisymmetry with gives , contradicting axiom 6. Hence .
Step 3 (the least upper bound). By Steps 1 and 2 the set is a nonempty subset of that is bounded above in the sense of Upper Bound and Least Upper Bound, so by The Real Numbers it has a least upper bound . Since and is an upper bound for , we get .
We show . Suppose . By totality either or , and we derive a contradiction in each case.
Case A: and . Put . Claim 3 of Elementary Arithmetic in an Ordered Field gives , and , since would give on adding .
Put . Claim 2 gives and then ; and , so claim 3 gives . If then , and antisymmetry with would give , contradicting axiom 6; hence , and claim 4 gives and .
Put . Condition 2 gives , and claim 3 of Zero Products and Elementary Identities in a Field gives , since and .
Define if , and otherwise; in the second case totality gives . In either case, using reflexivity and from axiom 6,
Since and , claim 5 gives , that is by axiom 6. Claim 5 of Zero Products and Elementary Identities in a Field gives
Adding to both sides of and using condition 1 gives
the equality because, by axioms 8, 9 and 6,
Since and , claim 5 gives , and by axioms 5, 8, 7 and 6,
Hence by axiom 8, and adding and using condition 1 and transitivity gives
Claim 2 gives , so , and therefore because is an upper bound for . Adding to both sides and using condition 1 gives ; with , antisymmetry gives , contradicting .
Case B: and . Put ; as in Case A, and .
First, : if then by claim 1 of Zero Products and Elementary Identities in a Field, so , and antisymmetry with gives , contradicting .
Put . Claim 2 gives . By axioms 6, 9 and 8, , and by the preliminary, so would give by claim 3 of Zero Products and Elementary Identities in a Field; hence , and claim 4 gives and .
Put . Two applications of condition 2 give , and two applications of claim 3 of Zero Products and Elementary Identities in a Field give . By axioms 5, 8, 7 and 6,
We claim that is an upper bound for . Let , and suppose for contradiction that fails; by totality . Since is an upper bound for , also .
Claim 3 of Elementary Arithmetic in an Ordered Field applied to gives , and applied to gives ; since , claim 3 read in the other direction gives . Claim 2 gives , and adding to both sides of using condition 1 gives .
Claim 4 of Zero Products and Elementary Identities in a Field gives . Claim 5 of Elementary Arithmetic in an Ordered Field, applied to with , gives ; applied to with , it gives . By axiom 8 and transitivity,
Adding to both sides and using condition 1 gives . Since we have , so transitivity gives , and by the definition of . Adding to both sides and using condition 1 gives ; by the preliminary , so and hence . Condition 2 gives , so antisymmetry gives , and then , contradicting .
Therefore for every , so is an upper bound for . Since is a least upper bound, . Adding to both sides and using condition 1 gives , and adding gives ; with , antisymmetry gives , contradicting .
Both cases are impossible, so . Together with from Step 3 this proves existence, and uniqueness was proved above.
Loading…
Prerequisites
6687098f-755a-41c2-b327-c7c1c54197cc