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.
Inclusion totally orders the Dedekind reals
Statement
Set inclusion totally orders the Dedekind reals (Order on the Dedekind reals): the relation on cuts (Dedekind cut) is reflexive, antisymmetric (with antisymmetry delivering set equality ), and transitive, and it is moreover total: for any two cuts , either or .
Facts & Assumptions
Given: Dedekind cuts , ordered by inclusion (Order on the Dedekind reals).
Set inclusion is a partial order on any family of sets: reflexive (), antisymmetric (mutual inclusion , gives ), and transitive.
The order on is total (The rationals form a totally ordered field): for rationals exactly one of , , holds.
Downward closure (C2): if and then , and likewise for (Dedekind cut).
Proof
The relation is set inclusion, and is reflexive, antisymmetric (mutual inclusion and forces the set equality ), and transitive; hence is a partial order on .
It remains to establish totality. Fix cuts ; if there is nothing to prove, so assume . It suffices to show .
Since , choose a rational with and .
Every satisfies : otherwise by trichotomy, and then downward closure of places (directly if , or as ), contradicting .
Fix any . From together with , downward closure of gives ; as was arbitrary, .
Thus for all cuts , or , so is total; combined with the partial-order properties, set inclusion is a total order on .