Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-07
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 RMK functional outer content is well defined

Statement

Assume the Axiom of Dependent Choice. Let X be LCH and let Λ:Cc(X;R)→R be positive. For open U define ρ(U)=sup⁡{Λ(f):f∈Cc(X), 0≤f≤1U}=sup⁡{Λ(f):f≺U}, with sup⁡∅=0, and for arbitrary E⊆X define μ∗(E)=inf⁡{ρ(U):E⊆U, U open}. These are well-defined elements of [0,∞]; ρ is monotone, ρ(∅)=0, and μ∗(U)=ρ(U) for every open U.

Facts & Assumptions

Given: Dependent Choice, X is LCH, and Λ is a positive linear functional on Cc(X).

[L1]

A positive functional on Cc(X) is monotone. (A positive linear functional on Cc(X) is monotone)

[L2]

Under Dependent Choice, LCH cutoffs exist between a compact set and an open neighbourhood. (LCH Urysohn cutoff)

Proof

technique · direct
1.1givenL1

Every pointwise-admissible f is nonnegative, so Λ(f)≥0. The [given, L1] zero function is admissible for every open set, including the empty set; for U=∅ it is the only admissible function. Thus ρ(U)∈[0,∞] and ρ(∅)=0.

1.2L1L2

The cutoff supremum is at most the pointwise supremum. Conversely, let [L1, L2] 0≤f≤1U have compact support K, and choose h∈Cc(X) with 0≤h≤1 and h=1 on K by applying [L2] to K⊆X. For t>0 put ft=(f−th)+. Then ft≺U: its support lies in the compact set {f≥t}⊆U. Moreover 0≤f−ft≤th, so positivity gives Λ(f)≤Λ(ft)+tΛ(h). Letting t↓0 proves that the two displayed suprema defining ρ(U) are equal.

2.1step 1.1

If U⊆V, every test function admissible for U is admissible for V, hence ρ(U)≤ρ(V). The family of open supersets of any E is nonempty because it contains X, so μ∗(E) is well defined in [0,∞].

3.1step 2.1∎

For open U, using U itself in the infimum gives [step 2.1] μ∗(U)≤ρ(U). Conversely, if U⊆V with V open, monotonicity gives ρ(U)≤ρ(V); taking the infimum over such V gives the reverse inequality. This also covers U=∅ and ρ(U)=∞.

Depends on

Used by

Dependency tree · two levels

9 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