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.
For , the same representation theorem holds on arbitrary measure spaces
Statement
Assume the Axiom of Countable Choice (The Axiom of Countable Choice ()).
Let be any measure space, let , and let be conjugate to . For every bounded linear functional there exists a unique such that Moreover,
Facts & Assumptions
Given: The Axiom of Countable Choice, a measure space , an exponent , its conjugate exponent , and a bounded linear functional on .
Countable Choice is assumed (The Axiom of Countable Choice ()).
On every sigma-finite measurable subset, bounded functionals are represented by unique densities (On a sigma-finite measure space, every bounded linear functional on is integration against a unique function, On a semifinite measure space, a representing function is unique).
Every class with has sigma-finite essential support (For , every class has a sigma-finite essential support).
For , the pairing functional has norm (The functional has norm ; for assume is semifinite).
Proof
Let be the family of sigma-finite measurable subsets of . For each , define the restricted functional on , where is extended by outside . By [L1], there is a unique such that and
The empty set lies in and has , so the bounded set below is nonempty. Put For each , the definition of the supremum makes the family nonempty. By [L0], choose one from each family. Because each is sigma-finite, the family of sequences of measurable finite-measure subsets of whose union is is nonempty. Using [L0] again, choose one such sequence for every . Let The doubly indexed family has union , and a diagonal enumeration of it proves that is sigma-finite. By [L1], there is a unique representing . Since and both and represent , uniqueness in [L1] gives almost everywhere on . Therefore Since , the definition of also gives , and hence .
Let be the zero extension of a measurable representative of from to . Since , step 2.1 gives so and . Now let . Then is sigma-finite, so [L1] supplies . Uniqueness on and on gives Therefore The left side is at most by definition of , while the first term is by step 2.1. Hence so almost everywhere on and almost everywhere on .
Let . By [L2], choose a sigma-finite measurable set such that almost everywhere on . Applying step 1.1 to gives with Step 3.1 gives almost everywhere on , so Thus represents on all of .
If also represents , then and . By [L2], choose a sigma-finite measurable set such that almost everywhere on . The restrictions of and to represent the same bounded functional on the sigma-finite space , so [L1] gives almost everywhere on . Together with the choice of , this proves almost everywhere on . Finally [L3] gives So the representing class is unique and has the correct norm.
Depends on
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
- On a sigma-finite measure space, every bounded linear functional on $L^p$ is integration against a unique $L^q$ function
- For $1 \le p < \infty$, every $L^p(\mu)$ class has a sigma-finite essential support
- On a semifinite measure space, a representing $L^q$ function is unique
- Finite, sigma-finite, and semifinite measures
- The functional $\Lambda_g$ has norm $\|g\|_q$; for $q=\infty$ assume $\mu$ is semifinite
Used by
Dependency tree · two levels
26 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., Theorem 6.15 (standard reference, not scraped)
- John K. Hunter, Measure Theory, Theorem 7.14 (standard reference, not scraped)