Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck 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.

Dedekind completeness: the least-upper-bound property

Statement

Least-upper-bound property. Every nonempty set S of Dedekind cuts that is bounded above (there is a cut B with A≤B for all A∈S) has a least upper bound sup⁡S, and it is given explicitly by the union C:=⋃A∈SA. Together with The Dedekind reals form a totally ordered field this shows R 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 R.

Facts & Assumptions

Given: A nonempty set S of Dedekind cuts bounded above by a cut B (A≤B for all A∈S), and C:=⋃A∈SA (The real numbers R as Dedekind cuts).

[L1]

Cut axioms: (C1) proper and nonempty, (C2) downward closed, (C3) no greatest element (Dedekind cut).

[L2]

Order is inclusion: A≤D  ⟺  A⊆D (Order on the Dedekind reals).

[L3]

Inclusion is a partial (indeed total) order, so upper and least-upper bounds are taken with respect to ⊆ (Inclusion totally orders the Dedekind reals).

[L4]

R 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

technique · direct
1.1

(C1) C is nonempty and proper: S has a member A0 with A0≠∅ and A0⊆C, so C≠∅; and every A∈S satisfies A⊆B, so C=⋃A∈SA⊆B with B≠Q, hence C≠Q.

givenL1L2
1.2

(C2) C is downward closed: if p∈C then p∈A for some A∈S; for q<p, downward closure of A gives q∈A⊆C.

givenL1
1.3

(C3) C has no greatest element: if p∈C then p∈A for some A∈S; as A has no greatest element there is r∈A with r>p, and r∈C.

givenL1
1.4

C is an upper bound for S: every A∈S satisfies A⊆⋃A′∈SA′=C, i.e. A≤C.

givenL2
1.5

C is below every upper bound: if a cut D satisfies A≤D for all A∈S, then A⊆D for all A, so C=⋃A∈SA⊆D, i.e. C≤D.

givenL2L3
2.1

C is a Dedekind cut.

step 1.1step 1.2step 1.3L1
3.1

Therefore sup⁡S exists and equals C=⋃A∈SA: R has the least-upper-bound property. With The Dedekind reals form a totally ordered field, R is a complete totally ordered field, the order-completeness of the Dedekind construction, the exact counterpart of Cauchy-sequence completeness.

step 2.1step 1.4step 1.5L4∎

Depends on

Used by

Dependency tree · two levels

10 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