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.
Addition, negation, and subtraction of Dedekind cuts
Definition
Let be Dedekind cuts of (Dedekind cut, The real numbers as Dedekind cuts).
Sum. The sum is the Minkowski sumset in :
Additive identity. , the cut of the rational under the embedding (The real numbers as Dedekind cuts).
Additive inverse. For a cut , Equivalently, iff there is a rational with (set ; conversely ). Intuitively is bounded away from from below: some rational strictly beneath already fails to lie in .
Subtraction. .
Remarks
The sum is again a cut, and is an abelian group with identity : closure, commutativity, associativity, and the identity law are Cut addition: is a cut, commutative and associative, with identity , and existence of inverses is For a cut , is a cut and .
The slack in the definition of is essential and is not cosmetic. Neither nor is a cut in general: the first need not be downward closed, and the second can acquire a greatest element. Excising the boundary rational (the " with " clause) makes a genuine cut with no greatest element and forces the exact identity , not merely (For a cut , is a cut and ).
Depends on
Used by
- Multiplication and reciprocals of Dedekind cuts Definition
- Cut addition: A+B is a cut, commutative and associative, with identity 0^* Lemma
- For a cut A, -A is a cut and A + (-A) = 0^* Lemma
- Generic evaluation of bounded measurable functions by rational cuts Lemma
- The rational cuts embed densely in ℝ, preserving sums, products, 0, 1 and the order Lemma
- The Dedekind reals form a field Theorem
- The Dedekind reals form a totally ordered field Theorem
Dependency tree · two levels
4 results within two dependency steps 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
- 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)
- M. Girotti, Addendum — Construction of $\mathbb{R}$ via Dedekind's method (MATH 317, Advanced Calculus of One Variable) (standard reference, not scraped)
- Construction of the real numbers (Wikipedia) (standard reference, not scraped)
- Math 331 course handout: Dedekind Cuts and Real Numbers (Hobart and William Smith Colleges) (standard reference, not scraped)