Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-10
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.

Compact-test exponential law and products of quotient maps

Statement

For CG spaces X,Y,Z, currying g(x,y)=f(x)(y) is a natural bijection between continuous maps X×kYZ and XC(Y,Z), and induces a natural homeomorphism C(X×kY,Z)C(X,C(Y,Z)). Products of quotient maps between CG spaces are quotient maps for k-products. Specifically, for q:XQ, the relation on X×kY is (x,y)(x,y) exactly when q(x)=q(x) and y=y. No WH hypothesis is required.

Facts & Assumptions

Proof

Given: The spaces, maps, and hypotheses in the statement above.

1.1

For a compact Hausdorff test (v,w):KY×kC(Y,Z), consider aw(a)(v(a)). If its value at a lies in open O, regularity gives a closed neighbourhood L of a with w(a)(v(L))O. The set N=w1W(vL,L,O) is open and contains a. For bNintL, one has w(b)(v(b))O. Thus every test composite of evaluation is continuous, so evaluation Y×kC(Y,Z)Z is continuous.

F1F2F3F4
1.2

Given continuous g:X×kYZ, each function f(x):yg(x,y) is continuous by the slice map. For tests v:LX, u:KY, the map (b,a)g(v(b),u(a)) is continuous on the compact Hausdorff product. The tube lemma says that the set of b for which all its values on {b}×K lie in O is open. This is (fv)1W(u,K,O). Testing on L proves continuity XC0(Y,Z), and the CG-source property lifts it to C(Y,Z).

F1F2F5
2.1

Conversely, a continuous f:XC(Y,Z) uncurries continuously by composing its product with the evaluation of step 1.1. The two constructions are inverse since both give the same value f(x)(y) at every pair. Precomposition and postcomposition preserve this equality, proving naturality.

F1step 1.1step 1.2
3.1

The map (h,x,y)h(x)(y) is a composite of two continuous evaluations. Twice applying the map correspondence of steps 1.2–2.1 makes the induced map C(X,C(Y,Z))C(X×kY,Z) continuous. Conversely, start with evaluation (h,x,y)h(x,y) and curry successively in y and x. This gives the inverse continuous map. Product reassociations are homeomorphisms by F1, so the displayed bijection is a homeomorphism.

F1step 1.1step 1.2step 2.1
3.2

Let P be the ordinary quotient of X×kY by the stated relation and p its quotient map. It is CG. The map q×id descends to a continuous bijection a:PQ×kY. The transpose x(yp(x,y)) is constant on each q-fibre and hence descends continuously to QC(Y,P). Uncurrying gives b:Q×kYP with b(q(x),y)=p(x,y). Surjectivity of q and p gives ab=id and ba=id. Thus q×id is quotient.

F1F6step 1.2step 2.1
4.1

For quotient maps q:XQ and r:YR, factor q×r=(idQ×r)(q×idY). Each factor is quotient by step 3.2 and symmetry, and their composite is quotient. Empty factors give empty products and the same inverse identities; no representative of a quotient fibre has been selected.

F1F6step 3.2

Depends on

Used by

Dependency tree · two levels

30 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