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 cut
Definition
Work over the totally ordered field of rationals (The rationals as equivalence classes of pairs of integers, The rationals form a totally ordered field). A subset is a Dedekind cut iff it satisfies all three of:
- (C1) and (proper and nonempty);
- (C2) downward closed: if and , then ;
- (C3) no greatest element: if , then there exists with .
Remarks
This is the lower-set convention (Rudin's): a cut is the set of rationals lying strictly below a real point, so it "opens downward" and never closes off at a maximum. Under the opposite (upper-set) convention the inequalities are reversed; we fix the lower-set form throughout.
An equivalent phrasing of (C2) by contraposition: if and , then ; the complement is upward closed. Consequently every and satisfy : were , downward closure (C2) would place . Thus a cut splits into a lower piece and an upper piece with every element of the former below every element of the latter, the lower piece having no largest member.
The set of all Dedekind cuts is the carrier of the real numbers (The real numbers as Dedekind cuts); each cut is a real number, identified with the downward gap of rationals it names.
Depends on
Used by
- Addition, negation, and subtraction of Dedekind cuts Definition
- Multiplication and reciprocals of Dedekind cuts Definition
- Order on the Dedekind reals Definition
- The real numbers ℝ as Dedekind cuts Definition
- The cut S = {q : q<0 or q²<2} is an irrational real number Example
- FALSE: every Dedekind cut has a greatest element False statement
- Cut addition: A+B is a cut, commutative and associative, with identity 0^* Lemma
- Each rational cut q^* is a Dedekind cut Lemma
- For a cut A, -A is a cut and A + (-A) = 0^* Lemma
- For a positive cut A, the reciprocal A⁻¹ satisfies A · A⁻¹ = 1^* Lemma
- Inclusion totally orders the Dedekind reals Lemma
- The Dedekind reals are Archimedean Lemma
- The rational cuts embed densely in ℝ, preserving sums, products, 0, 1 and the order Lemma
- Dedekind completeness: the least-upper-bound property Theorem
- The Dedekind reals form a field Theorem
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 27 results over 14 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)
- E. Landau, Foundations of Analysis (standard reference, not scraped)
- Math 331 course handout: Dedekind Cuts and Real Numbers (Hobart and William Smith Colleges) (standard reference, not scraped)
- Dedekind cut (Wikipedia) (standard reference, not scraped)