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.
Nonnegative real square roots exist uniquely
Statement
In a Dedekind-complete ordered field, every has a unique with .
Facts & Assumptions
Given: A field satisfying Dedekind-complete ordered real field and .
Dedekind-complete ordered real field: every nonempty bounded-above subset has a least upper bound; field operations preserve order.
Proof
If , is a root. If , let . It contains . If , then , so bounds above. By [A1], exists and .
Suppose . Put . Then , so . Thus , contradicting that is an upper bound. If , put . Since , , and . Every therefore satisfies , contradicting that is the least upper bound. Hence .
If , then unless , which is excluded by . Thus two nonnegative roots of cannot differ; is unique.
Depends on
Used by
- Exact dyadic bisection for square-root endpoints Algorithm
- Finite complex-array norms used by the NUFFT certificates Definition
- Real elementary functions and their domains Definition
- Real intervals, complex rectangles and ball enclosures Definition
- A positive mode multiplier too small to certify Example
- The two-node Gauss–Legendre rule is exact through degree three Example
- A nondegenerate dyadic simplex determines a unique sphere Lemma
- Exact Gaussian grid alias identity and explicit alias bound Lemma
- Real and complex modulus product and triangle inequalities Lemma
- Certified type-1 Gaussian gridding error and type-2 adjoint bound Theorem
- Dyadic square-root bisection gives outward endpoints Theorem
- Outward-rounded operations are inclusion-isotone and enclose DAG evaluations Theorem
- The Jacobi matrix spectrum is the set of Gauss nodes Theorem
Dependency tree · one level
1 result within one dependency step of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Steven G. Krantz, Foundations of Analysis, §1.1, Theorem 1.8 (standard reference, not scraped)