Alphabeta Math
ExampleConstruction: AI-adaptedVerification: AI-adaptedPipeline-generatedaudited 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 p and Lp

Statement

Assume countable choice ACω. For every measure space (S,A,μ) and every 1<p<, both real and complex Lp(μ) are reflexive. In particular, real and complex p are reflexive in this exponent range.

The open range is essential. Real and complex c0 are not reflexive. If, in addition to ACω, the ultrafilter lemma, dependent choice, and the relative Hahn--Banach principle are assumed, then real and complex 1 and are not reflexive. In particular, counting measure gives an L endpoint counterexample.

Facts & Assumptions

Given: Countable choice, an arbitrary measure space, an exponent 1<p<, and a scalar field K{R,C}; for the 1 endpoint clause also the ultrafilter lemma, DC, and relative HB.

[F1]

Under ACω, real and complex Lp over an arbitrary measure space are reflexive for 1<p< (The Axiom of Countable Choice (ACω), Reflexivity of Lp for one less p less infinity).

[F2]

On counting measure on N, real Lp is exactly real p with the same norm. For complex functions, the complex Lp definition uses the same integral of the real nonnegative modulus fp; applying the counting-measure identity to that modulus gives fpp=kf(k)p. Since counting measure has no nonempty null set, its a.e. quotient is equality everywhere, so complex Lp is isometrically complex p as well (p is the Lp space of counting measure, Complex Lp classes and Euclidean test-function conventions).

[F4]

Real and complex c0 are Banach without choice (Real and complex c0 are Banach). A Banach space is reflexive exactly when its canonical evaluation map JX:XX is onto (Reflexivity is surjectivity of the canonical map). The bilinear sequence-pairing identifications give c0(K)=1(K); the real dual of 1 is by counting-measure duality, and the complex dual is (C) by the complex sequence theorem (The continuous dual of c0 is ell-one, Counting measure specializes the representation theorem to p and q, The complex continuous dual of ell-one is ell-infinity). A sequence lies in c0 exactly when it tends to zero, while contains every bounded sequence (The sequence spaces c_0 and ell-infinity).

[F5]

c0(K) is a closed linear subspace of (K) (c_0 is a closed subspace of ell-infinity). Under the assumed relative Hahn--Banach principle, every closed linear subspace of a reflexive real or complex Banach space is reflexive (Closed subspaces of reflexive spaces are reflexive).

Proof

technique · Specialize arbitrary-measure reflexivity to counting measure, then compute the canonical image of $c_0$ under the published bilinear duality identifications
1.1

The first assertion is exactly [F1]: under ACω, both scalar versions of Lp(μ) are reflexive for every measure space and every 1<p<. Empty and zero measure spaces are included; their Lp spaces are zero and the cited theorem still applies.

F1given
1.2

Under the three additional principles stated for the endpoint clause, [F3] gives nonreflexivity of both real and complex 1. Those principles are used here only through that cited corollary.

F3given
1.3

The c0 conclusion needs none of those additional principles. Fix K. By [F4], c0(K) is a Banach space. Let T:1(K)c0(K) be the isometric bijection in [F4], so T(a)(x)=nanxn. Identify (1(K)) with (K) by [F4], using the same bilinear series pairing. For xc0 and a1, Jc0(x)(T(a))=T(a)(x)=nanxn. Thus, under the composite identification c0, the canonical image Jc0(x) is exactly the bounded sequence x. The constant sequence 1=(1,1,) belongs to but not to c0 by [F4], so it is a concrete bidual element outside Jc0(c0). Hence Jc0 is not onto and [F4] proves that real and complex c0 are not reflexive.

F4

Under relative Hahn--Banach, suppose (K) were reflexive. Then it would be a reflexive Banach space, and [F5] would make its closed subspace c0(K) reflexive, contradicting the preceding canonical-image calculation. Hence (K) is not reflexive, for either scalar field. The ultrafilter lemma and DC in the endpoint hypotheses are needed for the selected 1 proof, not for this argument. [F4, F5]

2.1

Give N counting measure. By [F2], the real or complex Lp space in step 1.1 is isometrically the corresponding p. Reflexivity therefore gives the asserted sequence-space specialization.

step 1.1F2

For counting measure, no nonempty subset is null, so the essential-supremum norm on L(N) is the ordinary supremum norm and its a.e. equivalence is equality. Thus L(N;K) is isometrically (K); Step 1.3 supplies the claimed L endpoint counterexample under its exact assumptions. [F2, F4, step 1.3]

3.1

Steps 1.1 and 2.1 prove the positive result in the entire open exponent range, while steps 1.2, 1.3, and 2.1 provide the promised failures outside it. Countable choice is used through the arbitrary-measure Lp theorem. The ultrafilter lemma, DC, and relative HB are additionally used only for the selected 1 proof; the direct canonical-image proof for c0 is choice-free. No assertion about reflexivity of L1 or L on every measure space is made.

step 1.1step 2.1step 1.2step 1.3F1F3F5

Remarks

Source notes

Teschl's sequence-space examples after Theorem 4.20 identify reflexivity of p for 1<p< and compute the canonical image of c0 as the proper inclusion c0 (printed p. 116). The arbitrary-measure and complex-scalar claims here use the stronger local suppliers listed above. The 1 endpoint retains the exact assumptions of the library's selected Schur/Eberlein--Smulian proof rather than silently weakening them from the source's classical setting.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

67 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