Alphabeta Math
ExampleConstruction: AI-adaptedVerification: AI-adaptedprecheck passverified 2026-08-02 (claude-opus-5)
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 cut S={q:q<0 or q2<2} is an irrational real number

Example

The set S:={q∈Q:q<0 or q2<2} is a Dedekind cut (Dedekind cut), hence a real number (The real numbers R as Dedekind cuts), yet no rational lies "at its boundary": it is the cut that names 2, the real number Q lacks. It is the canonical witness that cuts capture limits missing from Q, and the standard test case for the completeness of R.

Facts & Assumptions

Given: The set S:={q∈Q:q<0 or q2<2}, the cut axioms (C1)–(C3) (Dedekind cut), and R as the set of all cuts with rational embedding q↦q∗={r∈Q:r<q} (The real numbers R as Dedekind cuts).

[L1]

Q is a totally ordered field; in particular squaring is order-preserving on nonnegatives (0≤a<b⇒a2<b2) and the usual rational arithmetic holds (The rationals form a totally ordered field).

[L2]

No rational number squares to 2 (FALSE: some rational number squares to 2).

Verification

technique · direct
1.1

(C1) 0∈S since 02=0<2, so S≠∅; and 2∉S since 2>0 and 22=4>2, so S≠Q.

givenL1
1.2

(C2) Let p∈S and q<p. If q<0 then q∈S by definition. Otherwise 0≤q<p, so p>0; then p∈S forces p2<2, and 0≤q<p gives q2<p2<2, whence q∈S.

givenL1
1.3

(C3, case q≤0) Given q∈S with q≤0, take r=1: then 1∈S (as 12=1<2) and r=1>0≥q, so r>q.

givenL1
1.4

(C3, case q>0) Given q∈S with q>0, we have q2<2; set r=2q+2q+2. Then r−q=2−q2q+2>0, so r>q>0, while r2−2=2 (q2−2)(q+2)2<0, so r2<2; hence r∈S with r>q.

givenL1algebra
2.1

(C3) Combining the two cases, every q∈S admits r∈S with r>q: S has no greatest element.

step 1.3step 1.4
3.1

By steps 1.1, 1.2 and 2.1, S satisfies (C1)–(C3); it is a Dedekind cut (Dedekind cut), i.e. a real number (The real numbers R as Dedekind cuts).

step 1.1step 1.2step 2.1
4.1

Finally S≠p∗ for every p∈Q: were S=p∗={r:r<p}, then p∉S would give p>0 and p2≥2, while p2=2 is impossible by [L2], so p2>2; as p>0 we have p+2>0, and then s:=2p+2p+2 satisfies 0<s<p and s2>2, so s∉S, yet s<p puts s∈p∗=S, a contradiction. Thus S is a cut represented by no rational: it is the cut that names 2, the real number absent from Q.

step 3.1L2algebra∎

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

9 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