Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-generatedSession-authored (Fable 5 assisted)precheck passjudge pass (z-ai/glm-5.2)audited 2026-07-29
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.

Dini's theorem: on a compact metric space a nondecreasing sequence of continuous real functions converging pointwise to a continuous limit converges uniformly

Statement

Let (X,d)(X,d) be a compact metric space (Open cover, subcover, compact metric space, and compact subset of a metric space), let fk:XRf_k : X \to \mathbb{R} be continuous for every kNk \in \mathbb{N} (Continuity of a map between metric spaces, at a point and globally, in the ε\varepsilon-δ\delta form, R\mathbb{R} carrying its usual metric, The absolute value makes R\mathbb{R} a metric space: d(x,y)=xyd(x,y) = |x-y| is a metric, its open balls are the intervals (xr,x+r)(x-r, x+r), and it is unbounded), and suppose

fk(x)fk+1(x)for every kN and every xX,f_k(x) \le f_{k+1}(x) \qquad \text{for every } k \in \mathbb{N} \text{ and every } x \in X ,

so that the sequence is nondecreasing at every point (Nondecreasing, increasing, nonincreasing, decreasing, monotone, and eventually monotone sequences). Suppose further that fk(x)f(x)f_k(x) \to f(x) for every xXx \in X (Limits and Cauchy sequences of reals) with the limit function f:XRf : X \to \mathbb{R} continuous. Then (fk)(f_k) converges to ff uniformly (Uniform convergence, and the topology of uniform convergence: the metric topology of the uniform metric on YXY^{X} and on C(X,Y)C(X,Y)).

All four hypotheses are used. Compactness of XX, monotonicity of the sequence, continuity of every fkf_k and continuity of the limit ff each enter the proof, and dropping any one of them makes the conclusion false; the companion page exhibits the failure when the limit is not continuous.

The nonincreasing form holds too, by applying the theorem to (fk)(-f_k) and f-f, which are continuous and nondecreasing at every point; the proof below is written for the nondecreasing direction only, and the Statement claims that direction.

No choice principle is used: the finite subcover produced below is returned as a list of indices by the indexed form of compactness (A subset of a metric space is open in the subspace metric exactly when it is the trace of an open set of the ambient space, and it is compact as a metric space in its own right exactly when every family of open subsets of the ambient space covering it, indexed or not, has finitely many members covering it).

Facts & Assumptions

Given: A compact metric space (X,d)(X,d), continuous functions fk:XRf_k : X \to \mathbb{R} with fk(x)fk+1(x)f_k(x) \le f_{k+1}(x) for all kk and xx, a continuous f:XRf : X \to \mathbb{R} with fk(x)f(x)f_k(x) \to f(x) for every xXx \in X, and ι\iota the canonical natural of R\mathbb{R} (The canonical natural ι(n)=n1F\iota(n) = n \cdot 1_F of a field).

[A1]

fk(x)fk+1(x)f_k(x) \le f_{k+1}(x) for every kNk \in \mathbb{N} and every xXx \in X.

[A2]

fk(x)f(x)f_k(x) \to f(x) in R\mathbb{R} for every xXx \in X, and ff and every fkf_k are continuous.

[L1]

A sequence of reals with xkxk+1x_k \le x_{k+1} for every kk is nondecreasing, that is xjxmx_j \le x_m whenever jmj \le m (Nondecreasing, increasing, nonincreasing, decreasing, monotone, and eventually monotone sequences).

[L6]

XX is a compact subset of itself, so every family (Ui)iI(U_i)_{i \in I} of open subsets of XX with X=iUiX = \bigcup_i U_i has nNn \in \mathbb{N} and indices i0,,inIi_0, \dots, i_n \in I with X=Ui0UinX = U_{i_0} \cup \dots \cup U_{i_n}, unless X=X = \varnothing (A subset of a metric space is open in the subspace metric exactly when it is the trace of an open set of the ambient space, and it is compact as a metric space in its own right exactly when every family of open subsets of the ambient space covering it, indexed or not, has finitely many members covering it, claim 3, Open cover, subcover, compact metric space, and compact subset of a metric space).

[L7]

For n1n \ge 1 and natural numbers k0,,kn1k_0, \dots, k_{n-1} there is j<nj^{\ast} < n with kjkjk_j \le k_{j^{\ast}} for every j<nj < n: the nonempty finite set of reals {ι(k0),,ι(kn1)}\{\iota(k_0), \dots, \iota(k_{n-1})\} has a maximum, attained at some index, and ι\iota is strictly increasing on N\mathbb{N}, hence reflects the order (Every nonempty finite set of reals has a maximum and a minimum, Maximum and minimum of a set, Canonical naturals are positive and strictly increasing, The canonical natural ι(n)=n1F\iota(n) = n \cdot 1_F of a field).

[L8]

Uniform convergence of (fk)(f_k) to ff is: for every real ε>0\varepsilon > 0 there is NNN \in \mathbb{N} with fk(x)f(x)<ε|f_k(x) - f(x)| < \varepsilon for every xXx \in X and every kNk \ge N (Uniform convergence, and the topology of uniform convergence: the metric topology of the uniform metric on YXY^{X} and on C(X,Y)C(X,Y), Convergence in the uniform metric is exactly uniform convergence: one NN serving every point, Convergence of a sequence in a metric space: xkxx_k \to x iff d(xk,x)0d(x_k, x) \to 0 in R\mathbb{R}).

Proof

technique · direct
1.1

Fix xXx \in X; the sequence (fk(x))(f_k(x)) is nondecreasing by [A1] and [L1], and it converges by [A2], hence is bounded and in particular bounded above.

A1A2L1L2
1.2

Let ε>0\varepsilon > 0 be real and put Uk:={xX:f(x)fk(x)<ε}U_k := \{\, x \in X : f(x) - f_k(x) < \varepsilon \,\} for kNk \in \mathbb{N}.

construct
2.1

By [L2] the sequence (fk(x))(f_k(x)) converges to the supremum of its range, and by [A2] it converges to f(x)f(x), so uniqueness of limits gives f(x)=supkfk(x)f(x) = \sup_k f_k(x); hence fk(x)f(x)f_k(x) \le f(x) for every kNk \in \mathbb{N} and every xXx \in X.

step 1.1A2L2L3
2.2

Each UkU_k is open: let aUka \in U_k and put η:=(ε(f(a)fk(a)))/2>0\eta := (\varepsilon - (f(a) - f_k(a)))/2 > 0; continuity of ff and of fkf_k at aa gives reals δ1,δ2>0\delta_1, \delta_2 > 0 with f(x)f(a)<η|f(x)-f(a)| < \eta for d(x,a)<δ1d(x,a) < \delta_1 and fk(x)fk(a)<η|f_k(x)-f_k(a)| < \eta for d(x,a)<δ2d(x,a) < \delta_2, and then δ:=min{δ1,δ2}>0\delta := \min\{\delta_1,\delta_2\} > 0 gives, for d(x,a)<δd(x,a) < \delta, the estimate f(x)fk(x)<(f(a)+η)(fk(a)η)=(f(a)fk(a))+2η=εf(x) - f_k(x) < (f(a)+\eta) - (f_k(a)-\eta) = (f(a)-f_k(a)) + 2\eta = \varepsilon, so B(a,δ)UkB(a,\delta) \subseteq U_k.

step 1.2A2L4L5choose
2.3

X=kNUkX = \bigcup_{k \in \mathbb{N}} U_k: given xXx \in X, convergence fk(x)f(x)f_k(x) \to f(x) supplies kk with fk(x)f(x)<ε|f_k(x) - f(x)| < \varepsilon, hence f(x)fk(x)<εf(x) - f_k(x) < \varepsilon and xUkx \in U_k.

step 1.2A2
3.1

If X=X = \varnothing the conclusion holds with N:=0N := 0, the condition being vacuous; so assume XX \ne \varnothing, and compactness applied to the family (Uk)kN(U_k)_{k \in \mathbb{N}} gives nNn \in \mathbb{N} and k0,,knNk_0, \dots, k_n \in \mathbb{N} with X=Uk0UknX = U_{k_0} \cup \dots \cup U_{k_n}.

step 2.2step 2.3L6L8
4.1

By [L7] there is jnj^{\ast} \le n with kjkjk_j \le k_{j^{\ast}} for every jnj \le n; put N:=kjN := k_{j^{\ast}}.

step 3.1L7
5.1

UmUNU_m \subseteq U_N whenever mNm \le N: for xUmx \in U_m we have fm(x)fN(x)f_m(x) \le f_N(x) by [L1], so f(x)fN(x)f(x)fm(x)<εf(x) - f_N(x) \le f(x) - f_m(x) < \varepsilon.

step 1.2step 4.1A1L1
6.1

Hence X=Uk0UknUNX = U_{k_0} \cup \dots \cup U_{k_n} \subseteq U_N, so X=UNX = U_N, that is f(x)fN(x)<εf(x) - f_N(x) < \varepsilon for every xXx \in X.

step 3.1step 4.1step 5.1
7.1

For every kNk \ge N and every xXx \in X: 0f(x)fk(x)f(x)fN(x)<ε0 \le f(x) - f_k(x) \le f(x) - f_N(x) < \varepsilon, using fk(x)f(x)f_k(x) \le f(x) from step 2.1 and fN(x)fk(x)f_N(x) \le f_k(x) from [L1]; so fk(x)f(x)<ε|f_k(x) - f(x)| < \varepsilon.

step 2.1step 6.1A1L1
8.1

As ε\varepsilon was an arbitrary positive real, step 7.1 produces for each of them an index NN serving every point of XX, which is uniform convergence of (fk)(f_k) to ff.

step 1.2step 3.1step 7.1L8

Remarks

  • Where continuity of the limit is used. Only in step 2.2, to make UkU_k open. Without it the sets UkU_k need not be open, the cover argument collapses, and the conclusion is false: the companion page exhibits continuous fkf_k increasing pointwise on the compact space [0,1][0,1] to a discontinuous limit, with no uniform convergence.

  • Where monotonicity is used. Twice, and both times to turn "some index works at this point" into "one index works at every point": at step 5.1, to make the sets UkU_k increase with kk so that a finite subcover collapses to a single UNU_N, and at step 7.1, to propagate the bound from NN to every later index.

  • Where compactness is used. Once, at step 3.1. On a non-compact domain the theorem fails, and the standard witness is the increasing sequence of functions on (0,1](0,1] that are 00 up to 1/(k+1)1/(k+1) and rise to 11; nothing on this page needs that witness and it is not constructed here.

  • The conclusion is genuinely about the sequence and not about the family. Dini's theorem says nothing about an arbitrary set of continuous functions with a continuous pointwise supremum; the ordering of the sequence by its index is what steps 5.1 and 7.1 consume.

Depends on

Used by

Dependency tree · next 3 levels

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