Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-16
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.

Real Stone–Weierstrass theorem for compact Hausdorff spaces

Statement

Let X be a compact Hausdorff space. Every unital point-separating real function algebra A⊆C(X,R) is uniformly dense in C(X,R).

Facts & Assumptions

Given: A compact Hausdorff space X and a unital point-separating real function algebra A⊆C(X,R).

[L1]

The uniform closure of a real function algebra on a compact Hausdorff space is itself a real function algebra and a real vector sublattice of C(X,R) (The uniform closure of a real function algebra is a vector lattice).

[L2]

On a compact Hausdorff space, a unital point-separating real vector sublattice of C(X,R) contains, for every f∈C(X,R) and every ε>0, a member within ε of f at every point; that is, it is uniformly dense (Lattice Stone–Weierstrass theorem on a compact Hausdorff space).

Proof

technique · direct
1.1given

If X=∅, then C(X,R) contains only the empty function, which is a constant function and therefore belongs to the unital algebra A; thus A=C(X,R).

1.2L1given

Assume X≠∅ and let B:=A‾ be the uniform closure. By [L1], B is a real vector sublattice and a real function algebra; it is unital and point-separating because it contains A.

2.1step 1.2L2∎

By [L2], the vector sublattice B is dense in C(X,R), while by definition B is closed; hence B=C(X,R), which says exactly that A is uniformly dense.

Depends on

Used by

Dependency tree · two levels

9 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