Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-14
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 ACω. For every measure space (S,A,μ) and every 1<p<, both Lp(μ;R) and Lp(μ;C) are reflexive.

Facts & Assumptions

Given: ACω, an arbitrary measure space, 1<p<, and the conjugate exponent q, so 1<q< and the conjugate exponent of q is p.

[F1]

A Banach space is reflexive exactly when its canonical evaluation map into the bidual is surjective (Reflexivity is surjectivity of the canonical map).

[F2]

Under Countable Choice, real Lr duality over an arbitrary measure space identifies every member of (Lr) uniquely and isometrically with a bilinear integration density in Lr, for 1<r< (For 1<p<, the same representation theorem holds on arbitrary measure spaces).

[F3]

Under Countable Choice, the same unique isometric bilinear-pairing identification holds for complex Lr, 1<r< (Complex Lp duality from real Lp duality).

[F4]

Under Countable Choice, real Lr is complete for every 1r (Riesz-Fischer completeness of Lp for 1p).

[F5]

Complex Lr 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).

[F6]

Countable Choice is the assertion that every countable family of nonempty sets has a choice function (The Axiom of Countable Choice (ACω)).

Proof

technique · apply the $L^p$ representation theorem twice and identify the resulting map with canonical evaluation
1.1

First verify the Banach condition. Real Lp is complete by [F4]. If (fn) is Cauchy in complex Lp, [F5] makes (Refn) and (Imfn) Cauchy in real Lp; [F4] gives limits u,vLp(μ;R). The upper component bound in [F5] gives fn(u+iv)pRefnup+Imfnvp0. Thus complex Lp is complete as well, including the zero and empty measure spaces.

F4F5given
1.2

Fix either scalar field K and write E=Lp(μ;K) and H=Lq(μ;K). By [F2] in the real case and [F3] in the complex case, the map Tq:HE defined by (Tqh)(f)=fhdμ is a scalar-linear isometric bijection. The same theorem with q in place of p identifies H isometrically with Lp=E by the same bilinear formula.

F2F3given
2.1

Let ΦE. Since Tq is a bounded linear map, ΦTq lies in H. The q-duality assertion in step 1.2 therefore supplies uE such that Φ(Tqh)=hudμ for every hH. This includes Φ=0, for which uniqueness gives u=0.

step 1.2
3.1

Given any E, surjectivity of Tq supplies hH with =Tqh. Commutativity of scalar multiplication and the bilinear pairing then gives Φ()=Φ(Tqh)=hu=uh=(Tqh)(u)=(u)=(JEu)(). Hence Φ=JEu.

step 1.2step 2.1algebra
4.1

Every ΦE is therefore in the range of JE. Step 1.1 makes E 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 p and q to lie strictly between one and infinity, so it makes no endpoint claim.

F1F6step 1.1step 1.2step 3.1

Remarks

Using the bilinear complex pairing is what makes the canonical-map calculation literal: the two scalar factors commute in hu=uh. With a sesquilinear convention an explicit conjugation map would be required.

Depends on

Used by

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