Alphabeta Math
CounterexampleConstruction: AI-adaptedVerification: AI-adaptedprecheck passverified 2026-09-09 (gpt-6-astra)
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.

Refuted: C(X,Y) is closed in the topology of pointwise convergence. The ramps on [0,1] converge pointwise to a discontinuous limit

Statement refuted

Refuted claim: for a topological space X and a metric space Y the set C(X,Y) is closed in YX for the topology of pointwise convergence (The topology of pointwise convergence on YX, which is the product topology, and its restriction to C(X,Y)). In particular, this would imply that every pointwise limit of a sequence of continuous functions is continuous.

The witness is the sequence of ramps on I:=[0,1]. With ak:=1/ι(k+2) (The canonical natural ι(n)=n⋅1F of a field), so that 0<ak≤1/2, define rk:I→R by

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

Each rk is continuous, the sequence (rk) converges pointwise to the indicator function

χ(t):=0 (t<1),χ(1):=1,

and χ is not continuous at 1. So C(I,R) is not closed in RI for the topology of pointwise convergence.

The sequence is moreover pointwise nonincreasing, rk+1(t)≤rk(t) for every t∈I and every k∈N (step 2.1 below). That is recorded here because it is the configuration Dini's theorem rules out on a compact domain when the limit is continuous; here the limit is not continuous, and the conclusion of Dini's theorem fails.

This is exactly what the uniform topology repairs. For the uniform metric C(X,Y) is closed (A uniform limit of continuous functions is continuous, so C(X,Y) is closed in YX under the uniform metric, claim 3), so the convergence above cannot be uniform. Explicitly, for 0<η<1, take t=1−ηak<1. Then χ(t)=0 and rk(t)=1−η. Since both functions take values in [0,1], this proves sup⁡t∈I∣rk(t)−χ(t)∣=1 for every k. The supremum is not attained: below 1 the ramp is less than 1, and at 1 the difference is zero.

Facts & Assumptions

Given: I=[0,1] with the metric d(s,t)=∣s−t∣ inherited from R (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, Isometry, isometric embedding, and the subspace metric on a subset, Intervals of R: the nine order-convex forms, nondegeneracy, and length), the target R with the same metric, the reals ak=1/ι(k+2), the ramps rk and the indicator χ displayed above.

[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/ι(2)=1/2 and 1/2≤1−ak<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<ε).

[L7]

A two-element set of reals has a maximum and a minimum, each of which is one of the two elements (Every nonempty finite set of reals has a maximum and a minimum, Maximum and minimum of a set).

Counterexample

technique · direct
1.1

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

L1L3L4
1.2

rk(1)=(1−(1−ak))/ak=1 for every k.

L1
1.3

Let t∈I with t<1; by [L2] there is a natural m≥1 with 1/ι(m)<1−t, and then every k≥m has ak=1/ι(k+2)≤1/ι(m)<1−t, hence t<1−ak and rk(t)=0.

L1L2
1.4

χ is not continuous at 1: take ε:=1/2 and let δ>0 be any real. Put s:=1−min⁡{δ/2,1/2}. Then 1/2≤s<1 and ∣s−1∣=min⁡{δ/2,1/2}≤δ/2<δ, yet ∣χ(s)−χ(1)∣=1, which is not below 1/2.

L6L7
2.1

(rk) is pointwise nonincreasing: for t≤1−ak+1 one has rk+1(t)=0≤rk(t), the values of rk being nonnegative; and for t>1−ak+1, which forces t>1−ak since ak+1<ak, writing u:=1−t with 0≤u<ak+1 gives rk(t)=1−u/ak and rk+1(t)=1−u/ak+1, and ak+1<ak gives u/ak≤u/ak+1, hence rk+1(t)≤rk(t). This includes t=1, where u=0 and both ramps equal 1.

step 1.1L1
2.2

By steps 1.2 and 1.3 the sequence (rk(t)) is eventually equal to χ(t) for every t∈I, so rk(t)→χ(t) for every t, and therefore rk→χ in the topology of pointwise convergence on RI.

step 1.2step 1.3L5
3.1

So χ∉C(I,R) although χ is a limit in the topology of pointwise convergence of a sequence in C(I,R); hence C(I,R) is not closed in that topology, and the claim is false.

step 1.1step 2.2step 1.4∎

Remarks

  • Monotonicity is not what fails. Step 2.1 shows the ramps decrease pointwise to χ on the compact domain I, with every rk continuous; the only hypothesis of Dini's theorem that is missing is continuity of the limit, and its conclusion, uniform convergence, fails. The last example on this page uses this family for exactly that contrast.

  • Closedness in the pointwise topology is not a mild question. The set C(I,R) is in fact dense in RI for the topology of pointwise convergence, since a basic neighbourhood constrains only finitely many values and any finite list of values is realised by a continuous function. Nothing above needs that, and it is not proved here.

  • What survives is the uniform statement. Convergence in the uniform metric does force continuity of the limit (A uniform limit of continuous functions is continuous, so C(X,Y) is closed in YX under the uniform metric), so the failure above is a failure of the topology, not of the limit operation: the same sequence, tested against a stronger notion of convergence, simply does not converge.

Depends on

Used by

Dependency tree · two levels

78 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