CorollaryStatement: 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.

A point-separating nowhere-vanishing real function algebra is uniformly dense

Statement

Let $X$ be a compact Hausdorff space and let $A \subseteq C (X, R)$ be a point-separating nowhere-vanishing real function algebra. Then $A$ is uniformly dense in $C (X, R)$ .

Facts & Assumptions

Given: A compact Hausdorff space $X$ and a point-separating nowhere-vanishing real function algebra $A \subseteq C (X, R)$ .

[L1]

A point-separating real function algebra either has full uniform closure, or all its members vanish at one fixed point and its closure is exactly the functions vanishing there; the empty space lies in the full-closure alternative (A separating real function algebra is dense or its closure consists exactly of the functions vanishing at one point).

Proof

technique · direct

1.1L1

If $X = \emptyset$ , [L1] gives the full-closure conclusion directly.

2.1L1given∎

If $X \neq \emptyset$ , the proper alternative in [L1] would give a point $x_{0}$ at which every member of $A$ vanishes, contradicting nowhere-vanishing at $x_{0}$ ; therefore the full-closure alternative holds and $A$ is uniformly dense.

Depends on

A separating real function algebra is dense or its closure consists exactly of the functions vanishing at one point

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

5 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

E. Carlen, Notes on Topology and the Stone-Weierstrass Theorem, consequence of Theorem 1.26 (standard reference, not scraped)