Alphabeta Math
False statementConstruction: AI-adaptedVerification: AI-generatedSession-authored (Fable 5 assisted)precheck passverified 2026-08-05 (claude-sonnet-5)
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.

FALSE: a pointwise convergent sequence of continuous functions converges uniformly on every compact set

Statement

False claim: for metric spaces XX and YY, if a sequence (fk)(f_k) in C(X,Y)C(X,Y) converges pointwise to fC(X,Y)f \in C(X,Y) (A sequence converges in the topology of pointwise convergence exactly when it converges at every point), then (fk)(f_k) converges to ff uniformly on every compact subset of XX, that is fkff_k \to f in the topology of compact convergence (The topology of compact convergence on C(X,Y)C(X,Y) for metric XX and YY: uniform convergence on each compact subset of XX).

The claim fails already on the compact space X=[0,1]X = [0,1] with Y=RY = \mathbb{R}, where it reduces to "pointwise convergence implies uniform convergence". The refutation below writes down the standard moving spike explicitly. The relation that is true is the inclusion of topologies (On C(X,Y)C(X,Y) with XX and YY metric, uniform convergence is finer than compact convergence, which is finer than pointwise convergence): compact convergence implies pointwise convergence, and not the reverse.

No choice principle is used; every function below is given by a formula.

Facts & Assumptions

Given: The interval X:=[0,1]={tR:0t1}X := [0,1] = \{\, t \in \mathbb{R} : 0 \le t \le 1 \,\} (Intervals of R\mathbb{R}: the nine order-convex forms, nondegeneracy, and length) with the metric d(s,t)=std(s,t) = |s-t| inherited from R\mathbb{R} (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, Isometry, isometric embedding, and the subspace metric on a subset), the target Y:=RY := \mathbb{R} with the same metric, the reals ak:=1/ι(k+2)a_k := 1/\iota(k+2) for kNk \in \mathbb{N} (The canonical natural ι(n)=n1F\iota(n) = n \cdot 1_F of a field), and the constant function 0:XR\mathbf{0} : X \to \mathbb{R} with value 00.

[L1]

ι\iota is strictly increasing on N\mathbb{N} and ι(n)>0\iota(n) > 0 for n1n \ge 1, so 0<ak1/ι(2)=1/20 < a_k \le 1/\iota(2) = 1/2 and 0<2ak10 < 2a_k \le 1 for every kNk \in \mathbb{N}, and mnm \le n gives anama_n \le a_m (The canonical natural ι(n)=n1F\iota(n) = n \cdot 1_F of a field, Canonical naturals are positive and strictly increasing, Inverses of positives are positive, and reciprocation reverses order).

[L2]

For every real ε>0\varepsilon > 0 there is a natural m1m \ge 1 with 1/ι(m)<ε1/\iota(m) < \varepsilon (For every ε>0\varepsilon > 0 in a complete ordered field there is a natural n1n \ge 1 with 1/n<ε1/n < \varepsilon).

[L7]

The basic sets of the topology of compact convergence are BK(f,ε)={g:d(f(x),g(x))<ε for every xK}B_K(f,\varepsilon) = \{\, g : d(f(x),g(x)) < \varepsilon \text{ for every } x \in K \,\}, and a sequence converging to ff in a topology is eventually inside every neighbourhood of ff (The topology of compact convergence on C(X,Y)C(X,Y) for metric XX and YY: uniform convergence on each compact subset of XX, The topology of pointwise convergence on YXY^{X}, which is the product topology, and its restriction to C(X,Y)C(X,Y)).

Refutation

technique · direct
1.1

[0,1][0,1] is bounded, being contained in the ball B(0,2)B(0,2) of R\mathbb{R}, and closed in R\mathbb{R}, since a point y<0y < 0 has B(y,y)B(y,-y) inside the complement and a point y>1y > 1 has B(y,y1)B(y, y-1) inside the complement; so [0,1][0,1] is a compact subset of R\mathbb{R} and (X,d)(X,d) is a compact metric space.

L5L6
1.2

For kNk \in \mathbb{N} define fk:XRf_k : X \to \mathbb{R} by fk(t):=t/akf_k(t) := t/a_k for 0tak0 \le t \le a_k, by fk(t):=2t/akf_k(t) := 2 - t/a_k for akt2aka_k \le t \le 2a_k, and by fk(t):=0f_k(t) := 0 for 2akt12a_k \le t \le 1.

constructL1
2.1

The three formulas agree where their domains overlap: at t=akt = a_k both of the first two give 11, and at t=2akt = 2a_k both of the last two give 00; so fkf_k is a well-defined function on XX, the three closed sets [0,ak][0,a_k], [ak,2ak][a_k,2a_k] and [2ak,1][2a_k,1] covering XX because 0<2ak10 < 2a_k \le 1.

step 1.2L1
2.2

fk(0)=0f_k(0) = 0 for every kk, from the first formula.

step 1.2
2.3

For tXt \in X with t>0t > 0: by [L2] there is a natural m1m \ge 1 with 1/ι(m)<t/21/\iota(m) < t/2, and then every kmk \ge m has k+2>mk + 2 > m, hence ak=1/ι(k+2)1/ι(m)<t/2a_k = 1/\iota(k+2) \le 1/\iota(m) < t/2, hence 2ak<t2a_k < t and fk(t)=0f_k(t) = 0 by the third formula.

step 1.2L1L2
2.4

On the other hand fk(ak)=ak/ak=1f_k(a_k) = a_k/a_k = 1 for every kNk \in \mathbb{N}, and akXa_k \in X because 0<ak1/210 < a_k \le 1/2 \le 1.

step 1.2L1
3.1

Each of the three restrictions is the restriction of an affine map of R\mathbb{R}, hence continuous; so fkf_k is continuous on XX by the pasting lemma for a finite closed cover, and fkC(X,R)f_k \in C(X,\mathbb{R}).

step 1.2step 2.1L3L4
3.2

By steps 2.2 and 2.3 the sequence (fk(t))(f_k(t)) is eventually 00 for every tXt \in X, so fk(t)0=0(t)f_k(t) \to 0 = \mathbf{0}(t) for every tXt \in X; that is, (fk)(f_k) converges pointwise to 0\mathbf{0}, which is continuous, being constant.

step 2.2step 2.3L3
3.3

Hence for every kNk \in \mathbb{N} the value fk(ak)0(ak)=1|f_k(a_k) - \mathbf{0}(a_k)| = 1 is not below 1/21/2, so fkBX(0,1/2)f_k \notin B_{X}(\mathbf{0}, 1/2), while BX(0,1/2)B_{X}(\mathbf{0},1/2) is a basic open set of the topology of compact convergence containing 0\mathbf{0}, the whole space XX being compact by step 1.1.

step 1.1step 2.4L7
4.1

So no tail of (fk)(f_k) lies in the neighbourhood BX(0,1/2)B_X(\mathbf{0},1/2) of 0\mathbf{0}: the sequence does not converge to 0\mathbf{0} in the topology of compact convergence, although by step 3.2 it converges to 0\mathbf{0} pointwise.

step 3.2step 3.3L7
5.1

The pair (X,Y)=([0,1],R)(X,Y) = ([0,1],\mathbb{R}) with the sequence (fk)(f_k) and the limit 0\mathbf{0} therefore satisfies the hypothesis of the claim and violates its conclusion at the compact set K=XK = X, so the claim is false.

step 3.2step 4.1

Remarks

  • The failure is not about the size of the domain. The domain here is compact, so "uniformly on every compact set" is the same as "uniformly", and the witness shows that pointwise convergence does not give uniform convergence even there. What moves is the place where the two functions differ: the spike has height 11 for every kk and merely slides towards 00.

  • The area under the spike does tend to 00, so this witness does not also separate the integral from its pointwise limit: the standard warning that pointwise convergence controls no integral needs a spike whose height grows as its base shrinks. Nothing about integration is claimed here.

  • What is true in this direction. Uniform convergence implies convergence on every compact set, which implies pointwise convergence (On C(X,Y)C(X,Y) with XX and YY metric, uniform convergence is finer than compact convergence, which is finer than pointwise convergence); the reverse of each implication fails, and the companion page separates the two rightmost topologies with a different witness on R\mathbb{R}.

  • The index shift is not cosmetic. N\mathbb{N} contains 00, so the spike is built on 1/ι(k+2)1/\iota(k+2) and not on 1/k1/k: at k=0k = 0 the reciprocal 1/ι(1)1/\iota(1) would give a support [0,2][0,2] reaching outside [0,1][0,1], and the pasting lemma would have nothing to paste.

Depends on

Used by

Dependency tree · next 3 levels

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