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

A function lattice with the two-point duplication property uniformly approximates its target

Statement

Let X be a nonempty compact topological space, let fC(X,R), and let LC(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 uL such that u(z)f(z)<εfor every zX.

Facts & Assumptions

Given: A nonempty compact space X, a continuous f:XR, a family LC(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,yX there is hL 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.1

Fix xX and let Hx:={hL:h(x)=f(x)}; for hHx put Uh:={zX:h(z)>f(z)ε}, an open set by continuity.

given
2.1

The family (Uh)hHx covers X: for any yX, [L1] supplies hL with h(x)=f(x) and h(y)=f(y)>f(y)ε, so hHx and yUh.

L1step 1.1
3.1

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

step 2.1L2given
4.1

Let G:={gL:g(z)>f(z)ε for every zX, and g(x)=f(x) for some xX}, a subset of L formed by comprehension rather than by selecting one function per point, and for gG put Vg:={zX:g(z)<f(z)+ε}; each Vg is open. The family (Vg)gG covers X: given xX, 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)+ε.

step 3.1given
5.1

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

step 4.1L2given
6.1

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 zX.

step 3.1step 4.1step 5.1algebra

Depends on

Used by

Dependency tree · next 3 levels

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