Alphabeta Math
ExampleConstruction: AI-adaptedVerification: 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.

The map (x,z)xz(x,z) \mapsto x \cdot z on R×R\mathbb{R} \times \mathbb{R} and its transpose z(xxz)z \mapsto (x \mapsto x \cdot z) traced through the exponential law

Example

Take X:=RX := \mathbb{R}, Z:=RZ := \mathbb{R} and Y:=RY := \mathbb{R}, all with the usual metric (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), and let

f:R×RR,f(x,z):=xz.f : \mathbb{R} \times \mathbb{R} \to \mathbb{R}, \qquad f(x,z) := x \cdot z .

Write F:=Φ(f)F := \Phi(f) for its transpose, so F(z)(x)=xzF(z)(x) = x \cdot z: each F(z)F(z) is the multiplication-by-zz map of R\mathbb{R}. This example checks every clause of the exponential law (The exponential law: for a locally compact metric XX and any spaces ZZ and YY, transposition is a bijection between C(X×Z,Y)C(X \times Z, Y) and C(Z,C(X,Y))C(Z, C(X,Y)) with the compact-open topology) by hand on this pair:

  1. ff is continuous on R×R\mathbb{R} \times \mathbb{R} with 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);
  2. each F(z)F(z) is continuous, being Lipschitz with constant z|z|, so F(z)C(R,R)F(z) \in C(\mathbb{R},\mathbb{R});
  3. F:RC(R,R)F : \mathbb{R} \to C(\mathbb{R},\mathbb{R}) is continuous for the compact-open topology, directly: if zz0<ε/ι(m)|z - z_0| < \varepsilon/\iota(m) then F(z)B[m,m](F(z0),ε)F(z) \in B_{[-m,m]}(F(z_0), \varepsilon);
  4. R\mathbb{R} is locally compact, so the exponential law applies and Φ\Phi is a bijection C(R×R,R)C(R,C(R,R))C(\mathbb{R} \times \mathbb{R}, \mathbb{R}) \to C(\mathbb{R}, C(\mathbb{R},\mathbb{R})) whose inverse returns ff from FF.

Claim 3 is the content of 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 in this instance, verified without the tube lemma; claim 4 is where If XX is a locally compact metric space then the evaluation map is continuous for the compact-open topology is spent.

Facts & Assumptions

Given: R\mathbb{R} with d(s,t)=std(s,t) = |s-t|; the product R×R\mathbb{R} \times \mathbb{R} with the product topology; the map f(x,z)=xzf(x,z) = xz and its transpose FF; and for a natural m1m \ge 1 the interval [m,m]={t:ι(m)tι(m)}[-m,m] = \{\, t : -\iota(m) \le t \le \iota(m) \,\} (Intervals of R\mathbb{R}: the nine order-convex forms, nondegeneracy, and length, The canonical natural ι(n)=n1F\iota(n) = n \cdot 1_F of a field).

[L2]

uv=uv|uv| = |u||v|, u+vu+v|u+v| \le |u|+|v|, and u0|u| \ge 0 (Basic properties of the absolute value, The triangle inequality, Absolute value in an ordered field).

[L7]

R\mathbb{R} is locally compact if every point has a compact set containing a ball around it; and then the exponential law holds for X=RX = \mathbb{R} and arbitrary Z,YZ, Y, with Φ\Phi a bijection whose inverse sends FF to (x,z)F(z)(x)(x,z) \mapsto F(z)(x) (Locally compact metric space: every point has a compact neighbourhood, The exponential law: for a locally compact metric XX and any spaces ZZ and YY, transposition is a bijection between C(X×Z,Y)C(X \times Z, Y) and C(Z,C(X,Y))C(Z, C(X,Y)) with the compact-open topology, The evaluation map e:C(X,Y)×XYe : C(X,Y) \times X \to Y, e(f,x)=f(x)e(f,x) = f(x), Injection, surjection, bijection).

Verification

technique · direct
1.1

For claim 1, fix (x0,z0)R×R(x_0,z_0) \in \mathbb{R} \times \mathbb{R} and a real ε0>0\varepsilon_0 > 0, and put δ:=min{1, ε0/(x0+z0+1)}\delta := \min\{1,\ \varepsilon_0/(|x_0| + |z_0| + 1)\}, a real with 0<δ10 < \delta \le 1.

L1L2choose
1.2

For fixed zz the map F(z):xxzF(z) : x \mapsto xz satisfies xzxz=zxx|xz - x'z| = |z||x-x'|, so it is Lipschitz with constant z|z| and continuous; this is claim 2.

L2L4
1.3

For claim 3, fix z0Rz_0 \in \mathbb{R} and a neighbourhood NN of F(z0)F(z_0) in the compact-open topology; there are a compact KK and a real ε>0\varepsilon > 0 with BK(F(z0),ε)NB_K(F(z_0),\varepsilon) \subseteq N, and a natural m1m \ge 1 with K[m,m]K \subseteq [-m,m], so B[m,m](F(z0),ε)BK(F(z0),ε)NB_{[-m,m]}(F(z_0),\varepsilon) \subseteq B_K(F(z_0),\varepsilon) \subseteq N.

L5choose
1.4

For claim 4: given xRx \in \mathbb{R} take a natural m1m \ge 1 with x+1<ι(m)|x| + 1 < \iota(m); then [m,m][-m,m] is compact and B(x,1)[m,m]B(x,1) \subseteq [-m,m], since tx<1|t - x| < 1 gives tx+1<ι(m)|t| \le |x| + 1 < \iota(m); so R\mathbb{R} is a locally compact metric space.

L2L5L6
2.1

If d((x,z),(x0,z0))<δd_\infty\big((x,z),(x_0,z_0)\big) < \delta then xx0<δ|x - x_0| < \delta and zz0<δ|z - z_0| < \delta, so zz0+zz0<z0+δ|z| \le |z_0| + |z - z_0| < |z_0| + \delta.

step 1.1L1L2
2.2

Put η:=ε/ι(m)>0\eta := \varepsilon/\iota(m) > 0; if zz0<η|z - z_0| < \eta then for every x[m,m]x \in [-m,m] we get F(z)(x)F(z0)(x)=xzz0ι(m)zz0<ι(m)η=ε|F(z)(x) - F(z_0)(x)| = |x||z - z_0| \le \iota(m)|z-z_0| < \iota(m)\eta = \varepsilon, so F(z)B[m,m](F(z0),ε)NF(z) \in B_{[-m,m]}(F(z_0),\varepsilon) \subseteq N.

step 1.3L2L6
3.1

Hence xzx0z0=z(xx0)+x0(zz0)zxx0+x0zz0<(z0+δ)δ+x0δ=δ(x0+z0+δ)δ(x0+z0+1)ε0|xz - x_0z_0| = |z(x - x_0) + x_0(z - z_0)| \le |z||x-x_0| + |x_0||z-z_0| < (|z_0| + \delta)\delta + |x_0|\delta = \delta\big(|x_0| + |z_0| + \delta\big) \le \delta\big(|x_0| + |z_0| + 1\big) \le \varepsilon_0.

step 1.1step 2.1L2
4.1

So ff is continuous at every point in the ε\varepsilon-δ\delta sense for the metric dd_\infty, hence continuous as a map of topological spaces for the product topology; this is claim 1.

step 3.1L1L3
5.1

As NN was an arbitrary neighbourhood of F(z0)F(z_0) and z0z_0 an arbitrary point, FF is continuous for the compact-open topology; this is claim 3, and it agrees with what 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 gives from claim 1.

step 4.1step 1.3step 2.2L3L5
6.1

The exponential law therefore applies with X=Z=Y=RX = Z = Y = \mathbb{R}: transposition is a bijection between C(R×R,R)C(\mathbb{R}\times\mathbb{R},\mathbb{R}) and C(R,C(R,R))C(\mathbb{R}, C(\mathbb{R},\mathbb{R})), it sends the ff of claim 1 to the FF of claim 3, and its inverse sends FF back to (x,z)F(z)(x)=xz(x,z) \mapsto F(z)(x) = xz, which is ff; this is claim 4.

step 4.1step 5.1step 1.4L7

Remarks

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · next 3 levels

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