Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-generatedSession-authored (Fable 5 assisted)precheck 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.

If f:X×ZYf : X \times Z \to Y is continuous then its transpose F:ZC(X,Y)F : Z \to C(X,Y), F(z)(x)=f(x,z)F(z)(x) = f(x,z), is continuous for the compact-open topology, with no hypothesis on XX beyond being metric

Statement

Let (X,d)(X,d) be a metric space carrying its metric topology (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, Metrizable space: a topological space whose topology is induced by some metric; metrizability is topological, the metric is not), let ZZ and YY be topological spaces (Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison), and let

f:X×ZYf : X \times Z \to Y

be continuous, the product carrying the product topology (The product set iIXi\prod_{i \in I} X_i of functions choosing a point in each factor, the projections, the box topology, and the product topology as the initial topology of the projections; the empty product is a one-point space). For zZz \in Z define F(z):XYF(z) : X \to Y by F(z)(x):=f(x,z)F(z)(x) := f(x,z). Then:

  1. F(z)C(X,Y)F(z) \in C(X,Y) for every zZz \in Z;
  2. the transpose F:ZC(X,Y)F : Z \to C(X,Y) is continuous when C(X,Y)C(X,Y) carries the compact-open topology (The compact-open topology on C(X,Y)C(X,Y) for a metric domain XX, with subbasis S(K,V)={f:f[K]V}S(K,V) = \{f : f[K] \subseteq V\}).

No local compactness and no separation hypothesis is used, on any of the three spaces; XX is metric only because the compact-open topology is defined here over the compact subsets of a metric space. No choice principle is used.

Facts & Assumptions

Given: A metric space (X,d)(X,d) with its metric topology, topological spaces ZZ and YY, a continuous f:X×ZYf : X \times Z \to Y, and F(z)(x)=f(x,z)F(z)(x) = f(x,z).

[L7]

Tube lemma: for compact KXK \subseteq X, a point z0Zz_0 \in Z and an open NX×ZN \subseteq X \times Z with K×{z0}NK \times \{z_0\} \subseteq N there is an open WZW \subseteq Z with z0Wz_0 \in W and K×WNK \times W \subseteq N (Tube lemma: if KK is a compact subset of a metric space XX, ZZ is a topological space and NN is open in X×ZX \times Z with K×{z0}NK \times \{z_0\} \subseteq N, then K×WNK \times W \subseteq N for some open Wz0W \ni z_0).

[L8]

A subset of a topological space is open exactly when it is a neighbourhood of each of its points, that is when each of its points lies in an open set inside it (Neighbourhood of a point and neighbourhood base, with this library's convention that a neighbourhood need not be open, consequence 4).

Proof

technique · direct
1.1

Fix zZz \in Z and let jz:XX×Zj_z : X \to X \times Z be the map jz(x):=(x,z)j_z(x) := (x,z); its components are the identity of XX and the constant map at zz, both continuous, so jzj_z is continuous.

L1L3L4
2.1

F(z)=fjzF(z) = f \circ j_z, since (fjz)(x)=f(x,z)=F(z)(x)(f \circ j_z)(x) = f(x,z) = F(z)(x) for every xXx \in X; hence F(z)F(z) is continuous and F(z)C(X,Y)F(z) \in C(X,Y), which is claim 1.

step 1.1L2
3.1

For claim 2 it suffices, by [L5] and [L6], to show that F1[S(K,V)]F^{-1}[S(K,V)] is open in ZZ for every compact KXK \subseteq X and every open VYV \subseteq Y.

step 2.1L5L6suffices: preimages of subbasic sets are open
3.2

Unwinding the definitions, F1[S(K,V)]={zZ:F(z)[K]V}={zZ:f(x,z)V for every xK}F^{-1}[S(K,V)] = \{\, z \in Z : F(z)[K] \subseteq V \,\} = \{\, z \in Z : f(x,z) \in V \text{ for every } x \in K \,\}.

step 2.1L6
4.1

Let z0F1[S(K,V)]z_0 \in F^{-1}[S(K,V)] and put N:=f1[V]N := f^{-1}[V], an open subset of X×ZX \times Z; by step 3.2 every xKx \in K satisfies f(x,z0)Vf(x,z_0) \in V, that is K×{z0}NK \times \{z_0\} \subseteq N.

step 3.2L9
5.1

The tube lemma applied to KK, z0z_0 and NN gives an open WZW \subseteq Z with z0Wz_0 \in W and K×WNK \times W \subseteq N.

step 4.1L7choose
6.1

Every zWz \in W then satisfies f(x,z)Vf(x,z) \in V for every xKx \in K, that is zF1[S(K,V)]z \in F^{-1}[S(K,V)]; so WW is an open set with z0WF1[S(K,V)]z_0 \in W \subseteq F^{-1}[S(K,V)].

step 3.2step 4.1step 5.1
7.1

As z0z_0 was an arbitrary point of F1[S(K,V)]F^{-1}[S(K,V)], that set is open in ZZ; by step 3.1 this proves claim 2.

step 3.1step 6.1L8

Remarks

  • The tube lemma is the entire content. The condition defining F1[S(K,V)]F^{-1}[S(K,V)] is "the whole slice K×{z}K \times \{z\} lands in VV", and openness of that condition in zz is exactly the statement that a neighbourhood of a slice contains a tube. Everything else is unwinding.

  • This half of the exponential law is the cheap half. It needs no hypothesis on XX beyond compactness being available for its subsets, and none at all on ZZ or YY. The converse half — that every continuous F:ZC(X,Y)F : Z \to C(X,Y) arises from a continuous ff — runs through continuity of the evaluation map and is where local compactness of XX is spent.

  • The map FF determines ff and conversely, as functions. That the assignment fFf \mapsto F is injective, and that under the local compactness hypothesis it is onto the continuous maps ZC(X,Y)Z \to C(X,Y), is the exponential law below; this theorem is the statement that the assignment lands in the right place.

Depends on

Used by

Dependency tree · next 3 levels

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