Alphabeta Math
ExampleConstruction: AI-adaptedVerification: AI-adaptedPipeline-generatedverified 2026-09-23 (gpt-6-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.

Weak-star compactness of probability measures

Statement

Assume the ultrafilter lemma and Dependent Choice (The axiom of dependent choice: a relation in which every element is related to something admits an N-indexed chain). If K is compact Hausdorff, the regular Borel probability measures on K form a compact space for convergence against continuous real- or complex-valued functions, using the corresponding real or complex dual of C(K).

Facts & Assumptions

Given: The ultrafilter lemma, Dependent Choice, and a compact Hausdorff space K.

[F1]

Under the ultrafilter lemma, the closed dual unit ball is weak-star compact (Banach–Alaoglu).

[F2]

Under Dependent Choice, every bounded positive functional on real C0(K) has a unique finite regular representing measure whose mass is its norm (Positive C0(X) functionals have finite regular representing measures).

[F3]

Under Dependent Choice, bounded complex functionals on C0(K) are uniquely the integrals against finite regular complex Borel measures, with norm equal to total variation (The bounded complex dual of C0(X) is regular complex measures).

[F4]

Regular Borel measures are inner regular on every Borel set (Regular Borel measure on an LCH space).

[F6]

The spaces Cc and C0 are defined by compact support and compact superlevel sets (Compact support, Cc(X), and C0(X)).

Proof

technique · identify probabilities with a weak-star closed slice
1.1F5F6given

If K=∅, no measure can have total mass one, so the probability space is empty and compact. Hence assume K≠∅. By [F5], compactness makes K locally compact, and it is Hausdorff by hypothesis. Every continuous function on compact K has compact support and compact closed superlevel sets, so [F6] gives Cc(K)=C0(K)=C(K).

2.1F3step 1.1

A regular Borel probability μ defines Lμ(g)=∫Kg dμ. For real or complex g, ∣Lμ(g)∣≤∥g∥∞μ(K)=∥g∥∞, while Lμ(1)=1; hence Lμ∈BC(K)∗ and ∥Lμ∥=1. It is positive on nonnegative real-valued g.

2.2F2F3F4step 1.1

Conversely, let L∈BC(K)∗ satisfy L(1)=1 and L(g)∈[0,∞) for every nonnegative real-valued g∈C(K). In the real case [F2] represents L by a finite regular measure μ in the sense of [F4], and μ(K)=L(1)=1. In the complex case restrict L to real-valued functions, apply [F2], and use complex linearity to recover L(g+ih)=∫g dμ+i∫h dμ; uniqueness in [F3] identifies this same positive probability measure. This is the use of Dependent Choice; the ultrafilter lemma is used separately in [F1].

3.1step 2.1step 2.2

Thus probabilities correspond exactly to the slice S of BC(K)∗ cut out by L(1)=1 and by L(g)∈[0,∞) for all nonnegative real-valued g. Each condition is weak-star closed because it is the inverse image of the closed set {1} or [0,∞) under one evaluation; arbitrary intersections remain closed.

4.1F1F7step 2.1step 2.2step 3.1

By [F1], the dual ball is weak-star compact under the ultrafilter lemma. Hence its closed subset S is compact by [F7]. Under the two representation directions above, the weak-star topology is exactly convergence of ∫g dμ for every continuous test function g, so the probability measures are compact in the asserted topology.

5.1step 1.1step 4.1∎

The initial reduction proves the empty case, and the closed-slice construction proves both scalar-field cases for nonempty compact Hausdorff K.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

45 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