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.

Probability sequences on compact metric spaces have integral-convergent subsequences

Statement

Assume countable choice. Let (μn)n≥1 be Borel probabilities on a nonempty compact metric space K. There are strictly increasing positive integers nr and a Borel probability μ on K such that ∫f dμnr→∫f dμ for every f∈C(K,R). The limiting probability can be taken outer regular on Borel sets and inner regular on open sets.

Facts & Assumptions

[F1]

Under countable choice, C(K,R) has an enumerated uniformly dense family. A countable dense family of continuous functions on a compact metric space.

[F2]

Every bounded real sequence has a convergent subsequence. Bolzano-Weierstrass: every bounded real sequence has a convergent subsequence.

[F3]

A positive normalized real-linear functional on C(K,R) is represented by a regular Borel probability under countable choice. A compact-metric probability representation using countable choice.

[F4]

Nonnegative integrals are monotone and homogeneous. Monotonicity and nonnegative homogeneity of the nonnegative integral.

[F5]

Integrals of integrable functions are linear. The Lebesgue integral is linear on L1(μ).

Proof

Given: Assume countable choice. Let (μn)n≥1 be Borel probabilities on a nonempty compact metric space K. There are strictly increasing positive integers nr and a Borel probability μ on K such that ∫f dμnr→∫f dμ for every f∈C(K,R). The limiting probability can be taken outer regular on Borel sets and inner regular on open sets.

1.1F1F4F5

Fix the dense family (fj) of [F1]. Continuous real functions on K are bounded, as proved there; they are Borel measurable by continuity. For every Borel probability ν, [F4] bounds the integral of ∣f∣ by ∥f∥∞, so f is integrable. Positivity and [F5], applied to ∥f−g∥∞±(f−g), give ∣∫f dν−∫g dν∣≤∥f−g∥∞. In particular an,j=∫fj dμn is a bounded real sequence for each j.

1.2F2

There is a deterministic convergent-subsequence rule for a bounded real sequence (an) restricted to an infinite subset S of the positive integers, with a specified bound M≥0. Start with I0=[−M,M]. Bisect the current closed interval; retain its left half if infinitely many indices in S have values there, and otherwise retain the right half, which must have infinitely many such indices. At stage m≥1 choose the least eligible index km∈S greater than km−1, with k0=0, whose value lies in Im. The indices exist because an infinite subset of the naturals is unbounded. The intervals are nested and have lengths 2M2−m, so the selected values are Cauchy. They converge: [F2] provides a convergent subsequence with limit L, and the Cauchy estimate followed by the triangle inequality with a sufficiently late member of that subsequence gives ∣akm−L∣<ε for all sufficiently large m. This also works for M=0. Left-half precedence and least indices make every stage unique, so ordinary recursion suffices; no Dependent Choice is used.

2.11.11.2

Set S0=N>0. Recursively apply the rule of step 1.2 to coordinate an,j on Sj−1 with M=∥fj∥∞, and let Sj be its infinite output index set. Thus Sj⊆Sj−1, and the jth coordinate converges along the increasing enumeration of Sj. Let nr be the rth smallest member of Sr. Since Sr+1⊆Sr, its (r+1)th member is at least the (r+1)th member of Sr, which exceeds nr. Thus (nr) is strictly increasing. For every fixed j, all nr with r≥j belong to Sj and increase without bound, so ∫fj dμnr converges. All index sets and enumerations are defined uniquely by the fixed rule.

3.11.11.22.1F1F2F3F5∎

For f∈C(K,R) and ε>0, choose one j with ∥f−fj∥∞<ε/3. For large r,s, step 2.1 gives ∣∫fj dμnr−∫fj dμns∣<ε/3; the two uniform error bounds of step 1.1 show that (∫f dμnr)r is Cauchy. It is bounded, and hence converges by the Cauchy-plus-[F2] argument in step 1.2. Define Λ(f) to be this unique limit. Passing to limits in [F5] proves real linearity, positivity passes to limits of nonnegative real numbers, and Λ(1)=1 since every μnr is a probability. Apply [F3] with exactly these hypotheses to obtain the regular Borel probability μ and the asserted convergence for every f. The choices used are those in [F1] and [F3], both explicitly bounded by countable choice; neither the nested extraction nor the definition of the unique limit selects an arbitrary family of witnesses.

Depends on

Used by

Dependency tree · two levels

32 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