Alphabeta Math
CorollaryStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passverified 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.

Locally finite Borel measures on second-countable LCH spaces are regular

Statement

Assume the Axiom of Countable Choice ACω. Every Borel measure finite on compact sets on a second-countable LCH space is regular.

Facts & Assumptions

Given: Countable Choice (The Axiom of Countable Choice (ACω)), X is second-countable and LCH, and μ is finite on compact sets.

[L2]

Under Countable Choice, if every open set is sigma-compact, compact-finite Borel measures are regular (Sigma-compact open sets make locally finite Borel measures regular). The stated choice assumption is spent only in this theorem.

Proof

technique · direct
1.1L1givenconstruct

Let (Bn) be a given countable base and let U be open. Take all indices n for which Bn‾ is compact and contained in U; this is a specified subfamily of the given base and needs no selection. For each x∈U, [L1] gives an open W with x∈W⊆W‾⊆U and W‾ compact. Choose one Bn with x∈Bn⊆W; its closure is a closed subset of the compact W‾, hence compact and contained in U. Thus the selected subfamily covers U, and U is the union of the corresponding countably many compact closures.

2.1step 1.1L2given∎

Thus every open set is sigma-compact. Apply [L2] under the stated Countable Choice premise to obtain regularity of μ.

Depends on

Used by

Dependency tree · two levels

27 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