Alphabeta Math
LemmaStatement: 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 function lattice with the two-point duplication property uniformly approximates its target

Statement

Let X be a nonempty compact topological space, let f∈C(X,R), and let L⊆C(X,R) be closed under pointwise maxima and minima. If L has the two-point duplication property relative to f (The two-point duplication property of a function family relative to a target function), then for every ε>0 there is u∈L such that ∣u(z)−f(z)∣<εfor every z∈X.

Facts & Assumptions

Given: A nonempty compact space X, a continuous f:X→R, a family L⊆C(X,R) closed under finite pointwise maxima and minima, the two-point duplication property relative to f, and a real ε>0.

[L1]

The two-point duplication property says that for every x,y∈X there is h∈L with h(x)=f(x) and h(y)=f(y) (The two-point duplication property of a function family relative to a target function).

[L2]

If an indexed family of open subsets of an ambient space covers a compact subset A, then finitely many indexed members cover A, with the case A=∅ stated separately (A subspace is compact exactly when every family of open subsets of the ambient space covering it, indexed or not, has finitely many members covering it).

Proof

technique · direct
1.1given

Fix x∈X and let Hx:={h∈L:h(x)=f(x)}; for h∈Hx put Uh:={z∈X:h(z)>f(z)−ε}, an open set by continuity.

2.1L1step 1.1

The family (Uh)h∈Hx covers X: for any y∈X, [L1] supplies h∈L with h(x)=f(x) and h(y)=f(y)>f(y)−ε, so h∈Hx and y∈Uh.

3.1step 2.1L2given

By compactness and [L2], finitely many Uh0,…,Uhn cover X; their pointwise maximum g:=h0∨⋯∨hn belongs to L, satisfies g(z)>f(z)−ε for every z∈X, and satisfies g(x)=f(x) because every hj(x)=f(x).

4.1step 3.1given

Let G:={g∈L:g(z)>f(z)−ε for every z∈X, and g(x)=f(x) for some x∈X}, a subset of L formed by comprehension rather than by selecting one function per point, and for g∈G put Vg:={z∈X:g(z)<f(z)+ε}; each Vg is open. The family (Vg)g∈G covers X: given x∈X, step 3.1 produces a member of L with both defining properties, so it lies in G, and it contains x in its Vg because g(x)=f(x)<f(x)+ε.

5.1step 4.1L2given

By compactness and [L2], finitely many Vg0,…,Vgm cover X; their pointwise minimum u:=g0∧⋯∧gm belongs to L.

6.1step 3.1step 4.1step 5.1algebra∎

Every gj is greater than f−ε everywhere by step 3.1, so u>f−ε everywhere; and at every z some Vgj contains z, so u(z)≤gj(z)<f(z)+ε. Thus ∣u(z)−f(z)∣<ε for every z∈X.

Depends on

Used by

Dependency tree · two levels

8 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