Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicableSession-authored (Fable 5 assisted)judge pass (z-ai/glm-5.2)audited 2026-07-26
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.

Sequences, convergence, Cauchyness, monotonicity, boundedness and closed intervals in an arbitrary ordered field

Definition

Throughout, FF is an ordered field (Ordered field) with its order and its absolute value |\cdot| (Absolute value in an ordered field), and N\mathbb{N} is the set of natural numbers with its order (The natural numbers N\mathbb{N} (von Neumann), Order on the natural numbers).

A sequence in FF is a function x:NFx : \mathbb{N} \to F. We write xkx_k for x(k)x(k) and (xk)(x_k), or (xk)kN(x_k)_{k \in \mathbb{N}}, for the function itself.

Let (xk)(x_k) be a sequence in FF.

  • (xk)(x_k) is bounded when there is MFM \in F with xkM|x_k| \le M for every kNk \in \mathbb{N}.

  • (xk)(x_k) converges to LFL \in F when

    for every εF with ε>0 there is NN such that xkL<ε for all kN.\text{for every } \varepsilon \in F \text{ with } \varepsilon > 0 \text{ there is } N \in \mathbb{N} \text{ such that } |x_k - L| < \varepsilon \text{ for all } k \ge N.

    We then write xkLx_k \to L in FF. The sequence is convergent in FF when it converges to some LFL \in F, and divergent in FF otherwise.

  • (xk)(x_k) is Cauchy in FF when

    for every εF with ε>0 there is NN such that xkxl<ε for all k,lN.\text{for every } \varepsilon \in F \text{ with } \varepsilon > 0 \text{ there is } N \in \mathbb{N} \text{ such that } |x_k - x_l| < \varepsilon \text{ for all } k, l \ge N.

  • (xk)(x_k) is nondecreasing when xjxkx_j \le x_k for all jkj \le k, increasing when xj<xkx_j < x_k for all j<kj < k, nonincreasing when xjxkx_j \ge x_k for all jkj \le k, decreasing when xj>xkx_j > x_k for all j<kj < k, and monotone when it is nondecreasing or nonincreasing.

  • For a strictly increasing n:NNn : \mathbb{N} \to \mathbb{N}, the subsequence of (xk)(x_k) along nn is the composite (xnj)jN(x_{n_j})_{j \in \mathbb{N}}. An element LFL \in F is a subsequential limit of (xk)(x_k) when some subsequence of (xk)(x_k) converges to LL in FF.

Closed intervals and nesting. For a,bFa, b \in F with aba \le b, the closed interval with endpoints aa and bb is

[a,b]F  :=  {xF:axb},[a,b]_F \;:=\; \{\, x \in F : a \le x \le b \,\},

and its length is ba0b - a \ge 0. A sequence (Ik)kN(I_k)_{k \in \mathbb{N}} of closed intervals Ik=[ak,bk]FI_k = [a_k, b_k]_F is nested when Ik+1IkI_{k+1} \subseteq I_k for every kk. Its lengths tend to 00 in FF when the sequence (bkak)kN(b_k - a_k)_{k \in \mathbb{N}} converges to 00 in the sense above, that is, when for every ε>0\varepsilon > 0 in FF there is NNN \in \mathbb{N} with bkak<εb_k - a_k < \varepsilon for all kNk \ge N (the absolute value may be dropped because each length is 0\ge 0).

Remarks

  • The thresholds range over FF, and that is not a stylistic choice. In an Archimedean ordered field one may equivalently test ε\varepsilon over the canonical rationals, and that is what the R\mathbb{R}-specific Limits and Cauchy sequences of reals does; the two agree there, as the remark on rational and real ε\varepsilon in Sequences of reals: bounded, eventually, frequently, tails, subsequences records. In a general FF they do not agree, because the canonical rationals need not be cofinal below the positive elements. A concrete failure lives on this page: in R((t1))\mathbb{R}((t^{-1})) every positive rational constant exceeds t1t^{-1} (clause 4 of R((t1))\mathbb{R}((t^{-1})) is non-Archimedean, and the monomials tkt^{-k} are cofinal below its positive elements, since a nonzero constant is nonzero at index 00), so the sequence taking the value 00 at even indices and t1t^{-1} at odd indices would satisfy the Cauchy condition read with rational thresholds only, while failing it at ε=t2\varepsilon = t^{-2}, where consecutive terms differ by t1>t2t^{-1} > t^{-2}; and it has no limit at all, since a convergent sequence is Cauchy by the triangle inequality. Every definition above therefore quantifies over εF\varepsilon \in F, and no proof in this library may substitute a rational threshold in a field that has not been shown to be Archimedean.

  • These are the R\mathbb{R}-notions with R\mathbb{R} replaced by FF, and nothing more. Sequence, tail, subsequence and boundedness are Sequences of reals: bounded, eventually, frequently, tails, subsequences; monotonicity is Nondecreasing, increasing, nonincreasing, decreasing, monotone, and eventually monotone sequences; subsequential limits are Subsequential limit of a real sequence, and the subsequential limit set; convergence and Cauchyness are Limits and Cauchy sequences of reals; closed intervals are the form [a,b][a,b] of Intervals of R\mathbb{R}: the nine order-convex forms, nondegeneracy, and length. Only the field in which the inequalities are read has changed.

  • Transfer of theorems is not automatic, and citing an R\mathbb{R}-item for a general FF is a citation error. A result proved about sequences of reals is a statement about R\mathbb{R}. Many such proofs use only the ordered-field axioms and go through for any FF verbatim, and many others use completeness or the Archimedean property and do not. Which is which has to be settled by reading the proof; until an item is stated for a general ordered field, it may not be cited for one.

  • Limits are unique in any ordered field. If xkLx_k \to L and xkLx_k \to L' in FF with LLL \ne L', put ε:=LL/2\varepsilon := |L - L'|/2, which is positive because LL>0|L-L'| > 0 (Basic properties of the absolute value) and 2=1+1>02 = 1 + 1 > 0. Choose NN beyond which both xkL<ε|x_k - L| < \varepsilon and xkL<ε|x_k - L'| < \varepsilon hold, and take any kNk \ge N: the triangle inequality (The triangle inequality, proved for an arbitrary ordered field) gives LLLxk+xkL<2ε=LL|L - L'| \le |L - x_k| + |x_k - L'| < 2\varepsilon = |L - L'|, which is impossible. So the limit, when it exists, is unique, and the notation limkxk\lim_k x_k is unambiguous. No completeness and no Archimedean hypothesis is used.

  • Indexing starts at 00, as everywhere in this library, because 0N0 \in \mathbb{N} (The natural numbers N\mathbb{N} (von Neumann)). A nested sequence of intervals therefore begins with I0I_0, and a statement about "the first NN terms" means the indices 0,,N10, \dots, N-1.

Depends on

Used by

Dependency tree · next 3 levels

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