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.

Weak Hausdorff diagonals and closed quotients

Statement

A CG space X is WH if and only if its diagonal is closed in X×kX. For an ordinary quotient q:XQ with X CG, Q is CGWH if and only if {(x,x):q(x)=q(x)} is closed in X×kX. Compact Hausdorff test images in WH spaces are closed compact Hausdorff subspaces. WH passes to subspaces and kification. Finite k-products, finite coproducts and closed subspaces of CGWH spaces are CGWH. If X is CG and Y is CGWH, then C(X,Y) and its kified based mapping and loop subspaces are CGWH.

Facts & Assumptions

Proof

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

1.1

If X is WH, its points are closed by singleton tests. For u:KX compact Hausdorff, L=u(K) is closed and compact. The surjection u:KL is closed: any closed subset of K is compact Hausdorff and its image is closed by WH. For distinct a,bL, the disjoint closed fibres can be separated by disjoint open U,VK. The sets Lu(KU) and Lu(KV) are disjoint open neighbourhoods of a,b. Therefore L is Hausdorff.

F1F4F5F6
1.2

Conversely suppose the diagonal is closed. For tests u:KX and v:LX, the set E={(a,b):u(a)=v(b)} is closed in the compact Hausdorff K×L, hence compact. Its projection to L is compact and closed and is exactly v1(u(K)). Thus u(K) is k-closed in X and therefore closed. This proves WH.

F1F2F5F6F7F8
2.1

A test into a subspace composed with its inclusion has image closed in the ambient WH space, hence closed in the subspace. Kification preserves tests and has finer topology, so it preserves WH. Step 1.1 also shows that each test-image mapping subbasic open is a compact-Hausdorff-subspace subbasic open; the converse uses the inclusion as test.

F1F2step 1.1
2.2

If CG X is WH, test its diagonal by (v,w):KX×kX. At a with v(a)w(a), regularity provides a closed neighbourhood L of a inside v1(X{w(a)}). Then v(L) is closed by WH, and intLw1(Xv(L)) is a neighbourhood of a on which vw. Each test equality set is closed; compact generation makes the diagonal closed.

F1F2F4F5step 1.1
3.1

The diagonal of a finite k-product is the intersection of the inverse images of the factor diagonals. Hence it is closed and the product is WH. A compact test into a finite coproduct has compact Hausdorff clopen inverse-image pieces; their images are closed in their summands, so their finite union is closed in the coproduct. Closed subspaces are CG by F2 and WH by step 2.1. These prove the asserted finite closure properties, including the empty product and coproduct.

F2F5step 2.1step 2.2step 1.2
3.2

For q:XQ, the quotient Q is CG and q×q is quotient. Therefore its diagonal is closed exactly when its inverse image, the stated fibre equivalence relation, is closed. Steps 2.2–1.2 identify this condition with WH of Q.

F2F3step 2.2step 1.2
4.1

Each point evaluation ex:C(X,Y)Y is continuous since inverse images of opens are singleton-test subbasic opens. The diagonal of C(X,Y) is xX(ex×ex)1ΔY, hence closed. This mapping space is CG by definition, so is WH. Requiring a basepoint or either interval endpoint to map to the closed point y0 cuts out a closed subspace. Such subspaces are CGWH by step 3.1. The empty intersection when X is empty gives the one-point mapping space.

F1F2step 1.1step 2.2step 1.2step 3.1

Depends on

Used by

Dependency tree · two levels

40 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