Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-generatedprecheck 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) be a compact metric space (Open cover, subcover, compact metric space, and compact subset of a metric space), let fk:X→R be continuous for every k∈N (Continuity of a map between metric spaces, at a point and globally, in the ε-δ form, R carrying its usual metric, The absolute value makes R a metric space: d(x,y)=∣x−y∣ is a metric, its open balls are the intervals (x−r,x+r), and it is unbounded), and suppose

fk(x)≤fk+1(x)for every k∈N and every x∈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) for every x∈X (Limits and Cauchy sequences of reals) with the limit function f:X→R continuous. Then (fk) converges to f uniformly (Uniform convergence, and the topology of uniform convergence: the metric topology of the uniform metric on YX and on C(X,Y)).

All four hypotheses are used. Compactness of X, monotonicity of the sequence, continuity of every fk and continuity of the limit f 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) and −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), continuous functions fk:X→R with fk(x)≤fk+1(x) for all k and x, a continuous f:X→R with fk(x)→f(x) for every x∈X, and ι the canonical natural of R (The canonical natural ι(n)=n⋅1F of a field).

[A1]

fk(x)≤fk+1(x) for every k∈N and every x∈X.

[A2]

fk(x)→f(x) in R for every x∈X, and f and every fk are continuous.

[L1]

A sequence of reals with xk≤xk+1 for every k is nondecreasing, that is xj≤xm whenever j≤m (Nondecreasing, increasing, nonincreasing, decreasing, monotone, and eventually monotone sequences).

[L6]

X is a compact subset of itself, so every family (Ui)i∈I of open subsets of X with X=⋃iUi has n∈N and indices i0,…,in∈I with X=Ui0∪⋯∪Uin, unless X=∅ (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 n≥1 and natural numbers k0,…,kn−1 there is j∗<n with kj≤kj∗ for every j<n: the nonempty finite set of reals {ι(k0),…,ι(kn−1)} has a maximum, attained at some index, and ι is strictly increasing on 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)=n⋅1F of a field).

Proof

technique · direct
1.1

Fix x∈X; the sequence (fk(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 be real and put Uk:={ x∈X:f(x)−fk(x)<ε } for k∈N.

construct
2.1

By [L2] the sequence (fk(x)) converges to the supremum of its range, and by [A2] it converges to f(x), so uniqueness of limits gives f(x)=sup⁡kfk(x); hence fk(x)≤f(x) for every k∈N and every x∈X.

step 1.1A2L2L3
2.2

Each Uk is open: let a∈Uk and put η:=(ε−(f(a)−fk(a)))/2>0; continuity of f and of fk at a gives reals δ1,δ2>0 with ∣f(x)−f(a)∣<η for d(x,a)<δ1 and ∣fk(x)−fk(a)∣<η for d(x,a)<δ2, and then δ:=min⁡{δ1,δ2}>0 gives, for d(x,a)<δ, the estimate f(x)−fk(x)<(f(a)+η)−(fk(a)−η)=(f(a)−fk(a))+2η=ε, so B(a,δ)⊆Uk.

step 1.2A2L4L5choose
2.3

X=⋃k∈NUk: given x∈X, convergence fk(x)→f(x) supplies k with ∣fk(x)−f(x)∣<ε, hence f(x)−fk(x)<ε and x∈Uk.

step 1.2A2
3.1

If X=∅ the conclusion holds with N:=0, the condition being vacuous; so assume X≠∅, and compactness applied to the family (Uk)k∈N gives n∈N and k0,…,kn∈N with X=Uk0∪⋯∪Ukn.

step 2.2step 2.3L6L8
4.1

By [L7] there is j∗≤n with kj≤kj∗ for every j≤n; put N:=kj∗.

step 3.1L7
5.1

Um⊆UN whenever m≤N: for x∈Um we have fm(x)≤fN(x) by [L1], so f(x)−fN(x)≤f(x)−fm(x)<ε.

step 1.2step 4.1A1L1
6.1

Hence X=Uk0∪⋯∪Ukn⊆UN, so X=UN, that is f(x)−fN(x)<ε for every x∈X.

step 3.1step 4.1step 5.1
7.1

For every k≥N and every x∈X: 0≤f(x)−fk(x)≤f(x)−fN(x)<ε, using fk(x)≤f(x) from step 2.1 and fN(x)≤fk(x) from [L1]; so ∣fk(x)−f(x)∣<ε.

step 2.1step 6.1A1L1
8.1

As ε was an arbitrary positive real, step 7.1 produces for each of them an index N serving every point of X, which is uniform convergence of (fk) to f.

step 1.2step 3.1step 7.1L8∎

Remarks

  • Where continuity of the limit is used. Only in step 2.2, to make Uk open. Without it the sets Uk need not be open, the cover argument collapses, and the conclusion is false: the companion page exhibits continuous fk increasing pointwise on the compact space [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 Uk increase with k so that a finite subcover collapses to a single UN, and at step 7.1, to propagate the bound from N 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] that are 0 up to 1/(k+1) and rise to 1; 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 · two levels

81 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