Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + claude-opus-5[1m])audited 2026-08-24
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.

Countable disjoint unions of Carathéodory measurable sets are measurable and split every test set

Statement

Let (Ek)k∈N be a pairwise disjoint sequence of Carathéodory measurable subsets of X, and put E=⋃kEk. Then E is Carathéodory measurable and

μ∗(A∩E)=∑k=0∞μ∗(A∩Ek)

for every A⊆X. Equivalently: a countable disjoint union of Carathéodory measurable sets is Carathéodory measurable, and μ∗(A∩⋃kEk)=∑kμ∗(A∩Ek) for every A⊆X.

Facts & Assumptions

Given: A pairwise disjoint sequence (Ek) of Carathéodory measurable sets, its union E, and a test set A⊆X.

[L1]

If E0,…,En−1 are pairwise disjoint Carathéodory measurable sets, then outer measure splits every test set over those pieces and the remaining complement. (Outer measure splits exactly over finite Carathéodory-measurable partitions)

[F1]

An outer measure on a set X is a function μ∗:P(X)→[0,+∞] that vanishes at the empty set, is monotone, and is countably subadditive. (Outer measures)

Proof

technique · direct
1.1L1algebra

Applying [L1] to the first n sets and to A gives μ∗(A)≥∑k<nμ∗(A∩Ek)+μ∗(A∖E), because A∖E⊆A∖⋃k<nEk and outer measure is monotone; this includes n=0.

2.1step 1.1F1algebra∎

Taking the supremum over n in step 1.1 yields μ∗(A)≥∑kμ∗(A∩Ek)+μ∗(A∖E). Apply step 1.1 again with the test set A∩E: its remainder outside E is empty, so taking the supremum gives μ∗(A∩E)≥∑kμ∗(A∩Ek) without subtracting an infinite quantity. Countable subadditivity gives the reverse inequality. Substituting this equality into the first bound and using subadditivity on (A∩E)∪(A∖E) proves the Carathéodory identity, even when the series is +∞.

Depends on

Used by

Dependency tree · two levels

9 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