Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicableSession-authored (Fable 5 assisted)judge pass (deepseek-v4-pro + gpt-5.6-terra)verified 2026-08-09 (gpt-5.6-terra-codex-subscription)
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 five completeness properties of an ordered field: least upper bound, monotone convergence, nested intervals, Bolzano-Weierstrass, and Cauchy completeness

Definition

Throughout, FF is an ordered field (Ordered field) with its order and its absolute value. Sequences in FF, and the notions of convergence in FF, Cauchyness in FF, boundedness, nondecreasing and nonincreasing, subsequence, closed interval [a,b]F[a,b]_F, nesting, and lengths tending to 00 in FF, are the ones fixed once and for all in Sequences, convergence, Cauchyness, monotonicity, boundedness and closed intervals in an arbitrary ordered field. They are not restated here and they are never read in R\mathbb{R}: every ε\varepsilon below ranges over the positive elements of FF itself.

A sequence (xk)(x_k) in FF is bounded above when there is BFB \in F with xkBx_k \le B for every kNk \in \mathbb{N}, and a subset SFS \subseteq F is bounded above when there is BFB \in F with sBs \le B for every sSs \in S (Complete ordered field (least-upper-bound property), Upper bound, least upper bound, and strict upper bound).

The following are five properties that FF may or may not have.

  • (LUB), the least-upper-bound property. Every nonempty SFS \subseteq F that is bounded above has a least upper bound in FF. This is exactly the condition that makes FF a complete ordered field (Complete ordered field (least-upper-bound property)), and the two names are used interchangeably here.

  • (MCT), the monotone convergence property. Every nondecreasing sequence in FF that is bounded above converges in FF.

  • (NIP), the nested interval property. For every nested sequence (Ik)kN(I_k)_{k \in \mathbb{N}} of closed intervals Ik=[ak,bk]FI_k = [a_k, b_k]_F of FF whose lengths tend to 00 in FF, the intersection

    kNIk\bigcap_{k \in \mathbb{N}} I_k

    is nonempty.

  • (BW), the Bolzano-Weierstrass property. Every bounded sequence in FF has a subsequence that converges in FF.

  • (CC), Cauchy completeness. Every Cauchy sequence in FF converges in FF.

Alongside these we use the Archimedean property (ARCH) of Archimedean ordered field: for every xFx \in F there is a natural number nn with x<n1Fx < n \cdot 1_F.

Remarks

Depends on

Used by

Dependency tree · next 3 levels

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