Alphabeta Math
ExampleConstruction: AI-generatedVerification: AI-generatedSession-authored (Fable 5 assisted)precheck 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.

On a finite compact Hausdorff space a unital separating algebra contains every scalar-valued function

Example

Let X be a finite compact Hausdorff space and let F be either R or C. If AC(X,F) is a unital point-separating F-function algebra, then A=C(X,F)=FX. Thus on a finite Hausdorff space uniform approximation strengthens to exact interpolation. In the complex case no self-adjointness hypothesis is needed.

Facts & Assumptions

Given: A finite compact Hausdorff space X, a scalar field F{R,C}, and a unital point-separating F-function algebra AC(X,F).

[L1]

A real function algebra is a real vector subspace closed under pointwise multiplication; unitality supplies all constants and point separation supplies a member distinguishing each distinct pair (Unital, point-separating, and nowhere-vanishing real function algebras on a compact Hausdorff space).

[L2]

A complex function algebra is a complex vector subspace closed under pointwise multiplication, with the same literal unitality and point-separation clauses; self-adjointness is a separate condition (Self-adjoint complex function algebras, unitality, and point separation).

[L3]

Every natural-number-indexed list of nonempty sets has a choice function on its family of values, and this finite choice uses no form of the Axiom of Choice (Every natural-number-indexed list of nonempty sets has a choice function on its family of values).

[L4]

In this library, a finite family is empty or has an explicit finite listing; in particular, a finite space is listable (Open cover, subcover, and compact topological space; a compact subset is a subspace that is compact in its own right, finiteness convention).

Verification

technique · direct
1.1

If X=, then FX has only the empty function, which is the zero element of A. If X={x}, every function is constant, so unitality gives A=FX.

L1L2
1.2

Assume X has at least two points and use [L4] to list its points. For a fixed xX, [L5] supplies, for each listed yx, a nonempty set of open neighbourhoods of x missing y; [L3] chooses one from each member of this finite list. Their intersection is the open singleton {x}. Hence every singleton is open and every function XF is continuous.

L3L4L5choose
1.3

For every ordered pair xy, point separation in [L1] or [L2] gives fxyA with fxy(x)fxy(y); by [L3] and the finite listing in [L4], choose these over the finite list of ordered pairs and define hxy:=(fxyfxy(y))/(fxy(x)fxy(y))A. Then hxy(x)=1 and hxy(y)=0.

L1L2L3L4choosealgebra
2.1

For each xX, the finite product ex:=yxhxy belongs to A, equals 1 at x, and equals 0 at every other point because the factor indexed by that point vanishes.

step 1.3L1L2L4algebra
3.1

For any function φ:XF, the finite sum xXφ(x)ex belongs to A and agrees with φ at every point. By step 1.2 every such φ is continuous, so A=C(X,F)=FX.

step 1.2step 2.1L1L2L4algebra

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · next 3 levels

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