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.

Order on the Dedekind reals

Definition

For Dedekind cuts A,B∈R (Dedekind cut, The real numbers R as Dedekind cuts), the order is set inclusion:

A≤B  ⟺  A⊆B,A<B  ⟺  A⊊B.

That is, A<B means A⊆B and A≠B.

A cut A is called positive iff 0∗<A, and nonnegative iff 0∗≤A, where 0∗={ r∈Q:r<0 } is the cut of 0. Negative and nonpositive cuts are defined symmetrically: A<0∗ and A≤0∗.

Remarks

Positivity has a convenient rational restatement: 0∗≤A iff every rational r<0 lies in A, and 0∗<A iff moreover 0∈A. Indeed if 0∈A then downward closure (C2) forces every r<0 into A, so 0∗⊆A and the inclusion is proper; conversely 0∗⊊A supplies some q∈A with q≥0, whence 0∈A by (C2). Thus a cut is positive exactly when it contains 0.

Inclusion is manifestly reflexive, antisymmetric, and transitive; what is not immediate is that it is total (any two cuts are comparable), which is Inclusion totally orders the Dedekind reals. Compatibility of this order with the field operations (translation invariance of ≤ and closure of nonnegatives under products), making R a totally ordered field, is The Dedekind reals form a totally ordered field.

Depends on

Used by

Dependency tree · two levels

4 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