Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicableSession-authored (Fable 5 assisted)verified 2026-08-10 (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.

Pointwise convergence, uniform convergence, and the uniformly Cauchy condition for sequences of real-valued functions

Definition

Let XX be a set and, for each kNk \in \mathbb{N}, let fk:XRf_k : X \to \mathbb{R} be a real-valued function (The vector space FXF^{X} of all functions XFX \to F with pointwise operations, and FnF^{n} as the case X=n={0,1,,n1}X = n = \{0, 1, \dots, n-1\}). Let f:XRf : X \to \mathbb{R}.

The sequence (fk)(f_k) converges pointwise to ff on XX when, for every xXx \in X, the real sequence (fk(x))(f_k(x)) converges to f(x)f(x) (Limits and Cauchy sequences of reals). Thus the index after which fk(x)f(x)<ε|f_k(x)-f(x)|<\varepsilon may depend on both ε\varepsilon and xx.

The sequence (fk)(f_k) converges uniformly to ff on XX when

(ε>0)(NN)(kN)(xX)fk(x)f(x)<ε,(\forall \varepsilon>0)(\exists N\in\mathbb{N})(\forall k\ge N)(\forall x\in X)\quad |f_k(x)-f(x)|<\varepsilon,

where ε\varepsilon ranges over the positive reals. Here one index NN serves every point of XX.

The sequence (fk)(f_k) is uniformly Cauchy on XX when

(ε>0)(NN)(m,nN)(xX)fm(x)fn(x)<ε.(\forall \varepsilon>0)(\exists N\in\mathbb{N})(\forall m,n\ge N)(\forall x\in X)\quad |f_m(x)-f_n(x)|<\varepsilon.

For each of the three notions above, restricting the error to positive rationals gives an equivalent condition. The real-error condition immediately implies the rational-error condition. Conversely, given a real η>0\eta>0, choose n1n\ge1 with 1/n<η1/n<\eta by For every ε>0\varepsilon > 0 in a complete ordered field there is a natural n1n \ge 1 with 1/n<ε1/n < \varepsilon; the condition for the positive rational 1/n1/n implies the condition for η\eta. The real-error form is used because it makes the uniform quantifiers transparent.

Depends on

Used by

Dependency tree · next 3 levels

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