Alphabeta Math
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.

✓ 28 results · all verified · 24 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 4 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Outer Measure and the Caratheodory Extension Theorem

1 · Prerequisites

2 · Summary

Measures on a sigma-algebra, complete measure spaces, continuity from below, the completion of a measure space, and uniqueness of measures agreeing on a sigma-finite generating pi-system are the declared dependencies used throughout. Algebras of subsets, generated sigma-algebras, and the Borel sigma-algebra supply the domains. Nonnegative extended series and Tonelli's theorem license countable covering costs, while the metric topology and the distance between sets support the metric criterion.

An outer measure is defined on every subset and becomes a complete measure on its Carathéodory measurable sets. Covering costs turn a premeasure on an algebra into an outer measure, agreement on the algebra yields the extension theorem, and sigma-finiteness gives uniqueness and identifies the full Carathéodory domain with the completion. Regular outer measures admit continuity from below on arbitrary subsets, while metric outer measures make every Borel set measurable.

3 · Logical flowchart

4 · Definitions, theorems and proofs

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (deepseek-v4-pro + claude-opus-5[1m])audited 2026-08-24Open item page →

Outer measures

Definition

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. Explicitly:

  1. μ∗(∅)=0;
  2. if A⊆B⊆X, then μ∗(A)≤μ∗(B);
  3. for every sequence (Ak)k∈N of subsets of X, μ∗(⋃k∈NAk)≤∑k=0∞μ∗(Ak), where the sum is the nonnegative extended sum of Series in the nonnegative extended real line.

The domain is the whole power set P(X). No measurability condition is imposed before μ∗(A) is defined.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (deepseek-v4-pro + claude-opus-5[1m])audited 2026-08-24Open item page →

Carathéodory measurable sets

Definition

Let μ∗ be an outer measure on X (Outer measures). A set E⊆X is Carathéodory measurable for μ∗ when μ∗(A)=μ∗(A∩E)+μ∗(A∖E) for every A⊆X.

Write Mμ∗ for the family of all Carathéodory measurable subsets of X. The quantifier over every test set A is part of the definition.

RemarkRemark: AI-adaptedProof: Not applicablejudge pass (deepseek-v4-pro + claude-opus-5[1m])audited 2026-08-24Open item page →

Carathéodory measurability is not Carathéodory's differentiability criterion

Carathéodory measurability (Carathéodory measurable sets) is a condition on a subset E of the domain of an outer measure: every test set must split additively across E and its complement. The theorem Carathéodory's characterisation: f is differentiable at c if and only if there is φ:A→R, continuous at c, with f(x)−f(c)=φ(x)(x−c) for every x∈A, and then φ is unique and φ(c)=f′(c) concerns differentiability of a real function at a limit point and characterizes it by a continuous factorization. The shared name records the mathematician, not a logical relationship between the conditions.

LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + claude-opus-5[1m])audited 2026-08-24Open item page →

In the Carathéodory identity, the subadditive inequality is automatic

Statement

For every outer measure μ∗ and all A,E⊆X, μ∗(A)≤μ∗(A∩E)+μ∗(A∖E). Consequently, to prove that E is Carathéodory measurable (Carathéodory measurable sets), it suffices to prove the reverse inequality for every A⊆X.

Facts & Assumptions

Given: An outer measure μ∗ on X and subsets A,E⊆X.

[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.1givenalgebra

The test set decomposes as A=(A∩E)∪(A∖E).

2.1step 1.1F1algebra∎

Apply countable subadditivity in [F1] to the two sets in step 1.1 followed by empty sets. This gives μ∗(A)≤μ∗(A∩E)+μ∗(A∖E), including 0=0+0 when A=∅ and without subtracting when a value is +∞.

PropositionStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + claude-opus-5[1m])audited 2026-08-24Open item page →

Carathéodory measurable sets form an algebra

Statement

The Carathéodory measurable subsets of X form an algebra of subsets. In particular, ∅ is measurable, complements of measurable sets are measurable, and finite unions of measurable sets are measurable (Algebras of subsets).

Facts & Assumptions

Given: An outer measure μ∗ on X and Carathéodory measurable sets E,F⊆X.

[F1]

A set E⊆X is Carathéodory measurable for μ∗ when μ∗(A)=μ∗(A∩E)+μ∗(A∖E) for every A⊆X. (Carathéodory measurable sets)

[L1]

For every outer measure μ∗ and all A,E⊆X, μ∗(A)≤μ∗(A∩E)+μ∗(A∖E). (In the Carathéodory identity, the subadditive inequality is automatic)

Proof

technique · direct
1.1F1algebra

For every test set A, the split by ∅ reads μ∗(A)=0+μ∗(A), so ∅ is measurable; the identity for X∖E is the identity for E with its two summands exchanged. Applying [F1] first to E and then, inside each resulting piece, to F splits A into the four cells A∩E∩F, A∩E∖F, A∩F∖E, and A∖(E∪F), with their outer measures summing to μ∗(A).

2.1step 1.1F1L1algebra∎

By subadditivity, μ∗(A∩(E∪F)) is at most the sum of the first three cell values from step 1.1, while A∖(E∪F) is the fourth cell; hence μ∗(A)≥μ∗(A∩(E∪F))+μ∗(A∖(E∪F)). The reverse inequality is [L1], so E∪F is measurable and the measurable family is an algebra.

LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + claude-opus-5[1m])audited 2026-08-24Open item page →

Outer measure splits exactly over finite Carathéodory-measurable partitions

Statement

Let E0,…,En−1 be pairwise disjoint Carathéodory measurable subsets of X, where n∈N. For every A⊆X,

μ∗(A)=∑k<nμ∗(A∩Ek)+μ∗(A∖⋃k<nEk).

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.

Facts & Assumptions

Given: An outer measure μ∗, a natural number n, pairwise disjoint Carathéodory measurable sets E0,…,En−1, and a test set A⊆X.

[F1]

A set E⊆X is Carathéodory measurable for μ∗ when μ∗(A)=μ∗(A∩E)+μ∗(A∖E) for every A⊆X. (Carathéodory measurable sets)

[L1]

The Carathéodory measurable subsets of X form an algebra of subsets. (Carathéodory measurable sets form an algebra)

Proof

technique · induction
1.1L1base

At n=0 the finite union is empty and the finite sum is the empty sum 0, so the formula is μ∗(A)=0+μ∗(A); moreover every partial union Un:=⋃k<nEk is measurable by [L1].

1.2ih

Assume the displayed formula at n and put Rn:=A∖Un.

2.1step 1.2F1algebra

Since En is disjoint from Un, [F1] gives μ∗(Rn)=μ∗(A∩En)+μ∗(A∖Un+1). Substituting this equality into the induction hypothesis in step 1.2 gives the formula for n+1, including empty pieces and infinite values without cancellation.

3.1step 1.1step 2.1discharge-induction∎

Step 1.1 is the base case and step 2.1 proves the successor case, so the formula holds for every n∈N.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + claude-opus-5[1m])audited 2026-08-24Open item page →

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 +∞.

PropositionStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + claude-opus-5[1m])audited 2026-08-24Open item page →

Every outer-null set is Carathéodory measurable

Statement

Every set of outer measure zero, and every subset of it, is Carathéodory measurable and has outer measure zero.

Facts & Assumptions

Given: An outer measure μ∗ on X, a set N⊆X with μ∗(N)=0, and a subset S⊆N.

[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)

[L1]

For every outer measure μ∗ and all A,E⊆X, μ∗(A)≤μ∗(A∩E)+μ∗(A∖E). (In the Carathéodory identity, the subadditive inequality is automatic)

Proof

technique · direct
1.1F1algebra

Monotonicity gives 0≤μ∗(S)≤μ∗(N)=0, so μ∗(S)=0; for every test set A, the same argument gives μ∗(A∩S)=0.

2.1step 1.1L1algebra∎

Since A∖S⊆A, monotonicity gives μ∗(A)≥μ∗(A∖S)=μ∗(A∩S)+μ∗(A∖S) by step 1.1; [L1] supplies the reverse inequality, so S is Carathéodory measurable.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + claude-opus-5[1m])audited 2026-08-24Open item page →

Carathéodory's theorem: measurable sets form a sigma-algebra carrying a complete measure

Statement

For an outer measure μ∗ on X, the Carathéodory measurable subsets form a sigma-algebra, and the restriction of the outer measure to it is a complete measure.

Facts & Assumptions

Given: An outer measure μ∗ on X and its family Mμ∗ of Carathéodory measurable sets.

[L1]

The Carathéodory measurable subsets of X form an algebra of subsets. (Carathéodory measurable sets form an algebra)

[L2]

A countable disjoint union of Carathéodory measurable sets is Carathéodory measurable, and μ∗(A∩⋃kEk)=∑kμ∗(A∩Ek) for every A⊆X. (Countable disjoint unions of Carathéodory measurable sets are measurable and split every test set)

[L3]

Every set of outer measure zero, and every subset of it, is Carathéodory measurable and has outer measure zero. (Every outer-null set is Carathéodory measurable)

[L4]

Let A be an algebra of subsets of X. If the union of every pairwise disjoint sequence in A belongs to A, then A is a sigma-algebra on X. (An algebra closed under countable disjoint unions is a sigma-algebra)

Proof

technique · direct
1.1L1L2L4

The family Mμ∗ is an algebra by [L1] and is closed under countable disjoint unions by [L2], so [L4] makes it a sigma-algebra.

1.2L2algebra

For a pairwise disjoint sequence (Ek) in Mμ∗, use A=⋃kEk in [L2]; then A∩Ek=Ek, so μ∗(⋃kEk)=∑kμ∗(Ek), including infinite values, and the restriction is a measure.

2.1L3algebra∎

If N∈Mμ∗ has restricted measure zero and S⊆N, then [L3] makes S measurable with outer measure zero; hence the restricted measure is complete.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (deepseek-v4-pro + claude-opus-5[1m])audited 2026-08-24Open item page →

Measurable hulls and regular outer measures

Definition

Let μ∗ be an outer measure on X. A measurable hull of E is a Carathéodory measurable set H⊇E with μ∗(H)=μ∗(E); the outer measure is regular when every subset has a measurable hull.

This use of regularity concerns measurable supersets of arbitrary subsets. It is distinct from inner and outer regularity of a measure with respect to compact and open sets.

TheoremStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + claude-opus-5[1m])audited 2026-08-24Open item page →

Assuming countable choice, regular outer measures are continuous from below on all subsets

Statement

Assume the Axiom of Countable Choice. Let μ∗ be a regular outer measure on X, and let (En)n∈N be increasing with E=⋃nEn. Then

μ∗(E)=sup⁡n∈Nμ∗(En).

Facts & Assumptions

Given: The Axiom of Countable Choice (The Axiom of Countable Choice (ACω)), a regular outer measure μ∗, and an increasing sequence (En) with union E.

[F1]

A measurable hull of E is a Carathéodory measurable set H⊇E with μ∗(H)=μ∗(E); the outer measure is regular when every subset has a measurable hull. (Measurable hulls and regular outer measures)

[L1]

If (En)n∈N is an increasing sequence of measurable sets for a measure μ, then μ(⋃nEn)=sup⁡nμ(En), with no finiteness hypothesis. (Continuity from below for measures)

[L2]

For every outer measure, the Carathéodory measurable subsets form a sigma-algebra, and the restriction of the outer measure to it is a complete measure. (Carathéodory's theorem: measurable sets form a sigma-algebra carrying a complete measure)

Proof

technique · direct
1.1F1L2givenchoose

If some μ∗(En)=+∞, monotonicity gives the result immediately. Otherwise countable choice and [F1] give measurable hulls Hn⊇En with μ∗(Hn)=μ∗(En); put Gn:=⋂k≥nHk. Sigma-algebra closure in [L2] makes each Gn measurable, while Gn⊆Gn+1 and En⊆Gn⊆Hn, so monotonicity makes μ∗(Gn)=μ∗(En).

2.1step 1.1L1algebra∎

Let G=⋃nGn. Since En⊆Gn, one has E⊆G, while [L1] for the Carathéodory restriction gives μ∗(G)=sup⁡nμ∗(Gn)=sup⁡nμ∗(En); hence monotonicity gives μ∗(E)≤sup⁡nμ∗(En), and the reverse inequality follows from En⊆E.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + claude-opus-5[1m])audited 2026-08-24Open item page →

Assuming countable choice, countable covering costs define an outer measure

Statement

Assume the Axiom of Countable Choice. Let X be a set, let C⊆P(X) contain ∅ and X, and let p:C→[0,+∞] satisfy p(∅)=0. For E⊆X, define

μ∗(E):=inf⁡{∑k=0∞p(Ck):(Ck)k∈N is in C and E⊆⋃kCk}.

Then μ∗ is an outer measure on X. In short: assuming countable choice, the infimum of countable covering costs defines an outer measure.

Facts & Assumptions

Given: The data in the Statement and the Axiom of Countable Choice.

[F1]

Countable choice says that for every family (Xn)n∈N of nonempty sets, there is a function f on N with f(n)∈Xn for every n. (The Axiom of Countable Choice (ACω))

[L1]

For every double sequence (aij)i,j∈N in [0,+∞], the two iterated nonnegative extended sums are equal, so the order of summation may be interchanged even when the common value is +∞. (Tonelli's theorem for double series of nonnegative extended real numbers)

[L2]

If A and B are at most countable, then A×B is at most countable, with an explicit enumeration and no choice principle. (A product of two at most countable sets is at most countable)

Proof

technique · direct
1.1givenalgebra

The sequence consisting only of empty sets covers ∅ at cost 0, so μ∗(∅)=0; if E⊆F, every cover of F covers E, so taking infima gives μ∗(E)≤μ∗(F).

2.1step 1.1F1L1L2choosealgebra∎

Let (Ej) be a sequence. If some μ∗(Ej)=+∞, the desired subadditive inequality is automatic. Otherwise, for ε>0, [F1] selects for each j a cover (Cjk)k of Ej with cost below μ∗(Ej)+ε2−(j+1); [L2] enumerates the doubly indexed family as one sequence covering ⋃jEj, and [L1] computes its cost as at most ∑jμ∗(Ej)+ε, since the displayed geometric error series has partial sums ε(1−2−n). Letting ε decrease to 0 proves countable subadditivity, so with step 1.1 the function is an outer measure.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (deepseek-v4-pro + claude-opus-5[1m])audited 2026-08-24Open item page →

Premeasures on algebras of sets

Definition

Let A0 be an algebra of subsets of X. A premeasure on an algebra A0 vanishes at the empty set and is countably additive whenever a disjoint sequence in A0 has its union in A0. Thus μ0:A0→[0,+∞] is a premeasure when μ0(∅)=0 and

μ0(⋃k∈NAk)=∑k=0∞μ0(Ak)

whenever the Ak are pairwise disjoint members of A0 and their union belongs to A0. Padding a finite disjoint family by empty sets shows that a premeasure is finitely additive.

The premeasure is finite if μ0(X)<+∞. It is sigma-finite if there is a sequence (Pn) in A0 with X=⋃nPn and μ0(Pn)<+∞ for every n.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (deepseek-v4-pro + claude-opus-5[1m])audited 2026-08-24Open item page →

The outer set function induced by a premeasure

Definition

Let μ0 be a premeasure on an algebra A0 of subsets of X. The set function induced by μ0 assigns E⊆X the infimum of ∑kμ0(Ak) over all countable algebra covers E⊆⋃kAk. In symbols,

μ∗(E):=inf⁡{∑k=0∞μ0(Ak):Ak∈A0 and E⊆⋃k∈NAk}.

The family of covering costs is nonempty because X∈A0 and (X,∅,∅,…) covers every E. It therefore has an infimum in [0,+∞] by completeness of the extended real line (Every subset of R‾ has a least upper bound and a greatest lower bound in R‾, agreeing with the real supremum and infimum on nonempty sets bounded in R). This definition calls μ∗ an outer set function until its outer-measure axioms have been proved.

CorollaryStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-24Open item page →

Assuming countable choice, the outer set function induced by a premeasure is an outer measure

Statement

Assume the Axiom of Countable Choice. The outer set function induced by a premeasure is an outer measure.

Facts & Assumptions

Given: Countable choice, an algebra A0 on X, a premeasure μ0, and its induced outer set function μ∗.

[L1]

Assuming countable choice, the infimum of countable covering costs defines an outer measure. (Assuming countable choice, countable covering costs define an outer measure)

[F1]

An algebra of subsets of X contains ∅, is closed under complements relative to X and binary unions, and therefore also contains X. (Algebras of subsets)

Proof

technique · direct
1.1F1given

The algebra law in [F1] gives ∅,X∈A0, and the premeasure normalization gives μ0(∅)=0. Thus C=A0 and p=μ0 satisfy every hypothesis of [L1].

2.1step 1.1L1∎

Applying [L1] to the data in step 1.1 shows that the induced outer set function μ∗ is an outer measure.

LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + claude-opus-5[1m])audited 2026-08-24Open item page →

A countable algebra cover disjointifies inside the covered algebra set

Statement

Let A0 be an algebra on X, let A∈A0, and let (Ak)k∈N be a sequence in A0 with A⊆⋃kAk. Then there are pairwise disjoint Bk∈A0 such that A=⋃kBk and Bk⊆Ak for every k. Equivalently: every countable algebra cover of an algebra set disjointifies inside that set into algebra members subordinate to the original cover.

Facts & Assumptions

Given: The algebra A0, the covered set A, and the cover (Ak) from the Statement.

[F1]

An algebra of subsets of X contains ∅ and is closed under complements and binary unions; consequently it is closed under finite unions, finite intersections, and differences. (Algebras of subsets)

Proof

technique · constructive
1.1F1construct

Define Bk:=A∩(Ak∖⋃j<kAj), using the empty preceding union when k=0; finite unions, differences, and intersections keep every Bk in A0, and Bk⊆Ak.

2.1step 1.1algebradischarge-construct∎

Distinct pieces are disjoint because a point in Bk belongs to no earlier Aj; every x∈A lies in some Ak, and at its least such index it belongs to Bk, so A=⋃kBk.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + claude-opus-5[1m])audited 2026-08-24Open item page →

The induced outer measure agrees with the premeasure on the source algebra

Statement

For every A∈A0, the outer measure induced by a premeasure satisfies μ∗(A)=μ0(A).

Facts & Assumptions

Given: A premeasure μ0 on an algebra A0 and its induced outer measure μ∗.

[F1]

A premeasure on an algebra A0 vanishes at the empty set and is countably additive whenever a disjoint sequence in A0 has its union in A0. (Premeasures on algebras of sets)

[L1]

Every countable algebra cover of an algebra set disjointifies inside that set into algebra members subordinate to the original cover. (A countable algebra cover disjointifies inside the covered algebra set)

[F2]

The set function induced by μ0 assigns E⊆X the infimum of ∑kμ0(Ak) over all countable algebra covers E⊆⋃kAk. (The outer set function induced by a premeasure)

Proof

technique · direct
1.1F2construct

The sequence (A,∅,∅,…) covers A at cost μ0(A), so μ∗(A)≤μ0(A).

1.2F1L1algebra

For any algebra cover (Ak) of A, [L1] gives disjoint Bk⊆Ak with union A; [F1] gives μ0(A)=∑kμ0(Bk), and finite additivity applied to Ak=Bk⊔(Ak∖Bk) gives μ0(Bk)≤μ0(Ak), hence μ0(A)≤∑kμ0(Ak).

2.1step 1.1step 1.2F2algebra∎

Since step 1.2 bounds every covering cost below by μ0(A), [F2] gives μ0(A)≤μ∗(A); combining this with step 1.1 proves equality, including infinite values without subtraction.

Remarks

No choice principle is used here. Steps 1.1, 1.2 and 2.1 read the defining infimum of The outer set function induced by a premeasure, disjointify one given cover, and apply countable additivity of the premeasure; none of them selects a cover for each index. The name outer measure is the one that Assuming countable choice, the outer set function induced by a premeasure is an outer measure earns for the induced set function under countable choice, and the identity proved here holds for the set function whether or not that hypothesis is in force.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + claude-opus-5[1m])audited 2026-08-24Open item page →

Assuming countable choice, every source-algebra set is measurable for the induced outer measure

Statement

Assume the Axiom of Countable Choice. Every member of the source algebra is Carathéodory measurable for the induced outer measure.

Facts & Assumptions

Given: Countable choice, a premeasure μ0 on an algebra A0, its induced outer set function μ∗, a set E∈A0, and a test set A⊆X.

[F1]

A premeasure on an algebra A0 vanishes at the empty set and is countably additive whenever a disjoint sequence in A0 has its union in A0. (Premeasures on algebras of sets)

[F2]

The set function induced by μ0 assigns E⊆X the infimum of ∑kμ0(Ak) over all countable algebra covers E⊆⋃kAk. (The outer set function induced by a premeasure)

[L1]

For every outer measure μ∗ and all A,E⊆X, μ∗(A)≤μ∗(A∩E)+μ∗(A∖E). (In the Carathéodory identity, the subadditive inequality is automatic)

[L2]

Assuming countable choice, the outer set function induced by a premeasure is an outer measure. (Assuming countable choice, the outer set function induced by a premeasure is an outer measure)

Proof

technique · direct
1.1F1F2choosecases

If μ∗(A)=+∞, the reverse Carathéodory inequality is automatic. If μ∗(A)<+∞, then for any ε>0 choose an algebra cover (Ck) of A with ∑kμ0(Ck)<μ∗(A)+ε; since E∈A0, the two sequences (Ck∩E) and (Ck∖E) lie in the algebra, cover A∩E and A∖E, and [F1] gives μ0(Ck)=μ0(Ck∩E)+μ0(Ck∖E).

2.1step 1.1L1L2algebra∎

By the defining infima, step 1.1 gives μ∗(A∩E)+μ∗(A∖E)<μ∗(A)+ε; since this holds for every positive ε, the left side is at most μ∗(A). Countable choice makes μ∗ an outer measure by [L2], so [L1] applies to it and gives the reverse inequality. Thus the Carathéodory identity holds for every A.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + claude-opus-5[1m])audited 2026-08-24Open item page →

Assuming countable choice, a premeasure extends through its induced outer measure

Statement

Assume the Axiom of Countable Choice. If μ0 is a premeasure on an algebra A0 of subsets of X and μ∗ is its induced outer set function, then A0⊆Mμ∗ and μ∗∣A0=μ0. The restriction of μ∗ to σ(A0) is therefore a measure extending μ0.

Equivalently: assuming countable choice, the induced outer measure restricts to a complete measure on its Carathéodory sigma-algebra and to a measure on σ(A0) extending μ0.

Facts & Assumptions

Given: Countable choice, a premeasure μ0 on A0, and its induced outer set function μ∗.

[L1]

Assuming countable choice, the outer set function induced by a premeasure is an outer measure. (Assuming countable choice, the outer set function induced by a premeasure is an outer measure)

[L2]

The Carathéodory measurable subsets form a sigma-algebra, and the restriction of the outer measure to it is a complete measure. (Carathéodory's theorem: measurable sets form a sigma-algebra carrying a complete measure)

[L3]

For every A∈A0, the outer measure induced by a premeasure satisfies μ∗(A)=μ0(A). (The induced outer measure agrees with the premeasure on the source algebra)

[L4]

Assuming countable choice, every member of the source algebra is Carathéodory measurable for the induced outer measure. (Assuming countable choice, every source-algebra set is measurable for the induced outer measure)

[L5]

For every E⊆P(X), σX(E) is the unique smallest sigma-algebra on X containing E. (Nonempty intersections of sigma-algebras are sigma-algebras, so the generated sigma-algebra exists and is minimal)

Proof

technique · direct
1.1L1L2

By [L1], μ∗ is an outer measure, and [L2] makes its restriction to Mμ∗ a complete measure.

1.2L3L4

By [L4], A0⊆Mμ∗, and [L3] identifies the restricted values there with μ0.

2.1step 1.1step 1.2L5algebra∎

Since Mμ∗ is a sigma-algebra containing A0, [L5] gives σ(A0)⊆Mμ∗; restricting the measure from step 1.1 to this generated sigma-algebra and using step 1.2 gives the claimed extension, with no sigma-finiteness hypothesis.

TheoremStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + claude-opus-5[1m])audited 2026-08-24Open item page →

Assuming countable choice, a premeasure-induced outer measure is regular with generated measurable hulls

Statement

Assume the Axiom of Countable Choice. An outer measure induced by a premeasure is regular, and every set has a measurable hull in σ(A0).

Facts & Assumptions

Given: Countable choice, a premeasure μ0 on A0, its induced outer measure μ∗, and a subset E⊆X.

[F1]

A measurable hull of E is a Carathéodory measurable set H⊇E with μ∗(H)=μ∗(E); the outer measure is regular when every subset has a measurable hull. (Measurable hulls and regular outer measures)

[F2]

The set function induced by μ0 assigns E⊆X the infimum of ∑kμ0(Ak) over all countable algebra covers E⊆⋃kAk. (The outer set function induced by a premeasure)

[L1]

Assuming countable choice, the induced outer measure restricts to a complete measure on its Carathéodory sigma-algebra and to a measure on σ(A0) extending μ0. (Assuming countable choice, a premeasure extends through its induced outer measure)

Proof

technique · direct
1.1F2givenchoosecases

If μ∗(E)=+∞, put H=X. Otherwise, for each n∈N, countable choice and [F2] give an algebra cover (Ank)k of E with cost below μ∗(E)+1/(n+1); put Un=⋃kAnk and H=⋂nUn.

2.1step 1.1L1algebra

In the finite case each Un and their intersection H lie in σ(A0); in the infinite case H=X lies there. Thus [L1] makes H Carathéodory measurable in either case.

3.1step 1.1step 2.1F1algebra∎

One has E⊆H. In the finite case, monotonicity and each covering bound give μ∗(E)≤μ∗(H)≤μ∗(Un)<μ∗(E)+1/(n+1) for every n, hence μ∗(H)=μ∗(E); in the infinite case both values are +∞. Therefore [F1] makes H a generated measurable hull, and μ∗ is regular.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + claude-opus-5[1m])audited 2026-08-24Open item page →

Assuming countable choice, Carathéodory measurability of a finite-outer-measure set is equivalent to source-algebra approximation

Statement

Assume the Axiom of Countable Choice. Let μ∗ be induced by a premeasure μ0 on A0, and let E⊆X satisfy μ∗(E)<+∞. Then E is Carathéodory measurable if and only if for every ε>0 there is A∈A0 such that μ∗(E△A)<ε.

Facts & Assumptions

Given: Countable choice, the induced outer set function μ∗, a set E of finite outer measure, and a positive real ε.

[F1]

The set function induced by μ0 assigns E⊆X the infimum of ∑kμ0(Ak) over all countable algebra covers E⊆⋃kAk. (The outer set function induced by a premeasure)

[L1]

Assuming countable choice, every member of the source algebra is Carathéodory measurable for the induced outer measure. (Assuming countable choice, every source-algebra set is measurable for the induced outer measure)

[L3]

Assuming countable choice, the outer set function induced by a premeasure is an outer measure. (Assuming countable choice, the outer set function induced by a premeasure is an outer measure)

[L2]

For every outer measure μ∗ and all A,E⊆X, μ∗(A)≤μ∗(A∩E)+μ∗(A∖E). (In the Carathéodory identity, the subadditive inequality is automatic)

Proof

technique · direct
1.1F1givenchoosealgebra

For the forward direction, suppose E is Carathéodory measurable. Choose by [F1] a cover (Ck) of E with finite cost below μ∗(E)+ε/4 and put H=⋃kCk. Applying the Carathéodory identity for E to the test set H shows that μ∗(H∖E)<ε/4; the finite total covering cost also has a tail below ε/4, so some finite union A=⋃k<nCk∈A0 satisfies μ∗(H∖A)<ε/4.

2.1step 1.1L1L3algebra

For the forward direction, step 1.1 gives E△A⊆(H∖E)∪(H∖A) and hence μ∗(E△A)<ε. For the reverse direction, assume the approximation property, fix a test set T, and choose A∈A0 with μ∗(E△A)<δ; since μ∗ is an outer measure by [L3] and A is measurable by [L1], subadditivity gives μ∗(T∩E)+μ∗(T∖E)≤μ∗(T∩A)+μ∗(T∖A)+2δ=μ∗(T)+2δ.

3.1step 2.1L2L3algebra∎

For the reverse direction, letting δ decrease to 0 in step 2.1 gives μ∗(T∩E)+μ∗(T∖E)≤μ∗(T), and [L2] applied to the outer measure of [L3] gives the opposite inequality; thus the Carathéodory identity holds for every T, completing both implications.

PropositionStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + claude-opus-5[1m])audited 2026-08-24Open item page →

Assuming countable choice, the Carathéodory extension dominates every other extension and agrees with it on finite-measure sets

Statement

Assume the Axiom of Countable Choice. Let μ=μ∗∣σ(A0) be the Carathéodory extension of a premeasure μ0, and let ν be any measure on σ(A0) extending μ0. Then ν(E)≤μ(E) for every E∈σ(A0), with equality whenever μ(E)<+∞.

Facts & Assumptions

Given: Countable choice, the premeasure, its induced extension μ, a competing extension ν, and a generated measurable set E.

[L0]

Assuming countable choice, the restriction of the induced outer measure to σ(A0) is a measure extending μ0. (Assuming countable choice, a premeasure extends through its induced outer measure)

[L1]

If (En) is an increasing sequence of measurable sets for a measure μ, then μ(⋃nEn)=sup⁡nμ(En), with no finiteness hypothesis. (Continuity from below for measures)

[L2]

If A⊆B are measurable and μ(A)<+∞, then μ(B)=μ(A)+μ(B∖A); if also μ(B)<+∞, finite subtraction gives μ(B∖A)=μ(B)−μ(A). (Measure of a set difference when the smaller set has finite measure)

[L3]

For every measure λ and every sequence (Ek) of measurable sets, λ(⋃kEk)≤∑kλ(Ek). (Finite and countable subadditivity of measures)

Proof

technique · direct
1.1L3givenalgebra

If (Ak) is any algebra cover of E, monotonicity and [L3] give ν(E)≤ν(⋃kAk)≤∑kν(Ak)=∑kμ0(Ak). Taking the infimum and using the given identity μ=μ∗∣σ(A0) gives ν(E)≤μ∗(E)=μ(E).

2.1step 1.1L0L1choose

Countable choice makes μ a measure on σ(A0) extending μ0 by [L0]. Suppose μ(E)<+∞ and choose an algebra cover (Ak) of E with finite total cost. For H=⋃kAk and Hn=⋃k<nAk, both extensions agree on every Hn∈A0, so [L1] gives μ(H)=ν(H); the finite covering cost makes this common value finite.

3.1step 1.1step 2.1L2algebra∎

Apply [L2] to E⊆H for each measure. Step 1.1 applied to H∖E gives ν(H∖E)≤μ(H∖E), so finite subtraction from the common value in step 2.1 gives μ(E)≤ν(E); combined with step 1.1, this proves equality.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + claude-opus-5[1m])audited 2026-08-24Open item page →

A sigma-finite premeasure has at most one extension to its generated sigma-algebra

Statement

A sigma-finite premeasure has at most one measure extension to the sigma-algebra generated by its source algebra.

Facts & Assumptions

Given: A sigma-finite premeasure μ0 on A0, a sequence (An) in A0 covering X with finite premeasure, and extensions μ,ν on σ(A0).

[F1]

A premeasure on an algebra A0 vanishes at the empty set and is countably additive whenever a disjoint sequence in A0 has its union in A0. (Premeasures on algebras of sets)

[F2]

An algebra of subsets is nonempty and is closed under finite unions and intersections. (Algebras of subsets)

[F3]

A pi-system on X is a nonempty family of subsets closed under binary intersections. (Pi-systems)

[L1]

If two measures agree on a generating pi-system and on an increasing exhaustion (Pn) from that pi-system with X=⋃nPn and equal finite values on every Pn, then the measures are equal on the generated sigma-algebra. (Measures agreeing on a generating pi-system are equal under an increasing finite-measure exhaustion from that pi-system)

Proof

technique · direct
1.1F1F2algebra

Put Pn=⋃k≤nAk. By [F2], Pn∈A0, the sequence is increasing with union X, and finite additivity from [F1] gives μ0(Pn)≤∑k≤nμ0(Ak)<+∞.

2.1step 1.1F3given

The algebra A0 is nonempty and closed under intersections by [F2], hence is a pi-system by [F3]; it generates σ(A0), and both extensions agree with μ0 on it and on the exhaustion (Pn) from step 1.1.

3.1step 2.1L1∎

Applying [L1] to the generating pi-system and the increasing finite-measure exhaustion of step 2.1 gives μ=ν on σ(A0).

CorollaryStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-08-24Open item page →

A finite premeasure has at most one extension to its generated sigma-algebra

Statement

A finite premeasure has at most one measure extension to the sigma-algebra generated by its source algebra.

Facts & Assumptions

Given: A finite premeasure μ0 on an algebra A0 of subsets of X.

[L1]

A sigma-finite premeasure has at most one measure extension to the sigma-algebra generated by its source algebra. (A sigma-finite premeasure has at most one extension to its generated sigma-algebra)

[F1]

A premeasure on an algebra A0 vanishes at the empty set and is countably additive whenever a disjoint sequence in A0 has its union in A0. (Premeasures on algebras of sets)

Proof

technique · direct
1.1F1construct

Since μ0(X)<+∞, the constant sequence Pn=X is an increasing sigma-finite exhaustion, including when X=∅ or μ0(X)=0.

2.1step 1.1L1∎

The sigma-finite uniqueness theorem [L1] applied to the exhaustion in step 1.1 shows that the finite premeasure has at most one extension to σ(A0).

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + claude-opus-5[1m])audited 2026-08-24Open item page →

Under sigma-finiteness, every Carathéodory measurable set differs from a generated measurable hull by a null set

Statement

Assume countable choice. If μ0 is sigma-finite, μ∗ is its induced outer measure, and E is Carathéodory measurable, then there is H∈σ(A0) with E⊆H and μ∗(H∖E)=0.

Facts & Assumptions

Given: Countable choice, a sigma-finite premeasure μ0, a covering sequence (An) of finite premeasure, and a Carathéodory measurable set E.

[F1]

A premeasure on an algebra A0 vanishes at the empty set and is countably additive whenever a disjoint sequence in A0 has its union in A0. (Premeasures on algebras of sets)

[L1]

Assuming countable choice, an outer measure induced by a premeasure is regular, and every set has a measurable hull in σ(A0). (Assuming countable choice, a premeasure-induced outer measure is regular with generated measurable hulls)

[L2]

Assuming countable choice, the induced outer measure restricts to a complete measure on its Carathéodory sigma-algebra and to a measure on σ(A0) extending μ0. (Assuming countable choice, a premeasure extends through its induced outer measure)

Proof

technique · direct
1.1F1L1choose

Put Pn=⋃k≤nAk, so [F1] gives Pn∈A0, Pn↑X, and μ0(Pn)<+∞; using countable choice and [L1], select Hn∈σ(A0) with E∩Pn⊆Hn and μ∗(Hn)=μ∗(E∩Pn).

2.1step 1.1L2algebra

Both Hn and E∩Pn are Carathéodory measurable by [L2], and their common measure is finite, so additivity on Hn=(E∩Pn)⊔(Hn∖(E∩Pn)) gives μ∗(Hn∖(E∩Pn))=0.

3.1step 2.1algebra∎

The set H=⋃nHn belongs to σ(A0) and contains E because Pn↑X; moreover H∖E is contained in the union of the null excesses from step 2.1, so countable subadditivity gives μ∗(H∖E)=0.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + claude-opus-5[1m])audited 2026-08-24Open item page →

Assuming countable choice, the Carathéodory domain is the completion of the sigma-finite extension

Statement

Assume the Axiom of Countable Choice and let μ0 be a sigma-finite premeasure. The Carathéodory sigma-algebra of its induced outer measure is exactly the completion of σ(A0) under the extended measure, and the Carathéodory restriction equals the completed measure there.

Facts & Assumptions

Given: Countable choice, a sigma-finite premeasure, its induced outer measure μ∗, its generated extension μ, and the completion of that extension.

[L1]

If the premeasure is sigma-finite and E is Carathéodory measurable, there is H∈σ(A0) with E⊆H and μ∗(H∖E)=0. (Under sigma-finiteness, every Carathéodory measurable set differs from a generated measurable hull by a null set)

[L2]

Assuming countable choice, an outer measure induced by a premeasure is regular, and every set has a measurable hull in σ(A0). (Assuming countable choice, a premeasure-induced outer measure is regular with generated measurable hulls)

[L3]

The Carathéodory measurable subsets form a sigma-algebra, and the restriction of the outer measure to it is a complete measure. (Carathéodory's theorem: measurable sets form a sigma-algebra carrying a complete measure)

[L4]

Assume the Axiom of Countable Choice. Let (X,A,μ) be a measure space, and let (X,A‾,μ‾) be its completion construction. Then μ‾ is a complete measure on A‾ extending μ. It is the unique complete measure on A‾ that extends μ. (Assuming countable choice, every measure space has a unique complete extension to its completion)

[L5]

Assuming countable choice, the induced outer measure of a premeasure satisfies A0⊆Mμ∗ and μ∗∣A0=μ0, so its restriction to σ(A0) is a measure extending μ0. (Assuming countable choice, a premeasure extends through its induced outer measure)

Proof

technique · direct
1.1L3L4L5

By [L3] the Carathéodory restriction is a complete measure, and by [L5] its sigma-algebra contains σ(A0) with the restriction there equal to μ; so it is a complete measure extending μ. Therefore its sigma-algebra contains every set A∪N with A,Z∈σ(A0), N⊆Z, and μ(Z)=0, so it contains the completion domain of [L4].

1.2L1L2choose

Conversely, let E be Carathéodory measurable. By [L1] choose H∈σ(A0) with E⊆H and μ∗(H∖E)=0; by [L2] choose a generated measurable hull Z∈σ(A0) of H∖E, so H∖E⊆Z and μ∗(Z)=0.

2.1step 1.1step 1.2L4algebra∎

Since E=(H∖Z)∪(E∩Z), with H∖Z,Z∈σ(A0) and E∩Z⊆Z null, E belongs to the completion domain. Thus the domains coincide, and [L4] identifies the two complete extensions of μ on that domain.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (deepseek-v4-pro + claude-opus-5[1m])audited 2026-08-24Open item page →

Metric outer measures

Definition

Let (X,d) be a metric space and let μ∗ be an outer measure on X. An outer measure on a metric space is a metric outer measure when μ∗(A∪B)=μ∗(A)+μ∗(B) for all nonempty A,B with d(A,B)>0.

The nonempty restriction is necessary because set distance in Bounded subset, diameter, distance from a point to a set, and distance between two sets in a metric space is defined only when both sets are nonempty. If either set is empty, the same equality follows separately from μ∗(∅)=0.

LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + claude-opus-5[1m])audited 2026-08-24Open item page →

Boundary layers of finite metric outer measure exhaust the complement of a closed set in outer measure

Statement

Let μ∗ be a metric outer measure on (X,d), let F⊆X be closed, and let A⊆X satisfy μ∗(A)<+∞. If F≠∅, define

Bn:={x∈A∖F:d(x,F)≥1/(n+1)},

and if F=∅, put Bn=A. Then Bn⊆Bn+1, ⋃nBn=A∖F, and

sup⁡n∈Nμ∗(Bn)=μ∗(A∖F).

Thus, for a closed set F and a finite-outer-measure test set A, the positive-distance layers inside A∖F increase to A∖F in outer measure.

Facts & Assumptions

Given: The metric outer measure, the closed set F, and the finite-outer-measure set A from the Statement.

[F1]

An outer measure on a metric space is a metric outer measure when μ∗(A∪B)=μ∗(A)+μ∗(B) for all nonempty A,B with d(A,B)>0. (Metric outer measures)

[F2]

In a metric space, d(x,A) is defined exactly when A is nonempty, and d(A,B) exactly when both sets are nonempty; no boundedness is required for either distance. (Bounded subset, diameter, distance from a point to a set, and distance between two sets in a metric space)

[F3]

For a nonnegative extended-real sequence, the series is the supremum of its finite partial sums, and a tail series is formed by shifting the sequence. (Series in the nonnegative extended real line)

Proof

technique · direct
1.1F2construct

If F=∅ or A∖F=∅, the asserted constant layers give the result without set-distance notation. Otherwise [F2] licenses d(x,F), the layers are increasing, and closedness means every x∉F has a ball disjoint from F, hence d(x,F)>0 and x enters some Bn; thus Bn↑A∖F. Put Cn=Bn+1∖Bn.

2.1step 1.1F1algebra

The function x↦d(x,F) is 1-Lipschitz, since the triangle inequality gives d(x,F)≤d(x,y)+d(y,F) and symmetrically. Therefore two nonempty annuli Ci,Cj of the same parity with i<j are positively separated: their distance-to-F ranges are separated by the positive gap between 1/(i+2) and 1/(j+1). Repeated use of [F1] on finite parity unions gives ∑k<mμ∗(C2k)≤μ∗(A) and ∑k<mμ∗(C2k+1)≤μ∗(A), with empty annuli omitted.

3.1step 1.1step 2.1F3algebra∎

By [F3], each parity series is the supremum of its increasing finite partial sums, and step 2.1 bounds that supremum by the finite number μ∗(A). Given ε>0, choose a partial sum within ε/2 of each supremum; every later tail is then below ε/2, so both parity tails tend to zero. Now (A∖F)∖Bn=⋃k≥nCk, so subadditivity bounds its outer measure by those two tails. Thus all sufficiently large n satisfy μ∗(Bn)≤μ∗(A∖F)≤μ∗(Bn)+ε, and taking the supremum over n proves the stated equality.

PropositionStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + claude-opus-5[1m])audited 2026-08-24Open item page →

Closed sets are Carathéodory measurable for metric outer measures

Statement

Every closed subset of a metric space is Carathéodory measurable for every metric outer measure.

Facts & Assumptions

Given: A metric outer measure μ∗ on (X,d), a closed set F⊆X, and a test set A⊆X.

[L1]

For a closed set F and a finite-outer-measure test set A, the positive-distance layers inside A∖F increase to A∖F in outer measure. (Boundary layers of finite metric outer measure exhaust the complement of a closed set in outer measure)

[L2]

For every outer measure μ∗ and all A,E⊆X, μ∗(A)≤μ∗(A∩E)+μ∗(A∖E). (In the Carathéodory identity, the subadditive inequality is automatic)

[F1]

An outer measure on a metric space is a metric outer measure when μ∗(A∪B)=μ∗(A)+μ∗(B) for all nonempty A,B with d(A,B)>0. (Metric outer measures)

Proof

technique · direct
1.1F1algebra

If μ∗(A)<+∞, let Bn be the layers of [L1]. The sets A∩F and Bn are disjoint and positively separated whenever both are nonempty, while normalization handles an empty member; hence [F1] and monotonicity give μ∗(A)≥μ∗((A∩F)∪Bn)=μ∗(A∩F)+μ∗(Bn).

2.1step 1.1L1

Taking the supremum over n in step 1.1 and using [L1] gives μ∗(A)≥μ∗(A∩F)+μ∗(A∖F).

3.1step 2.1L2cases∎

If μ∗(A)=+∞, the inequality in step 2.1 is automatic because the right side is at most +∞; in every case [L2] supplies the reverse inequality, so the Carathéodory identity holds for every test set A.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + claude-opus-5[1m])audited 2026-08-24Open item page →

Every Borel set is Carathéodory measurable for a metric outer measure

Statement

Every Borel subset of a metric space is Carathéodory measurable for every metric outer measure.

Facts & Assumptions

Given: A metric space (X,d), a metric outer measure μ∗, and its Carathéodory family Mμ∗.

[L1]

Every closed subset of a metric space is Carathéodory measurable for every metric outer measure. (Closed sets are Carathéodory measurable for metric outer measures)

[L2]

The Carathéodory measurable subsets form a sigma-algebra, and the restriction of the outer measure to it is a complete measure. (Carathéodory's theorem: measurable sets form a sigma-algebra carrying a complete measure)

[F1]

The Borel sigma-algebra B(X) of a topological space is the sigma-algebra generated by its open sets. (The Borel sigma-algebra of a topological space)

[L3]

For every E⊆P(X), σX(E) is the unique smallest sigma-algebra on X containing E. (Nonempty intersections of sigma-algebras are sigma-algebras, so the generated sigma-algebra exists and is minimal)

Proof

technique · direct
1.1L1L2algebra

By [L2], Mμ∗ is a sigma-algebra. It contains every closed set by [L1], and hence contains every open set by closure under complements.

2.1step 1.1F1L3∎

By [F1], the Borel sigma-algebra is generated by the open sets, so minimality in [L3] and step 1.1 give B(X)⊆Mμ∗; this also covers the empty metric space and the one-point space.

5 · Examples, counterexamples and false statements

False statementConstruction: Literature-sourcedVerification: AI-generatedprecheck passjudge pass (deepseek-v4-pro + claude-opus-5[1m])audited 2026-08-24Open item page →

FALSE: every subset is Carathéodory measurable for every outer measure

Statement

Every subset of every set is Carathéodory measurable for every outer measure on that set.

Facts & Assumptions

Given: The two-point set X={0,1} and the set function μ∗(∅)=0, μ∗(A)=1 for A≠∅.

[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)

[F2]

A set E⊆X is Carathéodory measurable for μ∗ when μ∗(A)=μ∗(A∩E)+μ∗(A∖E) for every A⊆X. (Carathéodory measurable sets)

Refutation

technique · direct
1.1F1algebra

The function vanishes at ∅ and is monotone; if a countable union is nonempty, at least one member is nonempty, so the union has value 1 and the sum of the member values is at least 1, while an empty union gives 0≤0. Thus μ∗ is an outer measure.

2.1step 1.1F2algebra∎

For E={0} and test set A=X, [F2] would require 1=μ∗(X)=μ∗({0})+μ∗({1})=1+1, which is false.

False statementConstruction: Literature-sourcedVerification: AI-generatedprecheck passjudge pass (deepseek-v4-pro + claude-opus-5[1m])audited 2026-08-24Open item page →

FALSE: every outer measure is countably additive on the whole power set

Statement

Every outer measure is countably additive on its entire power-set domain.

Facts & Assumptions

Given: The two-point set X={0,1} and the set function μ∗(∅)=0, μ∗(A)=1 for A≠∅.

[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)

Refutation

technique · direct
1.1F1algebra

The function vanishes at the empty set and is monotone; every cover of a nonempty union has a nonempty member, so its total cost is at least 1, and therefore the function is an outer measure.

2.1step 1.1algebra∎

The disjoint sets {0} and {1} have union X, but μ∗(X)=1 whereas μ∗({0})+μ∗({1})=2, so countable additivity fails after padding the pair by empty sets.

False statementConstruction: Literature-sourcedVerification: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + claude-opus-5[1m])audited 2026-08-24Open item page →

FALSE: every finitely additive nonnegative function on an algebra extends to a measure

Statement

Every finitely additive function from an algebra of subsets to [0,+∞] that vanishes at the empty set extends to a measure on the generated sigma-algebra.

Facts & Assumptions

Given: The power-set algebra P(N) and the function λ(A)=0 for finite A and λ(A)=+∞ for infinite A.

[F1]

An algebra of subsets of X is a subfamily of P(X) containing ∅ and closed under complements and finite unions. (Algebras of subsets)

[F2]

A measure vanishes at the empty set and is countably additive on every pairwise disjoint sequence in its sigma-algebra, beginning at index 0 and allowing +∞. (Measures on sigma-algebras)

Refutation

technique · direct
1.1F1algebra

The function vanishes at ∅. If A and B are disjoint and both finite, their union is finite and 0=0+0; if their union is infinite, at least one of A,B is infinite, so both λ(A∪B) and λ(A)+λ(B) are +∞. Thus λ is finitely additive on the algebra [F1].

2.1step 1.1F2algebra∎

The algebra is already the sigma-algebra P(N), so any extension must equal λ there. But the disjoint singleton sequence has union N, while λ(N)=+∞ and ∑k=0∞λ({k})=0, contradicting [F2].

False statementConstruction: Literature-sourcedVerification: AI-adaptedprecheck passaudited 2026-08-24Open item page →

FALSE: the extension of a premeasure is always unique

Statement

Every premeasure has at most one measure extension to its generated sigma-algebra, without any sigma-finiteness hypothesis.

Facts & Assumptions

Given: The algebra A0 of finite unions of half-open intervals (a,b] in R with extended endpoints, and μ0(∅)=0, μ0(A)=+∞ for nonempty A∈A0.

[F1]

A premeasure on an algebra A0 vanishes at the empty set and is countably additive whenever a disjoint sequence in A0 has its union in A0. (Premeasures on algebras of sets)

[L1]

For every set X, counting measure is a measure on (X,P(X)). (Counting measure is a measure)

[L2]

The family of half-open intervals (a,b] with real a<b generates the Borel sigma-algebra B(R). (Seven generating families for the Borel sigma-algebra on the real line)

Refutation

technique · direct
1.1F1L2algebra

The family A0 is an algebra containing the finite half-open intervals, so [L2] gives B(R)⊆σ(A0). Every extended-endpoint half-open interval is Borel, and finite unions of Borel sets are Borel, so A0⊆B(R) and the reverse inclusion follows. A disjoint sequence in A0 with empty union has all terms empty, while one with nonempty union has a nonempty term, so [F1] gives countable additivity of μ0. Every nonempty member contains a nonempty interval component and hence the distinct midpoint-bisection sequence a+(b−a)/2n after restricting to finite endpoints; therefore it is infinite, and the only finite-μ0 member is ∅, so μ0 is not sigma-finite.

2.1step 1.1L1algebra

By [L1], counting measure restricted to B(R) is a measure and agrees with μ0 because every nonempty source-algebra member is infinite. The function ν(B)=0 for B=∅ and ν(B)=+∞ otherwise is also a Borel measure: a disjoint union is empty exactly when every term is empty, and otherwise one term is nonempty. Thus both are extensions.

3.1step 2.1algebra∎

On a singleton {x}, counting measure is 1 while ν({x})=+∞, so the extensions are distinct.

False statementConstruction: Literature-sourcedVerification: AI-adaptedprecheck passaudited 2026-08-24Open item page →

FALSE: the covering construction agrees with every finitely additive source function

Statement

If a nonnegative set function on an algebra is finitely additive and vanishes at the empty set, then the countable-covering infimum agrees with it on the source algebra.

Facts & Assumptions

Given: The finite-cofinite algebra A0 of N and μ0(A)=0 for finite A, μ0(A)=+∞ for cofinite A.

[F1]

The set function induced by μ0 assigns E⊆X the infimum of ∑kμ0(Ak) over all countable algebra covers E⊆⋃kAk. (The outer set function induced by a premeasure)

[F2]

An algebra of subsets of X contains ∅ and is closed under complements and finite unions. (Algebras of subsets)

Refutation

technique · direct
1.1F2algebra

The finite-cofinite family is an algebra by [F2]. For disjoint A,B, two cofinite sets cannot both occur; if both are finite, all three values are 0, and if one is cofinite, the union and that set have value +∞, so μ0 is finitely additive.

2.1step 1.1F1algebra∎

Apply the covering formula of [F1] to this source function. The singleton sequence ({k})k∈N covers N with total cost 0, so the covering infimum at N is 0, while μ0(N)=+∞; hence finite additivity does not force agreement.

Sources