Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablejudge 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 cut

Definition

Work over the totally ordered field Q of rationals (The rationals as equivalence classes of pairs of integers, The rationals form a totally ordered field). A subset A⊆Q is a Dedekind cut iff it satisfies all three of:

  • (C1) A≠∅ and A≠Q (proper and nonempty);
  • (C2) downward closed: if p∈A and q<p, then q∈A;
  • (C3) no greatest element: if p∈A, then there exists r∈A with p<r.

Remarks

This is the lower-set convention (Rudin's): a cut is the set of rationals lying strictly below a real point, so it "opens downward" and never closes off at a maximum. Under the opposite (upper-set) convention the inequalities are reversed; we fix the lower-set form throughout.

An equivalent phrasing of (C2) by contraposition: if q∉A and q<p, then p∉A; the complement Q∖A is upward closed. Consequently every a∈A and b∉A satisfy a<b: were b≤a, downward closure (C2) would place b∈A. Thus a cut splits Q into a lower piece A and an upper piece Q∖A with every element of the former below every element of the latter, the lower piece having no largest member.

The set of all Dedekind cuts is the carrier of the real numbers (The real numbers R as Dedekind cuts); each cut is a real number, identified with the downward gap of rationals it names.

Depends on

Used by

Dependency tree · two levels

8 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