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.

The moving spikes on [0,1] converge pointwise to 0, do not converge uniformly, and do not converge in the topology of compact convergence

Example

Let I:=[0,1] with the metric inherited from R, let ak:=1/ι(k+2) for k∈N (The canonical natural ι(n)=n⋅1F of a field), and let fk:I→R be the moving spike

fk(t)=tak  (0≤t≤ak),fk(t)=2−tak  (ak≤t≤2ak),fk(t)=0  (2ak≤t≤1),

which is exactly the family built in FALSE: a pointwise convergent sequence of continuous functions converges uniformly on every compact set: each fk is continuous, and (fk) converges pointwise to the constant function 0, which is continuous. Write ρˉ for the uniform metric on RI (For a nonempty set X and a metric space (Y,d) the uniform metric ρˉ(f,g)=sup⁡xmin⁡{d(f(x),g(x)),1} is a metric on YX).

This example traces the one family through all three topologies of the A page:

  1. fk→0 in the topology of pointwise convergence (The topology of pointwise convergence on YX, which is the product topology, and its restriction to C(X,Y));
  2. ρˉ(fk,0)=1 for every k, so (fk) does not converge to 0 in the topology of uniform convergence (Uniform convergence, and the topology of uniform convergence: the metric topology of the uniform metric on YX and on C(X,Y));
  3. (fk) does not converge to 0 in the topology of compact convergence either (The topology of compact convergence on C(X,Y) for metric X and Y: uniform convergence on each compact subset of X).

So the two inclusions of On C(X,Y) with X and Y metric, uniform convergence is finer than compact convergence, which is finer than pointwise convergence are strict on C(I,R) at the leftmost step: pointwise convergence is strictly weaker than convergence on compact sets. The two rightmost topologies coincide here, because I is itself compact; separating those two needs a domain that is not compact, and the next counterexample on this page does it on R.

Facts & Assumptions

Given: I=[0,1] with the metric d(s,t)=∣s−t∣, the reals ak=1/ι(k+2), the spikes fk displayed above, the constant function 0, and the truncated metric dˉ=min⁡{d,1} on R.

[L2]

0≤fk(t)≤1 for every t∈I: on [0,ak] the value t/ak lies between 0 and 1, on [ak,2ak] the value 2−t/ak does, and on [2ak,1] it is 0 (Maximum and minimum of a set, Every nonempty finite set of reals has a maximum and a minimum).

[L5]

A sequence converges in the topology of pointwise convergence exactly when it converges at every point (A sequence converges in the topology of pointwise convergence exactly when it converges at every point).

[L6]

The topology of uniform convergence is finer than the topology of compact convergence, which is finer than the topology of pointwise convergence, so convergence in a finer topology implies convergence in a coarser one (On C(X,Y) with X and Y metric, uniform convergence is finer than compact convergence, which is finer than pointwise convergence).

Verification

technique · direct
1.1

(fk) converges to 0 at every point of I, hence in the topology of pointwise convergence; this is claim 1.

L1L5
1.2

For every k and every t∈I: ∣fk(t)−0(t)∣=fk(t)≤1, so dˉ(fk(t),0(t))=fk(t).

L2L3
2.1

Hence 1 is an upper bound of { dˉ(fk(t),0(t)):t∈I } and the value 1 is attained at t=ak∈I, so ρˉ(fk,0)=1 for every k∈N.

step 1.2L1L2L3
3.1

Therefore no index K makes ρˉ(fk,0)<1/2 for k≥K, so (fk) does not converge to 0 in the uniform metric and hence not in the topology of uniform convergence; this is claim 2.

step 2.1L4
3.2

I is compact and ∣fk(ak)−0(ak)∣=1, so fk∉BI(0,1/2) for every k, while BI(0,1/2) is a member of a neighbourhood base at 0 in the topology of compact convergence; so no tail of (fk) lies in that neighbourhood and (fk) does not converge to 0 there, which is claim 3.

step 2.1L1L7
4.1

Claims 1 and 3 together show that convergence in the topology of pointwise convergence does not imply convergence in the topology of compact convergence, so the leftmost inclusion of the comparison theorem is strict on C(I,R).

step 1.1step 3.2L6∎

Remarks

  • Nothing is lost and nothing is gained by the truncation. The uniform metric truncates distances at 1, and here the spikes never exceed 1, so ρˉ(fk,0) is the honest supremum of ∣fk∣. A family of spikes of height 5 would have ρˉ=1 as well, which is exactly the sense in which the uniform metric records "not close" without recording how far.

  • The failure is at a moving point. For each fixed t the values fk(t) are eventually 0; what prevents a single index from serving every t is that the place where fk equals 1 depends on k and never disappears. That is the quantifier order of Uniform convergence, and the topology of uniform convergence: the metric topology of the uniform metric on YX and on C(X,Y), seen in one family.

  • On this domain the two right-hand topologies cannot be separated. Since I=[0,1] is compact, K=I is an admissible compact set and convergence on every compact subset of I is convergence on I itself, that is uniform convergence. Separating them needs a domain that is not compact, and the next counterexample on this page uses R.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

93 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