Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedSession-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.

Real Stone--Weierstrass theorem for compact metric spaces

Statement

Let KK be a nonempty compact metric space and let AC(K,R)A\subseteq C(K,\mathbb R) be a unital subalgebra which separates points. Then AA is dense in C(K,R)C(K,\mathbb R) for the supremum metric.

Facts & Assumptions

Given: fC(K,R)f\in C(K,\mathbb R) and ε>0\varepsilon>0.

[L1]

The uniform closure A\overline A is closed under pointwise maximum and minimum (The uniform closure of a unital real function algebra is closed under absolute value, maximum, and minimum).

[L2]

For distinct x,yKx,y\in K and prescribed real values at x,yx,y, AA contains a function taking those two values (A unital separating real function algebra interpolates arbitrary values at two distinct points).

[L3]

Every open cover of the compact metric space KK has a finite subcover (Open cover, subcover, compact metric space, and compact subset of a metric space).

Proof

technique · constructive
1.1

For fixed x,yKx,y\in K, choose ux,yAu_{x,y}\in A with ux,y(x)=f(x)u_{x,y}(x)=f(x) and ux,y(y)=f(y)u_{x,y}(y)=f(y), using f(x)1f(x)\mathbf1 when x=yx=y and [L2] otherwise.

L2algebra
2.1

For fixed xx, the open sets Ux,y={z:ux,y(z)>f(z)ε}U_{x,y}=\{z:u_{x,y}(z)>f(z)-\varepsilon\} cover KK, since yUx,yy\in U_{x,y}. Select y1,,yry_1,\ldots,y_r whose sets cover KK by [L3].

step 1.1L3construct
3.1

Put gx=maxjux,yjAg_x=\max_j u_{x,y_j}\in\overline A. Then gx(x)=f(x)g_x(x)=f(x) and gx>fεg_x>f-\varepsilon on KK.

L1step 2.1algebra
4.1

The open sets Vx={z:gx(z)<f(z)+ε}V_x=\{z:g_x(z)<f(z)+\varepsilon\} cover KK. By [L3], choose x1,,xsx_1,\ldots,x_s whose VxiV_{x_i} cover KK.

step 3.1L3construct
5.1

The function h=minigxih=\min_i g_{x_i} belongs to A\overline A by [L1], and fε<h<f+εf-\varepsilon<h<f+\varepsilon pointwise. Thus hf<ε\lVert h-f\rVert_\infty<\varepsilon.

L1step 3.1step 4.1algebra
6.1

Since ε\varepsilon was arbitrary and every hh of step 5.1 lies in the closed set A\overline A, the function ff lies in A\overline A. Thus A=C(K,R)\overline A=C(K,\mathbb R) and AA is dense.

step 5.1discharge-construct

Depends on

Used by

Dependency tree · next 3 levels

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