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, the semifinite part is a semifinite measure and equals the original measure exactly when it is semifinite
Statement
Assume the Axiom of Countable Choice. For every measure , its semifinite part is a semifinite measure and . Moreover,
Facts & Assumptions
Given: A measure on and the Axiom of Countable Choice.
The semifinite part is the supremum of the finite values over measurable (The semifinite part of a measure).
Under countable choice, an infinite-measure set for a semifinite measure contains finite-measure subsets of arbitrarily large measure (Assuming countable choice, an infinite-measure set in a semifinite measure space has arbitrarily large finite-measure subsets).
A measure is countably additive on disjoint measurable sequences (Measures on sigma-algebras), and measures are monotone (Measures are monotone).
A natural-number-indexed finite family of nonempty sets has a choice function in ZF (Every natural-number-indexed list of nonempty sets has a choice function on its family of values).
Proof
One has and for every measurable , since every finite-measure satisfies .
Let be disjoint and . If is measurable with , then the are disjoint finite-measure subsets of , so . Taking the supremum over gives .
Conversely, for each finite initial range, the supremum property and finite choice permit finite-measure arbitrarily close to ; their finite disjoint union has finite measure and lies in . If one of the finitely many suprema is , use an arbitrarily large finite value instead. Hence every finite partial sum is at most , and so is their supremum.
The set function is semifinite: if , its defining supremum supplies a measurable with , and then .
For the reverse direction, suppose is semifinite. If , the choice gives ; if , [L2] makes the defining finite values unbounded, so again .
Steps 1.1, 1.2 and 1.3 give the empty-set condition and both countable-additivity inequalities, so is a measure; step 1.4 makes it semifinite.
For the forward direction of the displayed equivalence, if , then is semifinite because step 2.1 proves that is semifinite.
Steps 3.1 and 1.5 prove both directions of the equivalence, while step 1.1 records the pointwise inequality .
Depends on
- The semifinite part of a measure
- Assuming countable choice, an infinite-measure set in a semifinite measure space has arbitrarily large finite-measure subsets
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
- Measures on sigma-algebras
- Measures are monotone
- Every natural-number-indexed list of nonempty sets has a choice function on its family of values
Used by
Cited to discharge well-definedness by The semifinite part of a measure.
Dependency tree · two levels
23 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(a-b) (standard reference, not scraped)