Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck pass
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.

The uniform closure of a unital real function algebra is closed under absolute value, maximum, and minimum

Statement

If A⊆C(K,R) is a unital real function algebra and A‾ is its uniform closure, then u∈A‾ implies ∣u∣∈A‾; consequently u∨v and u∧v lie in A‾ whenever u,v do.

Facts & Assumptions

Given: A unital real function algebra A and u,v∈A‾.

[L1]

The algebra operations and constants are those in A unital point-separating real subalgebra of C(K,R).

[L2]

Polynomials uniformly approximate ∣t∣ on every bounded closed interval (Polynomials are uniformly dense in C([a,b],R) for every closed interval).

Proof

technique · direct
1.1givenL1algebra

The closure A‾ is a real subalgebra. Indeed, fix w,z∈A‾, real α,β, and a target error η>0. For each δ>0 there are two witnesses a,b∈A with ∥a−w∥∞<δ and ∥b−z∥∞<δ. Then αa+βb,ab∈A, and ∥αa+βb−(αw+βz)∥∞≤(∣α∣+∣β∣)δ,∥ab−wz∥∞≤δ(∥w∥∞+∥z∥∞+δ). Choose 0<δ<min⁡{1,η/(1+∣α∣+∣β∣+∥w∥∞+∥z∥∞)} to make both errors less than η. Constants already belong to A. This proves the asserted algebra closure using only finitely many witnesses for each target error.

1.2givenL1L2algebra

Fix η>0 and put M=∥u∥∞+1. Choose one a∈A with ∥a−u∥∞<min⁡{1,η/3}. Then ∣a(x)∣≤M on K. By [L2], choose one real polynomial p with sup⁡∣t∣≤M∣p(t)−∣t∣∣<η/3. Since A is unital, p(a)∈A, including its constant term. The inequality ∣∣r∣−∣s∣∣≤∣r−s∣ gives ∥p(a)−∣u∣∥∞≤∥p(a)−∣a∣∥∞+∥∣a∣−∣u∣∥∞<2η/3<η. Thus ∣u∣∈A‾ by the metric definition of closure. No sequence of approximants or diagonal choice is used.

2.1step 1.1step 1.2algebra∎

Step 1.1 puts u−v and u+v in A‾, and step 1.2 applies to u−v. The identities u∨v=(u+v+∣u−v∣)/2 and u∧v=(u+v−∣u−v∣)/2 therefore give the remaining closure.

Depends on

Used by

Dependency tree · two levels

13 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