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
Then is a measure taking only the values and , and
The zero-infinity summand in such a decomposition need not be unique.
Facts & Assumptions
Given: A measure on and the Axiom of Countable Choice.
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).
Sigma-finiteness means admitting a countable measurable cover by finite-measure sets (Finite, sigma-finite, and semifinite measures).
Countable choice selects countably many covers (The Axiom of Countable Choice ()), 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).
Under countable choice, a countable union of at most countable sets is at most countable (Countable unions of at most countable sets, assuming ).
Counting measure is a measure (Counting measure is a measure), and is uncountable ( is uncountable (Cantor's nested intervals, 1874)).
A countable union has measure at most the nonnegative sum of the measures of its members (Finite and countable subadditivity of measures).
The value is the supremum of the values of finite-measure measurable subsets of (The semifinite part of a measure).
Counting measure assigns a finite set its cardinality and an infinite set (Counting measure on an arbitrary set).
Proof
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 family to one countable cover.
If is sigma-finite for , restriction of the measure axioms makes 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 , is exactly the supremum in [L7]. Thus [L1] applied to gives .
For nonuniqueness, take counting measure on the uncountable set . It is semifinite: every set of positive counting measure is nonempty, so one of its points gives a singleton subset of finite positive measure by [L8]. Hence [L1] makes its semifinite part itself. Besides the zero measure, define for countable and for uncountable . One has ; for a disjoint sequence, [L4] makes the union countable exactly when every member is countable, so countable additivity has both sides in that case and both sides otherwise. Thus is a measure, and both and satisfy .
Therefore, for a disjoint sequence , the union is sigma-finite exactly when every is sigma-finite. Hence exactly when every , and otherwise both sides of are ; also .
If is sigma-finite, step 1.2 gives ; if is not sigma-finite, then and .
Step 2.1 proves that is a zero-infinity-valued measure.
Step 2.2 proves , and step 1.3 supplies two distinct zero-infinity summands for the same semifinite part, proving the final assertion.
Depends on
- The semifinite part of a measure
- Assuming countable choice, the semifinite part is a semifinite measure and equals the original measure exactly when it is semifinite
- Finite, sigma-finite, and semifinite measures
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
- A product of two at most countable sets is at most countable
- Countable unions of at most countable sets, assuming $\mathrm{AC}_\omega$
- Finite and countable subadditivity of measures
- Counting measure on an arbitrary set
- Counting measure is a measure
- $\mathbb{R}$ is uncountable (Cantor's nested intervals, 1874)
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
- G. Folland, Real Analysis, 2nd ed., §1.3, Exercise 15(c) (standard reference, not scraped)