Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicablejudge 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, F is an ordered field (Ordered field) with its order and its absolute value ∣⋅∣ (Absolute value in an ordered field), and N is the set of natural numbers with its order (The natural numbers N (von Neumann), Order on the natural numbers).

A sequence in F is a function x:N→F. We write xk for x(k) and (xk), or (xk)k∈N, for the function itself.

Let (xk) be a sequence in F.

  • (xk) is bounded when there is M∈F with ∣xk∣≤M for every k∈N.

  • (xk) converges to L∈F when

    for every ε∈F with ε>0 there is N∈N such that ∣xk−L∣<ε for all k≥N.

    We then write xk→L in F. The sequence is convergent in F when it converges to some L∈F, and divergent in F otherwise.

  • (xk) is Cauchy in F when

    for every ε∈F with ε>0 there is N∈N such that ∣xk−xl∣<ε for all k,l≥N.

  • (xk) is nondecreasing when xj≤xk for all j≤k, increasing when xj<xk for all j<k, nonincreasing when xj≥xk for all j≤k, decreasing when xj>xk for all j<k, and monotone when it is nondecreasing or nonincreasing.

  • For a strictly increasing n:N→N, the subsequence of (xk) along n is the composite (xnj)j∈N. An element L∈F is a subsequential limit of (xk) when some subsequence of (xk) converges to L in F.

Closed intervals and nesting. For a,b∈F with a≤b, the closed interval with endpoints a and b is

[a,b]F  :=  { x∈F:a≤x≤b },

and its length is b−a≥0. A sequence (Ik)k∈N of closed intervals Ik=[ak,bk]F is nested when Ik+1⊆Ik for every k. Its lengths tend to 0 in F when the sequence (bk−ak)k∈N converges to 0 in the sense above, that is, when for every ε>0 in F there is N∈N with bk−ak<ε for all k≥N (the absolute value may be dropped because each length is ≥0).

Remarks

  • The thresholds range over F, and that is not a stylistic choice. In an Archimedean ordered field one may equivalently test ε over the canonical rationals, and that is what the R-specific Limits and Cauchy sequences of reals does; the two agree there, as the remark on rational and real ε in Sequences of reals: bounded, eventually, frequently, tails, subsequences records. In a general F 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((t−1)) every positive rational constant exceeds t−1 (clause 4 of R((t−1)) is non-Archimedean, and the monomials t−k are cofinal below its positive elements, since a nonzero constant is nonzero at index 0), so the sequence taking the value 0 at even indices and t−1 at odd indices would satisfy the Cauchy condition read with rational thresholds only, while failing it at ε=t−2, where consecutive terms differ by t−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, 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-notions with R replaced by F, 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] of Intervals of 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-item for a general F is a citation error. A result proved about sequences of reals is a statement about R. Many such proofs use only the ordered-field axioms and go through for any F 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 xk→L and xk→L′ in F with L≠L′, put ε:=∣L−L′∣/2, which is positive because ∣L−L′∣>0 (Basic properties of the absolute value) and 2=1+1>0. Choose N beyond which both ∣xk−L∣<ε and ∣xk−L′∣<ε hold, and take any k≥N: the triangle inequality (The triangle inequality, proved for an arbitrary ordered field) gives ∣L−L′∣≤∣L−xk∣+∣xk−L′∣<2ε=∣L−L′∣, which is impossible. So the limit, when it exists, is unique, and the notation lim⁡kxk is unambiguous. No completeness and no Archimedean hypothesis is used.

  • Indexing starts at 0, as everywhere in this library, because 0∈N (The natural numbers N (von Neumann)). A nested sequence of intervals therefore begins with I0, and a statement about "the first N terms" means the indices 0,…,N−1.

Depends on

Used by

Dependency tree · two levels

30 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