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

Under the ultrafilter lemma and dependent choice, the closure of the full evaluation image is the Stone–Čech compactification

Statement

Assume the ultrafilter lemma and dependent choice. If XX is Tychonoff, e:X[0,1]C(X,[0,1])e:X\to[0,1]^{C(X,[0,1])} is its full evaluation map, and B=e[X]B=\overline{e[X]}, then (B,e)(B,e) is a Stone–Čech compactification of XX.

Facts & Assumptions

Given: The two stated choice principles, a Tychonoff space XX, its full evaluation closure BB, a compact Hausdorff space KK, and a continuous map f:XKf:X\to K.

[L1]

Under the ultrafilter lemma, the evaluation closure gives a Hausdorff compactification (Assuming the ultrafilter lemma, every Tychonoff space has a Hausdorff compactification).

[L2]

Under dependent choice, KK has an embedding j:K[0,1]Jj:K\to[0,1]^J (Under dependent choice, every compact Hausdorff space embeds in a unit cube).

[L5]

Every continuous unit-interval-valued map extends uniquely over the full evaluation closure (Every continuous [0,1][0,1]-valued function extends uniquely over the closure of the full evaluation image).

[L6]

A Stone–Čech compactification is a Hausdorff compactification with the stated unique compact-Hausdorff extension property (The Stone–Čech compactification by its compact-Hausdorff extension property).

Proof

technique · direct
1.1

By [L1], BB is compact Hausdorff and e[X]e[X] is dense in it.

L1
1.2

Use [L2] to fix an embedding j:K[0,1]Jj:K\to[0,1]^J. For each aJa\in J, the map πajf:X[0,1]\pi_a\circ j\circ f:X\to[0,1] extends uniquely to a continuous ha:B[0,1]h_a:B\to[0,1] by [L5].

L2L5
2.1

The family (ha)aJ(h_a)_{a\in J} assembles to a continuous map h:B[0,1]Jh:B\to[0,1]^J by [L4], and he=jfh\circ e=j\circ f coordinatewise.

step 1.2L4
3.1

The subset j[K]j[K] is compact, hence closed in the Hausdorff cube by [L3]. It contains h[e[X]]h[e[X]], so it contains h[B]h[B]: the inverse image h1[j[K]]h^{-1}[j[K]] is closed in BB and contains the dense subset e[X]e[X].

L3step 1.1step 2.1
4.1

Thus fˉ=j1h:BK\bar f=j^{-1}\circ h:B\to K is continuous and satisfies fˉe=f\bar f\circ e=f. If q:BKq:B\to K is another extension, then jqj\circ q and hh agree on dense e[X]e[X], so [L3] gives equality and injectivity of jj gives q=fˉq=\bar f.

L3step 2.1step 3.1
5.1

Step 1.1 gives a Hausdorff compactification and step 4.1 gives the required unique extension for every compact Hausdorff target. This is exactly [L6].

step 1.1step 4.1L6

Depends on

Used by

Dependency tree · next 3 levels

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