How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Square roots exist: a unique with ; the positives are
Statement
Let be a complete ordered field (Complete ordered field (least-upper-bound property)). Then every with has a unique with and ; we write . Consequently the positive elements of are exactly the nonzero squares: if and only if for some .
Statement references
Facts & Assumptions
Given: A complete ordered field (Complete ordered field (least-upper-bound property)), that is, an ordered field (Ordered field) with the least-upper-bound property, and an element with .
Every nonempty subset of that is bounded above has a least upper bound in (Complete ordered field (least-upper-bound property)).
Sign and scaling rules: a product of positives is positive, and for one has (Sign rules for products and monotonicity of multiplication).
Squaring is strictly monotone on the nonnegatives: if then ; in particular squaring is injective on (Squaring is monotone on the nonnegatives).
A nonzero square is positive: if then (Squares of nonzero elements are positive).
Multiplying inequalities of positives: if and then (Multiplying inequalities of positives).
Inverses of positive elements are positive, and implies (Inverses of positives are positive, and reciprocation reverses order).
Proof
If , then satisfies and , so existence holds; assume henceforth .
Uniqueness holds once a root exists: if satisfy , then strict monotonicity of squaring on nonnegatives [L3] rules out both and , forcing ; so at most one has .
Define ; then because and , so .
The element is an upper bound of : since we have , so any has and , whence , giving .
By completeness [L1], exists in ; and since we have .
Assume, for contradiction, that ; by trichotomy either or .
(Case .) Since and , [L6] and [L2] give . Let if , and if . Since , [L6] gives ; together with the ordered-field sign and scaling rules [L2], this gives and in either branch; then and , so , whence with , contradicting that is an upper bound of .
(Case .) Here since ; since and , [L6] and [L2] give . Let if , and if . Again [L6] gives , and the ordered-field sign and scaling rules [L2] give and , so and , hence every has with and , so by [L3]; thus is an upper bound of with , contradicting that is the least upper bound.
Both cases of the disjunction in step 3.1 give a contradiction, so the assumption fails and : a unique (by step 1.2) with exists, and applying this to any writes with while conversely any nonzero square is positive by [L4], so the positive elements of are exactly the nonzero squares.
Depends on
Complete ordered field (least-upper-bound property)
Sign rules for products and monotonicity of multiplication
Squaring is monotone on the nonnegatives
Squares of nonzero elements are positive
Multiplying inequalities of positives
Ordered field
Inverses of positives are positive, and reciprocation reverses order
Dependency tree · 2 levels
Sources
- W. Rudin, Principles of Mathematical Analysis, 3rd ed., Ch. 1 (Thm 1.21)
- M. Spivak, Calculus, 4th ed., Ch. 8
- University of Colorado analysis notes: The real numbers