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.1given

Fix open G,V and f≺V∩G. Put [given] K=supp⁡f. For any g≺V∖K, the supports of f and g are disjoint, so f+g≺V. Hence ρ(V)≥Λ(f)+ρ(V∖K). Since V∖G⊆V∖K, ρ(V∖K)≥μ∗(V∖G). Taking the supremum over f≺V∩G therefore gives ρ(V)≥ρ(V∩G)+μ∗(V∖G)=μ∗(V∩G)+μ∗(V∖G).

2.1step 1.1

For arbitrary E and open V⊇E, monotonicity and step 1.1 [step 1.1] give ρ(V)≥μ∗(E∩G)+μ∗(E∖G). Infimizing over V gives the hard Caratheodory inequality; outer subadditivity gives the reverse inequality.

3.1step 2.1L1∎

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.

Depends on

Used by

Dependency tree · two levels

17 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