Alphabeta Math
ExampleConstruction: AI-adaptedVerification: 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 applied to a nondecreasing sequence of piecewise linear approximations on [0,1], and what fails when the limit is not continuous

Example

Let I:=[0,1] with the metric inherited from R and let ak:=1/ι(k+2) (The canonical natural ι(n)=n⋅1F of a field), so 0<ak≤1/2 and 1/2≤1−ak<1. Define the clipped identities

sk(t):=t  (0≤t≤1−ak),sk(t):=1−ak  (1−ak≤t≤1).

Then:

  1. each sk is continuous on the compact space I, and the sequence is nondecreasing at every point: sk(t)≤sk+1(t);
  2. sk(t)→t for every t∈I, and the limit function idI:t↦t is continuous;
  3. therefore Dini's theorem (Dini's theorem: on a compact metric space a nondecreasing sequence of continuous real functions converging pointwise to a continuous limit converges uniformly) applies and (sk) converges to idI uniformly — which is confirmed by the direct estimate ∣sk(t)−t∣≤ak for every t.

And the hypothesis that the limit is continuous cannot be dropped. The ramps rk of Refuted: C(X,Y) is closed in the topology of pointwise convergence. The ramps on [0,1] converge pointwise to a discontinuous limit are continuous on the same compact I and pointwise nonincreasing, and they converge pointwise to the indicator of {1}, which is not continuous; the conclusion of Dini's theorem fails for them, since a uniform limit of continuous functions would be continuous. So on a compact domain, with monotonicity and with continuity of every term, continuity of the limit is exactly the missing hypothesis, and it is not implied by the others.

Facts & Assumptions

[L1]

ι is strictly increasing on N with ι(n)>0 for n≥1, and 0<u≤v gives 0<1/v≤1/u; hence 0<ak+1≤ak≤1/2 and 1/2≤1−ak≤1−ak+1<1 (The canonical natural ι(n)=n⋅1F of a field, Canonical naturals are positive and strictly increasing, Inverses of positives are positive, and reciprocation reverses order).

[L2]

For every real η>0 there is a natural m≥1 with 1/ι(m)<η (For every ε>0 in a complete ordered field there is a natural n≥1 with 1/n<ε).

[L8]

The ramps rk on I are continuous, are pointwise nonincreasing, and converge pointwise to the indicator χ of {1}, which is not continuous (Refuted: C(X,Y) is closed in the topology of pointwise convergence. The ramps on [0,1] converge pointwise to a discontinuous limit).

[L9]

The maximum and the minimum of a two-element set of reals exist and are among its elements (Every nonempty finite set of reals has a maximum and a minimum, Maximum and minimum of a set).

Verification

technique · direct
1.1

The two formulas for sk agree at t=1−ak, both giving 1−ak, and the closed sets [0,1−ak] and [1−ak,1] cover I since 0<1−ak<1; each restriction is the restriction of an affine map of R, so sk is a well-defined continuous function on I.

L1L3L4
1.2

sk(t)=min⁡{t, 1−ak} for every t∈I: for t≤1−ak the minimum is t, and for t≥1−ak it is 1−ak.

L1L9
2.1

sk(t)≤sk+1(t) for every t and k, since 1−ak≤1−ak+1 makes min⁡{t,1−ak}≤min⁡{t,1−ak+1}; with step 1.1 this is claim 1.

step 1.1step 1.2L1L9
2.2

0≤t−sk(t)≤ak for every t∈I: for t≤1−ak the difference is 0, and for t>1−ak it is t−(1−ak)≤1−(1−ak)=ak.

step 1.2L1
3.1

Let ε>0 be real; by [L2] there is a natural m≥1 with 1/ι(m)<ε, and every k≥m has ak=1/ι(k+2)≤1/ι(m)<ε, so ∣sk(t)−t∣≤ak<ε for every t∈I.

step 2.2L1L2
4.1

In particular sk(t)→t for every t∈I, and idI is continuous, being the restriction of an affine map; this is claim 2.

step 3.1L3
5.1

I is a compact metric space, every sk is continuous, the sequence is pointwise nondecreasing and its pointwise limit idI is continuous, so Dini's theorem applies and (sk) converges to idI uniformly; step 3.1 exhibits the same conclusion directly, an index m serving every point at once.

step 2.1step 3.1step 4.1L5L6L7
6.1

For the failure clause, the ramps rk are continuous on the same compact I and pointwise nonincreasing with pointwise limit the discontinuous χ; were the convergence uniform, the limit would be continuous, so it is not uniform, and the conclusion of Dini's theorem fails for a family satisfying every one of its hypotheses except continuity of the limit.

step 5.1L5L7L8∎

Remarks

  • Dini's theorem is not needed for the positive half, and that is the point. Step 3.1 proves uniform convergence of (sk) by hand, because the discrepancy t−sk(t) is bounded by ak independently of t. The example is worth stating because the general theorem gives the same conclusion from hypotheses that never mention a uniform bound: compactness, monotonicity, and continuity of the terms and of the limit.

  • Each hypothesis of Dini's theorem is doing something. Continuity of the limit fails for the ramps, and the conclusion fails with it. Compactness cannot be dropped either, though this page does not construct a witness for that. Monotonicity cannot be dropped: the moving spikes earlier on this page are continuous on the compact I, converge pointwise to the continuous 0, and do not converge uniformly, and they are not monotone at any point where the spike passes.

  • The nonincreasing form is the one the ramps illustrate, and it is the form obtained from Dini's theorem: on a compact metric space a nondecreasing sequence of continuous real functions converging pointwise to a continuous limit converges uniformly by applying it to the negatives of the functions, as that item's Statement records. Nothing here needs a separate proof.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

105 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