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.
Dedekind completeness: the least-upper-bound property
Statement
Least-upper-bound property. Every nonempty set of Dedekind cuts that is bounded above (there is a cut with for all ) has a least upper bound , and it is given explicitly by the union Together with The Dedekind reals form a totally ordered field this shows is a complete totally ordered field: the Dedekind construction is order-complete. This order-completeness is the Dedekind counterpart of the Cauchy-sequence completeness of .
Facts & Assumptions
Given: A nonempty set of Dedekind cuts bounded above by a cut ( for all ), and (The real numbers as Dedekind cuts).
Cut axioms: (C1) proper and nonempty, (C2) downward closed, (C3) no greatest element (Dedekind cut).
Order is inclusion: (Order on the Dedekind reals).
Inclusion is a partial (indeed total) order, so upper and least-upper bounds are taken with respect to (Inclusion totally orders the Dedekind reals).
is a totally ordered field; the least-upper-bound property below is the order-completeness that complements it (The Dedekind reals form a totally ordered field).
Proof
(C1) is nonempty and proper: has a member with and , so ; and every satisfies , so with , hence .
(C2) is downward closed: if then for some ; for , downward closure of gives .
(C3) has no greatest element: if then for some ; as has no greatest element there is with , and .
is an upper bound for : every satisfies , i.e. .
is below every upper bound: if a cut satisfies for all , then for all , so , i.e. .
is a Dedekind cut.
Therefore exists and equals : has the least-upper-bound property. With The Dedekind reals form a totally ordered field, is a complete totally ordered field, the order-completeness of the Dedekind construction, the exact counterpart of Cauchy-sequence completeness.
Depends on
Used by
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 20 results over 13 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.
Sources
- W. Rudin, Principles of Mathematical Analysis, 3rd ed., Ch. 1 (Appendix: construction of ℝ) (standard reference, not scraped)
- Construction of the real numbers (Wikipedia) (standard reference, not scraped)
- M. Girotti, Addendum — Construction of $\mathbb{R}$ via Dedekind's method (MATH 317, Advanced Calculus of One Variable) (standard reference, not scraped)
- Dedekind cut (Wikipedia) (standard reference, not scraped)