Alphabeta Math
Pipeline-generated
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 and Eberlein Smulian

1 · Prerequisites

2 · Summary

Reflexivity first appears here as a compactness property of the closed unit ball and as a canonical relationship between a Banach space and its bidual. The opening results prove the weak-compactness criterion, dual reflexivity, stability under closed subspaces and quotients, and real/complex Lp reflexivity in the open range. Their ultrafilter-lemma, relative Hahn--Banach, and Countable Choice costs are stated on the individual items; none is silently promoted to a stronger choice principle.

The middle section distinguishes relative weak compactness, sequential compactness, and countable compactness before proving the full Eberlein--Šmulian equivalence. Its reductions isolate the separable span, metrize only the relevant bounded dual ball, and return pointwise closure to the canonical bidual image. Schur's property then shows why agreement of weak and norm convergence for sequences need not identify the two topologies.

The final section develops geometric routes to reflexivity and norm attainment. Uniform convexity leads through Milman--Pettis; Clarkson's exact real and complex inequalities give the Lp application. James's theorem is proved through its noncompactness and convex-block lemmas, while Bishop--Phelps is kept to its valid scalar and convex-set scope. The closing separability results and the choice-free completeness of real and complex c0 supply the companion examples without importing later Hilbert-space theorems.

3 · Logical flowchart

4 · Definitions, theorems and proofs

TheoremStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-14Open item page →

Reflexive iff unit ball weakly compact

Statement

Assume the ultrafilter lemma and HB. A real or complex Banach space X is reflexive if and only if its closed unit ball

BX={xX:x1}

is compact for the weak topology σ(X,X).

Facts & Assumptions

Given: The ultrafilter lemma, HB, and a real or complex Banach space X.

[F1]

Reflexivity means that the canonical evaluation map JX:XX is surjective (Reflexivity is surjectivity of the canonical map).

[F2]

Under HB, JX is scalar-linear and isometric, with (JXx)(f)=f(x) (Relative Hahn–Banach makes the canonical bidual map an isometry).

[F3]

The weak topology on X is the initial topology of the maps xf(x) for fX, and the weak-star topology on X is the initial topology of the evaluations xx(f) for fX (Weak topology on a normed space, The weak-star topology from finite evaluations).

[F4]

Every weak-star topology is Hausdorff; this needs neither HB nor a choice principle (Basic weak star neighborhoods, step 4.1).

[F5]

Assuming the ultrafilter lemma, the closed unit ball of a normed dual is weak-star compact (Banach–Alaoglu).

[F8]

Under HB, JX(BX) is weak-star dense in BX (Goldstine's theorem).

[F9]

The compactness principle used by the selected proof of Banach–Alaoglu is compact-Hausdorff Tychonoff under the ultrafilter lemma (Assuming the ultrafilter lemma, an arbitrary product of compact Hausdorff spaces is compact).

[F10]

HB denotes the real dominated-extension principle and is an additional hypothesis over ZF (The real dominated-extension principle as an additional hypothesis over ZF).

Proof

Proof technique: identify the weak unit ball with its canonical bidual image and use compactness plus density.

1.1

For every fX and xX, (xx(f))(JXx)=f(x). Consequently the pullback by JX of the weak-star initial topology on X is exactly the weak initial topology on X: both are generated by the same family {f:fX}. Since [F2] makes JX injective, it is a homeomorphism from weak X onto JX(X) with the relative weak-star topology. This also covers X={0}, when both spaces are singletons.

F2F3
1.2

Isometry gives JX(BX)=JX(X)BX. Indeed JXx=x, so both inclusions include the closed boundary x=1; if X=0, both sides are the singleton {0}.

F2
2.1

Suppose first that X is reflexive. By [F1], JX(X)=X, so step 1.2 gives JX(BX)=BX. Apply Banach–Alaoglu to the normed space X: under the ultrafilter lemma its dual ball BX is weak-star compact. The homeomorphism in step 1.1 therefore transfers this compactness to weak BX. This is the only direction, and the only step, that spends the ultrafilter lemma; in the selected Alaoglu proof it enters through [F9].

F1F5F9step 1.1step 1.2
2.2

Conversely, suppose that BX is weakly compact. Step 1.1 makes the restriction JXBX weak-to-weak-star continuous, so [F6] makes JX(BX) weak-star compact. The weak-star topology on X is Hausdorff by [F4], and hence [F7] makes JX(BX) weak-star closed in X. No compactness choice principle is used in this reverse implication: its compact set is the one in the hypothesis.

F4F6F7step 1.1
3.1

Goldstine [F8] says that JX(BX) is weak-star dense in BX. It is contained in that ball by step 1.2 and is weak-star closed by step 2.2. Therefore JX(BX)=BX. This uses topological closure, not merely sequential closure.

F8step 1.2step 2.2
4.1

Let xX. If x=0, then x=JX0. If x0, put u=x/xBX. Step 3.1 supplies uBX with JXu=u; scalar linearity then gives x=JX(xu). Thus JX is onto, so X is reflexive by [F1]. This normalization treats the zero and norm-one endpoints separately and selects only one witness for the supplied x, not a family of witnesses.

F1F2step 3.1
5.1

Steps 2.1 and 4.1 prove the two implications. HB is used through the canonical isometry [F2] and Goldstine [F8], and [F10] records exactly which additional principle that name denotes. The ultrafilter lemma is used only through Alaoglu in step 2.1; the reverse implication is choice-free once its weak compactness hypothesis and HB-backed Goldstine are supplied.

F2F8F10step 2.1step 4.1

Remarks

Completeness is present because reflexivity is defined here for Banach spaces; the topological ball argument itself never applies a completeness theorem. The proof also explains why compactness, rather than sequential compactness, appears at this stage: compactness in a Hausdorff space makes the Goldstine-dense canonical ball closed. The sequential characterization requires the separate Eberlein–Šmulian theorem.

TheoremStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-14Open item page →

A Banach space is reflexive if and only if its dual is reflexive

Statement

Assume HB and the Axiom of Countable Choice ACω. A real or complex Banach space X is reflexive if and only if its dual X is reflexive.

Facts & Assumptions

Given: HB, ACω, and a real or complex Banach space X.

[F1]

A Banach space is reflexive exactly when its canonical map into its bidual is surjective; surjectivity means that every member of the bidual is evaluation at a vector (Reflexivity is surjectivity of the canonical map).

[F2]

Under HB the canonical map JE:EE of every real or complex normed space is scalar-linear and isometric, hence injective (Relative Hahn–Banach makes the canonical bidual map an isometry).

[F3]

Assuming ACω, a norm-complete subspace of a normed space is closed (A complete normed subspace is closed under countable choice).

[F4]

Under HB, a point outside a nonempty closed convex subset of a real or complex normed space is strictly separated from it by a nonzero bounded scalar-linear functional; the inequalities use its real part (Relative geometric Hahn–Banach with the exact open, closed, and compact hypotheses, part (ii)).

[F5]

HB is the real dominated-extension principle over ZF, and ACω is choice for each supplied sequence of nonempty sets (The real dominated-extension principle as an additional hypothesis over ZF, The Axiom of Countable Choice (ACω)).

Proof

technique · direct in both directions
1.1

If X={0}, every scalar-linear functional on X is zero, so X=X=X={0} and both canonical maps are surjective. The equivalence therefore holds in the zero-space case.

F1algebra
1.2

Suppose first that X is reflexive. Let ΛX and define f=ΛJX. Scalar linearity of the two maps makes f scalar-linear, and [F2] gives f(x)ΛJXx=Λx, so fX.

F2given
1.3

Conversely, suppose that X is reflexive and put W=JX(X)X. The image W is a scalar-linear subspace by [F2]. It is complete: if (JXxn) is Cauchy in its restricted norm, then xnxm=JXxnJXxm makes (xn) Cauchy in the Banach space X; for its limit x, the same equality gives JXxnJXx in W.

F2given
2.1

For arbitrary xX, reflexivity of X supplies an xX with x=JXx. Then JX(f)(x)=x(f)=JXx(f)=f(x)=Λ(JXx)=Λ(x). Thus JX(f)=Λ. Since Λ was arbitrary, JX is surjective and X is reflexive. This chooses only one representing vector for one arbitrary x at a time.

F1step 1.2
2.2

Apply [F3] under the assumed ACω. The complete subspace W is closed in X. It is also nonempty and convex because it is a linear subspace.

F3F5step 1.3
3.1

Suppose for contradiction that some zXW exists. By [F4] there is a nonzero ΓX that strictly separates the point z from W. In particular, ReΓ is bounded above on W. For wW and every real t, also twW; boundedness of tReΓ(w) for all tR forces ReΓ(w)=0. In the complex case iwW as well, so 0=ReΓ(iw)=ImΓ(w); hence in either field ΓW=0.

F4step 2.2assume-contraalgebra
4.1

Reflexivity of X supplies fX with Γ=JX(f). For every xX, step 3.1 yields 0=Γ(JXx)=JXx(f)=f(x). Thus f=0, whence Γ=JX(0)=0, contradicting the nonzero separator in step 3.1.

F1step 3.1discharge-contradiction: step 3.1
5.1

No point of X lies outside W, so JX(X)=X and [F1] says that X is reflexive. This proves the reverse implication and hence the equivalence. HB is used only in the isometry [F2] and separation [F4]; ACω is used only in step 2.2 through [F3].

F1F2F3F4step 4.1

Source notes

Bühler–Salamon, Theorem 2.71(i), printed pp. 89–90, supplies the complete canonical-map and annihilator argument. The proof above replaces the source's ordinary-choice background by the repository's exact local bookkeeping: ACω is stated because the selected complete-subspace-closed supplier assumes it, while HB is stated separately for bidual isometry and geometric separation. The complex branch is supplied by the real-part and iW calculation in step 3.1.

TheoremStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-14Open item page →

Closed subspaces of reflexive spaces are reflexive

Statement

Assume HB. If X is a real or complex reflexive Banach space and YX is a closed linear subspace with the restricted norm, then Y is reflexive.

Facts & Assumptions

Given: HB, a real or complex reflexive Banach space X, and a closed linear subspace YX.

[F1]

Reflexivity is surjectivity of the canonical evaluation map (Reflexivity is surjectivity of the canonical map).

[F2]

For a subset MX, M consists of the members of X that vanish on M (Annihilator notation and the preannihilator).

[F3]

Under HB, a point outside a nonempty closed convex subset of a real or complex normed space is uniformly strictly separated from it by the real part of a bounded scalar-linear functional (Relative geometric Hahn–Banach with the exact open, closed, and compact hypotheses, part (ii)).

[F4]

A closed linear subspace of a Banach space is Banach with its restricted norm (A closed subspace of a Banach space is Banach).

[F5]

HB is the real dominated-extension principle over ZF (The real dominated-extension principle as an additional hypothesis over ZF).

[F6]

Under HB, every bounded scalar-linear functional on any linear subspace of a normed space has a norm-preserving extension to the ambient space (Relative norm-preserving Hahn–Banach extension over the real and complex fields).

Proof

technique · pull a bidual functional back along dual restriction, represent it in $X$, and prove that its representing vector lies in $Y$
1.1

Let R:XY be restriction, R(f)=fY. It is scalar-linear and bounded with Rff. Hence for a supplied yY the composite x=yR belongs to X. Since X is reflexive, [F1] supplies xX such that JXx=x, meaning f(x)=y(fY) for every fX.

F1givenalgebra
2.1

If fY, then fY=0, so step 1.1 gives f(x)=y(0)=0. Thus every functional annihilating Y also annihilates x.

F2step 1.1
3.1

We claim xY. This is immediate if Y=X. Otherwise suppose xY; then Y is a nonempty closed convex set and [F3] supplies 0fX, aR, and ε>0 with Ref(y)aε<a+εRef(x) for every yY. Since tyY for every real t, the real-linear function Ref can be bounded above on the line Ry only when Ref(y)=0. In the complex case applying this also to iyY gives Ref(iy)=Imf(y)=0, so in either field fY=0. Taking y=0 in the separation inequality gives 0aε and hence Ref(x)a+ε2ε>0, contradicting step 2.1. Therefore xY.

F2F3step 2.1discharge-contradiction
4.1

Let gY be arbitrary. By norm-preserving Hahn–Banach [F6], one functional fX extends g; this also covers g=0 and Y={0}. Steps 1.1 and 3.1 then give y(g)=y(fY)=f(x)=g(x)=(JYx)(g). Hence y=JYx.

F6step 1.1step 3.1
5.1

The closed-subspace theorem [F4] makes Y a Banach space. Since the arbitrary yY of step 1.1 lies in the range of JY by step 4.1, that canonical map is surjective, and [F1] makes Y reflexive. If Y=0, its bidual and all maps above are zero and the same argument gives the singleton range directly.

F1F4step 1.1step 4.1
6.1

HB is used exactly twice: geometric separation in step 3.1 and the extension of one supplied g in step 4.1; [F5] records the principle being assumed. No compactness principle or simultaneous family choice occurs.

F3F5F6step 3.1step 4.1step 5.1

Remarks

Closedness of Y has two distinct jobs: it makes Y complete, and it permits separation of a hypothetical representing vector outside Y. No assertion is made for a nonclosed subspace.

TheoremStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-14Open item page →

Quotients of reflexive spaces are reflexive

Statement

Assume HB and the Axiom of Countable Choice ACω. If X is a real or complex reflexive Banach space and YX is a closed linear subspace, then the quotient Banach space X/Y is reflexive.

Facts & Assumptions

Given: HB, ACω, a real or complex reflexive Banach space X, and a closed scalar-linear subspace YX.

[F1]

Reflexivity means that the canonical map JX:XX is surjective, so every xX is evaluation at a vector of X (Reflexivity is surjectivity of the canonical map).

[F2]

For the quotient map q:XX/Y, pullback is a scalar-linear isometric bijection Q:(X/Y)Y, Qh=hq (The dual of a quotient is its annihilator).

[F3]

Under HB, every bounded scalar-linear functional on an arbitrary linear subspace of a real or complex normed space extends to the whole space without increasing its norm (Relative norm-preserving Hahn–Banach extension over the real and complex fields).

[F4]

Assuming ACω, the quotient of a Banach space by a closed linear subspace is Banach for the quotient norm (A quotient of a Banach space by a closed subspace is Banach).

[F5]

HB is the real dominated-extension principle over ZF, while ACω chooses from each supplied sequence of nonempty sets (The real dominated-extension principle as an additional hypothesis over ZF, The Axiom of Countable Choice (ACω)).

Proof

Proof technique: extend a quotient-bidual functional and represent the extension in the reflexive ambient space.

1.1

Put Z=X/Y and write q:XZ for the quotient map. By [F4], under the assumed ACω the normed quotient Z is Banach. This includes Y=X, when Z={0}, and Y={0}, when the quotient norm is the original norm.

F4F5given
1.2

Let zZ be arbitrary. The isometric bijection Q:ZY from [F2] has a scalar-linear isometric inverse. Define g:YK by g(u)=z(Q1u). It is a bounded scalar-linear functional with g=z; if Y={0}, both sides are zero.

F2givenalgebra
2.1

Apply [F3] under HB to the subspace YX. There is xX with xY=g and x=g. Only this one supplied functional is extended; no family of extensions is chosen.

F3F5step 1.2
3.1

Reflexivity of X supplies an xX with x=JXx. Put z=q(x)Z.

F1step 2.1
4.1

For every hZ, [F2] gives Qh=hqY, and therefore JZz(h)=h(qx)=Qh(x)=JXx(Qh)=x(Qh)=g(Qh)=z(h). Hence JZz=z. The calculation is scalar-linear over both fields and uses the bilinear evaluation convention, with no conjugation.

F2step 1.2step 2.1step 3.1
5.1

Since zZ was arbitrary, JZ is surjective; together with the Banach conclusion in step 1.1, [F1] shows that Z=X/Y is reflexive. When Y=X, step 1.2 starts from the unique zero bidual functional and the same computation gives the zero representer; when Y=0, Q is the usual identification and the computation reduces to ambient reflexivity. HB is spent only in step 2.1, and ACω only in step 1.1.

F1F3F4step 1.1step 4.1

Source notes

Bühler–Salamon, Theorem 2.71(ii), printed pp. 91–92, gives the complete annihilator-extension computation. The proof above keeps its exact algebra but states the repository's weak-choice costs: the selected quotient- completeness theorem requires ACω, while the extension from Y to X requires HB. It does not claim that the quotient map sends the ambient closed unit ball onto the quotient closed unit ball.

LemmaStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-14Open item page →

Complex Lp duality from real Lp duality

Statement

Assume the Axiom of Countable Choice ACω. Let (X,A,μ) be any measure space, let 1<p<, and let q be conjugate to p. Every bounded complex-linear functional Λ:Lp(μ;C)C has a unique hLq(μ;C) such that

Λ([f])=Xfhdμ([f]Lp(μ;C)),

where the pairing is bilinear, with no conjugation. Moreover Λ=hq.

Facts & Assumptions

Given: ACω, an arbitrary measure space, conjugate exponents 1<p,q<, and a bounded complex-linear Λ:Lp(μ;C)C.

[F1]

Under Countable Choice, every bounded real-linear functional on real Lp over an arbitrary measure space is uniquely integration against a real Lq density, with equality of norms (For 1<p<, the same representation theorem holds on arbitrary measure spaces).

[F2]

Complex Lp is the a.e. quotient of measurable finite-valued complex functions with finite p-norm; real and imaginary parts, conjugation, products, and positive powers have the stated measurability conventions, and bilinear tests use fs without conjugation (Complex Lp classes and Euclidean test-function conventions).

[F3]

Complex Hölder makes the bilinear pairing bounded, and complex Lp has the quotient norm with fp=fp (Complex Holder, Minkowski, and the quotient norm).

[F4]

Countable Choice selects from every countable family of nonempty sets (The Axiom of Countable Choice (ACω)).

Proof

technique · represent the real and imaginary parts on the real-valued subspace, then use a normalized phase test for the norm and uniqueness
1.1

Regard real Lp(μ) as the real-valued subspace of complex Lp(μ;C). The maps A(u)=ReΛ(u) and B(u)=ImΛ(u) are bounded real-linear functionals there, with A(u),B(u)Λup. Applying [F1] twice gives real a,bLq(μ) such that A(u)=ua and B(u)=ub for every real uLp. Put h=a+ibLq(μ;C); component inequalities in [F3] make its q-norm finite.

F1F2F3given
2.1

For real-valued u, componentwise complex integration gives Λ(u)=A(u)+iB(u)=u(a+ib)=uh. If f=u+iv is an arbitrary complex Lp class, [F3] puts its real and imaginary parts in real Lp, and complex linearity gives Λ(f)=Λ(u)+iΛ(v)=uh+ivh=fh. All identities depend only on a.e. classes by the quotient and integration conventions in [F2]–[F3].

F2F3step 1.1algebra
3.1

Hölder [F3] gives fhfphq, hence Λhq. If h=0 a.e., step 2.1 gives Λ=0 and equality follows. Otherwise define v=0 on {h=0} and v=hq2h where h0. Then v=hq1 and vh=hq pointwise. Since (q1)p=q, [F2]–[F3] give vLp, vp=hqq1, and Λ(v)=hq=hqq. Testing on v/vp proves Λhq, including the closed unit-norm endpoint.

F2F3step 2.1algebra
4.1

If kLq(μ;C) gives the same pairing functional, put d=hk. Then fd=0 for every fLp. If d were nonzero, the phase test of step 3.1 with d in place of h would produce vLp with vd=dqq>0, a contradiction. Thus d=0 in Lq, so the density is unique.

F2F3step 3.1discharge-contradiction
5.1

Steps 2.1–4.1 prove existence, equality of norms, and uniqueness. Countable Choice is used only inside the real arbitrary-measure representation [F1], whose construction makes countably many local choices; applying that theorem to A and B requires only two instances and no stronger choice principle. The empty and zero-measure spaces have only zero Lp classes and are covered by the h=0 branch of step 3.1; the forbidden endpoints p=1, never enter because 1<p,q<.

F1F4step 1.1step 2.1step 3.1step 4.1

Remarks

The absence of a conjugate in the displayed pairing is deliberate. It is why the phase test contains h: multiplication then gives the nonnegative real function hq.

TheoremStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-14Open item page →

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.

DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-14Open item page →

Relative weak compactness and three sequential notions

Definition

Let X be a real or complex Banach space, give it its weak topology σ(X,X) from Weak topology on a normed space, and let AX.

  • A is relatively weakly compact if its weak closure Aw is weakly compact. It is weakly compact if A itself, with the relative weak topology, is compact.
  • A is relatively weakly sequentially compact if every sequence (an)nN in A has strictly increasing indices n0<n1< and a point xX such that ankx weakly. It is weakly sequentially compact if the limit can always be taken in A.
  • A is relatively weakly countably compact if every sequence (an) in A has a weak cluster point xX, meaning that for every weak neighborhood U of x and every NN there is an nN with anU. It is weakly countably compact if the cluster point can always be taken in A.

The cluster-point condition is indexed: a value occurring infinitely often is a cluster point even when the range of the sequence is finite. Thus constant and eventually constant sequences have the expected cluster point. The empty set satisfies all three relative conditions: its weak closure is empty and compact, and there is no sequence with values in it. In fact the corresponding absolute conditions are vacuous or compact for the same reason.

Remarks

These are definitions, not implications between the notions. In a general topological space the three properties need not coincide. Their equivalence for weak subsets of Banach spaces is the content of Eberlein–Šmulian later on this page. “Relative” permits a sequential limit or cluster point in the ambient XA; “absolute” does not.

LemmaStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-14Open item page →

Eberlein–Šmulian separable reduction

Statement

Assume HB. Let X be a real or complex Banach space and let (xn)nN be a sequence in X. Put

Y=spanK{xn:nN}.

Then Y, with the restricted norm, is a separable Banach space. Its intrinsic weak topology σ(Y,Y) is exactly the relative topology induced by σ(X,X), and Y is weakly closed in X.

Facts & Assumptions

Given: HB, a real or complex Banach space X, and one supplied sequence (xn) in X.

[F1]

A topological space is separable when it has an at most countable dense subset (Separability: the existence of an at most countable dense subset).

[F2]

The rationals are countably infinite, products of two at most countable sets are at most countable, and every nonempty image of a surjection from N is at most countable (Q is countably infinite, A product of two at most countable sets is at most countable, A nonempty set is at most countable iff it is a surjective image of N).

[F3]

The embedded rationals are dense in R (The rationals embed densely in the reals).

[F4]

Under HB, each bounded scalar-linear functional on a subspace extends to the ambient normed space with the same norm (Relative norm-preserving Hahn–Banach extension over the real and complex fields).

[F5]

Under HB, a point outside a nonempty closed convex set is uniformly strictly separated from that set by the real part of a member of the ambient dual (Relative geometric Hahn–Banach with the exact open, closed, and compact hypotheses).

[F6]

A closed linear subspace of a Banach space is Banach with the restricted norm (A closed subspace of a Banach space is Banach).

[F7]

The weak topology is the initial topology of all bounded scalar-linear functionals (Weak topology on a normed space), and HB denotes the real dominated-extension principle (The real dominated-extension principle as an additional hypothesis over ZF).

Proof

Proof technique: explicit countable dense set, followed by Hahn–Banach extension and separation.

1.1

Let QK=Q in the real case and Q+iQ in the complex case, with the canonical embeddings into the scalar field understood. By [F2], QK is at most countable: in the complex case it is the image of the countable product Q×Q. It is nonempty, so fix one surjection q:NQK. This is one instantiation of the countability theorem, not a countable family of choices.

F2
1.2

The scalar set QK is dense in K. This is [F3] over R. Over C, approximate the real and imaginary parts separately and use (a+ib)(r+is)ar+bs.

F3algebra
1.3

Every FX restricts to a member of Y, so every ambient weak subbasic set has an intrinsically weak-open trace on Y. Conversely, given one gY, [F4] supplies FX with FY=g. Therefore the inverse image under g of any scalar-open set is the trace on Y of the corresponding ambient weak-open inverse image under F. Finite intersections behave the same way. The two topologies on Y are equal.

F4F7
2.1

The set N<N of finite strings of naturals has a choice-free enumeration: order strings first by s+j<ss(j), then by length, and then lexicographically. Each fixed-value block is finite, and the displayed order lists every finite string. Map s=(s(0),,s(m1)) to ds=j=0m1q(s(j))xj, with empty sum 0. Its image D={ds:sN<N} is nonempty and at most countable by [F2].

step 1.1F2construct
3.1

The set D is norm dense in spanK{xn:nN}. Indeed, write a given vector there as u=j=0m1αjxj, padding with zero coefficients when necessary. If m=0, then u=0=d. If m>0 and ε>0, put S=j<m(1+xj)>0. By step 1.2, make the finitely many choices rjQK with αjrj<ε/S. Choose indices kj with q(kj)=rj; only finitely many choices are involved. For s=(k0,,km1), the triangle inequality gives udsj<mαjrjxj<(ε/S)j<mxj<ε. Thus D=Y.

step 1.1step 2.1step 1.2algebra
4.1

By [F1] and step 3.1, Y is separable. The norm closure of a linear subspace is again linear: approximating two vectors and using the triangle inequality proves closure under addition, and multiplying an approximating net by one fixed scalar proves closure under scalar multiplication, including the scalar zero. Hence Y is a closed linear subspace of the Banach space X, so [F6] makes Y Banach.

F1F6step 3.1
5.1

Finally take zXY. The set Y is nonempty, closed and convex, while {z} is compact and disjoint from it. By [F5], there are fX, aR and δ>0 such that Ref(y)aδ<a+δRef(z) for every yY. The weakly open set {wX:Ref(w)>a} contains z and misses Y. Every point of XY therefore has a weak neighborhood in the complement, so Y is weakly closed. This uses HB only through [F4] and [F5]: the proof never selects extensions or separators simultaneously for a family.

F4F5F7step 4.1

Source notes

Bühler–Salamon, proof of Theorem 3.42, printed p. 145, uses the smallest closed span of a sequence as the separable reduction. The intrinsic/relative weak topology and weak-closedness details are supplied here from the exact HB-relative extension and separation results cited above.

LemmaStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-14Open item page →

Eberlein–Šmulian metrization on the relevant dual ball

Statement

Assume ACω and HB. Let Y be a separable real or complex normed space and let KY be weakly compact. Then the weak topology on K is metrizable. More precisely, there is a sequence (fn) in the closed unit ball of Y that separates the points of Y, and

dK(x,y)=n=02(n+1)min{1,fn(xy)}

is a metric on K inducing its relative weak topology. If Y={0}, the unique metric on each of its two subsets gives the same conclusion.

Facts & Assumptions

Given: ACω, HB, a separable real or complex normed space Y, and a weakly compact subset K.

[F1]

Separability means existence of an at most countable dense subset, and each nonempty at most countable set is the image of a surjection from N (Separability: the existence of an at most countable dense subset, A nonempty set is at most countable iff it is a surjective image of N).

[F2]

Under HB, every nonzero vector has a norm-one functional taking that vector to its norm, in both scalar fields (Relative dual norming, point separation, and recovery of the norm).

[F3]

ACω supplies a choice function for every sequence of nonempty sets (The Axiom of Countable Choice (ACω)).

[F4]

The weak topology is initial for the members of Y (Weak topology on a normed space).

[F6]

The standard weighted sum of bounded complete coordinate metrics is a complete metric inducing the countable product topology (The standard weighted metric on a countable product of bounded complete metric spaces is complete).

[F9]

HB is the named real dominated-extension principle (The real dominated-extension principle as an additional hypothesis over ZF).

Proof

Proof technique: a countable norming family and a compact-to-Hausdorff identification.

1.1

If Y={0}, then K is either empty or the singleton {0}. In either case the zero function dK:K×KR is the unique metric and induces the only topology on K, which is its relative weak topology. Hence suppose below that Y{0}.

givenF4
1.2

On K put δ(s,t)=min{1,st}. This is a metric bounded by 1 and induces the usual scalar topology, because its balls of radius below 1 are the usual metric balls. It is complete: a δ-Cauchy sequence is eventually Cauchy for at every tolerance below 1, so [F5] gives a usual limit, and δ(s,t)st gives convergence in δ.

F5algebra
2.1

By separability, take an at most countable norm-dense DY. It is nonempty because its closure is the nonempty space Y. The set E={z/z:zD{0}} is at most countable and nonempty. It is dense in the unit sphere: if u=1 and ε>0, density gives zD with zu<min{1/2,ε/2}, so z0 and z/zu1z+zu2zu<ε. By [F1], enumerate E as (un)nN, allowing repetitions.

F1step 1.1algebra
2.2

Apply [F6] to countably many copies of (K,δ). The formula D(a,b)=n=02(n+1)δ(an,bn) is a metric on KN inducing its product topology. Its restriction to every subset is a metric inducing the subspace topology, and that metric topology is Hausdorff by [F7].

F6F7step 1.2
3.1

For each n, let Sn={fY:f=1, f(un)=1}. Each Sn is nonempty by [F2], including in the complex case where the attained value is the positive real number 1. Apply ACω once to the sequence (Sn) and obtain fnSn for every n.

F2F3step 2.1choose
4.1

The family (fn) separates points of Y. If xy, put v=(xy)/xy and choose un with unv<1/2. Then fn(v)fn(un)fn(vun)>11/2>0, since fn=1. Therefore fn(xy)=xyfn(v)0.

step 2.1step 3.1algebra
5.1

Define Φ:KKN by Φ(x)=(fn(x))n. Every coordinate fn is weakly continuous, so the initial property of the product topology makes Φ continuous. Step 4.1 makes it injective. Its corestriction Φ0:KΦ[K] is therefore a continuous bijection.

F4F10step 3.1step 4.1
6.1

The weak space K is compact by hypothesis, and Φ[K] is Hausdorff by step 2.2. Hence [F8] makes Φ0 a homeomorphism. Pulling the restricted product metric back along Φ0 gives exactly dK(x,y)=D(Φ(x),Φ(y)), the displayed metric, and its topology is precisely the relative weak topology on K. Together with step 1.1 this proves the claim for every Y and for empty as well as nonempty K.

F8step 1.1step 2.2step 5.1
7.1

The only countable selection is step 3.1, where ACω selects the norming family. HB is used only inside the individual norming-functional supplier [F2]. Enumeration in step 2.1 is obtained from one at-most-countable set by its supplied surjection and uses no choice. The argument metrizes only the supplied weakly compact K in a separable Y; it makes no metrizability claim for all of Y or for nonseparable spaces.

F1F2F3F9step 2.1step 3.1step 6.1

Source notes

Haase, Theorem E.2, printed pp. 346–347, proves the corresponding compact countable-evaluation metrization pattern for a separable compact subset of a pointwise function space. Here the HB norming family supplies the separating evaluations, and compact-to-Hausdorff identifies the resulting product topology with the weak topology on K. No part of the unavailable Whitley paper is used.

LemmaStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-14Open item page →

Countable compactness closes in the bidual

Statement

Assume the ultrafilter lemma, the Axiom of Dependent Choice (DC), and HB. Let X be a real or complex Banach space and let AX be relatively weakly countably compact: every sequence in A has a weak cluster point in X. Then A is norm bounded and

JX(A)wJX(X)X.

Here the closure uses σ(X,X). The conclusion does not assert that the cluster point or the representing point belongs to A.

Facts & Assumptions

Given: the three stated principles, X, and A as in the statement.

[F1]

Relative weak countable compactness means that every sequence in the set has a cluster point in the ambient weak space, with "cluster" requiring every neighborhood to contain arbitrarily late terms (Relative weak compactness and three sequential notions).

[F2]

The weak and weak-star topologies are the initial topologies of their evaluation maps; basic weak-star neighborhoods impose only finitely many evaluation inequalities (Weak topology on a normed space, The weak-star topology from finite evaluations, Basic weak star neighborhoods).

[F3]

Assuming the ultrafilter lemma, the dual unit ball is weak-star compact (Banach–Alaoglu), and arbitrary products of compact Hausdorff spaces are compact (Assuming the ultrafilter lemma, an arbitrary product of compact Hausdorff spaces is compact).

[F4]

Under HB the canonical map JX:XX is an isometry, for both scalar fields (Relative Hahn–Banach makes the canonical bidual map an isometry). HB is the named relative dominated-extension principle (The real dominated-extension principle as an additional hypothesis over ZF).

[F5]

Assuming DC, a pointwise bounded family of bounded operators on a Banach space is uniformly norm bounded (Uniform boundedness principle). If the target is Banach, the bounded-operator space is Banach (If (Y) is Banach then (\mathcal B(X,Y)) is Banach).

[F6]

DC supplies a sequence following any entire relation from a specified initial state (The axiom of dependent choice: a relation in which every element is related to something admits an N-indexed chain).

[F10]

On the scalar field put ρ(s,t)=min{1,st}. This bounded metric induces the usual scalar topology, since its balls of radius less than 1 are the usual balls. It is complete: a ρ-Cauchy sequence is Cauchy for the usual metric by testing tolerances below 1, and its usual scalar limit is also its ρ-limit. The standard weighted metric on a countable product of complete metrics bounded by 1 therefore applies to copies of (K,ρ) and induces the product topology; metric spaces are Hausdorff (The standard weighted metric on a countable product of bounded complete metric spaces is complete, The reals are complete, The complex plane is complete, and convergence is equivalent to convergence of real and imaginary parts, Distinct points of a metric space have disjoint balls around them, The product set iIXi of functions choosing a point in each factor, the projections, the box topology, and the product topology as the initial topology of the projections; the empty product is a one-point space).

[F12]

A nonempty at-most-countable set can be enumerated by a sequence, finite Cartesian products of countable sets are countable, the natural numbers are cofinal in the reals, and 1/n is eventually smaller than every positive real (A nonempty set is at most countable iff it is a surjective image of N, A product of two at most countable sets is at most countable, Every complete ordered field is Archimedean, For every ε>0 in a complete ordered field there is a natural n1 with 1/n<ε).

Proof

Proof technique: the Grothendieck pointwise-compactness argument, with each countable selection implemented by DC.

1.1

If A=, it is norm bounded and JX(A)= has empty weak-star closure, so both conclusions hold. Hence assume A.

given
1.2

Put K=BX with its weak-star topology and define Φ:XKK by Φ(x)(u)=u(x). Each Φ(x) is continuous on K by [F2], so Φ(X)C(K). The space K is compact by [F3] and Hausdorff because distinct members of X differ at some xX, whose evaluation separates them in the Hausdorff scalar field. By [F4], Φ(x)=x and Φ is injective. Since every uX is zero or a scalar multiple of a member of K, [F2] shows that the pointwise topology on Φ(X) is exactly the weak topology transported from X.

F2F3F4
1.3

For each uX the scalar set u(A) is bounded. Otherwise every set En={aA:u(a)>n}, n1, is nonempty. Apply DC to finite valid histories, starting with the empty history and extending the nth stage by an element of En+1; this gives (an) with u(an)>n+1. Let a be a weak cluster. The weak neighborhood u(xa)<1 contains arbitrarily late an, while [F12] lets us take such an n with n+1>u(a)+1. Then u(an)u(a)+1<n+1, a contradiction.

F1F2F6F12
1.4

We shall repeatedly use this choice-free consequence of compactness. If (zn) is a sequence in a compact space, then the closed sets CN={zn:nN} are nonempty, nested, and have the finite-intersection property. By [F8] some z lies in every CN; by the closure characterization, every neighborhood of z contains terms with arbitrarily large indices. Thus z is a cluster point of the sequence.

F8
2.1

Every sequence in M:=Φ(A) has a pointwise cluster in Φ(X). Indeed, injectivity gives its unique lift (an) in A; [F1] gives a weak cluster aX, and the topology identification in step 1.2 makes Φ(a) a pointwise cluster.

F1step 1.2
2.2

The dual X=B(X,K) is Banach: the real and complex scalar fields are Banach and [F5] applies to the bounded-operator space. The family {JX(a):aA}B(X,K) is pointwise bounded by step 1.3, so UBP under the assumed DC gives R:=supaAJX(a)<.

F5step 1.3
3.1

The HB isometry [F4] gives a=JX(a)R for every aA. Thus A, and equivalently M in the supremum norm, is norm bounded.

F4step 1.2step 2.2
4.1

Let B=Mp be the closure in the full product KK. For each tK, step 3.1 gives h(t)R for hM. The scalar disk DR={z:zR} is compact Hausdorff by [F9], including R=0; hence DRK is compact by [F3]. It is closed in KK, so BDRK, and B is closed in that product. Therefore B is compact by [F8].

F3F8F9step 3.1
5.1

We prove BC(K). Suppose instead that gB is discontinuous at yK. Then for some ε>0, every neighborhood of y meets Z={zK:g(z)g(y)ε}. This is exactly the negation of continuity at y into the metric scalar field, written with one failed positive tolerance. Notice yZ.

F10step 4.1assume-contra
6.1

Put U0=K and ηn=ε/(n+1) for n1. DC on finite valid histories constructs hnM, open neighborhoods Un of y, and xnK such that hn(y)g(y)<ηn/2 and hn(xm)g(xm)<ηn/2 for m<n, while yUnUnUn1{z:hn(z)hn(y)<ηn} and xnUnZ. At stage n, the approximation is possible because g is in the pointwise closure of M; the set to be shrunk is an open neighborhood of y because hn is continuous; [F7] supplies Un; and step 5.1 makes UnZ nonempty. Thus the relation extending a finite valid history is entire, exactly the hypothesis of DC.

F2F6F7step 5.1construct
7.1

By step 2.1, (hn) has a pointwise cluster h=Φ(a)Φ(X). By step 1.4, (xn) has a cluster xK. The nesting in step 6.1 gives xmUn whenever mn, so the closure characterization gives xUn for every n.

F8step 1.4step 2.1step 6.1
8.1

Hence hn(x)hn(y)<ηn and hn(y)g(y)<ηn/2. Since ηn0 by [F12], hn(x)g(y). But h is a pointwise cluster of (hn), so h(x) is a cluster of the convergent scalar sequence (hn(x)); scalar Hausdorffness forces h(x)=g(y).

F10F12step 6.1step 7.1
9.1

For fixed m, step 6.1 gives hn(xm)g(xm) as n. The same cluster-and-uniqueness argument gives h(xm)=g(xm). Since xmZ, we therefore have h(xm)h(x)=g(xm)g(y)ε for every m.

F10F12step 5.1step 6.1step 7.1step 8.1
10.1

The function h=Φ(a) is continuous on K. Thus {z:h(z)h(x)<ε/2} is a neighborhood of the cluster x and must contain arbitrarily late xm, contradicting step 9.1. Therefore every gB is continuous and BC(K).

F1F2step 1.2step 7.1step 9.1discharge-contradiction: step 5.1
11.1

Fix gB. For positive integers r,s and hM, define Vhr,s={(t1,,tr)Kr:h(tj)g(tj)<1/s for 1jr}. These sets are open because g,hC(K) by step 10.1, and they cover Kr because g lies in the pointwise closure of M. The finite power Kr is compact by [F3], so some nonempty finite list of members of M has the corresponding Vhr,s covering Kr.

F2F3step 4.1step 10.1
12.1

Pair the positive integer indices (r,s) using [F12]. Apply DC to finite histories of choices of the finite subcovers from step 11.1; the extension relation is entire. Thus obtain one finite list Fr,sM for every pair. Their union M0 is at most countable: retain the finite-list order, pad each nonempty list by its first term, and enumerate the pairs of natural indices using [F12]. No member of an uncountable family has been selected.

F6F12step 11.1
13.1

The point g lies in the pointwise closure of M0: for finitely many points and tolerance δ>0, repeat points if needed to form a positive-length tuple and choose s with 1/s<δ; a member of Fr,s gives all the inequalities. Let P=M0p. Then gPB; P is closed in compact B, hence compact by [F8], and it is separable because the at-most-countable M0 is dense in it.

F8F12step 4.1step 12.1
14.1

We record the compact-cluster argument of Haase's Lemma E.1. Let (qn)K, qK, and let (vj) be pointwise dense in P. If vj(qn)vj(q) for every j, then v(qn)v(q) for every vP. Indeed, let C be the intersection of the closures of all tails of (qn); it is nonempty by step 1.4. For zC, continuity and the assumed scalar convergence give vj(z)=vj(q) for every j. Pointwise density then gives v(z)=v(q) for every vP: otherwise the two-coordinate neighborhood of v at z,q with radius v(z)v(q)/3 would contain no vj. If v(qn) failed to converge to v(q), least-index recursion would give a subsequence staying some fixed positive distance away. Its closed tail closures have a common point zC by [F8], while continuity of v at z contradicts both v(z)=v(q) and that fixed separation.

F2F8step 1.4step 10.1step 13.1
14.2

The compact separable pointwise space P is nonempty because it contains g. Enumerate a nonempty pointwise-dense subset as (vj) using [F12]. On the countable product of the bounded scalar metrics ρ use the standard weighted product metric D from [F10], and pull it back along q(vj(q))j to a continuous pseudometric d on K.

F10F12step 13.1
15.1

For each positive integer n, the open d-balls of radius 1/n cover K, so compactness gives a nonempty finite list of centers. DC, applied to finite histories of such lists, chooses one list for each n. Pad every list by its first center and use the countable pairing in [F12] to enumerate the union as (qm). For each qK and each n, take the first center in the nth list whose ball contains q; the resulting sequence qmn satisfies d(qmn,q)<1/n, hence vj(qmn)vj(q) for every j.

F3F6F10F12step 14.2
16.1

The evaluations at (qm) separate P. If v,wP agree at every qm, then for arbitrary qK use the sequence from step 15.1. Step 14.1 gives v(qmn)v(q) and w(qmn)w(q); equality term by term and scalar Hausdorffness give v(q)=w(q). Thus v=w.

F10step 14.1step 15.1
17.1

The evaluation map E:PKN, E(v)=(v(qm))m, is continuous for the pointwise and product topologies by [F2] and injective by step 16.1. Its corestriction to E(P) is a continuous bijection from compact P to a metric, hence Hausdorff, space. By [F11] it is a homeomorphism. Pulling back the restriction of the weighted metric built from ρ therefore metrizes the pointwise topology of P.

F2F10F11step 13.1step 16.1
18.1

Enumerate M0 as (wk), with repetitions allowed. Since it is dense in the metric space P, for each n1 there is a k with dP(wk,g)<1/n; take the least such k. This defines, without choice, a sequence (wkn) in M0 converging to g pointwise.

F12step 13.1step 17.1
19.1

Lift this sequence uniquely to (an) in A. By [F1] it has a weak cluster aX, so Φ(a) is a pointwise cluster of (wkn) by step 1.2. Every scalar coordinate of that sequence converges to the corresponding coordinate of g by step 18.1; uniqueness of scalar cluster points gives g=Φ(a). Since gB was arbitrary, BΦ(X).

F1F2F10step 1.2step 18.1
20.1

Let xJX(A)w and restrict it to K: g(t)=x(t). Every finite pointwise neighborhood of g on K is the restriction of a basic weak-star neighborhood of x in X, so it meets JX(A) by [F2]. Hence gB, and step 19.1 gives aX with g(t)=t(a) for every tK.

F2step 1.2step 4.1step 19.1
21.1

For arbitrary uX, the equality is immediate if u=0; otherwise u/uK, and linearity gives x(u)=ug(u/u)=u(a)=JX(a)(u). Thus x=JX(a)JX(X). Together with step 3.1 and the empty case of step 1.1 this proves both assertions. The ultrafilter lemma is spent in steps 1.2, 4.1 and 11.1 through compactness; HB is spent only in the isometry in steps 1.2 and 3.1; DC is spent in UBP at step 2.2 and in the explicit finite-history constructions of steps 1.3, 6.1, 12.1 and 15.1.

F3F4F5F6step 1.1step 3.1step 20.1

Source notes

Haase's Lemma E.1 and Theorems E.2, E.3 and E.14, printed pp. 345–347 and 354–355, supply the complete compact-cluster, metrization, countable-reduction, and pointwise-closure arguments. The proof above changes Haase's phrase "take gx" to a cover indexed by every available function and uses DC only to choose countably many finite subcovers; this avoids an unrecorded choice over all tuples. It also supplies the dual-completeness premise needed by UBP and uses closed tail closures, rather than a metric compactness theorem, to obtain cluster points in the possibly nonmetrizable space K.

TheoremStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-14Open item page →

Eberlein–Šmulian theorem

Statement

Assume the ultrafilter lemma, the Axiom of Dependent Choice (DC), and HB. For every subset A of a real or complex Banach space X, the following are equivalent:

  1. A is relatively weakly compact;
  2. A is relatively weakly sequentially compact;
  3. A is relatively weakly countably compact.

All closures, limits, cluster points, and compactness assertions use the weak topology σ(X,X) and the ambient space X.

Facts & Assumptions

Given: the ultrafilter lemma, DC, HB, a real or complex Banach space X, and AX.

[F1]

Relative weak compactness means compactness of the weak closure; relative weak sequential compactness gives a weakly convergent subsequence with ambient limit; relative weak countable compactness gives an ambient weak cluster point with arbitrarily late terms in every neighborhood (Relative weak compactness and three sequential notions).

[F2]

Under HB, the closed scalar span of one sequence in X is a separable Banach subspace, is weakly closed in X, and its intrinsic weak topology is the relative ambient weak topology (Eberlein–Šmulian separable reduction).

[F3]

Assuming ACω and HB, every weakly compact subset of a separable normed space is weakly metrizable (Eberlein–Šmulian metrization on the relevant dual ball).

[F4]

DC gives a chain through every entire relation from a prescribed initial state, whereas ACω is a choice function for each supplied sequence of nonempty sets (The axiom of dependent choice: a relation in which every element is related to something admits an N-indexed chain, The Axiom of Countable Choice (ACω)).

[F6]

Under the ultrafilter lemma, DC and HB, a relatively weakly countably compact A is norm bounded and satisfies JX(A)wJX(X) (Countable compactness closes in the bidual).

[F7]

Under the ultrafilter lemma, the closed unit ball of the dual of any normed space is weak-star compact (Banach–Alaoglu).

[F8]

The weak and weak-star topologies are initial for their scalar evaluations, and under HB the canonical map JX:XX is scalar-linear and isometric (Weak topology on a normed space, The weak-star topology from finite evaluations, Relative Hahn–Banach makes the canonical bidual map an isometry).

[F10]

Strictly increasing natural-number indices satisfy nkk (A strictly increasing index map satisfies nkk), and HB is the named dominated-extension principle (The real dominated-extension principle as an additional hypothesis over ZF).

Proof

Proof technique: prove the cycle compact sequential countable compact.

1.1

We first derive the exact choice fragment needed by [F3], rather than citing the unproved remark that DC implies ACω. Given any sequence (En)nN of nonempty sets, let S be the set of all finite histories s with domain n for some n and s(k)Ek for k<n. The empty history belongs to S. Relate s to t when t extends s by exactly one value from Edoms. The relation is entire because that next set is nonempty. DC from the empty history gives a chain (sn) with sn of length n and sn+1 extending sn; its union is a function f on N with f(n)En. Thus the assumed DC proves the instance of ACω required below.

F4construct
1.2

If A=, its weak closure is empty and compact and there is no sequence in A, so all three conditions hold. If X={0} and A, then A={0}, its weak topology is the singleton topology, and every sequence is constant, so again all three conditions hold. Hence the remaining implications may be proved without special conventions for these cases.

F1F8algebra
1.3

The evaluation identity JXx(u)=u(x) shows from [F8] that JX:(X,σ(X,X))(JX(X),σ(X,X)JX(X)) is continuous and that its inverse is continuous: every subbasic evaluation on either side pulls back to the corresponding evaluation on the other. HB makes JX injective through its isometry, so it is a homeomorphism onto its image.

F8F10
1.4

Assume A is relatively weakly compact and let (an) be a sequence in A. Put C=Aw and let Y be the norm-closed scalar span of the sequence. By [F1], C is weakly compact, and by [F2], Y is a separable Banach subspace, weakly closed in X, with its intrinsic weak topology equal to the relative ambient weak topology. Set K=CY, which contains every an.

F1F2
1.5

Assume A is relatively weakly sequentially compact and let (an) be any sequence in A. Take strictly increasing indices (nk) and xX with ankx weakly. Given a weak neighborhood U of x and NN, convergence gives k0 with ankU for kk0; for kmax{k0,N}, [F10] gives nkkN. Thus U contains an arbitrarily late term of the original sequence, so x is its weak cluster point and A is relatively weakly countably compact.

F1F10
1.6

Assume A is relatively weakly countably compact. By [F6], choose R0 with aR for every aA and put D=JX(A)wX; then DJX(X).

F6
2.1

In the situation of step 1.4, K is weakly closed in the compact space C, because Y is weakly closed in X. Hence [F9] makes K compact, and [F2] identifies this topology with its intrinsic relative weak topology as a subset of the separable space Y.

F2F9step 1.4
2.2

In the situation of step 1.6, apply [F7] to the normed space X: its dual unit ball BX is weak-star compact. Fixed scalar multiplication SR(z)=Rz is weak-star continuous by [F8], since every evaluation of SRz is R times the corresponding evaluation of z. Therefore [F9] makes RBX=SR[BX] weak-star compact, including R=0, when it is the singleton {0}.

F7F8F9step 1.6
3.1

By step 1.1 the assumptions of [F3] hold, so step 2.1 makes K a compact metric space in its weak topology. The choice-free implication [F5] gives a subsequence of (an) converging to a point of K in that metric, hence weakly in Y and, by [F2], weakly in X. Since the original sequence was arbitrary, A is relatively weakly sequentially compact.

F2F3F5step 1.1step 2.1
3.2

The set D from step 1.6 lies in RBX. Indeed, for zD, uX and ε>0, the weak-star neighborhood {w:(wz)(u)<ε} meets JX(A), so some aA satisfies z(u)<u(a)+εRu+ε. If z(u)>Ru, taking half the positive gap as ε is a contradiction; hence z(u)Ru for every u, including u=0, and zR. The closure D is weak-star closed in X, so it is closed in the compact subspace RBX and therefore compact by [F9].

F8F9step 1.6step 2.2
4.1

Since step 1.6 gives DJX(X), the weak-star closure of JX(A) in X equals its closure in the subspace JX(X): an ambient neighborhood and its trace meet JX(A) in exactly the same way at points of JX(X). The homeomorphism in step 1.3 carries weak closure to subspace weak-star closure, so D=JX(Aw). Its inverse restricted to the compact set D is continuous, and [F9] makes Aw=JX1[D] weakly compact. Thus A is relatively weakly compact.

F1F6F9step 1.3step 1.6step 3.2
5.1

Step 3.1 proves relative weak compactness implies relative weak sequential compactness, step 1.5 proves sequential compactness implies countable compactness, and step 4.1 proves countable compactness implies compactness. Together with the empty and zero-space cases in step 1.2, this proves all three conditions equivalent over both scalar fields. The ultrafilter lemma is spent in steps 1.6 and 2.2 through [F6] and Alaoglu; DC is spent in [F6] and locally at step 1.1; HB is spent in [F2], [F3], [F6] and the canonical isometry in step 1.3.

F1F2F3F4F6F7F8F10step 1.2step 1.5step 3.1step 4.1

Source notes

Haase's Theorem E.17, printed pp. 355–356, gives the canonical embedding into Cp(BX) and the compact/sequential equivalence; Theorems E.2–E.3 and E.14 on printed pp. 345–347 and 354–355 supply its complete pointwise- compactness route. The local lemma [F6] contains that argument with BPI, DC and HB exposed. The proof here additionally derives DC ACω from finite histories before using [F3], rather than consuming the unproved bibliographic remark in the choice definitions.

CorollaryStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-14Open item page →

Reflexivity is equivalent to weak subsequential compactness of bounded sequences

Statement

Assume the ultrafilter lemma, DC, and HB. A real or complex Banach space X is reflexive if and only if every norm-bounded sequence in X has a subsequence that converges weakly to a point of X.

Facts & Assumptions

Given: the ultrafilter lemma, DC, HB, and a real or complex Banach space X.

[F1]

Under the ultrafilter lemma and HB, X is reflexive if and only if its closed unit ball BX is weakly compact (Reflexive iff unit ball weakly compact).

[F2]

Under the ultrafilter lemma, DC and HB, relative weak compactness, relative weak sequential compactness and relative weak countable compactness are equivalent (Eberlein–Šmulian theorem).

[F3]

Under HB, every nonzero vector has a norm-one scalar-linear functional taking that vector to its norm (Relative dual norming, point separation, and recovery of the norm).

[F4]

The weak topology is initial for all members of X, so every such functional and fixed scalar multiplication are weakly continuous (Weak topology on a normed space).

[F5]

The ultrafilter lemma is the statement that every filter on a set is contained in an ultrafilter; DC is the entire-relation chain principle, and HB is the real dominated-extension principle over ZF (The axiom of dependent choice: a relation in which every element is related to something admits an N-indexed chain, The real dominated-extension principle as an additional hypothesis over ZF).

Proof

Proof technique: apply Eberlein–Šmulian to the weakly closed unit ball and rescale.

1.1

The norm-closed unit ball BX is weakly closed under HB. Indeed, if xBX, then x>1 and [F3] gives fX with f=1 and f(x)=x. The weakly open set {y:f(y)>1} contains x and misses BX, since f(y)y1 there. Thus every exterior point has a weak neighborhood in the complement. This also covers X={0}, when there is no exterior point.

F3F4
1.2

Suppose X is reflexive and let (xn) be norm bounded. Fix R0 with xnR for every n. If R=0, then xn=0 for all n and the identity subsequence converges weakly to zero. Hence it remains to consider R>0 and the sequence yn=xn/RBX.

givenalgebra
1.3

Conversely, suppose every norm-bounded sequence in X has a weakly convergent subsequence. Every sequence in BX is bounded by 1, so it has a subsequence converging weakly to a point of the ambient space X. Thus BX is relatively weakly sequentially compact.

given
2.1

In the positive-radius case of step 1.2, [F1] makes BX weakly compact, and step 1.1 makes its weak closure equal to itself, so it is relatively weakly compact. By [F2], some subsequence ynk converges weakly to yX. For every fX, f(xnk)=Rf(ynk)Rf(y)=f(Ry), so xnkRy weakly. Together with the zero-radius case, every bounded sequence has the required subsequence.

F1F2F4step 1.1step 1.2
2.2

Under the hypothesis of step 1.3, [F2] makes BX relatively weakly compact. Its weak closure is BX by step 1.1, so BX itself is weakly compact.

F2step 1.1step 1.3
3.1

Apply the reverse implication of [F1] to step 2.2. The weak compactness of BX implies that X is reflexive.

F1step 2.2
4.1

Steps 2.1 and 3.1 prove the two implications, including X=0, bound R=0, the closed-ball endpoint xn=R, and both scalar fields. The ultrafilter lemma is spent through the compact-unit-ball criterion and Eberlein–Šmulian, DC through Eberlein–Šmulian, and HB through those two suppliers and dual norming; no full Axiom of Choice is used.

F5step 2.1step 3.1

Remarks

Source notes

Teschl's Theorem 4.30, printed pp. 127–128, proves the forward bounded- sequence conclusion for reflexive spaces. Haase's Theorem E.17, printed pp. 355–356, supplies the compact/sequential equivalence used in both directions. The converse here also uses the already-authored compact-unit-ball characterization and proves the ball's weak closedness explicitly, so relative compactness is not silently replaced by compactness.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-14Open item page →

Schur property

Definition

Let X be a real or complex Banach space. It has the Schur property if, for every sequence (xn)nN in X and every xX,

xnx in σ(X,X)xnx0.

Thus the premise is convergence in the weak topology from Weak topology on a normed space, while the conclusion is convergence for the given norm. Equivalently, it is enough to test weakly null sequences: if xnx weakly, linearity of every fX gives f(xnx)0; conversely this applied to xnx recovers weak convergence to x. The corresponding norm statements are equivalent because (xnx)0=xnx.

Remarks

The definition concerns sequences only. It does not say that the weak and norm topologies coincide, nor does it turn weak convergence of arbitrary nets into norm convergence. The zero Banach space has the Schur property.

TheoremStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-14Open item page →

Real and complex ell one have the Schur property

Statement

Both 1(R) and 1(C) have the Schur property: every weakly convergent sequence in either space converges in the 1 norm.

Facts & Assumptions

Given: K{R,C} and a sequence a(n)a in 1(K), with coordinates indexed by N={0,1,}.

[F1]

The Schur property is the implication from weak convergence to norm convergence, equivalently the same implication for weakly null sequences (Schur property). Weak convergence is convergence under every bounded scalar-linear functional (Weak convergence of nets and sequences).

[F2]

By the definitions of and 1 (The sequence spaces c_0 and ell-infinity, Finite truncations approximate null and summable sequences), for either scalar field, if b(K) and c1(K), then

kckbkbc1.

Thus the absolutely convergent series hb(c)=kckbk defines a bounded scalar-linear functional, with no conjugation in the complex pairing. Coordinate evaluation is the special case b=ek (The sequence spaces c_0 and ell-infinity, Finite truncations approximate null and summable sequences).

[F3]

If c1(K) and PNc retains coordinates 0,,N, then k>Nck=cPNc10 (Finite truncations approximate null and summable sequences).

[F4]

Every nonempty subset of N has a least element (The well-ordering principle), and a deterministic successor rule can be iterated along N (The recursion theorem).

[F5]

A strictly increasing index map satisfies njj (A strictly increasing index map satisfies nkk).

Proof

1.1

First verify the Banach-space condition. Let (c(m)) be Cauchy in 1(K). Each coordinate sequence is Cauchy because ck(m)ck(r)c(m)c(r)1; let ck be its scalar limit by [F6]. Given η>0, take M such that c(m)c(r)1<η/2 for m,rM. For fixed mM and N, passage to the limit in the finite sum gives k=0Nckck(m)η/2. Hence [F6] gives kckck(m)η/2, so cc(m)1 and cc(m)1<η. In particular c=(cc(M))+c(M)1. Thus both scalar versions of 1 are complete and hence Banach.

F3F6algebra
2.1

Put u(n)=a(n)a. For every f(1(K)), f(u(n))=f(a(n))f(a)0, so (u(n)) is weakly null. By [F1] and step 1.1 it is enough to prove u(n)10.

givenF1step 1.1
3.1

Suppose otherwise. Negating the definition of convergence supplies an ε>0 such that S:={nN:u(n)1ε} is cofinal in N: for every N it contains an nN. In particular S is nonempty.

step 2.1assume-contra
4.1

We recursively define strictly increasing indices n0<n1< and strictly increasing finite cutoffs N0<N1<. Let n0 be the least element of S, and let N0 be the least N for which k>Nuk(n0)<ε/8; the latter set is nonempty by [F3]. Given (nj,Nj), coordinate evaluation is a bounded functional by [F2], so uk(n)0 for each kNj. Because this head is finite, eventually k=0Njuk(n)<ε/8. The cofinal set S therefore contains an n>nj satisfying this inequality. Take the least such n as nj+1, then take the least N>Nj with k>Nuk(nj+1)<ε/8, again using [F3]. Each least value is unique by [F4]. On the set of pairs (n,N) with nS and k>Nuk(n)<ε/8, these rules therefore define a total deterministic successor function; [F4] iterates it from (n0,N0) and assembles the entire sequence without a choice axiom.

F2F3F4step 3.1
5.1

Define disjoint finite blocks I0={0,,N0} and Ij={Nj1+1,,Nj} for j1. For j1, the construction and njS give kIjuk(nj)u(nj)1k=0Nj1uk(nj)k>Njuk(nj)>3ε/4. For j=0 there is no old head, so the same block sum is greater than 7ε/8.

step 3.1step 4.1algebra
6.1

Define one scalar sequence b=(bk) blockwise. If kIj and uk(nj)0, put bk=sgn(uk(nj)) when K=R, and put bk=uk(nj)/uk(nj) when K=C; put bk=0 when that coordinate is zero. Because (Nj) is strictly increasing, [F5] gives Njj; hence every natural k lies in exactly one of the disjoint blocks. Thus bk1, so b(K), and the no-conjugation pairing from [F2] satisfies uk(nj)bk=uk(nj) on Ij in both scalar fields.

F2F5step 5.1construct
7.1

Let hb be the bounded functional supplied by [F2]. For j1, the triangle inequality, step 5.1, and the head and tail estimates in step 4.1 give hb(u(nj))kIjuk(nj)k=0Nj1uk(nj)k>Njuk(nj)>ε/2. For j=0, the block exceeds 7ε/8 and the only complementary tail is below ε/8, so the stronger bound hb(u(n0))>3ε/4 holds.

F2step 4.1step 5.1step 6.1
8.1

On the other hand, weak nullity in step 2.1 gives hb(u(n))0. The indices (nj) are strictly increasing, and [F5] gives njj, so the scalar subsequence hb(u(nj)) also tends to zero. This contradicts its uniform lower bound in step 7.1. Therefore u(n)10, hence a(n)a10; [F1] and the completeness proved in step 1.1 establish the Schur property over both R and C. The construction used only least natural numbers, scalar completeness and recursion, not Countable Choice or any stronger choice principle.

F1F5step 1.1step 2.1step 7.1discharge-contradiction: step 3.1
CorollaryStatement: AI-adaptedProof: AI-adaptedaudited 2026-09-14Open item page →

Ell one is not reflexive

Statement

Assume the ultrafilter lemma, DC, and HB. Neither 1(R) nor 1(C) is reflexive.

Facts & Assumptions

Given: the ultrafilter lemma, DC, HB, and K{R,C}.

[F1]

Under these three assumptions, a real or complex Banach space is reflexive if and only if every norm-bounded sequence has a weakly convergent subsequence (Reflexivity is equivalent to weak subsequential compactness of bounded sequences).

[F2]

Both real and complex 1 have the Schur property, so every weakly convergent sequence in either space converges in norm (Real and complex ell one have the Schur property).

[F3]

The space 1(K) consists of scalar sequences with norm a1=n=0an (Finite truncations approximate null and summable sequences).

[F4]

The ultrafilter lemma is the statement that every filter on a set is contained in an ultrafilter; DC and HB are respectively the principles named in The axiom of dependent choice: a relation in which every element is related to something admits an N-indexed chain and The real dominated-extension principle as an additional hypothesis over ZF.

Proof

1.1

For nN, let en be the coordinate vector with value 1 at n and 0 elsewhere. By [F3], en1(K) and en1=1, so (en) is norm bounded. If mn, the two nonzero coordinates of emen have moduli 1, hence emen1=2.

F3construct
2.1

Suppose for contradiction that 1(K) is reflexive. The forward implication of [F1] applied to the bounded sequence from step 1.1 supplies strictly increasing indices (nj) and x1(K) such that enjx.

F1step 1.1assume-contra
3.1

By [F2], the weakly convergent subsequence in step 2.1 converges to x in norm. A norm-convergent sequence is Cauchy: once enjx1<1/2 and enkx1<1/2, the triangle inequality gives enjenk1<1. But strict increase makes njnk for jk, and step 1.1 makes that distance exactly 2. This contradiction proves that 1(K) is not reflexive. Since K was either scalar field, the result holds for both. The ultrafilter lemma, DC and HB are spent only through [F1]; the Schur argument [F2] is choice-free.

F2F4step 1.1step 2.1discharge-contradiction: step 2.1

Remarks

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-14Open item page →

Uniformly convex Banach space

Definition

Let X be a real or complex Banach space with closed unit ball BX. The given norm, and hence X, is uniformly convex if for every ε(0,2] there is a δ>0 such that

x,yBX  and  xyεx+y21δ.

The endpoint 2 is included. Values ε>2 need not be tested, because the triangle inequality gives xy2 on BX. The zero space is uniformly convex vacuously: for each positive ε the antecedent has no witnesses.

Remarks

Uniform convexity implies strict convexity of the unit ball. Indeed, for distinct unit vectors x,y, take ε=xy>0; the displayed condition makes the midpoint norm strictly less than one. The converse is not part of the definition.

The property belongs to the specified norm, not merely to the underlying topological vector space. For example, on R2 the parallelogram identity gives (x+y)/222=(x22+y22)/2xy22/41ε2/4, so the Euclidean norm is uniformly convex with δ=11ε2/4>0. The supremum norm is equivalent because zz22z, but it is not even strictly convex: (1,1) and (1,1) are distinct unit vectors whose midpoint (1,0) also has supremum norm one. Thus one may not transfer uniform convexity across an arbitrary equivalent renorming.

LemmaStatement: AI-adaptedProof: AI-generatedjudge pass (gpt-5.6-terra)audited 2026-09-14Open item page →

Uniform convexity gives unique asymptotic centers

Statement

Assume the Axiom of Countable Choice ACω. Let X be a real or complex uniformly convex Banach space, let (xn)nN be a bounded sequence in X, and let CX be nonempty, norm closed and convex. Define its asymptotic-radius function on C by

r(y):=lim supnxny(yC).

Then there is a unique cC such that

r(c)=infyCr(y).

The point c is the asymptotic center of (xn) relative to C. Convexity uses real coefficients even when X is complex.

Facts & Assumptions

Given: X, (xn) and C as in the statement, with R:=infyCr(y) once that real infimum has been justified.

[F1]

For a bounded real sequence, its limit superior is the real infimum of its real tail suprema. If its limit superior is the real number L, then for every η>0 its terms are eventually less than L+η (Limit superior and limit inferior of a real sequence as infnsupknxk and supninfknxk in R, For finite L: L=lim supxk iff for every ε>0 one has xk<L+ε eventually and xk>Lε frequently).

[F2]

Every nonempty subset of R bounded below has a real infimum (Every nonempty set bounded below has an infimum).

[F3]

ACω supplies one member of each member of a sequence of nonempty sets (The Axiom of Countable Choice (ACω)).

[F4]

For every real η>0 there is an integer N1 with 1/N<η (For every ε>0 in a complete ordered field there is a natural n1 with 1/n<ε).

[F5]

Uniform convexity says that for each θ(0,2] there is δ>0 such that unit-ball vectors separated by at least θ have midpoint norm at most 1δ (Uniformly convex Banach space).

[F6]

Every norm-Cauchy sequence in X converges in X (Banach space).

[F7]

A closed subset of a metric space contains the limit of each convergent sequence in it (A point lies in the closure of A iff some sequence in A converges to it, and a set is closed iff it is sequentially closed, using its choice-free closed-to-sequentially-closed direction).

[F8]

Convexity keeps real midpoints in C, also in a complex normed space (Convex sets and continuous real-hyperplane separation in a normed space).

[F9]

Canonical positive naturals increase with their indices, and inversion reverses strict inequalities between positive elements. Consequently 1/(j+1)0 (Canonical naturals are positive and strictly increasing, Inverses of positives are positive, and reciprocation reverses order).

Proof

1.1

Choose B0 with xnB for every n. For each yC, 0xnyB+y, so [F1] makes r(y) a finite nonnegative real. Thus {r(y):yC} is nonempty and bounded below by zero, and [F2] defines a finite real R0.

givenF1F2
2.1

The function r is 1-Lipschitz. Indeed, fix y,zC and η>0. By [F1], eventually xnz<r(z)+η, and then xnyxnz+zy<r(z)+zy+η. The corresponding tail supremum, and hence its infimum r(y), is at most r(z)+zy+η. If r(y)>r(z)+zy, [F4] supplies a positive reciprocal smaller than that gap, contradicting this inequality. Hence r(y)r(z)+zy; exchanging y,z gives r(y)r(z)yz.

step 1.1F1F4
2.2

For jN put Ej:={yC:r(y)<R+1/(j+1)}. Each Ej is nonempty by the defining greatest-lower-bound property of R. Applying [F3] once to this countable family produces a sequence (yj) with yjEj for every j. This is the proof's exact use of ACω.

step 1.1F2F3
3.1

Suppose first that R=0. Given ε>0, [F4] and [F9] give a threshold J such that 1/(j+1)<ε/8 for jJ. For j,kJ, [F1] gives one index n beyond the two eventual thresholds at tolerance ε/8. Then yjykyjxn+xnyk<r(yj)+r(yk)+ε/4<ε/2. Thus (yj) is Cauchy when R=0.

step 2.2F1F4F9
3.2

Now suppose R>0, and fix ε>0. Put θ:=min{1,ε/(R+1)}(0,1]. Choose the δ>0 from [F5], replace it by δ0:=min{δ,1/2}, and set a:=min{1/2,Rδ0/2}>0,t:=R+a. Then t<R+1 and t(1δ0)<R. By [F4] and [F9], for all sufficiently large j,k one has r(yj),r(yk)<t. If such j,k also satisfied yjykε, [F1] would give a common tail on which both xnyj<t and xnyk<t. On that tail the vectors un:=xnyjt,vn:=xnykt belong to the unit ball and satisfy unvn=yjyk/t>ε/(R+1)θ. Uniform convexity therefore gives xnyj+yk2=tun+vn2t(1δ0) throughout that tail. The midpoint lies in C by [F8], and [F1] now yields r((yj+yk)/2)t(1δ0)<R, contradicting the definition of R. Consequently yjyk<ε for all sufficiently large j,k; (yj) is Cauchy also when R>0.

step 2.2F1F4F5F8F9
4.1

By [F6] there is cX with yjc, and [F7] gives cC. The lower-bound property gives Rr(c). Conversely, the Lipschitz estimate gives r(c)r(yj)+cyj<R+1/(j+1)+cyj for every j. If r(c)>R, [F4], [F9] and convergence make the sum 1/(j+1)+cyj smaller than this positive gap for some j, a contradiction. Hence r(c)=R, so a minimizer exists.

step 2.1step 2.2step 3.1step 3.2F4F6F7F9
4.2

To prove uniqueness, let c,dC both have radius R. If R=0 and cd, take η=cd/3 in [F1]; at one sufficiently large n the triangle inequality gives cd<2η, a contradiction. If R>0 and cd, repeat step 3.2 with ε=cd, the same θ,δ0,a,t, and the two fixed points c,d. Their radii equal R<t, so [F1] again gives a common tail, while [F5] makes the radius of their midpoint at most t(1δ0)<R. By [F8] that midpoint lies in C, the same contradiction. Thus c=d.

step 1.1step 3.2F1F5F8
5.1

Steps 4.1 and 4.2 give the asserted unique asymptotic center. The zero space is included: its only nonempty subset is the singleton {0} and the radius is zero. A singleton C is likewise immediate. The argument uses only real norms and real midpoints, so it is unchanged over complex scalars. The set C is expressly nonempty; no minimizer is asserted for the empty set.

step 4.1step 4.2

Source notes

Lim defines asymptotic radius and center for decreasing tails of a bounded net in §1, then proves nonemptiness and uniqueness for closed convex subsets of uniformly convex Banach spaces in Proposition 1 and Theorem 1 on printed pp. 422–423. The local proof is independent and makes its Countable Choice use explicit.

TheoremStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-14Open item page →

Milman–Pettis theorem

Statement

Assume the relative Hahn–Banach principle HB and the Axiom of Countable Choice ACω. Every real or complex uniformly convex Banach space is reflexive.

The ultrafilter lemma is not assumed.

Facts & Assumptions

Given: HB, ACω, and a real or complex uniformly convex Banach space X, with canonical map JX:XX.

[F1]

For every η(0,2], uniform convexity supplies δ>0 such that unit-ball vectors separated by at least η have midpoint norm at most 1δ (Uniformly convex Banach space).

[F2]

Under HB, if UBX, a finite list f1,,fmX and τ>0 are fixed, some xBX satisfies fi(x)U(fi)<τ for every i (Goldstine finite-data approximation, equivalently Goldstine's theorem).

[F3]

The norm on a real or complex dual space is F=supf1F(f) (The dual space X^* of a normed space and its dual norm).

[F4]

Under HB, JX is scalar-linear and isometric (Relative Hahn–Banach makes the canonical bidual map an isometry); HB is the explicitly named relative dominated-extension principle (The real dominated-extension principle as an additional hypothesis over ZF).

[F5]

Under ACω, a complete normed subspace of a normed space is closed (A complete normed subspace is closed under countable choice); Countable Choice is the countable-family selection principle (The Axiom of Countable Choice (ACω)).

[F6]

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

Proof

1.1

We first transfer uniform convexity to X. Fix ε(0,2] and take from [F1] a number δ>0 for the separation threshold ε/2. Let U,VBX satisfy UVε. By [F3], choose f0BX with (UV)(f0)>3ε/4. In the complex case multiply f0 by a scalar of modulus one, and in the real case change its sign if necessary, to obtain fBX with Re(UV)(f)>3ε/4.

F1F3given
2.1

Fix an arbitrary gBX and η>0, and put m:=Re(UV)(f)ε/2>0 and τ:=min{m/4,η}>0. Apply [F2] separately to U and V, each time with the two tests f,g and tolerance τ, obtaining x,yBX. Then Ref(xy)>Re(UV)(f)2τ>ε/2, so xy>ε/2. By [F1], (x+y)/21δ. Approximation at g therefore gives (U+V)(g)2<g(x)+g(y)2+τ1δ+η. If the left side exceeded 1δ, taking η to be half that positive gap would contradict this inequality. Hence (U+V)(g)/21δ. Taking the supremum over gBX by [F3] yields (U+V)/21δ.

step 1.1F1F2F3
3.1

Thus X, with its given dual norm, is uniformly convex: the modulus at ε may be taken to be any modulus of X at ε/2. Notice that step 2.1 used two finite-data witnesses only after U,V,f,g,η were fixed; it selected no sequence or family of witnesses.

step 1.1step 2.1
4.1

Let zX have norm one and let ρ>0. Put ε:=min{1,ρ}(0,1] and let δ>0 be the bidual modulus established in step 3.1. Set γ:=min{δ/4,1/4}. By [F3] choose f0BX with z(f0)>1γ, and rotate or change its sign to get fBX with Rez(f)>1γ. By [F2], choose xBX with f(x)z(f)<γ. Hence Ref(x)>12γ, and z+JXx2Rez(f)+f(x)2>13γ2>1δ. The contrapositive of the bidual uniform-convexity estimate gives zJXx<ερ.

F2F3F4step 3.1
5.1

It follows that JX(BX) is norm dense in BX. Indeed, the zero vector is JX0. For nonzero wBX and a prescribed ρ>0, apply step 4.1 to z=w/w with tolerance ρ/w, obtaining xBX; then wJX(wx)<ρ and wxBX.

step 4.1F4
6.1

By [F4], JX is an isometry, so its range JX(X) is a normed subspace isometric to the complete space X. Under the assumed ACω, [F5] makes this range norm closed in X. Step 5.1 puts every element of BX in its norm closure and hence in the range. Scaling then gives JX(X)=X: the zero element is already in the range, and a nonzero element is its norm times an element of the bidual unit sphere. Thus JX is surjective, and [F6] says that X is reflexive.

step 5.1F4F5F6
7.1

HB is used exactly in [F2] for Goldstine finite-data approximation and in [F4] for the canonical isometry. Countable Choice is used exactly through the complete-subspace closedness statement [F5]. No compactness theorem and no ultrafilter principle occurs. If X={0}, then X={0} and step 6.1 is immediate. All scalar inequalities use real parts, so the proof covers both real and complex scalars.

F2F4F5step 6.1
LemmaStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-14Open item page →

James nonreflexivity sequence separated from an annihilator

Statement

Assume the ultrafilter lemma, the Axiom of Dependent Choice (DC), and the relative Hahn–Banach principle HB. If a real Banach space X is not reflexive, then for every θ(0,1) there are a separable closed linear subspace MX and a sequence (xn)nN in BX such that

xn(m)0(mM)

and

dist ⁣(M,co{xn:nN})θ,

where M={wX:w(m)=0 for every mM} and co means finite convex hull.

Facts & Assumptions

Given: the ultrafilter lemma, DC, HB, a nonreflexive real Banach space X, and θ(0,1).

[F1]

Under the ultrafilter lemma, DC and HB, a Banach space is reflexive if and only if every norm-bounded sequence has a weakly convergent subsequence (Reflexivity is equivalent to weak subsequential compactness of bounded sequences). Its proof combines the weak compact unit-ball criterion (Reflexive iff unit ball weakly compact) with Eberlein–Šmulian (Eberlein–Šmulian theorem), whose compactness branch uses compact-Hausdorff Tychonoff under the ultrafilter lemma (Assuming the ultrafilter lemma, an arbitrary product of compact Hausdorff spaces is compact).

[F2]

Under HB, the norm-closed scalar span of a sequence in a Banach space is a separable Banach subspace, is weakly closed, and has intrinsic weak topology equal to its relative ambient weak topology (Eberlein–Šmulian separable reduction).

[F3]

Reflexivity is surjectivity of the canonical map, and under HB that map is a scalar-linear isometry (Reflexivity is surjectivity of the canonical map, Relative Hahn–Banach makes the canonical bidual map an isometry).

[F4]

DC is the entire-relation chain principle. Countable Choice ACω selects from a supplied sequence of nonempty sets (The axiom of dependent choice: a relation in which every element is related to something admits an N-indexed chain, The Axiom of Countable Choice (ACω)).

[F5]

Under ACω, a complete normed subspace of a normed space is closed (A complete normed subspace is closed under countable choice).

[F6]

A nonempty at most countable set admits a surjection from N; separability means having an at most countable dense subset (A nonempty set is at most countable iff it is a surjective image of N, Separability: the existence of an at most countable dense subset).

[F7]

Under HB, a bounded linear functional on any real linear subspace has an ambient extension of the same norm (Relative norm-preserving Hahn–Banach extension over the real and complex fields), derived from the relative dominated-extension principle (Dominated extension conditional on the relative principle, The real dominated-extension principle as an additional hypothesis over ZF).

[F8]

The dual norm is the supremum over the closed unit ball, and annihilators use the notation M={f:f(M)=0} (The dual space X^* of a normed space and its dual norm, Annihilator notation and the preannihilator).

Proof

Proof technique: separable reduction followed by finite annihilator duality and countable Hahn–Banach selection.

1.1

We first derive the exact Countable Choice instance used below. For a sequence (En) of nonempty sets, let S consist of all finite histories s with s(j)Ej for j<doms, starting with the empty history, and relate s to every one-term extension by a member of Edoms. This relation is entire. DC gives a chain of successively extended histories, whose union chooses one element of every En. Thus the assumed DC supplies every application of ACω below; we do not use the unproved bibliographic remark “DC implies ACω” as a theorem.

F4construct
1.2

By the contrapositive of [F1], choose a norm-bounded sequence (zn) in X with no weakly convergent subsequence. If R bounds all zn, then R>0, since an R=0 sequence is constantly zero. Replacing zn by zn/R, which preserves and reflects weak convergence of subsequences, we may assume znBX. Put M=spanR{zn:nN}. By [F2], M is a separable closed Banach subspace, and its intrinsic weak topology is the relative weak topology inherited from X.

F1F2algebra
2.1

The space M is not reflexive. Otherwise [F1], applied to the bounded sequence (zn) in the Banach space M, would give a subsequence converging weakly in M. Equality of the two weak topologies in [F2] would make the same subsequence weakly convergent in X, contrary to step 1.2. In particular M{0}.

step 1.2F1F2
3.1

Let JM:MM be the canonical map and Y=JM(M). By [F3], JM is an isometry, so Y is isometric to the complete space M. Step 1.1 and [F5] therefore make Y norm closed in M. It is proper because M is not reflexive.

step 1.1step 2.1F3F5
4.1

Choose qMY and put d=dist(q,Y). Closedness of Y gives d>0. Since d/θ>d and d is the infimum of the nonempty set {qy:yY}, choose yY with qy<d/θ. Define F=(qy)/qy. Then F=1, translation by yY does not change distance to the linear subspace Y, and hence dist(F,Y)=dqy>θ. No simultaneous family is chosen here.

step 3.1givenalgebrachoose
5.1

Since M is nonzero and separable, take a nonempty at most countable norm-dense subset DM and, by [F6], one surjection jmj from N onto D. Repetitions are harmless.

step 2.1step 4.1F6choose
6.1

For nN set Kn={uM:u(mj)=0 for 0jn},En=span{JMmj:0jn}. Then En=Kn inside M. The inclusion EnKn follows by evaluation. Conversely, if HM vanishes on Kn, define T:MRn+1 by T(u)=(u(m0),,u(mn)). Since kerT=Kn, the rule λ(Tu)=H(u) is a well-defined linear functional on imT. Finite-dimensional linear algebra extends λ to a functional (t0,,tn)j=0najtj on Rn+1, using only finitely many choices. Thus H=j=0najJMmjEn.

step 3.1step 5.1F3constructalgebra
7.1

The quotient-norm identity FKn=dist(F,En) holds. For HEn=Kn, restriction gives FHFKn. Conversely [F7] extends FKn to some GM with G=FKn; then FG vanishes on Kn, so step 6.1 puts FG in En and yields the reverse inequality. Since EnY, step 4.1 now gives FKn=dist(F,En)dist(F,Y)>θ.

step 4.1step 6.1F7F8
8.1

For each n, the last strict inequality and the dual-norm definition supply vKn with v1 and F(v)>θ. Replacing v by v if necessary and then setting u=θv/F(v) gives uKn, u<1, and F(u)=θ. By [F7], u has an extension xX with x=u<1. Therefore the set Pn of all such pairs (u,x) is nonempty.

step 7.1F7F8algebra
9.1

Apply the ACω instance from step 1.1 to (Pn), writing the selected pair as (un,xn). Then xnBX, xnM=un, F(un)=θ, and un(mj)=0 whenever jn. For fixed mM and ε>0, density supplies mj with mmj<ε; for nj, xn(m)=un(mmj)unmmj<ε. Hence xn(m)0 for every mM.

step 1.1step 5.1step 8.1F6
10.1

Let x=k=1rakxnk be any finite convex combination, where r1, ak0, and kak=1, and let wM. Restriction to M and step 9.1 give F ⁣((xw)M)=k=1rakF(unk)=θ. Since F=1, restriction cannot increase norm, and therefore xw(xw)Mθ. Taking the infimum over both nonempty sets proves dist(M,co{xn:nN})θ.

step 4.1step 9.1F8algebra
11.1

Steps 1.2 and 2.1 provide the required separable closed M, step 9.1 gives the pointwise-null dual-ball sequence, and step 10.1 gives the asserted annihilator separation. The endpoints θ=0,1 are excluded exactly as stated; X={0} cannot satisfy the nonreflexivity hypothesis. The argument is real: the sign change and the order comparison in step 8.1 are not offered as a complex proof. The ultrafilter lemma and HB enter through [F1], HB also enters through [F2], [F3] and [F7], and DC enters exactly through the finite-history derivation in step 1.1.

step 1.1step 1.2step 2.1step 9.1step 10.1F1F2F3F7

Source notes

Megginson's Theorem 1.13.11(a)→(b), printed pp. 125–126, supplies the separable finite-test bidual construction. Theorem 1.13.14(a)→(b), printed p. 132, first reduces an arbitrary nonreflexive real Banach space to a separable closed nonreflexive subspace and then extends the resulting functionals to the ambient space. The proof above expands the finite annihilator identity and records every choice principle used.

LemmaStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-14Open item page →

James convex-block norm-attainment criterion

Statement

Assume the Axiom of Dependent Choice (DC) and the relative Hahn–Banach principle HB. Let X be a real Banach space, let 0<θ<1, and let (xn)nN be a sequence in BX. For every bounded sequence s=(sn) in X put

L(s)={wX:w(x)lim supnsn(x) for every xX}.

Suppose

dist ⁣(L(x),co{xn:nN})θ,

where co is the finite convex hull. If (βn)nN is any sequence of positive reals with n=0βn=1, then there are α[θ,2] and a sequence (yn) in BX such that, for every wL(y),

j=0βj(yjw)=α

and, for every nN,

j=0nβj(yjw)<α(1θj>nβj).

In addition, assume the ultrafilter lemma. If X is nonreflexive, then some zX does not attain its norm on BX.

Facts & Assumptions

Given: DC, HB, a real Banach space X, 0<θ<1, a dual-ball sequence (xn) satisfying the displayed separation, and positive weights (βn) of sum one. The ultrafilter lemma is assumed only for the final nonreflexive consequence.

[F2]

Under HB, a real linear functional dominated by a sublinear functional extends to the whole real vector space (Dominated extension conditional on the relative principle, The real dominated-extension principle as an additional hypothesis over ZF).

[F3]

Nonempty real sets bounded below have infima, and bounded monotone real sequences converge to the corresponding supremum or infimum (Every nonempty set bounded below has an infimum, A nondecreasing sequence bounded above converges to the supremum of its range, and a nonincreasing sequence bounded below to the infimum).

[F4]

The dual norm is the supremum of absolute values on the closed unit ball. Since the scalar field is complete, X=B(X,R) is Banach, and every absolutely convergent series in it converges (The dual space X^* of a normed space and its dual norm, If (Y) is Banach then (\mathcal B(X,Y)) is Banach, Series criterion for Banach spaces, Series and absolute convergence in a normed space).

[F5]

DC supplies an infinite chain through any entire relation on a nonempty set (The axiom of dependent choice: a relation in which every element is related to something admits an N-indexed chain).

[F6]

A strictly increasing subsequence index map satisfies knn, and the real geometric-series formula holds for every ratio of absolute value less than one (A strictly increasing index map satisfies nkk, For r<1, k0rk=1/(1r), and for r1 the series diverges).

[F7]

Under the ultrafilter lemma, DC and HB, every nonreflexive real Banach space has the annihilator-separated pointwise-null dual-ball sequence of James nonreflexivity sequence separated from an annihilator. Its ultrafilter-lemma input is the compact-Hausdorff Tychonoff theorem (Assuming the ultrafilter lemma, an arbitrary product of compact Hausdorff spaces is compact).

Proof

technique · nested convex-block induction and a geometric series argument
1.1

We first record two elementary properties of L. For a bounded sequence s=(sn), say snC, the function p(u)=lim supnsn(u) is finite, positively homogeneous, and subadditive: homogeneity follows directly from tail suprema and subadditivity from [F1]. Apply [F2] to the zero functional on {0} dominated by p. The extension w satisfies w(u)p(u), while applying this inequality at u and using [F1] gives w(u)lim infnsn(u). Hence w(u)Cu, so wL(s) and wC. Thus L(s) is nonempty and, when sBX, lies in BX.

F1F2F4
1.2

Let V(s) be the set of sequences v=(vn) for which vnco{sj:jn} at every n. It is nonempty because sV(s). For each u, every such convex combination satisfies vn(u)supjnsj(u), so the receding-tail definition gives lim supnvn(u)lim supnsn(u) and therefore L(v)L(s). Flattening two finite convex combinations proves V(v)V(s) when vV(s). A subsequence of s also belongs to V(s): its nth index is at least n by [F6].

F1F6construct
1.3

Reindex the weights by positive integers, bm=βm1 for m1. Extend the corresponding reindexing of the dual sequence to a genuine zero-based library sequence by setting x^0=x0 and x^m=xm1 for m1. The duplicate initial term does not change any scalar limsup, so L(x^)=L(x), and {x^m:m1}={xn:nN}. Put Tm=j=mbj, so T1=1, Tm=bm+Tm+1, every Tm>0, and Tm0. Choose explicitly εm=min{1/(m+1),(1θ)2m1TmTm+1/bm}>0. Then εm0 and [F6] gives \sum_{m=1}^\infty\frac{b_m\varepsilon_m}{T_mT_{m+1}}\le(1-\theta)\sum_{m=1}^\infty2^{-m-1}=\frac{1-\theta}{2}<1-\theta.\tag{1}

givenF6algebra
1.4

Now additionally assume the ultrafilter lemma and that X is nonreflexive. Apply [F7] with the same θ to obtain M and (xn)BX, pointwise null on M, with its convex hull at distance at least θ from M. If wL(x), then for mM the defining inequality at m and m gives w(m)0 and w(m)0. Hence L(x)M, and the separation hypothesis of the technical criterion holds.

F1F7
2.1

Set x(0)=x^. Suppose that y1,,ym1 and the sequences x(0),,x(m1) have been constructed. For yco{xj(m1):jm} and vV(x(m1)), define Sm(y,v)={j<mbjyj+Tmyw:wL(v)}, and let αm be the infimum, over all such (y,v), of supSm(y,v). Step 1.1 makes every Sm nonempty. All displayed functionals have norm at most two, because all the convex blocks and all members of L(v) lie in the dual unit ball; hence 0αm2 and [F3] makes the infimum legitimate.

step 1.1step 1.2F3F4
3.1

For m=1, any admissible y is in the convex hull of the original sequence and L(v)L(x^)=L(x) by steps 1.2–1.3. The separation hypothesis therefore gives ywθ for every admissible w, so α1θ.

step 1.2step 1.3step 2.1given
4.1

Suppose m2. The induction will arrange that x(m1) is a subsequence of some z(m1)V(x(m2)). Consequently x(m1)V(x(m2)) by step 1.2. For an admissible y at stage m, both ym1 and y lie in co{xk(m2):km1}, and so does u=bm1ym1+TmyTm1. Also vV(x(m2)) by flattening. Since j<m1bjyj+Tm1uw=j<mbjyj+Tmyw, every stage-m candidate supplies a stage-(m1) candidate of the same supremum. Hence αm1αm. Together with step 3.1, θαm2 for all m.

step 1.2step 2.1step 3.1algebra
5.1

The definition of the positive number αm supplies ymco{xj(m1):jm} and z(m)V(x(m1)) such that \alpha_m\le\sup S_m(y_m^*,z^{(m)})<\alpha_m(1+\varepsilon_m).\tag{2} Because 0<εm<1, choose wmL(z(m)) for which the norm inside (2) is greater than αm(1εm). By [F4] and the balance of BX, there is umBX on which the same functional, without absolute-value signs, has value greater than that number. The bounded scalar sequence zj(m)(um) has a subsequence converging to its liminf by [F1]; denote the corresponding dual sequence by x(m).

step 1.3step 2.1step 4.1F1F3F4
6.1

These choices depend on the whole finite history. Let the state set consist of all finite histories satisfying step 5.1, beginning with the empty history and x(0)=x^, and relate a history to each valid one-stage extension. Step 5.1 proves that every state has a successor. Applying DC once produces all ym,z(m),wm,um,x(m) with (2) and the strict lower inequality. No simultaneous selection outside this DC application is being hidden.

step 5.1F5
7.1

The induction has produced the positive-indexed family (ym)m1. Make it a genuine sequence by putting y~0=y1 and y~m=ym for m1. For fixed n0 and every j>n, repeated flattening of the relations in steps 4.1–5.1 gives yjco{xk(n):kj}. Ignoring the single duplicated initial term in y~, the tail argument of step 1.2 therefore yields L(\widetilde y)\subseteq\bigcap_{n\ge0}L(x^{(n)})\subseteq\bigcap_{n\ge1}L(z^{(n)}).\tag{3} For the second inclusion, x(n) is a subsequence of z(n).

step 1.2step 4.1step 5.1step 6.1
8.1

Fix wL(y~). Since wL(x(m)) by (3) and the um-evaluations of x(m) converge to the liminf of those of z(m), w(um)lim infjzj(m)(um)wm(um). The last inequality follows by applying the definition wmL(z(m)) at um and using limsup reflection. Replacing wm by w therefore preserves the strict lower evaluation chosen in step 5.1. The upper estimate follows from wL(z(m)) and (2). Thus \alpha_m(1-\varepsilon_m)<\|\sum_{j<m}b_jy_j^*+T_my_m^*-w^*\|<\alpha_m(1+\varepsilon_m).\tag{4}

step 5.1step 7.1F1F4
9.1

By steps 2.1 and 4.1, (αm) is nondecreasing and bounded above by 2, so [F3] gives a limit α[θ,2]. The series j1bjyj is absolutely convergent and hence convergent in the Banach space X by [F4]. If q=j1bjyjw and the functional inside (4) is qm, then qqmjmbjyjym2Tm0. Since εm0, (4) gives q=α. Because bj=1, this is j1bj(yjw)=α.

step 1.3step 4.1step 8.1F3F4
10.1

It remains to prove the strict prefix estimate. Put Pn=j=1nbj(yjw), P0=0, and Qn=Pn1+Tn(ynw). The upper half of (4) and αnα give Qn<α(1+εn). The exact identity Pn=bnTnQn+Tn+1TnPn1 and induction yield Pn<αTn+1k=1nbk(1+εk)TkTk+1. Since bk=TkTk+1, k=1nbk/(TkTk+1)=1/Tn+11/T1. Using T1=1 and (1) therefore gives \|P_n\|<\alpha(1-T_{n+1})+\alpha(1-\theta)T_{n+1}=\alpha(1-\theta T_{n+1}).\tag{5} The calculation includes n=1, where P0=0.

step 1.3step 8.1step 9.1algebrainduction
11.1

Define the asserted zero-based sequence by ynout=yn+1. It and y~ differ only by a one-place shift and a duplicated first term, so their scalar limsups agree and L(yout)=L(y~). Step 9.1 is therefore the asserted infinite-series equality for every wL(yout), while (5) with n replaced by n+1 is exactly j=0nβj(yjoutw)<α(1θj>nβj). Relabeling yout as y proves the technical criterion, including the first term n=0 and every positive weight sequence.

step 1.3step 7.1step 9.1step 10.1
12.1

Put Δ=θ2/4 and r=Δ/2, and take the positive zero-based weights βj=(1r)rj. By [F6] they sum to one; their tails Rk=jkβj satisfy Rk+1=rRk<ΔRk. Apply the technical criterion to obtain α, y, and choose one wL(y), which is possible by step 1.1. The absolutely convergent series z=j=0βj(yjw) has z=αθ>0.

step 1.1step 11.1step 1.4F4F6
13.1

Fix uBX. Step 1.1 gives w1 and lim infjyj(u)w(u). Since θ22Δ=θ2/2>0, there is an arbitrarily late k, and in particular one with k1, such that (ykw)(u)<θ22Δαθ2Δ. Split z(u) before k, at k, and after k. The prefix estimate at k1, the displayed scalar inequality, and yjw2 give z(u)<α(1θRk)+(αθ2Δ)βk+2Rk+1<α(1θRk)+(αθ2Δ)βk+2ΔRk=α(αθ2Δ)Rk+1<α, because αθ2Δθ22Δ>0. Applying the same argument to u gives z(u)<α. Therefore z(u)<α=z for every uBX: z is nonzero but attains its norm nowhere on the closed unit ball.

step 1.1step 11.1step 12.1F1F4
14.1

The first part uses DC only in step 6.1 and HB only in step 1.1. The ultrafilter lemma is absent there and enters solely through [F7] in the final nonreflexive consequence. The empty space cannot meet either separation or nonreflexivity; singleton convex combinations and the first prefix occur in steps 3.1 and 11.1; all tail denominators are positive because every weight is positive; and both strict endpoints 0<θ<1 are used in (1) and step 13.1.

step 1.1step 1.3step 3.1step 6.1step 11.1step 1.4step 13.1

Source notes

Megginson's Lemma 1.13.12 proves nonemptiness of L(s). Lemma 1.13.13, printed pp. 128–132, supplies the eight-claim nested convex-block induction; its final reference to Lemma 1.13.10 step 6 is expanded here into the exact Pn,Qn,Tn identity and telescoping calculation. Theorem 1.13.14(b)→(d), printed pp. 132–133, supplies the annihilator inclusion and geometric-weight norm-nonattainment argument. The proof here reindexes all public data from the source's positive integers to the repository's zero-based N.

TheoremStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-14Open item page →

James reflexivity theorem

Statement

Assume the ultrafilter lemma, the Axiom of Dependent Choice (DC), and the relative Hahn–Banach principle HB. A real or complex Banach space X is reflexive if and only if every fX attains its norm on the closed unit ball: there is xBX with f(x)=f. This includes X={0}.

Facts & Assumptions

Given: the ultrafilter lemma, DC, HB, and a real or complex Banach space X.

[F1]

Reflexivity is surjectivity of the canonical map JX:XX; under HB the canonical map is an isometry (Reflexivity is surjectivity of the canonical map, Relative Hahn–Banach makes the canonical bidual map an isometry).

[F2]

Under HB, every bounded scalar-linear functional on a scalar-linear subspace of a normed space has a norm-preserving extension (Relative norm-preserving Hahn–Banach extension over the real and complex fields, The real dominated-extension principle as an additional hypothesis over ZF).

[F3]

Under DC and HB, and under the ultrafilter lemma for its nonreflexive consequence, the James convex-block criterion says that every nonreflexive real Banach space has a bounded real functional that does not attain its norm (James convex-block norm-attainment criterion, The axiom of dependent choice: a relation in which every element is related to something admits an N-indexed chain, Assuming the ultrafilter lemma, an arbitrary product of compact Hausdorff spaces is compact).

[F4]

The continuous dual consists of bounded scalar-linear functionals and its norm is the supremum on the closed unit ball; a Banach space is complete for its norm (The dual space X^* of a normed space and its dual norm, Banach space).

Proof

Proof technique: Hahn–Banach representation for the forward implication, then contrapositive and realification for the reverse implication.

1.1

Suppose X is reflexive and let fX. If f=0, then x=0BX attains its norm. If f0, define g on the one-dimensional scalar-linear subspace spanK{f}X by g(cf)=cf. Then g(cf)=cf, so g=1. By [F2] it extends to GX with G=1. Reflexivity and [F1] give xX with G=JXx and x=G=1. Hence f(x)=G(f)=f, so f attains its norm on BX.

F1F2F4given
1.2

For the reverse implication, first suppose that X is real and every member of X attains its norm. If X were nonreflexive, [F3] would supply zX that attains its norm nowhere on BX, a contradiction. Thus X is reflexive.

F3givenassume-contradischarge-contradiction
1.3

Now suppose X is complex and every complex-linear member of X attains its norm. Let XR be the same additive normed space with scalars restricted to R. It remains a real Banach space because its norm and Cauchy sequences are unchanged. For u(XR) define fu(x)=u(x)iu(ix). Real linearity gives fu(ix)=ifu(x), hence fu is complex linear, and Refu=u. The inequalities ufu and fuu follow respectively from u=Refu and, for each x, choosing a unit scalar a with afu(x)=fu(x) and observing fu(x)=u(ax). Thus fu=u.

F4constructalgebra
2.1

By hypothesis, fu attains its norm at some xBX. Choose a unit scalar a with afu(x)=fu(x) (take a=1 if the value is zero). Then axBX and u(ax)=Refu(ax)=Re(afu(x))=fu=u. Hence every member of (XR) attains its norm. The real implication in step 1.2 shows that XR is reflexive.

step 1.2step 1.3givenalgebra
3.1

To pass back to the complex space without an unproved slogan, let HX be complex linear. For u(XR) put U(u)=ReH(fu). Step 1.3 makes U a bounded real-linear functional on (XR), with U(u)Hu. Real reflexivity from step 2.1 supplies xXR such that U(u)=u(x) for every real-dual u. If fX and u=Ref, then the formula in step 1.3 gives fu=f, so ReH(f)=Ref(x). Apply the same equality to the complex functional if: complex linearity gives ReH(if)=ImH(f) and Re(if(x))=Imf(x). Thus H(f)=f(x)=JXx(f) for every fX. Therefore JX is onto and X is complex-reflexive.

F1step 1.3step 2.1algebra
4.1

Steps 1.1 and 1.2 prove both implications over the reals; steps 1.3–3.1 prove the complex reverse implication, while step 1.1 already covers the complex forward implication. If X={0}, its dual and bidual are zero and the unique functional attains norm zero at zero. The forward implication uses only HB; UL and DC enter the reverse implication exactly through [F3].

step 1.1step 1.2step 1.3step 2.1step 3.1F1F2F3

Source notes

Megginson's Theorem 1.13.14 proves the real contrapositive through the full convex-block argument. Theorem 1.13.15, printed p. 134, passes from complex norm attainment to real norm attainment using fu(x)=u(x)iu(ix) and a unit-modulus rotation. The final passage from real reflexivity to complex reflexivity is expanded here by representing an arbitrary complex bidual functional and recovering both of its scalar parts.

LemmaStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-14Open item page →

Quantitative Bishop–Phelps support functional construction

Statement

Assume the Axiom of Dependent Choice (DC) and the relative Hahn–Banach principle HB. Let C be a nonempty closed bounded convex subset of a real Banach space X. For every fX and every ε>0 there are vC and gX such that

gfεandg(c)g(v)(cC).

In fact, the construction below gives the strict bound gf<ε.

Facts & Assumptions

Given: DC, HB, X,C,f and ε as in the statement.

[F1]

A closed subset of a complete metric space is complete, without a choice axiom (Closed subspaces of complete metric spaces are complete; the converse under countable choice, claim 2, Banach space).

[F2]

DC produces a sequence along an entire relation from a specified initial state (The axiom of dependent choice: a relation in which every element is related to something admits an N-indexed chain).

[F4]

Under HB, a real linear functional dominated by a sublinear functional on a subspace has a dominated real-linear extension (Dominated extension conditional on the relative principle, The real dominated-extension principle as an additional hypothesis over ZF).

[F5]

The dual norm is the supremum of the absolute values on the closed unit ball (The dual space X^* of a normed space and its dual norm).

Proof

Proof technique: maximizing variational construction followed by a support-cone Hahn–Banach argument.

1.1

Choose a real number η with 0<η<ε. The restriction F=fC is continuous and bounded above because C is bounded. By [F1], C with its norm metric is complete. Fix one x0C, possible because C is nonempty, and for xC define S(x)={yC:F(y)F(x)+ηyx}. Each S(x) is nonempty because it contains x, and it is closed because F(y)F(x)ηyx is continuous in y.

givenF1construct
2.1

If yS(x) and zS(y), then F(z)F(y)+ηzyF(x)+η(yx+zy)F(x)+ηzx. Thus zS(x) and S(y)S(x). Since F is bounded above and S(x) is nonempty, its supremum is a real number. For every n and every xC, the defining approximation property of the supremum supplies yS(x) with F(y)>supzS(x)F(z)2n.

step 1.1algebra
3.1

Let a state be a nonempty finite sequence (x0,,xn) in C which starts at the fixed x0 and, at each earlier index k<n, has xk+1S(xk) and F(xk+1)>supzS(xk)F(z)2k. Relate each state to every valid one-term extension. Step 2.1 proves that this relation is entire, so one application of DC gives a compatible infinite sequence (xn) with both displayed properties for every n.

step 2.1F2choose
4.1

The ascent condition gives ηxn+1xnF(xn+1)F(xn). Consequently the partial sums of nxn+1xn are nondecreasing and bounded above by (supCFF(x0))/η. By [F3] the series converges, hence its tails tend to zero and (xn) is Cauchy. Completeness gives a limit vC.

step 1.1step 3.1F3algebra
5.1

Transitivity in step 2.1 makes every tail point xk, kn, belong to S(xn); closedness gives vS(xn) for every n. If zS(v), then transitivity also puts z in every S(xn), and the approximate-supremum condition gives F(z)<F(xn+1)+2n. Letting n and using continuity yields F(z)F(v). But zS(v) also gives F(z)F(v)+ηzv, so z=v. Therefore F(c)<F(v)+ηcv(cC, cv), and the corresponding non-strict inequality holds for every cC.

step 1.1step 2.1step 3.1step 4.1algebra
6.1

Put D={t(cv):t0, cC}. Because Cv is convex and contains zero, D is a convex cone: for t,s0 the sum t(cv)+s(cv) is zero if t+s=0, and otherwise equals (t+s)(tt+sc+st+scv). Step 5.1 and real linearity give f(d)ηd(dD). This includes d=0.

step 5.1givenalgebra
7.1

For xX define p(x)=infdD(ηx+df(d)). The set being infimized is nonempty because 0D. Step 6.1 and the reverse triangle inequality give every one of its terms at least ηx, while d=0 gives a term equal to ηx. Thus [F3] makes p(x) a finite real and -\eta\|x\|\le p(x)\le\eta\|x\|.\tag{1} Both bounds are uniform in the choice of d.

step 6.1F3algebra
8.1

The cone identities imply p(tx)=tp(x) for t>0, and (1) gives p(0)=0. If d1,d2D, then d1+d2D and ηx+y+d1+d2f(d1+d2)ηx+d1f(d1)+ηy+d2f(d2). Taking infima first over d1,d2 and then over D proves p(x+y)p(x)+p(y). Hence p is sublinear.

step 6.1step 7.1algebra
9.1

Apply [F4] to the zero functional on {0}, dominated by p, to obtain a real-linear h:XR with h(x)p(x). Applying this at x and x and using (1) gives h(x)ηx, so hX and hη by [F5]. For dD, the candidate d in the infimum gives p(d)f(d), whence h(d)=h(d)p(d)f(d) and h(d)f(d). Thus the extension dominates f on the support cone.

step 7.1step 8.1F4F5
10.1

Set g=fh. Then gX and gf=hη<ε. For every cC, the vector cv lies in D, so step 9.1 gives g(c)g(v)=f(cv)h(cv)0. Thus g attains its supremum on C at v. The proof permits a singleton C, f=0, X={0} and the closed-boundary cases; DC is used only in step 3.1 and HB only in step 9.1.

step 6.1step 9.1given

Source notes

Loewen–Wang Theorem 2.2 proves a generalized variational principle and derives the Ekeland inequality in (2.14). Proposition 5.1(i) applies that principle to a coercive function, and Theorem 5.2 states Bishop–Phelps for nonempty closed bounded convex sets. The proof above derives exactly the maximizing inequality needed here and then spells out the support-cone/sublinear-gauge argument.

TheoremStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-14Open item page →

Bishop phelps

Statement

Assume the Axiom of Dependent Choice (DC) and the relative Hahn–Banach principle HB.

  1. If C is a nonempty closed bounded convex subset of a real Banach space X, then the real-linear functionals attaining their supremum on C are norm dense in X.
  2. Consequently, the norm-attaining functionals are norm dense in the dual of every real Banach space.
  3. The norm-attaining complex-linear functionals are also norm dense in the dual of every complex Banach space.

The third claim concerns the closed unit ball only; no complex analogue for an arbitrary convex set is asserted.

Facts & Assumptions

Given: DC, HB, and the real or complex Banach spaces and positive approximation tolerances occurring in the statement.

[F1]

Under DC and HB, for a nonempty closed bounded convex set C in a real Banach space, every fX and ε>0 admit vC and gX with gf<ε and g(c)g(v) for every cC (Quantitative Bishop–Phelps support functional construction, The axiom of dependent choice: a relation in which every element is related to something admits an N-indexed chain, The real dominated-extension principle as an additional hypothesis over ZF).

[F2]

For a real or complex normed space, the dual norm is f=supxBXf(x) (The dual space X^* of a normed space and its dual norm).

Proof

Proof technique: quantitative approximation followed by unit-ball symmetry and complexification.

1.1

Let X be real, let C be as in claim 1, and fix fX and ε>0. By [F1] there are vC and gX such that gf<ε and g(c)g(v) for every cC. Thus g(v)=supCg, and arbitrary f and ε prove the asserted norm density.

givenF1
1.2

Now let X be complex and write XR for its realification. For u(XR) define Uu(x)=u(x)iu(ix). Real linearity gives Uu(ix)=iUu(x) and ReUu=u. For any x, choose a unit scalar a with aUu(x)=Uu(x) when the value is nonzero, and take a=1 otherwise. Then Uu(x)=u(ax)ux, while u(x)Uu(x); therefore UuX and Uu=u. The correspondence is real-linear, and for complex-linear f, URef=f.

F2constructalgebra
2.1

Take C=BX in step 1.1. Since BX is symmetric, supxBXg(x)=supxBXg(x)=g by [F2]. Hence the approximating g satisfies g(v)=g at some vBX and is norm-attaining. This includes g=0, which attains norm zero at zero.

step 1.1F2algebra
2.2

Fix fX and ε>0. Apply the real claim 1 to the same set BX inside XR and to Ref. It gives a real functional u and vBX with uRef<ε and u(x)u(v) on BX. Put G=Uu. Step 1.2 applied to uRef gives Gf<ε. Because the complex unit ball is symmetric, [F2] and step 1.2 give u(v)=supBXu=u=G. But ReG(v)=u(v)=G and G(v)G, so G(v)=G and G attains its norm.

step 1.1step 1.2F2givenalgebra
3.1

The three density assertions follow from steps 1.1, 2.1 and 2.2. If X={0}, its unique functional is zero and already norm-attaining. The proof uses DC and HB only through [F1]; the realification and complexification are explicit and use no choice. The general convex-set conclusion remains real, while the complex conclusion is exactly the unit-ball norm-attainment assertion.

step 1.1step 2.1step 1.2step 2.2F1

Source notes

Loewen–Wang Proposition 5.1(i) derives density of convex subgradients from Ekeland's variational principle, and Theorem 5.2 states the real Bishop–Phelps theorem for nonempty closed bounded convex sets. The complex unit-ball clause is proved locally by the explicit real-dual/complex-dual correspondence; the source is not cited for a general complex convex-set theorem.

TheoremStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-14Open item page →

Separable dual implies separable primal

Statement

Assume the Axiom of Countable Choice ACω and the relative Hahn–Banach principle HB. If the continuous dual X of a real or complex normed space X is norm separable, then X is norm separable.

Facts & Assumptions

Given: ACω, HB, a real or complex normed space X, and the hypothesis that X is separable in its norm topology.

[F1]

Separability means that an at most countable dense subset exists, and a nonempty at most countable set is the image of a sequence (Separability: the existence of an at most countable dense subset, A nonempty set is at most countable iff it is a surjective image of N).

[F2]

The dual norm is f=supx1f(x) (The dual space X^* of a normed space and its dual norm).

[F3]

Under HB, a point outside a nonempty closed convex set can be uniformly strictly separated from it by a nonzero continuous scalar-linear functional (Relative geometric Hahn–Banach with the exact open, closed, and compact hypotheses, The real dominated-extension principle as an additional hypothesis over ZF).

[F4]

The rationals are countable and dense in the reals. Products of two at most countable sets are at most countable, and under ACω a countable union of at most countable sets is at most countable (Q is countably infinite, The rationals embed densely in the reals, A product of two at most countable sets is at most countable, Countable unions of at most countable sets, assuming ACω, The Axiom of Countable Choice (ACω)).

Proof

technique · almost-norming sequence and annihilator separation
1.1

If X={0}, then {0} itself is a finite dense subset of X, so the conclusion holds. Henceforth suppose X{0}.

givenF1
1.2

By [F1], choose an at most countable norm-dense subset SX. Enlarge it by the zero functional, so it is nonempty and [F1] supplies a sequence (fn)n0 whose range is S. This sequence is norm dense in X.

givenF1construct
1.3

For each n, if fn=0 set Cn={0}; otherwise let Cn={xX:x1 and fn(x)>12fn}. The set Cn is nonempty by [F2]. Apply ACω to the family (Cn) and choose xnCn for every n. This is the only selection of an arbitrary countable family in the proof.

F2F4choose
2.1

Let K0=Q in the real case and K0=Q+iQ in the complex case, and let D be the K0-linear span of the sequence (xn). The field K0 is at most countable by [F4]. For each fixed number of summands, the coefficient-index tuples form a finite product of at most countable sets; the union over all finite lengths is at most countable by [F4]. Its image under evaluation is D, so D is at most countable. Density of Q in R shows that D is norm dense in the real or complex linear span of the xn.

step 1.3F4algebra
2.2

Let gX vanish on D. Then g(xn)=0 for every n. Given ε>0, norm density of (fn) gives an n with gfn<ε. By the definition of xn in step 1.3, 12fnfn(xn)=(fng)(xn)fng<ε, where the first inequality is also true when fn=0. Therefore ggfn+fn<3ε. Since this holds for every ε>0, g=0.

step 1.2step 1.3F2algebra
3.1

Suppose that the norm closure M=D were a proper subset of X. It is a nonempty closed real-linear subspace, and in the complex case it is complex-linear because K0 is dense in C. Choose zM. By [F3] there is a nonzero hX strictly separating z from M. Because M is a subspace and Reh is bounded on one side there, scaling forces Reh(m)=0 for every mM. In the complex case, applying this also to imM gives Imh(m)=0. Thus h vanishes on D, contradicting step 2.2. Consequently D=X.

F3step 2.1step 2.2assume-contracontradictiondischarge-contradiction
4.1

The at most countable set D is norm dense in X by steps 2.1 and 3.1, so X is separable by [F1]. The use of ACω is exactly the simultaneous choice in step 1.3 and the countable-union result in step 2.1; HB is used exactly in the separation step 3.1.

step 2.1step 3.1F1F3F4

Source notes

Brezis proves the real Banach-space case by the same almost-norming sequence and annihilator argument. The proof above observes that completeness is not used, handles X={0}, makes the countability and choice steps explicit, and uses Gaussian-rational coefficients to cover complex normed spaces.

CorollaryStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-14Open item page →

Separable reflexive space has separable dual

Statement

Assume the Axiom of Countable Choice ACω and the relative Hahn–Banach principle HB. If a real or complex Banach space X is reflexive and norm separable, then its continuous dual X is norm separable.

Facts & Assumptions

Given: ACω, HB, and a real or complex separable reflexive Banach space X.

[F1]

A space is separable precisely when it has an at most countable dense subset (Separability: the existence of an at most countable dense subset).

[F2]

Reflexivity says that the canonical map JX:XX is a surjective isometric embedding (Reflexivity is surjectivity of the canonical map).

[F3]

Under ACω and HB, a real or complex normed space whose continuous dual is norm separable is itself norm separable (Separable dual implies separable primal).

Proof

technique · transport a dense set through the canonical isometry and apply the preceding theorem to $X^*$
1.1

By [F1], fix an at most countable norm-dense set DX. Its image JX[D] is at most countable: the restriction of the injective map JX is a bijection from D onto that image.

givenF1F2
2.1

The image JX[D] is norm dense in X. Indeed, for ΦX and ε>0, surjectivity in [F2] gives xX with Φ=JXx, and density of D gives dD with xd<ε; the isometry in [F2] then gives ΦJXd=JX(xd)=xd<ε. Thus X is norm separable by [F1].

step 1.1F1F2
3.1

Apply [F3] to the normed space Y=X. Its continuous dual is Y=X, which is separable by step 2.1, so X is norm separable. No new selection or separation is made here: ACω and HB are used exactly through [F3].

givenstep 2.1F3

Source notes

Brezis proves the same implication by identifying X with X and applying the separable-dual theorem to X. Reflexivity is essential: Brezis's Remark 19 records L1 as separable with nonseparable dual L; that warning is source context and is not used as a supplier in the proof above.

LemmaStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-14Open item page →

Clarkson inequalities in both exponent ranges

Statement

Let (S,A,μ) be a measure space, let 1<p<, and let f,gLp(μ) over either R or C.

  1. If p2, then f+g2pp+fg2ppfpp+gpp2.
  2. If 1<p2 and q=p/(p1), then f+g2pq+fg2pq(fpp+gpp2)q/p.

At p=2 both formulas are the same equality.

Facts & Assumptions

Given: A measure space (S,A,μ), a real number 1<p<, and f,gLp(μ;K) for K=R or C.

[F1]

For 1<p<, the conjugate exponent is q=p/(p1) and satisfies 1/p+1/q=1 (Conjugate exponents, including the endpoint conventions).

[F2]

Real powers on positive bases obey the product, quotient, and iterated power laws; xxa is continuous and differentiable on (0,) with derivative axa1 (Real powers for positive bases, with the zero-base positive-exponent convention, The exponent, product, quotient, and iterated-power laws for positive real bases and real exponents, Continuity and derivatives of positive-base real powers).

[F3]

The natural logarithm is the inverse of the exponential, is continuous and strictly increasing, obeys the product and quotient laws, and has derivative 1/x (The natural logarithm as the inverse of the exponential function, Order, continuity, range, and the product, quotient, and reciprocal laws for the natural logarithm, The natural logarithm has derivative 1/x and equals the integral from 1 to x of 1/t).

[F5]

For conjugate finite exponents r,s>1, two-term Hölder gives a1b1+a2b2(a1r+a2r)1/r(b1s+b2s)1/s. (Holder's inequality for finite sums and conjugate real exponents)

[F6]

For z=a+ib, one has z=(a2+b2)1/2, zw=zw, and z=0 exactly when z=0 (Real and imaginary parts, complex conjugation, and modulus, Conjugation is an involutive real-field automorphism, zz=z2, and modulus is definite, multiplicative, and subadditive).

[F7]

Real and complex Lp consist of a.e. classes of measurable representatives with hpp=Shpdμ(1p<), and addition, subtraction, scalar multiplication, and the norm are representative-independent (The function space Lp(μ) for 0<p<, Complex Lp classes and Euclidean test-function conventions, The Lp norm descends to the quotient and makes Lp a normed space for 1p, Complex Holder, Minkowski, and the quotient norm).

[F8]

The nonnegative integral is order preserving and positively homogeneous, and it is additive on two nonnegative measurable functions (Monotonicity and nonnegative homogeneity of the nonnegative integral, Additivity of the nonnegative Lebesgue integral).

Proof

technique · prove the two scalar Clarkson estimates, then integrate; in the lower exponent range a two-coordinate Hölder calculation replaces an undeclared vector-valued Minkowski theorem
1.1

Suppose p2 and let r=p/21. For u,v0, first ur+vr(u+v)r: if u+v>0, divide by (u+v)r and use 0t1trt for t=u/(u+v) and 1t=v/(u+v); the zero case is equality. Also (u+v)r2r1(ur+vr). For r=1 this is equality. For r>1, apply [F5] with conjugate r and r/(r1) to (u,v) and (1,1), then raise to the rth power.

F2F4F5
1.2

Suppose 1<p<2 and put q=p/(p1)>2. For 0t1, define Φ(t)=((1+t)q+(1t)q)1/q(1+tp)1/p. We will prove Φ(t)21/q. Set α=p1 and β=1/(q1); by [F1], 0<α=β<1. For 0<t<1, put G1(t)=1t2ααβtα1+αβtα+1 and H(t)=(α+1)βt22tα+1+(1α)β. Direct differentiation gives G_1'(t)=\alpha t^{\alpha-2}H(t),\qquad H'(t)=2(\alpha+1)t(\beta-t^{\alpha-1})<0. \tag{2} because tα1>1>β. The estimate H(t)>0 holds whenever 2tα+1<(1α)β, while H(1)=2(β1)<0. Continuity, [F4], and strict decrease therefore give a unique t0(0,1) at which H vanishes. Thus G1 increases before t0 and decreases after it.

F1F2F4
1.3

Suppose 1<p<2, put q=p/(p1), r=q/p>1, and s=r/(r1). For measurable representatives of f,g, let A=f+gp,B=fgp,U=SAdμ,V=SBdμ, and M=(Ur+Vr)1/r. These numbers are finite by [F7]. If M=0, the inequality below is immediate. If M>0, set λ=(U/M)r1,η=(V/M)r1. Then λs+ηs=1 and M=λU+ηV. Two-term Hölder [F5], applied pointwise to (λ,η) and (A,B), gives M=\int_S(\lambda A+\eta B)\,d\mu\le\int_S(A^r+B^r)^{1/r}\,d\mu. \tag{7}

F1F2F5F7F8
2.1

For real or complex scalars a,b, [F6] and coordinate expansion give the scalar parallelogram identity a+b2+ab2=2(a2+b2). Apply both inequalities of step 1.1, first to u=a+b2,v=ab2 and then to u=a2,v=b2. Since 2r=p, this yields |a+b|^p+|a-b|^p\le2^{p-1}(|a|^p+|b|^p). \tag{1}

step 1.1F2F6
2.2

For every sufficiently small t>0, G1(t)1+αβαβtα1<0; for example the final inequality holds whenever t1α<αβ/(1+αβ). On the other hand G1(1)=0, and strict decrease on (t0,1) gives G1(t)>0 there. Consequently continuity and the monotonicity from step 1.2 give a unique t1(0,t0) such that G1<0 on (0,t1) and G1>0 on (t1,1).

step 1.2F2F4
3.1

Define, for 0<t<1, G2(t)=log(1+t)+βlog(1tα)log(1t)βlog(1+tα). Using [F2]–[F4] and simplifying over the positive common denominator gives G_2'(t)=\frac{2G_1(t)}{(1-t^2)(1-t^{2\alpha})}. \tag{3} For every ε>0, 0<t<ε1/α implies 0<tα<ε; hence tα0 as t0, and logarithm continuity proves that G2 extends continuously by G2(0)=0. By step 2.2 it first strictly decreases and then strictly increases. It eventually becomes positive: the derivative test applied to 1tαα(1t) gives 1tαα(1t), while 1+tα2; hence 1+t1t(1tα1+tα)β(α2)β(1t)β1>1 whenever 0<1t<(α/2)β/(1β). By the logarithm and real-power laws, the logarithm of the left side is G2(t), so it is positive there. Thus [F4] gives a unique t2(t1,1) such that G2<0 on (0,t2) and G2>0 on (t2,1).

step 2.2F2F3F4
3.2

Choose measurable representatives of f and g; every pointwise inequality below is unchanged by modifying them on a null set. If p2, integrate (1), use [F7]–[F8], and divide by 2p: f+g2pp+fg2ppfpp+gpp2. The integrals are finite because f±gLp by the normed-space structure in [F7].

step 2.1F7F8
4.1

Put G3(t)=(1+t)q1(1tp1)(1t)q1(1+tp1). The two terms are positive. Since log is strictly increasing, the sign of G3 is the sign of the logarithm of their ratio, namely (q1)log(1+t)+log(1tp1)(q1)log(1t)log(1+tp1)=(q1)G2(t). Another direct differentiation gives \Phi'(t)=\frac{\big((1+t)^q+(1-t)^q\big)^{1/q-1}}{(1+t^p)^{1+1/p}}G_3(t). \tag{4} The prefactor is positive. Step 3.1 therefore shows that Φ decreases and then increases, so its maximum on [0,1] is at an endpoint. Finally Φ(0)=21/q,Φ(1)=221/p=211/p=21/q. This proves \big((1+t)^q+(1-t)^q\big)^{1/q}\le2^{1/q}(1+t^p)^{1/p}. \tag{5}

step 3.1F1F2F3F4
5.1

For arbitrary real a,b, the unordered pair {a+b,ab} equals {a+b,ab}. After swapping the two moduli and, when the larger one is nonzero, dividing by it, (5) gives (|a+b|^q+|a-b|^q)^{1/q}\le2^{1/q}(|a|^p+|b|^p)^{1/p}. \tag{6} The case a=b=0 is immediate.

step 4.1F2
5.2

The same estimate holds for complex a,b. The case where either is zero follows directly, so swap them if necessary and suppose ab>0. Put w=b/a, r=w1, and x=Rewr; the last inequality follows from r2=(Rew)2+(Imw)2. The two terms below swap if Rew changes sign, so 1+wq+1wq=(1+r2+2x)q/2+(1+r22x)q/2. For 0c1, let K(c)=(1+r2+2rc)q/2+(1+r22rc)q/2. Its derivative is K(c)=qr((1+r2+2rc)q/21(1+r22rc)q/21)0. Thus K(x/r)K(1)=(1+r)q+(1r)q. Apply (5) to r, then multiply by a using [F6], to obtain (6) over C as well.

step 4.1F2F4F6
6.1

Raise the complex-or-real scalar estimate (6) to the pth power. Since pr=q, it says pointwise that (Ar+Br)1/r2p/q(fp+gp). Use this in (7), then use [F7]–[F8]: (f+gpq+fgpq)p/q2p/q(fpp+gpp). Raising to q/p gives a factor 2. Dividing by 2q and using 1q=q/p yields f+g2pq+fg2pq(fpp+gpp2)q/p.

step 1.3step 5.1step 5.2F1F2F7F8
7.1

Step 3.2 proves the first claim, and step 6.1 proves the second for 1<p<2. At p=2 one has q=2, and the scalar parallelogram identity in step 2.1 integrates to equality, so the overlapping endpoint belongs to both claims and the two displayed formulas coincide. The empty measure space, zero measure, and zero functions cause no exception: all their norms and all terms above are zero.

step 2.1step 3.2step 6.1F1F7F8

Source notes

Kuriyama–Miyagi–Okada–Miyoshi prove the real one-variable maximum through their Lemmas 2.1–2.4 and Theorem 2.5, then pass to complex scalars and Lp in Theorems 3.2 and 3.4. Steps 1.2, 2.2, 3.1, and 4.1 reproduce the derivative-sign argument rather than treating that strategy as proof text. Step 5.2 rewrites their phase calculation using Rew/w, and step 1.3 spells out the two-coordinate Hölder duality behind the required integral inequality.

CorollaryStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-14Open item page →

Lp is uniformly convex for 1<p<

Statement

Assume countable choice ACω. Let (S,A,μ) be a measure space and let 1<p<. Then both Lp(μ;R) and Lp(μ;C), with their usual norms, are uniformly convex.

More precisely, for 0<ε2 one may use

δp(ε)={1(1(ε/2)q)1/q,1<p2,q=p/(p1),1(1(ε/2)p)1/p,2p<.

At p=2 the two formulas agree.

Facts & Assumptions

Given: Countable choice, a measure space (S,A,μ), a real number 1<p<, a scalar field K{R,C}, and 0<ε2.

[F1]

A real or complex Banach space is uniformly convex if every ε(0,2] admits a δ>0 such that unit-ball vectors x,y with xyε satisfy (x+y)/21δ (Uniformly convex Banach space).

[F3]

If f,gLp(μ;K), the Clarkson inequalities (Clarkson inequalities in both exponent ranges) say

f+g2pp+fg2ppfpp+gpp2(p2),

and, when 1<p2 and q=p/(p1),

f+g2pq+fg2pq(fpp+gpp2)q/p.

These assertions hold for both real and complex scalars.

Proof

technique · Insert the lower bound on the half-difference into the appropriate Clarkson inequality and retain the resulting quantitative modulus
1.1

By [F2], Lp(μ;K) with its usual norm is complete for either choice of K. Its normed-space structure and completeness make it a real or complex Banach space, as required in [F1]. This includes the empty and zero measure spaces, whose Lp spaces are the zero Banach space.

F1F2
1.2

Let f,g lie in its closed unit ball and suppose fgpε. Put m=f+g2,d=fg2. Absolute homogeneity gives dp=fgp/2ε/2.

F4given
2.1

Suppose p2. The first inequality in [F3] and fp,gp1 give mpp+dpp1. By step 1.2 and strict increase of the positive pth power, mpp1dpp1(ε/2)p. Both sides are nonnegative. If 1(ε/2)p=0, then mpp=0 and hence mp=0. Otherwise the iterated-power law gives ((1(ε/2)p)1/p)p=1(ε/2)p, and strict increase of the positive pth power yields mp(1(ε/2)p)1/p=1δp(ε). Here 0<ε/21. Thus 0<(ε/2)p1, so 01(ε/2)p<1; applying strict increase of the positive 1/p power, including its zero-base convention, shows (1(ε/2)p)1/p<1. Hence δp(ε)>0. At ε=2 the root is 0 and δp(2)=1.

step 1.2F3F4F5
3.1

Suppose 1<p2 and put q=p/(p1). Then q2. The second inequality in [F3] has right side at most 1, because (fpp+gpp)/21 and the positive q/p power is increasing. Consequently mpq+dpq1. Repeating step 2.1 with q in place of p gives mp(1(ε/2)q)1/q=1δp(ε), and the same strict-power argument proves δp(ε)>0, with δp(2)=1. When p=2, one has q=2, so this is the same modulus as in step 2.1.

step 1.2step 2.1F3F4F5
4.1

For the fixed ε, choose the displayed number δp(ε) by the applicable exponent range. It is an explicitly defined positive real, so this is no use of a choice principle. Steps 2.1 and 3.1 prove the implication required by [F1] for arbitrary unit-ball f,g. Therefore Lp(μ;K) is uniformly convex. The only use of ACω is through the real and complex completeness results in [F2]; Clarkson's inequalities and the modulus calculation are choice-free.

step 1.1step 2.1step 3.1F1F2

Source notes

Kuriyama--Miyagi--Okada--Miyoshi prove the real and complex Clarkson inequalities and state the resulting uniform convexity on printed p. 124. The explicit modulus and endpoint check above are derived from their inequalities. The countable-choice hypothesis is added because this library's definition of uniform convexity is a property of Banach spaces and its published real and complex Lp completeness interfaces both carry that hypothesis.

LemmaStatement: Literature-sourcedProof: AI-generatedjudge pass (gpt-5.6-terra)audited 2026-09-14Open item page →

Real and complex c0 are Banach

Statement

For either scalar field K{R,C}, the space c0(K) with the supremum norm is a Banach space. No choice principle is used.

Facts & Assumptions

Given: A scalar field K{R,C} and a supremum-norm Cauchy sequence (x(m))mN in c0(K).

[F1]

The space c0(K) consists of the bounded scalar sequences which tend to zero and carries the supremum norm (The sequence spaces c_0 and ell-infinity).

[F2]

Every real Cauchy sequence converges in R, without choice (The reals are complete), and every complex Cauchy sequence converges in C (The complex plane is complete, and convergence is equivalent to convergence of real and imaginary parts).

[F4]

A normed space is Banach exactly when every norm-Cauchy sequence converges to a point of the space (Banach space).

Proof

technique · Take unique coordinatewise limits, prove that convergence is uniform, and then preserve the null-sequence condition
1.1

Fix nN. Since xn(m)xn(k)x(m)x(k), the scalar sequence (xn(m))m is Cauchy. By [F2] it has a unique limit, say xnK. The formula sending n to the ordered pair (n,xn) is single-valued, so [F3] collects these pairs into the graph of one scalar sequence x=(xn)nN. This uses uniqueness and Replacement, not a choice of one limit from each of many non-singleton sets.

F2F3given
2.1

The sequence x is bounded. Choose M so that x(m)x(M)<1 whenever mM. For every coordinate n, letting m tend to infinity in xn(m)xn(M)<1 gives xnxn(M)1. Therefore xn1+x(M) for every n.

step 1.1F1given
3.1

In fact x(m)x in the supremum norm. Given η>0, choose M so that x(m)x(k)<η/2 for all m,kM. Fix mM and n. Passing to the coordinatewise limit as k yields xn(m)xnη/2. Taking the supremum over n gives x(m)xη/2<η.

step 1.1step 2.1F1given
4.1

The uniform limit x still tends to zero. Given ε>0, use step 3.1 with tolerance ε/2 to fix an m with xx(m)<ε/2. Since x(m)c0, [F1] gives N such that xn(m)<ε/2 for all nN. Hence xnxnxn(m)+xn(m)<ε(nN). Together with boundedness from step 2.1, this says xc0(K).

step 2.1step 3.1F1
5.1

Thus every supremum-norm Cauchy sequence in real or complex c0 converges in that norm to an element of c0. By [F4], both spaces are Banach. The construction in step 1.1 used the unique scalar limits and Replacement, and no choice principle entered any step.

step 1.1step 4.1F4

Remarks

This A-page lemma is the direct completeness supplier needed by the companion reflexivity examples. The already published proof that c0 is Banach occurs on another examples page; it cannot be used here because companion B pages are leaves in the page-dependency plan.

5 · Examples, counterexamples and false statements

None yet.

Sources