Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck 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 SS of Dedekind cuts that is bounded above (there is a cut BB with ABA \le B for all ASA \in S) has a least upper bound supS\sup S, and it is given explicitly by the union C:=ASA.C := \bigcup_{A \in S} A. Together with The Dedekind reals form a totally ordered field this shows R\mathbb{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\mathbb{R}.

Facts & Assumptions

Given: A nonempty set SS of Dedekind cuts bounded above by a cut BB (ABA \le B for all ASA \in S), and C:=ASAC := \bigcup_{A \in S} A (The real numbers R\mathbb{R} as Dedekind cuts).

[L1]

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

[L2]

Order is inclusion: AD    ADA \le D \iff A \subseteq 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 \subseteq (Inclusion totally orders the Dedekind reals).

[L4]

R\mathbb{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) CC is nonempty and proper: SS has a member A0A_0 with A0A_0 \ne \emptyset and A0CA_0 \subseteq C, so CC \ne \emptyset; and every ASA \in S satisfies ABA \subseteq B, so C=ASABC = \bigcup_{A \in S} A \subseteq B with BQB \ne \mathbb{Q}, hence CQC \ne \mathbb{Q}.

givenL1L2
1.2

(C2) CC is downward closed: if pCp \in C then pAp \in A for some ASA \in S; for q<pq < p, downward closure of AA gives qACq \in A \subseteq C.

givenL1
1.3

(C3) CC has no greatest element: if pCp \in C then pAp \in A for some ASA \in S; as AA has no greatest element there is rAr \in A with r>pr > p, and rCr \in C.

givenL1
1.4

CC is an upper bound for SS: every ASA \in S satisfies AASA=CA \subseteq \bigcup_{A' \in S} A' = C, i.e. ACA \le C.

givenL2
1.5

CC is below every upper bound: if a cut DD satisfies ADA \le D for all ASA \in S, then ADA \subseteq D for all AA, so C=ASADC = \bigcup_{A \in S} A \subseteq D, i.e. CDC \le D.

givenL2L3
2.1

CC is a Dedekind cut.

step 1.1step 1.2step 1.3L1
3.1

Therefore supS\sup S exists and equals C=ASAC = \bigcup_{A \in S} A: R\mathbb{R} has the least-upper-bound property. With The Dedekind reals form a totally ordered field, R\mathbb{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 · next 3 levels

Direct dependencies and their dependencies through the next three levels: 20 results over 13 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