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.
The zero-countable / infinity-cocountable measure space breaks the endpoint of duality
Statement refuted
For , every bounded linear functional on is represented by a unique element of on every measure space.
Facts & Assumptions
Given: Assume the Axiom of Countable Choice (The Axiom of Countable Choice ()). Let be an uncountable set, let and define
Under countable choice, a countable union of at most countable sets is at most countable, and every subset of an at most countable set is at most countable (Countable unions of at most countable sets, assuming , Every subset of an at most countable set is at most countable).
A sigma-algebra is an algebra of subsets closed under countable unions, and a measure has value on and is countably additive on pairwise disjoint measurable sequences (Sigma-algebras, Measures on sigma-algebras).
The space is built from integrable representatives, is the space of essentially bounded measurable functions, and passes to almost-everywhere equivalence classes (The class of integrable functions, The space of essentially bounded measurable functions, The space as the quotient by null functions).
Chebyshev-Markov gives (Chebyshev-Markov inequality for the integral).
Counterexample
The family contains and is closed under complements by definition. Let lie in . If every is at most countable, then is at most countable by [L1]. If some is cocountable, then so [L1] makes the complement at most countable. Thus is a sigma-algebra on .
The function satisfies . Let be pairwise disjoint in . If two members were cocountable, then would be at most countable by [L1], contradicting that is uncountable. So at most one is cocountable. If every is at most countable, then is at most countable by [L1], and both sides of countable additivity are . If some is cocountable, then is at most countable by [L1], so the union is cocountable and both sides of countable additivity are . Hence is a measure on .
By definition of , a measurable set has finite -measure exactly when it is at most countable, and then its -measure is . In particular, is measurable and because is at most countable.
Let and choose an integrable representative . For each , set . By [L4], Step 3.1 therefore gives , so each is at most countable. By [L1], is at most countable and hence null. Thus every element of is the zero class.
The constant functions and are both in , but they do not define the same class because and step 3.1 gives that is not null. Thus contains at least two distinct classes.
Since has only the zero class by step 4.1, its only bounded linear functional is the zero functional. Both and represent that zero functional, because for the unique class in . By step 4.2, those two classes are distinct, so uniqueness fails. Therefore the representation theorem is false on this measure space.
Depends on
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
- Sigma-algebras
- Measures on sigma-algebras
- Countable unions of at most countable sets, assuming $\mathrm{AC}_\omega$
- Every subset of an at most countable set is at most countable
- The space $L^p(\mu)$ as the quotient by null functions
- The space $L^\infty(\mu)$ of essentially bounded measurable functions
- The class $L^1(\mu)$ of integrable functions
- Chebyshev-Markov inequality for the integral
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
38 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
- Gerald B. Folland, Real Analysis, 2nd ed., paragraph after Theorem 6.15 (standard reference, not scraped)
- John K. Hunter, Measure Theory, paragraph after Theorem 7.14 (standard reference, not scraped)