Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-generatedPipeline-generatedaudited 2026-09-06
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.

Assuming countable choice, Borel probability measures on Polish spaces are inner regular

Statement

Assume countable choice. If P is Polish and μ is a Borel probability measure on P, then for every Borel A⊆P and ε>0 there is a compact K⊆A with μ(A∖K)<ε.

Facts & Assumptions

Given: A complete separable metric presentation (P,d), a Borel probability μ, and ε>0.

[F1]

A Polish space has a complete compatible metric and a countable dense set. (Polish spaces are separable completely metrizable spaces)

[F2]

Measures are continuous from below and countably subadditive. (Continuity from below for measures, Finite and countable subadditivity of measures)

[F4]

A lambda-system containing a pi-system contains the sigma-algebra it generates. (Dynkin's pi-lambda theorem)

Proof

1.1F1F2

The empty P is immediate, so suppose P≠∅ and enumerate a countable dense set as (xm). For each r≥1, continuity from below chooses a finite union Ur of 2−r−2-balls centered at the xm with μ(P∖Ur)<ε2−r−2. Countable choice makes these choices simultaneously.

2.1F2F3step 1.1

The set K0=⋂rUr‾ is closed. Countable subadditivity gives μ(P∖K0)<ε/2. For every scale, one of the finite closed-ball covers from step 1.1 covers K0; choosing one point of K0 from each nonempty member of that finite cover and doubling the radius gives a finite net with centres in K0. Hence K0 is totally bounded and [F3] makes it compact.

3.1F2step 2.1

Every open G contains a compact K⊆G losing less than ε: for G=P use K0; otherwise intersect K0 with the increasing closed sets {x:d(x,P∖G)≥1/n}. Their union is K0∩G, so [F2] gives one with the required loss.

4.1F2step 2.1step 3.1

Let R be the Borel sets which, for every δ>0, have compact K⊆A⊆G with G open and μ(G∖K)<δ. Step 3.1 puts every open set in R. The tight compact set from step 2.1 shows that complements remain in R: from K⊆A⊆G, use K0∖G⊆P∖A⊆P∖K and bound the loss by μ(P∖K0)+μ(G∖K).

5.1F2F4step 4.1∎

For pairwise disjoint Aj∈R, continuity from below makes the measure of the tail of ⋃jAj arbitrarily small. A finite union of compact inner approximants handles that tail, while the union of the open outer approximants has loss bounded by the summable errors. Thus R is a lambda-system. Open sets are a pi-system generating the Borel sigma-algebra, so [F4] gives B(P)⊆R. The compact inner approximant for A proves the statement.

Depends on

Used by

Dependency tree · two levels

68 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