Alphabeta Math
False statementConstruction: 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.

FALSE: the evaluation map on C(X,Y) with the compact-open topology is continuous for every metric X

Statement

False claim: for every metric space X and every topological space Y the evaluation map e:C(X,Y)×X→Y, e(f,x)=f(x) (The evaluation map e:C(X,Y)×X→Y, e(f,x)=f(x)), is continuous when C(X,Y) carries the compact-open topology (The compact-open topology on C(X,Y) for a metric domain X, with subbasis S(K,V)={f:f[K]⊆V}).

The witness is X=Q, the rationals inside R with the metric d(s,t)=∣s−t∣, and Y=R with the same metric. The load-bearing fact is that a compact subset of Q has empty interior in Q: it is closed in R, and a subset of Q closed in R that contained a Q-ball would contain a whole real interval, which is uncountable while Q is not.

What the true theorem on this page requires is therefore not decoration. Continuity of the evaluation map is proved here under the hypothesis that X is locally compact (Locally compact metric space: every point has a compact neighbourhood, If X is a locally compact metric space then the evaluation map is continuous for the compact-open topology), and Q is a metric space that is locally compact at no point, exactly because of the fact just named.

No choice principle is used.

Facts & Assumptions

Given: The rationals Q inside R with the metric d(s,t)=∣s−t∣ (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), the target R with the same metric, the constant function z:Q→R with value 0, and the open interval V:=(−1,1) (Intervals of R: the nine order-convex forms, nondegeneracy, and length).

[L2]

A union of two closed subsets of a metric space is closed, its complement being an intersection of two open sets; iterating covers any finite list, and ∅ is closed (Arbitrary unions and finite intersections of open sets are open, open balls are open and closed balls are closed, The metric topology: a set is open when every one of its points has a ball around it inside the set; closed means open complement).

[L3]

Strictly between any two reals lies a rational (The rationals embed densely in the reals).

[L4]

For nonempty A the closure is A‾={ x:d(x,A)=0 }, a closed set equals its closure and contains it, and d(x,A)≥0 with d(x,A)≤d(x,a) for every a∈A; d(x,A)=0 when x∈A (The closure of a nonempty A is {x:d(x,A)=0}, equals A together with its limit points, and is the smallest closed superset, Bounded subset, diameter, distance from a point to a set, and distance between two sets in a metric space, Greatest lower bound (infimum)).

[L5]

Every nondegenerate open interval of R is uncountable, Q is at most countable, and a subset of an at most countable set is at most countable (Every nondegenerate interval of R is uncountable, Q is countably infinite, Every subset of an at most countable set is at most countable, Finite, countably infinite, countable, uncountable).

[L9]

The minimum of a two-element set of reals exists, is one of them, and is at most each of them (Every nonempty finite set of reals has a maximum and a minimum, Maximum and minimum of a set).

Refutation

technique · contradiction
1.1

Suppose the claim holds; in particular, with X:=Q and Y:=R, the evaluation map e:C(Q,R)×Q→R is continuous.

assume-contra
1.2

The constant function z is continuous, and e(z,0)=0∈V with V open in R.

givenL6L8
2.1

Continuity of e at the point (z,0) gives, by the two bases of [L7], a natural n, compact sets K0,…,Kn−1⊆Q, open sets V0,…,Vn−1⊆R and an open U⊆Q with 0∈U, such that z∈O:=S(K0,V0)∩⋯∩S(Kn−1,Vn−1) and e[O×U]⊆V.

step 1.1step 1.2L7choose
3.1

Fix a real ε>0 with BQ(0,ε)⊆U.

step 2.1L8choose
3.2

Put K:=K0∪⋯∪Kn−1, with K:=∅ when n=0; each Kj is a compact subset of R and hence closed in R, so K is a subset of Q closed in R.

step 2.1L1L2
4.1

BQ(0,ε)⊈K: otherwise (−ε,ε)∩Q⊆K, and this set is nonempty since it contains 0; every t∈(−ε,ε) then satisfies d(t,(−ε,ε)∩Q)=0, because for a real s>0 the set (max⁡{t−s,−ε}, min⁡{t+s,ε}) is a nondegenerate open interval and so contains a rational within s of t; hence t lies in the closure of that set, which the closed K contains, so (−ε,ε)⊆K⊆Q, making the uncountable interval (−ε,ε) at most countable, which is false.

step 3.2L3L4L5L8L9
5.1

Fix q∈BQ(0,ε) with q∉K.

step 4.1choose
6.1

Put η:=min⁡{d(q,K), 1} when K≠∅ and η:=1 when K=∅; then 0<η≤1, because K closed in R and q∉K give q∉K‾ and hence d(q,K)≠0, while d(q,K)≥0; and ∣q−t∣≥d(q,K)≥η for every t∈K.

step 3.2step 5.1L4L9
6.2

q∈U, since ∣q−0∣<ε puts q in BQ(0,ε)⊆U.

step 3.1step 5.1
7.1

Put A:={ s∈Q:∣s−q∣≥η }, which is nonempty because q+1∈Q and ∣(q+1)−q∣=1≥η, and define g:Q→R by g(s):=(2/η) d(s,A).

step 6.1constructL4
8.1

g is Lipschitz with constant 2/η, hence continuous, so g∈C(Q,R).

step 7.1L6
8.2

g vanishes on K: every t∈K lies in Q and satisfies ∣t−q∣≥η by step 6.1, so t∈A and d(t,A)=0.

step 6.1step 7.1L4
8.3

g(q)≥2: every s∈A satisfies ∣q−s∣≥η, so η is a lower bound of the distances from q to the members of A and d(q,A)≥η, whence g(q)=(2/η) d(q,A)≥2.

step 7.1L4
9.1

g∈O: for each j<n with Kj≠∅ we have z∈S(Kj,Vj), so 0∈Vj, and g[Kj]⊆{0}⊆Vj by step 8.2 since Kj⊆K; for Kj=∅ the condition is vacuous; and for n=0 the set O is the whole of C(Q,R).

step 2.1step 3.2step 8.1step 8.2
10.1

Hence (g,q)∈O×U while e(g,q)=g(q)≥2, so e(g,q)∉(−1,1)=V, contradicting e[O×U]⊆V of step 2.1; the assumption of step 1.1 is therefore false, and the claim fails for X=Q and Y=R.

step 2.1step 8.3step 9.1step 6.2discharge-contradiction∎

Remarks

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

125 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