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.
Reflexivity of Lp for one less p less infinity
Statement
Assume the Axiom of Countable Choice . For every measure space and every , both and are reflexive.
Facts & Assumptions
Given: , an arbitrary measure space, , and the conjugate exponent , so and the conjugate exponent of is .
A Banach space is reflexive exactly when its canonical evaluation map into the bidual is surjective (Reflexivity is surjectivity of the canonical map).
Under Countable Choice, real duality over an arbitrary measure space identifies every member of uniquely and isometrically with a bilinear integration density in , for (For , the same representation theorem holds on arbitrary measure spaces).
Under Countable Choice, the same unique isometric bilinear-pairing identification holds for complex , (Complex Lp duality from real Lp duality).
Under Countable Choice, real is complete for every (Riesz-Fischer completeness of for ).
Complex has a well-defined norm, and its real and imaginary parts have norm at most the complex norm while the complex norm is at most the sum of their norms (Complex Holder, Minkowski, and the quotient norm).
Countable Choice is the assertion that every countable family of nonempty sets has a choice function (The Axiom of Countable Choice ()).
Proof
First verify the Banach condition. Real is complete by [F4]. If is Cauchy in complex , [F5] makes and Cauchy in real ; [F4] gives limits . The upper component bound in [F5] gives . Thus complex is complete as well, including the zero and empty measure spaces.
Fix either scalar field and write and . By [F2] in the real case and [F3] in the complex case, the map defined by is a scalar-linear isometric bijection. The same theorem with in place of identifies isometrically with by the same bilinear formula.
Let . Since is a bounded linear map, lies in . The -duality assertion in step 1.2 therefore supplies such that for every . This includes , for which uniqueness gives .
Given any , surjectivity of supplies with . Commutativity of scalar multiplication and the bilinear pairing then gives . Hence .
Every is therefore in the range of . Step 1.1 makes Banach, so [F1] proves reflexivity in both scalar fields. The proof uses Countable Choice only through the completeness and arbitrary-measure duality suppliers cited in steps 1.1–1.2; [F6] records that exact assumption. No Hahn–Banach or compactness principle is additionally invoked. The argument requires both and to lie strictly between one and infinity, so it makes no endpoint claim.
Remarks
Using the bilinear complex pairing is what makes the canonical-map calculation literal: the two scalar factors commute in . With a sesquilinear convention an explicit conjugation map would be required.
Depends on
- Reflexivity is surjectivity of the canonical map
- For $1 < p < \infty$, the same representation theorem holds on arbitrary measure spaces
- Complex Lp duality from real Lp duality
- Riesz-Fischer completeness of $L^p$ for $1 \le p \le \infty$
- Complex Holder, Minkowski, and the quotient norm
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
Used by
- Reflexivity of ℓᵖ and Lᵖ Example
Dependency tree · two levels
37 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. (standard reference, not scraped)
- John K. Hunter, Measure Theory (standard reference, not scraped)