Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-13
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 compact-metric probability representation using countable choice

Statement

Assume the Axiom of Countable Choice. Let K be a nonempty compact metric space and let Λ:C(K,R)→R be real-linear, positive in the sense that f≥0 implies Λ(f)≥0, and normalized by Λ(1)=1. Then there is a Borel probability μ on K with Λ(f)=∫Kf dμ for every continuous real f. It is outer regular on Borel sets and inner regular on open sets by compact subsets. No Dependent Choice is required.

Facts & Assumptions

[F2]

A closed subset of a compact metric space is compact. A closed subset of a compact metric space is compact.

[F3]

The measurable sets of an outer measure form a sigma-algebra carrying its restriction as a complete measure. Carathéodory's theorem: measurable sets form a sigma-algebra carrying a complete measure.

[F4]

The nonnegative integral is monotone and homogeneous. Monotonicity and nonnegative homogeneity of the nonnegative integral.

[F5]

The Lebesgue integral is linear on integrable real functions. The Lebesgue integral is linear on L1(μ).

Proof

Given: Assume the Axiom of Countable Choice. Let K be a nonempty compact metric space and let Λ:C(K,R)→R be real-linear, positive in the sense that f≥0 implies Λ(f)≥0, and normalized by Λ(1)=1. Then there is a Borel probability μ on K with Λ(f)=∫Kf dμ for every continuous real f. It is outer regular on Borel sets and inner regular on open sets by compact subsets. No Dependent Choice is required.

1.1F1F2

For an open set U⊆K define tU(x)=inf⁡y∈K∖Ud(x,y) when K∖U≠∅, and tK=1. The triangle inequality, followed by the infimum, shows that tU is 1-Lipschitz in the first case; it is positive at every point of U because that point has a ball contained in U, and it vanishes outside U. If a nonempty closed F lies in U, the sets {tU>1/m} for positive integers m cover F. Adjoining K∖F and using [F1] gives a δ>0 with tU>δ on F. Consequently h=min⁡(1,max⁡(0,2tU/δ−1)) equals 1 on F, takes values in [0,1], and has support contained in {tU≥δ/2}⊆U. Here support means the closure in K of the nonzero set, which is compact by [F2]. For F=∅ use h=0. Any compact subset of a metric space is closed: the empty subset is closed, and for a nonempty compact subset, if x is outside it, its balls centered at y of radii d(x,y)/3 have a finite subcover; the minimum of these finitely many positive radii gives a ball at x missing the subset. Thus these cutoffs apply also to every compact F.

1.2F1

Write f≺U for continuous f with 0≤f≤1 and support contained in U. Positivity and linearity give monotonicity of Λ by applying positivity to differences, and ∣Λ(f)∣≤∥f∥∞ by comparison with constants. The norm is finite: the open sets {∣f∣<m} cover K and a finite subcover bounds f. Define ρ(U)=sup⁡f≺UΛ(f) and μ∗(E)=inf⁡E⊆U openρ(U). The zero function and the open set K make both families nonempty; 0≤ρ(U)≤1, ρ(∅)=0, and ρ(K)=1. Monotonicity immediately implies μ∗(U)=ρ(U) for open U, and monotonicity and zero empty-set value for μ∗.

2.1step 1.1F1

For a closed nonempty F⊆⋃i=1sUi with finitely many open Ui, put ti=tUi. Compactness, applied to the sets {max⁡iti>1/m} and K∖F, gives δ>0 with max⁡iti>δ on F. Set wi=(ti−δ/2)+ and w=∑iwi. Define φi=wimin⁡(2/δ,1/w) where w>0, and zero where w=0. Near a zero of w the formula is (2/δ)wi, proving continuity there. Each φi has support in {ti≥δ/2}⊆Ui, is nonnegative and at most 1, and ∑iφi=min⁡(2w/δ,1)=1 on the open neighborhood {w>δ/2} of F. For empty F use all zero functions. This constructs a finite subordinate partition without any selection principle.

3.1step 2.1step 1.2F1

For open U=⋃n≥1Un and f≺U, its closed support F is covered by finitely many distinct Uni by [F1] after adjoining K∖F. If F is empty, Λ(f)=0. Otherwise the partition in step 2.1 gives f=∑ifφi, with fφi≺Uni. Hence Λ(f)≤∑iρ(Uni)≤∑nρ(Un); taking the supremum proves open-set subadditivity. Given arbitrary En and ε>0, countable choice now selects simultaneously open Un⊇En with ρ(Un)<μ∗(En)+ε2−n. These are a specified countable family of nonempty sets of admissible opens. Thus μ∗(⋃nEn)≤ρ(⋃nUn)≤∑nμ∗(En)+ε. Letting ε decrease to zero proves that μ∗ is an outer measure; if the sum on the right is infinite the inequality is immediate and no selection is needed.

4.1step 1.2step 3.1F3

For open G,V and f≺V∩G, with support F. For any g≺V∖F, the supports are disjoint, so f+g≺V. Therefore ρ(V)≥Λ(f)+ρ(V∖F)≥Λ(f)+μ∗(V∖G). Taking the supremum over f gives ρ(V)≥μ∗(V∩G)+μ∗(V∖G). For arbitrary E⊆V, monotonicity replaces V in the two terms by E; taking the infimum over open V⊇E proves μ∗(E)≥μ∗(E∩G)+μ∗(E∖G). The opposite inequality is outer subadditivity. Thus every open G is Carathéodory measurable, and [F3] gives a Borel measure μ. It satisfies μ(K)=ρ(K)=1 and is outer regular by its defining infimum and μ(U)=ρ(U).

5.1step 1.1step 1.2step 4.1

For compact F⊆K, one has μ(F)=inf⁡{Λ(h):h∈C(K,R), h≥1F}. Indeed such h is nonnegative everywhere, and for 0<ε<1 the open set U={h>1−ε} contains F. Every g≺U satisfies g≤h/(1−ε), whence μ(F)≤ρ(U)≤Λ(h)/(1−ε), and then μ(F)≤Λ(h). Conversely for each open U⊇F, step 1.1 supplies h≺U with h=1 on F; hence the displayed infimum is at most ρ(U). Infimizing over U gives the reverse inequality. Empty F has both sides zero using h=0. If f≺U and F=supp⁡f, then f≤h for every h≥1F, so the compact formula gives Λ(f)≤μ(F). Taking the supremum over f proves μ(U)≤sup⁡F⊆U compactμ(F); monotonicity proves equality. This is the required inner regularity on opens.

6.1step 1.1step 1.2step 3.1step 4.1step 5.1F2F4F5∎

Let 0≤f∈C(K,R) and ε>0. Choose a positive integer N with f≤Nε, put F0=K, Fn={f≥nε} for 1≤n≤N, and fn=min⁡(ε,(f−(n−1)ε)+). These are continuous, the Fn are compact by [F2], f=∑n=1Nfn, and ε1Fn≤fn≤ε1Fn−1. The compact formula gives the lower bound εμ(Fn)≤Λ(fn); comparison with every continuous majorant of 1Fn−1 gives the upper bound Λ(fn)≤εμ(Fn−1). By [F4] the same bounds hold for ∫fn dμ. All these integrals are finite since fn≤ε and μ(K)=1. Summing and applying [F5] locates both Λ(f) and ∫f dμ in the same interval of length ε(μ(F0)−μ(FN))≤ε. Since ε is arbitrary they are equal. Finally f=f+−f− proves equality for every real continuous f, using positivity, linearity and [F5]. Countable choice was spent only on the admissible open supersets in step 3.1; the cutoffs and partitions are explicit metric formulas.

Depends on

Used by

Dependency tree · two levels

29 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