Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck passaudited 2026-08-21
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.

Assuming countable choice, every measure is the sum of its semifinite part and a zero-infinity-valued measure

Statement

Assume the Axiom of Countable Choice. For a measure μ, define

ν(E):={0,E is sigma-finite for μ,+,E is not sigma-finite for μ.

Then ν is a measure taking only the values 0 and +, and

μ=μsf+ν.

The zero-infinity summand in such a decomposition need not be unique.

Facts & Assumptions

Given: A measure μ on (X,A) and the Axiom of Countable Choice.

[L1]

Under countable choice, the semifinite part is a semifinite measure and agrees with a measure exactly when that measure is semifinite (Assuming countable choice, the semifinite part is a semifinite measure and equals the original measure exactly when it is semifinite).

[L2]

Sigma-finiteness means admitting a countable measurable cover by finite-measure sets (Finite, sigma-finite, and semifinite measures).

[L3]

Countable choice selects countably many covers (The Axiom of Countable Choice (ACω)), and a product of two at most countable sets is at most countable (A product of two at most countable sets is at most countable).

[L4]

Under countable choice, a countable union of at most countable sets is at most countable (Countable unions of at most countable sets, assuming ACω).

[L5]

Counting measure is a measure (Counting measure is a measure), and R is uncountable (R is uncountable (Cantor's nested intervals, 1874)).

[L6]

A countable union has measure at most the nonnegative sum of the measures of its members (Finite and countable subadditivity of measures).

[L7]

The value μsf(E) is the supremum of the values of finite-measure measurable subsets of E (The semifinite part of a measure).

[L8]

Counting measure assigns a finite set its cardinality and an infinite set + (Counting measure on an arbitrary set).

Proof

technique · direct
1.1

A measurable subset of a sigma-finite set is sigma-finite. Under [L3], a countable union of sigma-finite measurable sets is sigma-finite: select a finite-measure cover for each member and flatten the resulting N×N family to one countable cover.

givenL2L3choose
1.2

If E is sigma-finite for μ, restriction of the measure axioms makes μE a measure, and it is semifinite: a positive-measure subset must meet one member of a finite-measure cover in positive measure, since otherwise [L6] would make it null. The semifinite part of this restriction, evaluated at E, is exactly the supremum in [L7]. Thus [L1] applied to μE gives μsf(E)=μ(E).

givenL1L2L6L7
1.3

For nonuniqueness, take counting measure # on the uncountable set R. It is semifinite: every set of positive counting measure is nonempty, so one of its points gives a singleton subset of finite positive measure 1 by [L8]. Hence [L1] makes its semifinite part itself. Besides the zero measure, define η(E)=0 for countable E and + for uncountable E. One has η()=0; for a disjoint sequence, [L4] makes the union countable exactly when every member is countable, so countable additivity has both sides 0 in that case and both sides + otherwise. Thus η is a measure, and both 0 and η satisfy #=#sf+0=#sf+η.

givenL1L4L5L8
2.1

Therefore, for a disjoint sequence (Ek), the union is sigma-finite exactly when every Ek is sigma-finite. Hence ν(kEk)=0 exactly when every ν(Ek)=0, and otherwise both sides of ν(kEk)=kν(Ek) are +; also ν()=0.

step 1.1L2
2.2

If E is sigma-finite, step 1.2 gives (μsf+ν)(E)=μ(E)+0; if E is not sigma-finite, then μ(E)=+ and (μsf+ν)(E)=μsf(E)+(+)=+.

step 1.2L2
3.1

Step 2.1 proves that ν is a zero-infinity-valued measure.

step 2.1
4.1

Step 2.2 proves μ=μsf+ν, and step 1.3 supplies two distinct zero-infinity summands for the same semifinite part, proving the final assertion.

step 2.2step 1.3

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

41 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