Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6-luna)verified 2026-10-22 (gpt-6.1-sol)
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.

Euclidean real Radon representation under Countable Choice

Statement

Assume Countable Choice. For every open U⊆Rd, every bounded real linear functional on C0(U;R) is integration against a unique finite signed Radon measure. No Dependent Choice assumption is required.

Facts & Assumptions

Given: Countable Choice, an open Euclidean set U, and a bounded real functional L on C0(U).

[A1]

Countable Choice permits simultaneous selection from a countable family of nonempty sets. (The Axiom of Countable Choice (ACω))

[F1]

A bounded real functional is a difference of two bounded positive functionals, by a positive-cone supremum construction using no choice axiom. (A bounded real C_0(X) functional is a difference of positive functionals)

[F2]

Every metric outer measure measures all Borel sets; its Caratheodory restriction is a countably additive measure. (Every Borel set is Carathéodory measurable for a metric outer measure, Carathéodory's theorem: measurable sets form a sigma-algebra carrying a complete measure)

[F3]

Smooth compactly supported functions are uniformly dense in C0(U), and finite signed Radon measures agreeing on these tests are equal. (Smooth compactly supported functions are dense in C0 on an open Euclidean set, Uniqueness of a Radon measure representing a distribution)

Proof

Given: The objects in the Statement.

1.1givenconstruct

First let P be bounded and positive. For relatively open G⊆U put p(G)=sup⁡{P(f):f∈Cc(U), 0≤f≤1, supp⁡f⊆G}. Then 0≤p(G)≤∥P∥, p(∅)=0, and p is monotone. If a compact K is covered by open sets Gj, finitely many suffice, and there are continuous nonnegative compactly supported functions b1,…,bN, each supported in one of these sets, whose sum is positive on K. Indeed cover K by finitely many balls with doubled closures compactly contained in the relevant Gj and use distance cutoffs on these balls. On a neighborhood of K normalize the bi by their sum. Thus any f supported on K with 0≤f≤1 decomposes into finitely many fi≥0 with ∑fi=f and each fi≤1 compactly supported in its assigned Gj; combine terms assigned to the same j. Consequently p(⋃jGj)≤∑jp(Gj). For pairwise disjoint opens, adding finitely many admissible functions gives the reverse inequality for every finite partial sum, so p is countably additive on disjoint open unions. These compact partitions use only finite choices.

2.1A1F2step 1.1construct

Define μ∗(A)=inf⁡{p(G):A⊆G⊆U, G open}. For a sequence (Aj) and ε>0, [A1] selects open Gj⊇Aj with p(Gj)<μ∗(Aj)+ε2−j; step 1.1 proves countable subadditivity. Zero and monotonicity are immediate, so μ∗ is an outer measure, and μ∗(G)=p(G) for open G. If dist⁡(A,B)>0, they have disjoint open neighborhoods V,W in U. Every open G⊇A∪B satisfies p(G)≥p(G∩V)+p(G∩W)≥μ∗(A)+μ∗(B), by step 1.1. Taking the infimum and using subadditivity proves the metric condition. By [F2], restriction to Borel sets is a finite measure μ with μ(U)≤∥P∥.

3.1step 2.1choose

For an admissible f in the definition of p(G), let K=supp⁡f. Every open V⊇K admits f, hence μ(K)=inf⁡V⊇Kp(V)≥P(f). Taking the supremum over f proves μ(G)=sup⁡K⊆G compactμ(K). Outer regularity on every Borel set is the definition of μ∗. Finiteness gives compact inner regularity on every Borel set as well: given Borel A and ε>0, choose compact H⊆U with μ(U∖H)<ε and open V⊇U∖A with μ(V∖(U∖A))<ε. Then H∖V⊆A is compact and misses at most 2ε of μ(A). Thus μ is finite Radon, including regularity on all Borel sets.

4.1step 1.1step 3.1algebra

If 0≤g∈Cc(U) and g≤1K for compact K, the argument in step 3.1 gives P(g)≤μ(K). If instead g≥1K, then for 0<η<1, the open set Gη={g>1−η} contains K and every admissible f for p(Gη) satisfies f≤g/(1−η) on all of U. Positivity yields μ(K)≤p(Gη)≤P(g)/(1−η). Letting η↓0 gives μ(K)≤P(g).

5.1F3step 4.1algebra

Fix 0≤f∈Cc(U) and ε>0, take N with Nε≥∥f∥∞, and put fj=min⁡(ε,(f−(j−1)ε)+), K0=supp⁡f, Kj={f≥jε} for 1≤j≤N. The sum of the fj is f, and ε1Kj≤fj≤ε1Kj−1. Step 4.1 gives the same lower and upper bounds εμ(Kj) and εμ(Kj−1) for P(fj) as for ∫fj dμ. Summing and telescoping gives ∣P(f)−∫f dμ∣≤εμ(K0). Hence equality holds for f≥0, then for every real f∈Cc(U) by positive and negative parts. Uniform density [F3], boundedness of P, and finiteness of μ extend the identity to C0(U).

6.1F1F3step 3.1step 5.1construct∎

Apply [F1] to L=P−Q and the preceding construction to P,Q, obtaining finite positive Radon measures α,β. Their difference σ=α−β represents L. Its total variation is dominated by α+β, hence is regular by compact and open approximation with that finite positive Radon measure. Uniqueness follows from [F3]. All countable selections were the open near-minimizers in step 2.1; all other constructions were explicit or involved finitely many choices.

Depends on

Used by

Dependency tree · two levels

38 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