Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-generatedSession-authored (Fable 5 assisted)precheck passaudited 2026-07-31
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 closed interval: monotone pointwise convergence of continuous functions to a continuous limit is uniform

Statement

Let a<ba<b be reals. Suppose fk:[a,b]Rf_k:[a,b]\to\mathbb{R} and f:[a,b]Rf:[a,b]\to\mathbb{R} are continuous, fkff_k\to f pointwise, and the sequence is pointwise monotone in one fixed direction:

fk(x)fk+1(x)for all k,x,f_k(x)\le f_{k+1}(x)\quad\text{for all }k,x,

or

fk+1(x)fk(x)for all k,x.f_{k+1}(x)\le f_k(x)\quad\text{for all }k,x.

Then fkff_k\to f uniformly on [a,b][a,b].

Facts & Assumptions

Given: Reals a<ba<b, continuous functions fk,f:[a,b]Rf_k,f:[a,b]\to\mathbb{R}, pointwise convergence fkff_k\to f, and one of the two pointwise monotonicity conditions in the Statement.

[A1]

Uniform convergence means that for every real ε>0\varepsilon>0 there is NN such that fk(x)f(x)<ε|f_k(x)-f(x)|<\varepsilon for every kNk\ge N and every x[a,b]x\in[a,b] (Pointwise convergence, uniform convergence, and the uniformly Cauchy condition for sequences of real-valued functions).

[L2]

If h:ARh:A\to\mathbb{R} is continuous, the inverse image of an open subset of R\mathbb{R} is relatively open in AA: it is OAO\cap A for some open ORO\subseteq\mathbb{R} (f:ARf : A \to \mathbb{R} is continuous on AA if and only if the preimage of every open subset of R\mathbb{R} is the intersection with AA of an open subset of R\mathbb{R}, and dually for closed sets).

[L3]

Every open cover of the closed bounded interval [a,b][a,b] has a finite subcover (Heine-Borel by bisection: every closed bounded interval [a,b][a,b] is compact).

[L4]

Every finite list of natural numbers has a greatest member: apply the finite-real maximum theorem to their canonical images, which preserve the natural-number order; finite choices can be made without any choice axiom (Every nonempty finite set of reals has a maximum and a minimum, The canonical natural ι(n)=n1F\iota(n) = n \cdot 1_F of a field, Canonical naturals are positive and strictly increasing, \le is a linear order on N\mathbb{N}, Every natural-number-indexed list of nonempty sets has a choice function on its family of values).

Proof

technique · direct
1.1

Fix a real ε>0\varepsilon>0. For each nNn\in\mathbb{N} put hn:=fnfh_n:=f_n-f and Un:={x[a,b]:hn(x)<ε}U_n:=\{x\in[a,b]:|h_n(x)|<\varepsilon\}. The function hnh_n is continuous by [L1], so [L2] makes UnU_n relatively open in [a,b][a,b].

L1L2construct
1.2

In the nondecreasing case, pointwise convergence forces fn(x)f(x)f_n(x)\le f(x) for every n,xn,x, and the errors f(x)fn(x)f(x)-f_n(x) decrease with nn; in the nonincreasing case it forces f(x)fn(x)f(x)\le f_n(x) and the errors fn(x)f(x)f_n(x)-f(x) decrease. Thus UnUn+1U_n\subseteq U_{n+1} in either case, and pointwise convergence gives nUn=[a,b]\bigcup_nU_n=[a,b].

givenalgebra
2.1

Let O\mathcal{O} be the family of all open sets ORO\subseteq\mathbb{R} whose trace O[a,b]O\cap[a,b] equals UnU_n for some nn. By step 1.1 each UnU_n has such an open witness, and by step 1.2 the family O\mathcal{O} covers [a,b][a,b].

step 1.1step 1.2L2construct
3.1

By [L3], choose finitely many O0,,OrOO_0,\dots,O_r\in\mathcal{O} covering [a,b][a,b]. By finite choice, choose n0,,nrn_0,\dots,n_r with Oi[a,b]=UniO_i\cap[a,b]=U_{n_i}, and let N:=max{n0,,nr}N:=\max\{n_0,\dots,n_r\}.

step 2.1L3L4choose
4.1

Since the UnU_n are increasing, every UniU_{n_i} is contained in UNU_N; the traces of the OiO_i cover [a,b][a,b], so UN=[a,b]U_N=[a,b], and then Uk=[a,b]U_k=[a,b] for every kNk\ge N.

step 1.2step 3.1
5.1

Therefore fk(x)f(x)<ε|f_k(x)-f(x)|<\varepsilon for every kNk\ge N and every x[a,b]x\in[a,b]. Since ε\varepsilon was arbitrary, the convergence is uniform.

step 4.1A1

Depends on

Used by

Dependency tree · next 3 levels

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