Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-07
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.

Open sets are Caratheodory measurable for the RMK outer measure

Statement

Every open subset of X is Caratheodory measurable for the RMK outer measure μ. Consequently the Caratheodory measurable sets form a complete sigma-algebra containing the Borel sigma-algebra, and the restriction μ=μB(X) is a Borel measure.

Facts & Assumptions

Given: The RMK outer measure μ.

[L1]

The Caratheodory theorem turns the measurable sets of an outer measure into a complete measure space. (Carathéodory's theorem: measurable sets form a sigma-algebra carrying a complete measure)

Proof

technique · direct
1.1

Fix open G,V and fVG. Put [given] K=suppf. For any gVK, the supports of f and g are disjoint, so f+gV. Hence ρ(V)Λ(f)+ρ(VK). Since VGVK, ρ(VK)μ(VG). Taking the supremum over fVG therefore gives ρ(V)ρ(VG)+μ(VG)=μ(VG)+μ(VG).

given
2.1

For arbitrary E and open VE, monotonicity and step 1.1 [step 1.1] give ρ(V)μ(EG)+μ(EG). Infimizing over V gives the hard Caratheodory inequality; outer subadditivity gives the reverse inequality.

step 1.1
3.1

Therefore every open G is Caratheodory measurable. By [L1], the measurable sets form a complete sigma-algebra; since they contain all opens, they contain B(X), and the restriction is a Borel measure.

step 2.1L1

Depends on

Used by

Dependency tree · two levels

14 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