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, zero on countable sets and infinity on cocountable sets is a non-semifinite measure
Example
Assume the Axiom of Countable Choice and let be uncountable. On the sigma-algebra of countable and cocountable subsets of , define
Then is a measure, but it is not semifinite.
Facts & Assumptions
Given: An uncountable set and the Axiom of Countable Choice.
A sigma-algebra is closed under complements and countable unions (Sigma-algebras), and a measure is countably additive on disjoint measurable sequences (Measures on sigma-algebras).
Countable means finite or countably infinite (Finite, countably infinite, countable, uncountable), and under countable choice a countable union of at most countable sets is at most countable (The Axiom of Countable Choice (), Countable unions of at most countable sets, assuming ).
Semifiniteness requires every positive-measure measurable set to contain a positive finite-measure measurable subset (Finite, sigma-finite, and semifinite measures).
Verification
The countable-cocountable family is a sigma-algebra: complements exchange its two classes, a countable union of countable members is countable by [L2], and a union containing a cocountable member is cocountable.
The whole space has measure , while every measurable set of finite measure has measure ; hence contains no measurable subset of positive finite measure.
In a pairwise disjoint sequence from , at most one member is cocountable. If all members are countable, their union is countable by [L2] and both sides of countable additivity are ; if one is cocountable, the union is cocountable and both sides are .
Steps 1.1 and 2.1 prove that is a measure, and step 1.2 violates the semifiniteness condition [L3].
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
21 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 (standard reference, not scraped)