Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (openai/gpt-5.4)audited 2026-07-25
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.

The Dedekind reals form a totally ordered field

Statement

The inclusion order A≤B:  ⟺  A⊆B (Order on the Dedekind reals) makes R, the field of Dedekind cuts (The Dedekind reals form a field), a totally ordered field: the order is total, translation-invariant (A≤B⇒A+C≤B+C), and closed under multiplication of nonnegatives (0∗≤A and 0∗≤B⇒0∗≤A⋅B).

Facts & Assumptions

Given: Cuts A,B,C ordered by inclusion (Order on the Dedekind reals).

[L1]

R (Dedekind cuts) is a field under + and ⋅ (The Dedekind reals form a field).

[L2]

Inclusion totally orders R: reflexive, antisymmetric, transitive, and total (Inclusion totally orders the Dedekind reals).

[L3]

Addition is the sumset A+B={ a+b:a∈A, b∈B }, with identity 0∗ (Addition, negation, and subtraction of Dedekind cuts).

[L4]

For strictly positive cuts A,B>0∗, A⋅B={ q∈Q:q≤0 }∪{ ab:a∈A, b∈B, a>0, b>0 }; and A⋅B=0∗ whenever A=0∗ or B=0∗ (the sign rule). Also 0∗={ r∈Q:r<0 } (Multiplication and reciprocals of Dedekind cuts, Order on the Dedekind reals).

Proof

technique · direct
1.1L2

By Inclusion totally orders the Dedekind reals the relation ⊆ is a reflexive, antisymmetric, transitive, and total order on R.

1.2L3

Translation invariance: suppose A⊆B. Every element of A+C has the form a+c with a∈A, c∈C; since a∈A⊆B, also a+c∈B+C. Hence A+C⊆B+C, i.e. A≤B⇒A+C≤B+C.

1.3L4

Positivity of products of nonnegatives: suppose 0∗≤A and 0∗≤B. If A=0∗ or B=0∗, then A⋅B=0∗ by the sign rule [L4], so 0∗⊆A⋅B. Otherwise A,B>0∗, and the positive-case formula [L4] gives A⋅B⊇{ q∈Q:q≤0 }⊇{ r∈Q:r<0 }=0∗, so 0∗⊆A⋅B. In either case 0∗≤A⋅B.

2.1step 1.1step 1.2step 1.3L1∎

Thus R is a field whose inclusion order is total, translation-invariant, and closed under multiplication of nonnegative cuts: a totally ordered field.

Depends on

Dependency tree · 2 levels

Sources