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
- Absolute and Conditional Convergence; Rearrangement; Products
- Approximation and Compactness in C(K)
- Areas of Elementary Plane Figures
- Banach Alaoglu Goldstine and Krein Milman
- Binary Operations, Monoids, Groups and Subgroups
- Bounded Linear Operators and Quotient Spaces
- Compactness
- Compactness in Metric Spaces
- Complete Metrizability, Čech-Completeness, and Baire Category
- Completeness, Completion, and Uniform Continuity
- Complex Lp Spaces and Test-Function Conventions
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Convergence: Nets and Filters
- Convex and Semicontinuous Functions on Rⁿ
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Countability Axioms and Cardinal Functions
- Density Separability and Convolution in Lᵖ
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Dual Spaces Adjoint Operators and Annihilators
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Foundations of the Real Numbers for Analysis
- Fubini and Change of Variables
- Geometric Hahn Banach and Convex Separation
- Hausdorff via the Diagonal
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Lebesgue Measure on Euclidean Space
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Measurable Functions and Simple Approximation
- Measures and Their Basic Properties
- Metric Spaces
- Mixed Partials, Taylor Formulae, and Extrema
- Modes of Convergence Egorov and Lusin
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Normed and Banach Spaces
- Norming and Separation under Hahn–Banach
- Order, Zorn's Lemma, and the Axiom of Choice
- Outer Measure and the Caratheodory Extension Theorem
- Polynomial Rings, the Division Algorithm and Roots
- Power Series and Real-Analytic Functions
- Properties of the Integral and the Working FTC
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- Separation Axioms: the Hierarchy
- Sequences and Limits
- Sequences and Series of Functions; Uniform Convergence
- Series: Convergence and the Nonnegative Tests
- Sigma Algebras and Borel Sets
- Signed and Complex Measures Hahn and Jordan
- Simple Field Extensions and the Construction of the Complex Numbers
- Subspaces, Products, and Quotients
- Suprema and Infima
- The Analytic Hahn Banach Theorem
- The Baire Principles of Functional Analysis
- The Complex Exponential and Euler's Formula
- The Derivative and the Mean Value Theorems
- The Duality of Lᵖ and L^q
- The Exponential Function
- The Lebesgue Integral and the Convergence Theorems
- The Logarithm and General Powers
- The Lᵖ Spaces Holder Minkowski and Riesz Fischer
- The Radon Nikodym Theorem and Lebesgue Decomposition
- The Riemann Integral in Rᵐ and Jordan Content
- The Riemann Integral: Definition and Integrability
- The Topology of Euclidean Space
- The Total Derivative in ℝᵐ → ℝⁿ
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
- Triangularisation, Generalised Eigenspaces and Jordan Canonical Form
- Vector Spaces, Linear Subspaces, Span and Direct Sums
- Weak and Weak Star Topologies
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 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 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 supply the companion examples without importing later Hilbert-space theorems.
3 · Logical flowchart
4 · Definitions, theorems and proofs
Reflexive iff unit ball weakly compact
Statement
Assume the ultrafilter lemma and HB. A real or complex Banach space is reflexive if and only if its closed unit ball
is compact for the weak topology .
Facts & Assumptions
Given: The ultrafilter lemma, HB, and a real or complex Banach space .
Reflexivity means that the canonical evaluation map is surjective (Reflexivity is surjectivity of the canonical map).
Under HB, is scalar-linear and isometric, with (Relative Hahn–Banach makes the canonical bidual map an isometry).
The weak topology on is the initial topology of the maps for , and the weak-star topology on is the initial topology of the evaluations for (Weak topology on a normed space, The weak-star topology from finite evaluations).
Every weak-star topology is Hausdorff; this needs neither HB nor a choice principle (Basic weak star neighborhoods, step 4.1).
Assuming the ultrafilter lemma, the closed unit ball of a normed dual is weak-star compact (Banach–Alaoglu).
A continuous image of a compact space is compact (A continuous image of a compact space is compact; a continuous real-valued map on a nonempty compact space attains a maximum and a minimum; and a continuous bijection from a compact space to a Hausdorff space is a homeomorphism, claim 1).
A compact subset of a Hausdorff space is closed (In a Hausdorff space a point and a disjoint compact set, and two disjoint compact sets, have disjoint open neighbourhoods; hence every compact subset is closed, and in a compact Hausdorff space the compact subsets are exactly the closed ones, claim 3).
Under HB, is weak-star dense in (Goldstine's theorem).
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).
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.
For every and , . Consequently the pullback by of the weak-star initial topology on is exactly the weak initial topology on : both are generated by the same family . Since [F2] makes injective, it is a homeomorphism from weak onto with the relative weak-star topology. This also covers , when both spaces are singletons.
Isometry gives . Indeed , so both inclusions include the closed boundary ; if , both sides are the singleton .
Suppose first that is reflexive. By [F1], , so step 1.2 gives . Apply Banach–Alaoglu to the normed space : under the ultrafilter lemma its dual ball is weak-star compact. The homeomorphism in step 1.1 therefore transfers this compactness to weak . This is the only direction, and the only step, that spends the ultrafilter lemma; in the selected Alaoglu proof it enters through [F9].
Conversely, suppose that is weakly compact. Step 1.1 makes the restriction weak-to-weak-star continuous, so [F6] makes weak-star compact. The weak-star topology on is Hausdorff by [F4], and hence [F7] makes weak-star closed in . No compactness choice principle is used in this reverse implication: its compact set is the one in the hypothesis.
Goldstine [F8] says that is weak-star dense in . It is contained in that ball by step 1.2 and is weak-star closed by step 2.2. Therefore . This uses topological closure, not merely sequential closure.
Let . If , then . If , put . Step 3.1 supplies with ; scalar linearity then gives . Thus is onto, so is reflexive by [F1]. This normalization treats the zero and norm-one endpoints separately and selects only one witness for the supplied , not a family of witnesses.
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.
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.
A Banach space is reflexive if and only if its dual is reflexive
Statement
Assume HB and the Axiom of Countable Choice . A real or complex Banach space is reflexive if and only if its dual is reflexive.
Facts & Assumptions
Given: HB, , and a real or complex Banach space .
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).
Under HB the canonical map of every real or complex normed space is scalar-linear and isometric, hence injective (Relative Hahn–Banach makes the canonical bidual map an isometry).
Assuming , a norm-complete subspace of a normed space is closed (A complete normed subspace is closed under countable choice).
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)).
HB is the real dominated-extension principle over ZF, and 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 ()).
Proof
If , every scalar-linear functional on is zero, so and both canonical maps are surjective. The equivalence therefore holds in the zero-space case.
Suppose first that is reflexive. Let and define . Scalar linearity of the two maps makes scalar-linear, and [F2] gives , so .
Conversely, suppose that is reflexive and put . The image is a scalar-linear subspace by [F2]. It is complete: if is Cauchy in its restricted norm, then makes Cauchy in the Banach space ; for its limit , the same equality gives in .
For arbitrary , reflexivity of supplies an with . Then . Thus . Since was arbitrary, is surjective and is reflexive. This chooses only one representing vector for one arbitrary at a time.
Apply [F3] under the assumed . The complete subspace is closed in . It is also nonempty and convex because it is a linear subspace.
Suppose for contradiction that some exists. By [F4] there is a nonzero that strictly separates the point from . In particular, is bounded above on . For and every real , also ; boundedness of for all forces . In the complex case as well, so ; hence in either field .
Reflexivity of supplies with . For every , step 3.1 yields . Thus , whence , contradicting the nonzero separator in step 3.1.
No point of lies outside , so and [F1] says that is reflexive. This proves the reverse implication and hence the equivalence. HB is used only in the isometry [F2] and separation [F4]; is used only in step 2.2 through [F3].
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: 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 calculation in step 3.1.
Closed subspaces of reflexive spaces are reflexive
Statement
Assume HB. If is a real or complex reflexive Banach space and is a closed linear subspace with the restricted norm, then is reflexive.
Facts & Assumptions
Given: HB, a real or complex reflexive Banach space , and a closed linear subspace .
Reflexivity is surjectivity of the canonical evaluation map (Reflexivity is surjectivity of the canonical map).
For a subset , consists of the members of that vanish on (Annihilator notation and the preannihilator).
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)).
A closed linear subspace of a Banach space is Banach with its restricted norm (A closed subspace of a Banach space is Banach).
HB is the real dominated-extension principle over ZF (The real dominated-extension principle as an additional hypothesis over ZF).
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
Let be restriction, . It is scalar-linear and bounded with . Hence for a supplied the composite belongs to . Since is reflexive, [F1] supplies such that , meaning for every .
If , then , so step 1.1 gives . Thus every functional annihilating also annihilates .
We claim . This is immediate if . Otherwise suppose ; then is a nonempty closed convex set and [F3] supplies , , and with for every . Since for every real , the real-linear function can be bounded above on the line only when . In the complex case applying this also to gives , so in either field . Taking in the separation inequality gives and hence , contradicting step 2.1. Therefore .
Let be arbitrary. By norm-preserving Hahn–Banach [F6], one functional extends ; this also covers and . Steps 1.1 and 3.1 then give . Hence .
The closed-subspace theorem [F4] makes a Banach space. Since the arbitrary of step 1.1 lies in the range of by step 4.1, that canonical map is surjective, and [F1] makes reflexive. If , its bidual and all maps above are zero and the same argument gives the singleton range directly.
HB is used exactly twice: geometric separation in step 3.1 and the extension of one supplied in step 4.1; [F5] records the principle being assumed. No compactness principle or simultaneous family choice occurs.
Remarks
Closedness of has two distinct jobs: it makes complete, and it permits separation of a hypothetical representing vector outside . No assertion is made for a nonclosed subspace.
Quotients of reflexive spaces are reflexive
Statement
Assume HB and the Axiom of Countable Choice . If is a real or complex reflexive Banach space and is a closed linear subspace, then the quotient Banach space is reflexive.
Facts & Assumptions
Given: HB, , a real or complex reflexive Banach space , and a closed scalar-linear subspace .
Reflexivity means that the canonical map is surjective, so every is evaluation at a vector of (Reflexivity is surjectivity of the canonical map).
For the quotient map , pullback is a scalar-linear isometric bijection , (The dual of a quotient is its annihilator).
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).
Assuming , 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).
HB is the real dominated-extension principle over ZF, while chooses from each supplied sequence of nonempty sets (The real dominated-extension principle as an additional hypothesis over ZF, The Axiom of Countable Choice ()).
Proof
Proof technique: extend a quotient-bidual functional and represent the extension in the reflexive ambient space.
Put and write for the quotient map. By [F4], under the assumed the normed quotient is Banach. This includes , when , and , when the quotient norm is the original norm.
Let be arbitrary. The isometric bijection from [F2] has a scalar-linear isometric inverse. Define by . It is a bounded scalar-linear functional with ; if , both sides are zero.
Apply [F3] under HB to the subspace . There is with and . Only this one supplied functional is extended; no family of extensions is chosen.
Reflexivity of supplies an with . Put .
For every , [F2] gives , and therefore . Hence . The calculation is scalar-linear over both fields and uses the bilinear evaluation convention, with no conjugation.
Since was arbitrary, is surjective; together with the Banach conclusion in step 1.1, [F1] shows that is reflexive. When , step 1.2 starts from the unique zero bidual functional and the same computation gives the zero representer; when , is the usual identification and the computation reduces to ambient reflexivity. HB is spent only in step 2.1, and only in step 1.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 , while the extension from to requires HB. It does not claim that the quotient map sends the ambient closed unit ball onto the quotient closed unit ball.
Complex Lp duality from real Lp duality
Statement
Assume the Axiom of Countable Choice . Let be any measure space, let , and let be conjugate to . Every bounded complex-linear functional has a unique such that
where the pairing is bilinear, with no conjugation. Moreover .
Facts & Assumptions
Given: , an arbitrary measure space, conjugate exponents , and a bounded complex-linear .
Under Countable Choice, every bounded real-linear functional on real over an arbitrary measure space is uniquely integration against a real density, with equality of norms (For , the same representation theorem holds on arbitrary measure spaces).
Complex is the a.e. quotient of measurable finite-valued complex functions with finite -norm; real and imaginary parts, conjugation, products, and positive powers have the stated measurability conventions, and bilinear tests use without conjugation (Complex Lp classes and Euclidean test-function conventions).
Complex Hölder makes the bilinear pairing bounded, and complex has the quotient norm with (Complex Holder, Minkowski, and the quotient norm).
Countable Choice selects from every countable family of nonempty sets (The Axiom of Countable Choice ()).
Proof
Regard real as the real-valued subspace of complex . The maps and are bounded real-linear functionals there, with . Applying [F1] twice gives real such that and for every real . Put ; component inequalities in [F3] make its -norm finite.
For real-valued , componentwise complex integration gives . If is an arbitrary complex class, [F3] puts its real and imaginary parts in real , and complex linearity gives . All identities depend only on a.e. classes by the quotient and integration conventions in [F2]–[F3].
Hölder [F3] gives , hence . If a.e., step 2.1 gives and equality follows. Otherwise define on and where . Then and pointwise. Since , [F2]–[F3] give , , and . Testing on proves , including the closed unit-norm endpoint.
If gives the same pairing functional, put . Then for every . If were nonzero, the phase test of step 3.1 with in place of would produce with , a contradiction. Thus in , so the density is unique.
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 and requires only two instances and no stronger choice principle. The empty and zero-measure spaces have only zero classes and are covered by the branch of step 3.1; the forbidden endpoints never enter because .
Remarks
The absence of a conjugate in the displayed pairing is deliberate. It is why the phase test contains : multiplication then gives the nonnegative real function .
Reflexivity of Lp for one less p less infinity
Statement
Assume the Axiom of Countable Choice . For every measure space and every , both and are reflexive.
Facts & Assumptions
Given: , an arbitrary measure space, , and the conjugate exponent , so and the conjugate exponent of is .
A Banach space is reflexive exactly when its canonical evaluation map into the bidual is surjective (Reflexivity is surjectivity of the canonical map).
Under Countable Choice, real duality over an arbitrary measure space identifies every member of uniquely and isometrically with a bilinear integration density in , for (For , the same representation theorem holds on arbitrary measure spaces).
Under Countable Choice, the same unique isometric bilinear-pairing identification holds for complex , (Complex Lp duality from real Lp duality).
Under Countable Choice, real is complete for every (Riesz-Fischer completeness of for ).
Complex has a well-defined norm, and its real and imaginary parts have norm at most the complex norm while the complex norm is at most the sum of their norms (Complex Holder, Minkowski, and the quotient norm).
Countable Choice is the assertion that every countable family of nonempty sets has a choice function (The Axiom of Countable Choice ()).
Proof
First verify the Banach condition. Real is complete by [F4]. If is Cauchy in complex , [F5] makes and Cauchy in real ; [F4] gives limits . The upper component bound in [F5] gives . Thus complex is complete as well, including the zero and empty measure spaces.
Fix either scalar field and write and . By [F2] in the real case and [F3] in the complex case, the map defined by is a scalar-linear isometric bijection. The same theorem with in place of identifies isometrically with by the same bilinear formula.
Let . Since is a bounded linear map, lies in . The -duality assertion in step 1.2 therefore supplies such that for every . This includes , for which uniqueness gives .
Given any , surjectivity of supplies with . Commutativity of scalar multiplication and the bilinear pairing then gives . Hence .
Every is therefore in the range of . Step 1.1 makes Banach, so [F1] proves reflexivity in both scalar fields. The proof uses Countable Choice only through the completeness and arbitrary-measure duality suppliers cited in steps 1.1–1.2; [F6] records that exact assumption. No Hahn–Banach or compactness principle is additionally invoked. The argument requires both and to lie strictly between one and infinity, so it makes no endpoint claim.
Remarks
Using the bilinear complex pairing is what makes the canonical-map calculation literal: the two scalar factors commute in . With a sesquilinear convention an explicit conjugation map would be required.
Relative weak compactness and three sequential notions
Definition
Let be a real or complex Banach space, give it its weak topology from Weak topology on a normed space, and let .
- is relatively weakly compact if its weak closure is weakly compact. It is weakly compact if itself, with the relative weak topology, is compact.
- is relatively weakly sequentially compact if every sequence in has strictly increasing indices and a point such that weakly. It is weakly sequentially compact if the limit can always be taken in .
- is relatively weakly countably compact if every sequence in has a weak cluster point , meaning that for every weak neighborhood of and every there is an with . It is weakly countably compact if the cluster point can always be taken in .
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 ; “absolute” does not.
Eberlein–Šmulian separable reduction
Statement
Assume HB. Let be a real or complex Banach space and let be a sequence in . Put
Then , with the restricted norm, is a separable Banach space. Its intrinsic weak topology is exactly the relative topology induced by , and is weakly closed in .
Facts & Assumptions
Given: HB, a real or complex Banach space , and one supplied sequence in .
A topological space is separable when it has an at most countable dense subset (Separability: the existence of an at most countable dense subset).
The rationals are countably infinite, products of two at most countable sets are at most countable, and every nonempty image of a surjection from is at most countable ( 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 ).
The embedded rationals are dense in (The rationals embed densely in the reals).
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).
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).
A closed linear subspace of a Banach space is Banach with the restricted norm (A closed subspace of a Banach space is Banach).
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.
Let in the real case and in the complex case, with the canonical embeddings into the scalar field understood. By [F2], is at most countable: in the complex case it is the image of the countable product . It is nonempty, so fix one surjection . This is one instantiation of the countability theorem, not a countable family of choices.
The scalar set is dense in . This is [F3] over . Over , approximate the real and imaginary parts separately and use .
Every restricts to a member of , so every ambient weak subbasic set has an intrinsically weak-open trace on . Conversely, given one , [F4] supplies with . Therefore the inverse image under of any scalar-open set is the trace on of the corresponding ambient weak-open inverse image under . Finite intersections behave the same way. The two topologies on are equal.
The set of finite strings of naturals has a choice-free enumeration: order strings first by , then by length, and then lexicographically. Each fixed-value block is finite, and the displayed order lists every finite string. Map to , with empty sum . Its image is nonempty and at most countable by [F2].
The set is norm dense in . Indeed, write a given vector there as , padding with zero coefficients when necessary. If , then . If and , put . By step 1.2, make the finitely many choices with . Choose indices with ; only finitely many choices are involved. For , the triangle inequality gives . Thus .
By [F1] and step 3.1, 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 is a closed linear subspace of the Banach space , so [F6] makes Banach.
Finally take . The set is nonempty, closed and convex, while is compact and disjoint from it. By [F5], there are , and such that for every . The weakly open set contains and misses . Every point of therefore has a weak neighborhood in the complement, so is weakly closed. This uses HB only through [F4] and [F5]: the proof never selects extensions or separators simultaneously for a family.
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.
Eberlein–Šmulian metrization on the relevant dual ball
Statement
Assume and HB. Let be a separable real or complex normed space and let be weakly compact. Then the weak topology on is metrizable. More precisely, there is a sequence in the closed unit ball of that separates the points of , and
is a metric on inducing its relative weak topology. If , the unique metric on each of its two subsets gives the same conclusion.
Facts & Assumptions
Given: , HB, a separable real or complex normed space , and a weakly compact subset .
Separability means existence of an at most countable dense subset, and each nonempty at most countable set is the image of a surjection from (Separability: the existence of an at most countable dense subset, A nonempty set is at most countable iff it is a surjective image of ).
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).
supplies a choice function for every sequence of nonempty sets (The Axiom of Countable Choice ()).
The weak topology is initial for the members of (Weak topology on a normed space).
The real and complex scalar fields are complete for their usual metrics (The reals are complete, The complex plane is complete, and convergence is equivalent to convergence of real and imaginary parts).
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).
Every metric space is Hausdorff (Distinct points of a metric space have disjoint balls around them).
A continuous bijection from a compact space to a Hausdorff space is a homeomorphism (A continuous image of a compact space is compact; a continuous real-valued map on a nonempty compact space attains a maximum and a minimum; and a continuous bijection from a compact space to a Hausdorff space is a homeomorphism, claim 3).
HB is the named real dominated-extension principle (The real dominated-extension principle as an additional hypothesis over ZF).
The product topology is initial for the coordinate projections (The product set 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).
Proof
Proof technique: a countable norming family and a compact-to-Hausdorff identification.
If , then is either empty or the singleton . In either case the zero function is the unique metric and induces the only topology on , which is its relative weak topology. Hence suppose below that .
On put . This is a metric bounded by and induces the usual scalar topology, because its balls of radius below are the usual metric balls. It is complete: a -Cauchy sequence is eventually Cauchy for at every tolerance below , so [F5] gives a usual limit, and gives convergence in .
By separability, take an at most countable norm-dense . It is nonempty because its closure is the nonempty space . The set is at most countable and nonempty. It is dense in the unit sphere: if and , density gives with , so and . By [F1], enumerate as , allowing repetitions.
Apply [F6] to countably many copies of . The formula is a metric on inducing its product topology. Its restriction to every subset is a metric inducing the subspace topology, and that metric topology is Hausdorff by [F7].
For each , let . Each is nonempty by [F2], including in the complex case where the attained value is the positive real number . Apply once to the sequence and obtain for every .
The family separates points of . If , put and choose with . Then , since . Therefore .
Define by . Every coordinate is weakly continuous, so the initial property of the product topology makes continuous. Step 4.1 makes it injective. Its corestriction is therefore a continuous bijection.
The weak space is compact by hypothesis, and is Hausdorff by step 2.2. Hence [F8] makes a homeomorphism. Pulling the restricted product metric back along gives exactly , the displayed metric, and its topology is precisely the relative weak topology on . Together with step 1.1 this proves the claim for every and for empty as well as nonempty .
The only countable selection is step 3.1, where 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 in a separable ; it makes no metrizability claim for all of or for nonseparable spaces.
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 . No part of the unavailable Whitley paper is used.
Countable compactness closes in the bidual
Statement
Assume the ultrafilter lemma, the Axiom of Dependent Choice (DC), and HB. Let be a real or complex Banach space and let be relatively weakly countably compact: every sequence in has a weak cluster point in . Then is norm bounded and
Here the closure uses . The conclusion does not assert that the cluster point or the representing point belongs to .
Facts & Assumptions
Given: the three stated principles, , and as in the statement.
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).
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).
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).
Under HB the canonical map 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).
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).
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 -indexed chain).
A compact Hausdorff space is regular, and regularity permits open to be shrunk to open with (A compact Hausdorff space is regular and normal, hence and , A space is regular if and only if every point has a neighbourhood base of closed neighbourhoods, if and only if open gives an open with ).
Closed subspaces of compact spaces are compact; in a compact space every family of closed sets with the finite-intersection property has nonempty intersection; and closure is characterized by meeting every neighborhood (A closed subspace of a compact space is compact, and a finite union of compact subspaces is compact, A space is compact exactly when every family of closed subsets with the finite intersection property has nonempty intersection, A point lies in the closure of iff every basic neighbourhood of it meets ; the closure is the smallest closed superset and equals together with its derived set).
Real intervals and complex Euclidean disks are compact by finite-dimensional Heine–Borel (Heine-Borel in : with the Euclidean metric a subset of is compact if and only if it is closed and bounded, and the proof by bisection uses no choice principle; the same holds on the real line).
On the scalar field put . This bounded metric induces the usual scalar topology, since its balls of radius less than are the usual balls. It is complete: a -Cauchy sequence is Cauchy for the usual metric by testing tolerances below , and its usual scalar limit is also its -limit. The standard weighted metric on a countable product of complete metrics bounded by therefore applies to copies of 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 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).
A continuous bijection from a compact space to a Hausdorff space is a homeomorphism (A continuous image of a compact space is compact; a continuous real-valued map on a nonempty compact space attains a maximum and a minimum; and a continuous bijection from a compact space to a Hausdorff space is a homeomorphism, claim 3).
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 is eventually smaller than every positive real (A nonempty set is at most countable iff it is a surjective image of , A product of two at most countable sets is at most countable, Every complete ordered field is Archimedean, For every in a complete ordered field there is a natural with ).
Proof
Proof technique: the Grothendieck pointwise-compactness argument, with each countable selection implemented by DC.
If , it is norm bounded and has empty weak-star closure, so both conclusions hold. Hence assume .
Put with its weak-star topology and define by . Each is continuous on by [F2], so . The space is compact by [F3] and Hausdorff because distinct members of differ at some , whose evaluation separates them in the Hausdorff scalar field. By [F4], and is injective. Since every is zero or a scalar multiple of a member of , [F2] shows that the pointwise topology on is exactly the weak topology transported from .
For each the scalar set is bounded. Otherwise every set , , is nonempty. Apply DC to finite valid histories, starting with the empty history and extending the th stage by an element of ; this gives with . Let be a weak cluster. The weak neighborhood contains arbitrarily late , while [F12] lets us take such an with . Then , a contradiction.
We shall repeatedly use this choice-free consequence of compactness. If is a sequence in a compact space, then the closed sets are nonempty, nested, and have the finite-intersection property. By [F8] some lies in every ; by the closure characterization, every neighborhood of contains terms with arbitrarily large indices. Thus is a cluster point of the sequence.
Every sequence in has a pointwise cluster in . Indeed, injectivity gives its unique lift in ; [F1] gives a weak cluster , and the topology identification in step 1.2 makes a pointwise cluster.
The dual is Banach: the real and complex scalar fields are Banach and [F5] applies to the bounded-operator space. The family is pointwise bounded by step 1.3, so UBP under the assumed DC gives .
The HB isometry [F4] gives for every . Thus , and equivalently in the supremum norm, is norm bounded.
Let be the closure in the full product . For each , step 3.1 gives for . The scalar disk is compact Hausdorff by [F9], including ; hence is compact by [F3]. It is closed in , so , and is closed in that product. Therefore is compact by [F8].
We prove . Suppose instead that is discontinuous at . Then for some , every neighborhood of meets . This is exactly the negation of continuity at into the metric scalar field, written with one failed positive tolerance. Notice .
Put and for . DC on finite valid histories constructs , open neighborhoods of , and such that and for , while and . At stage , the approximation is possible because is in the pointwise closure of ; the set to be shrunk is an open neighborhood of because is continuous; [F7] supplies ; and step 5.1 makes nonempty. Thus the relation extending a finite valid history is entire, exactly the hypothesis of DC.
By step 2.1, has a pointwise cluster . By step 1.4, has a cluster . The nesting in step 6.1 gives whenever , so the closure characterization gives for every .
Hence and . Since by [F12], . But is a pointwise cluster of , so is a cluster of the convergent scalar sequence ; scalar Hausdorffness forces .
For fixed , step 6.1 gives as . The same cluster-and-uniqueness argument gives . Since , we therefore have for every .
The function is continuous on . Thus is a neighborhood of the cluster and must contain arbitrarily late , contradicting step 9.1. Therefore every is continuous and .
Fix . For positive integers and , define . These sets are open because by step 10.1, and they cover because lies in the pointwise closure of . The finite power is compact by [F3], so some nonempty finite list of members of has the corresponding covering .
Pair the positive integer indices 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 for every pair. Their union 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.
The point lies in the pointwise closure of : for finitely many points and tolerance , repeat points if needed to form a positive-length tuple and choose with ; a member of gives all the inequalities. Let . Then ; is closed in compact , hence compact by [F8], and it is separable because the at-most-countable is dense in it.
We record the compact-cluster argument of Haase's Lemma E.1. Let , , and let be pointwise dense in . If for every , then for every . Indeed, let be the intersection of the closures of all tails of ; it is nonempty by step 1.4. For , continuity and the assumed scalar convergence give for every . Pointwise density then gives for every : otherwise the two-coordinate neighborhood of at with radius would contain no . If failed to converge to , least-index recursion would give a subsequence staying some fixed positive distance away. Its closed tail closures have a common point by [F8], while continuity of at contradicts both and that fixed separation.
The compact separable pointwise space is nonempty because it contains . Enumerate a nonempty pointwise-dense subset as using [F12]. On the countable product of the bounded scalar metrics use the standard weighted product metric from [F10], and pull it back along to a continuous pseudometric on .
For each positive integer , the open -balls of radius cover , so compactness gives a nonempty finite list of centers. DC, applied to finite histories of such lists, chooses one list for each . Pad every list by its first center and use the countable pairing in [F12] to enumerate the union as . For each and each , take the first center in the th list whose ball contains ; the resulting sequence satisfies , hence for every .
The evaluations at separate . If agree at every , then for arbitrary use the sequence from step 15.1. Step 14.1 gives and ; equality term by term and scalar Hausdorffness give . Thus .
The evaluation map , , is continuous for the pointwise and product topologies by [F2] and injective by step 16.1. Its corestriction to is a continuous bijection from compact 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 .
Enumerate as , with repetitions allowed. Since it is dense in the metric space , for each there is a with ; take the least such . This defines, without choice, a sequence in converging to pointwise.
Lift this sequence uniquely to in . By [F1] it has a weak cluster , so is a pointwise cluster of by step 1.2. Every scalar coordinate of that sequence converges to the corresponding coordinate of by step 18.1; uniqueness of scalar cluster points gives . Since was arbitrary, .
Let and restrict it to : . Every finite pointwise neighborhood of on is the restriction of a basic weak-star neighborhood of in , so it meets by [F2]. Hence , and step 19.1 gives with for every .
For arbitrary , the equality is immediate if ; otherwise , and linearity gives . Thus . 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.
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 " 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 .
Eberlein–Šmulian theorem
Statement
Assume the ultrafilter lemma, the Axiom of Dependent Choice (DC), and HB. For every subset of a real or complex Banach space , the following are equivalent:
- is relatively weakly compact;
- is relatively weakly sequentially compact;
- is relatively weakly countably compact.
All closures, limits, cluster points, and compactness assertions use the weak topology and the ambient space .
Facts & Assumptions
Given: the ultrafilter lemma, DC, HB, a real or complex Banach space , and .
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).
Under HB, the closed scalar span of one sequence in is a separable Banach subspace, is weakly closed in , and its intrinsic weak topology is the relative ambient weak topology (Eberlein–Šmulian separable reduction).
Assuming and HB, every weakly compact subset of a separable normed space is weakly metrizable (Eberlein–Šmulian metrization on the relevant dual ball).
DC gives a chain through every entire relation from a prescribed initial state, whereas 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 -indexed chain, The Axiom of Countable Choice ()).
In a metric space, compactness implies sequential compactness without any choice principle, by least-index recursion (In any metric space compactness implies countable compactness and limit point compactness, and each of countable compactness and limit point compactness implies sequential compactness; every implication here is proved without a choice principle, claims 1 and 3).
Under the ultrafilter lemma, DC and HB, a relatively weakly countably compact is norm bounded and satisfies (Countable compactness closes in the bidual).
Under the ultrafilter lemma, the closed unit ball of the dual of any normed space is weak-star compact (Banach–Alaoglu).
The weak and weak-star topologies are initial for their scalar evaluations, and under HB the canonical map 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).
A closed subset of a compact space is compact, and continuous images of compact spaces are compact (A closed subspace of a compact space is compact, and a finite union of compact subspaces is compact, A continuous image of a compact space is compact; a continuous real-valued map on a nonempty compact space attains a maximum and a minimum; and a continuous bijection from a compact space to a Hausdorff space is a homeomorphism, claim 1).
Strictly increasing natural-number indices satisfy (A strictly increasing index map satisfies ), 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.
We first derive the exact choice fragment needed by [F3], rather than citing the unproved remark that DC implies . Given any sequence of nonempty sets, let be the set of all finite histories with domain for some and for . The empty history belongs to . Relate to when extends by exactly one value from . The relation is entire because that next set is nonempty. DC from the empty history gives a chain with of length and extending ; its union is a function on with . Thus the assumed DC proves the instance of required below.
If , its weak closure is empty and compact and there is no sequence in , so all three conditions hold. If and , then , 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.
The evaluation identity shows from [F8] that 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 injective through its isometry, so it is a homeomorphism onto its image.
Assume is relatively weakly compact and let be a sequence in . Put and let be the norm-closed scalar span of the sequence. By [F1], is weakly compact, and by [F2], is a separable Banach subspace, weakly closed in , with its intrinsic weak topology equal to the relative ambient weak topology. Set , which contains every .
Assume is relatively weakly sequentially compact and let be any sequence in . Take strictly increasing indices and with weakly. Given a weak neighborhood of and , convergence gives with for ; for , [F10] gives . Thus contains an arbitrarily late term of the original sequence, so is its weak cluster point and is relatively weakly countably compact.
Assume is relatively weakly countably compact. By [F6], choose with for every and put ; then .
In the situation of step 1.4, is weakly closed in the compact space , because is weakly closed in . Hence [F9] makes compact, and [F2] identifies this topology with its intrinsic relative weak topology as a subset of the separable space .
In the situation of step 1.6, apply [F7] to the normed space : its dual unit ball is weak-star compact. Fixed scalar multiplication is weak-star continuous by [F8], since every evaluation of is times the corresponding evaluation of . Therefore [F9] makes weak-star compact, including , when it is the singleton .
By step 1.1 the assumptions of [F3] hold, so step 2.1 makes a compact metric space in its weak topology. The choice-free implication [F5] gives a subsequence of converging to a point of in that metric, hence weakly in and, by [F2], weakly in . Since the original sequence was arbitrary, is relatively weakly sequentially compact.
The set from step 1.6 lies in . Indeed, for , and , the weak-star neighborhood meets , so some satisfies . If , taking half the positive gap as is a contradiction; hence for every , including , and . The closure is weak-star closed in , so it is closed in the compact subspace and therefore compact by [F9].
Since step 1.6 gives , the weak-star closure of in equals its closure in the subspace : an ambient neighborhood and its trace meet in exactly the same way at points of . The homeomorphism in step 1.3 carries weak closure to subspace weak-star closure, so . Its inverse restricted to the compact set is continuous, and [F9] makes weakly compact. Thus is relatively weakly compact.
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.
Source notes
Haase's Theorem E.17, printed pp. 355–356, gives the canonical embedding into 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 from finite histories before using [F3], rather than consuming the unproved bibliographic remark in the choice definitions.
Reflexivity is equivalent to weak subsequential compactness of bounded sequences
Statement
Assume the ultrafilter lemma, DC, and HB. A real or complex Banach space is reflexive if and only if every norm-bounded sequence in has a subsequence that converges weakly to a point of .
Facts & Assumptions
Given: the ultrafilter lemma, DC, HB, and a real or complex Banach space .
Under the ultrafilter lemma and HB, is reflexive if and only if its closed unit ball is weakly compact (Reflexive iff unit ball weakly compact).
Under the ultrafilter lemma, DC and HB, relative weak compactness, relative weak sequential compactness and relative weak countable compactness are equivalent (Eberlein–Šmulian theorem).
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).
The weak topology is initial for all members of , so every such functional and fixed scalar multiplication are weakly continuous (Weak topology on a normed space).
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 -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.
The norm-closed unit ball is weakly closed under HB. Indeed, if , then and [F3] gives with and . The weakly open set contains and misses , since there. Thus every exterior point has a weak neighborhood in the complement. This also covers , when there is no exterior point.
Suppose is reflexive and let be norm bounded. Fix with for every . If , then for all and the identity subsequence converges weakly to zero. Hence it remains to consider and the sequence .
Conversely, suppose every norm-bounded sequence in has a weakly convergent subsequence. Every sequence in is bounded by , so it has a subsequence converging weakly to a point of the ambient space . Thus is relatively weakly sequentially compact.
In the positive-radius case of step 1.2, [F1] makes weakly compact, and step 1.1 makes its weak closure equal to itself, so it is relatively weakly compact. By [F2], some subsequence converges weakly to . For every , , so weakly. Together with the zero-radius case, every bounded sequence has the required subsequence.
Under the hypothesis of step 1.3, [F2] makes relatively weakly compact. Its weak closure is by step 1.1, so itself is weakly compact.
Apply the reverse implication of [F1] to step 2.2. The weak compactness of implies that is reflexive.
Steps 2.1 and 3.1 prove the two implications, including , bound , the closed-ball endpoint , 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.
Remarks
- The ultrafilter lemma, DC and HB are hypotheses of this corollary, not results consumed from its proof: the statement above names each of them in full. The library states the ultrafilter lemma, and proves it from AC, as The ultrafilter lemma, from the Axiom of Choice: every filter extends to an ultrafilter, and records its proved choice cost in The proved choice cost of the ultrafilter lemma; this corollary assumes the lemma and inherits no part of that AC-based proof.
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.
Schur property
Definition
Let be a real or complex Banach space. It has the Schur property if, for every sequence in and every ,
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 weakly, linearity of every gives ; conversely this applied to recovers weak convergence to . The corresponding norm statements are equivalent because .
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.
Real and complex ell one have the Schur property
Statement
Both and have the Schur property: every weakly convergent sequence in either space converges in the norm.
Facts & Assumptions
Given: and a sequence in , with coordinates indexed by .
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).
By the definitions of and (The sequence spaces c_0 and ell-infinity, Finite truncations approximate null and summable sequences), for either scalar field, if and , then
Thus the absolutely convergent series defines a bounded scalar-linear functional, with no conjugation in the complex pairing. Coordinate evaluation is the special case (The sequence spaces c_0 and ell-infinity, Finite truncations approximate null and summable sequences).
If and retains coordinates , then (Finite truncations approximate null and summable sequences).
Every nonempty subset of has a least element (The well-ordering principle), and a deterministic successor rule can be iterated along (The recursion theorem).
A strictly increasing index map satisfies (A strictly increasing index map satisfies ).
Real and complex scalar Cauchy sequences converge (The reals are complete, The complex plane is complete, and convergence is equivalent to convergence of real and imaginary parts), and a nonnegative real series converges exactly when its partial sums are bounded above (A series of nonnegative terms converges iff its partial sums are bounded, and then the sum is their supremum).
Proof
First verify the Banach-space condition. Let be Cauchy in . Each coordinate sequence is Cauchy because ; let be its scalar limit by [F6]. Given , take such that for . For fixed and , passage to the limit in the finite sum gives . Hence [F6] gives , so and . In particular . Thus both scalar versions of are complete and hence Banach.
Put . For every , , so is weakly null. By [F1] and step 1.1 it is enough to prove .
Suppose otherwise. Negating the definition of convergence supplies an such that is cofinal in : for every it contains an . In particular is nonempty.
We recursively define strictly increasing indices and strictly increasing finite cutoffs . Let be the least element of , and let be the least for which ; the latter set is nonempty by [F3]. Given , coordinate evaluation is a bounded functional by [F2], so for each . Because this head is finite, eventually . The cofinal set therefore contains an satisfying this inequality. Take the least such as , then take the least with , again using [F3]. Each least value is unique by [F4]. On the set of pairs with and , these rules therefore define a total deterministic successor function; [F4] iterates it from and assembles the entire sequence without a choice axiom.
Define disjoint finite blocks and for . For , the construction and give . For there is no old head, so the same block sum is greater than .
Define one scalar sequence blockwise. If and , put when , and put when ; put when that coordinate is zero. Because is strictly increasing, [F5] gives ; hence every natural lies in exactly one of the disjoint blocks. Thus , so , and the no-conjugation pairing from [F2] satisfies on in both scalar fields.
Let be the bounded functional supplied by [F2]. For , the triangle inequality, step 5.1, and the head and tail estimates in step 4.1 give . For , the block exceeds and the only complementary tail is below , so the stronger bound holds.
On the other hand, weak nullity in step 2.1 gives . The indices are strictly increasing, and [F5] gives , so the scalar subsequence also tends to zero. This contradicts its uniform lower bound in step 7.1. Therefore , hence ; [F1] and the completeness proved in step 1.1 establish the Schur property over both and . The construction used only least natural numbers, scalar completeness and recursion, not Countable Choice or any stronger choice principle.
Ell one is not reflexive
Statement
Assume the ultrafilter lemma, DC, and HB. Neither nor is reflexive.
Facts & Assumptions
Given: the ultrafilter lemma, DC, HB, and .
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).
Both real and complex have the Schur property, so every weakly convergent sequence in either space converges in norm (Real and complex ell one have the Schur property).
The space consists of scalar sequences with norm (Finite truncations approximate null and summable sequences).
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 -indexed chain and The real dominated-extension principle as an additional hypothesis over ZF.
Proof
For , let be the coordinate vector with value at and elsewhere. By [F3], and , so is norm bounded. If , the two nonzero coordinates of have moduli , hence .
Suppose for contradiction that is reflexive. The forward implication of [F1] applied to the bounded sequence from step 1.1 supplies strictly increasing indices and such that .
By [F2], the weakly convergent subsequence in step 2.1 converges to in norm. A norm-convergent sequence is Cauchy: once and , the triangle inequality gives . But strict increase makes for , and step 1.1 makes that distance exactly . This contradiction proves that is not reflexive. Since 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.
Remarks
- The ultrafilter lemma, DC and HB are hypotheses of this corollary, not results consumed from the proof: the statement above names each of them in full. The library states the ultrafilter lemma, and proves it from AC, as The ultrafilter lemma, from the Axiom of Choice: every filter extends to an ultrafilter, and records its proved choice cost in The proved choice cost of the ultrafilter lemma; this corollary assumes the lemma and inherits no part of that AC-based proof.
Uniformly convex Banach space
Definition
Let be a real or complex Banach space with closed unit ball . The given norm, and hence , is uniformly convex if for every there is a such that
The endpoint is included. Values need not be tested, because the triangle inequality gives on . 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 , take ; 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 the parallelogram identity gives , so the Euclidean norm is uniformly convex with . The supremum norm is equivalent because , but it is not even strictly convex: and are distinct unit vectors whose midpoint also has supremum norm one. Thus one may not transfer uniform convexity across an arbitrary equivalent renorming.
Uniform convexity gives unique asymptotic centers
Statement
Assume the Axiom of Countable Choice . Let be a real or complex uniformly convex Banach space, let be a bounded sequence in , and let be nonempty, norm closed and convex. Define its asymptotic-radius function on by
Then there is a unique such that
The point is the asymptotic center of relative to . Convexity uses real coefficients even when is complex.
Facts & Assumptions
Given: , and as in the statement, with once that real infimum has been justified.
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 , then for every its terms are eventually less than (Limit superior and limit inferior of a real sequence as and in , For finite : iff for every one has eventually and frequently).
Every nonempty subset of bounded below has a real infimum (Every nonempty set bounded below has an infimum).
supplies one member of each member of a sequence of nonempty sets (The Axiom of Countable Choice ()).
For every real there is an integer with (For every in a complete ordered field there is a natural with ).
Uniform convexity says that for each there is such that unit-ball vectors separated by at least have midpoint norm at most (Uniformly convex Banach space).
Every norm-Cauchy sequence in converges in (Banach space).
A closed subset of a metric space contains the limit of each convergent sequence in it (A point lies in the closure of iff some sequence in converges to it, and a set is closed iff it is sequentially closed, using its choice-free closed-to-sequentially-closed direction).
Convexity keeps real midpoints in , also in a complex normed space (Convex sets and continuous real-hyperplane separation in a normed space).
Canonical positive naturals increase with their indices, and inversion reverses strict inequalities between positive elements. Consequently (Canonical naturals are positive and strictly increasing, Inverses of positives are positive, and reciprocation reverses order).
Proof
Choose with for every . For each , , so [F1] makes a finite nonnegative real. Thus is nonempty and bounded below by zero, and [F2] defines a finite real .
The function is -Lipschitz. Indeed, fix and . By [F1], eventually , and then . The corresponding tail supremum, and hence its infimum , is at most . If , [F4] supplies a positive reciprocal smaller than that gap, contradicting this inequality. Hence ; exchanging gives .
For put . Each is nonempty by the defining greatest-lower-bound property of . Applying [F3] once to this countable family produces a sequence with for every . This is the proof's exact use of .
Suppose first that . Given , [F4] and [F9] give a threshold such that for . For , [F1] gives one index beyond the two eventual thresholds at tolerance . Then Thus is Cauchy when .
Now suppose , and fix . Put . Choose the from [F5], replace it by , and set Then and . By [F4] and [F9], for all sufficiently large one has . If such also satisfied , [F1] would give a common tail on which both and . On that tail the vectors belong to the unit ball and satisfy . Uniform convexity therefore gives throughout that tail. The midpoint lies in by [F8], and [F1] now yields , contradicting the definition of . Consequently for all sufficiently large ; is Cauchy also when .
By [F6] there is with , and [F7] gives . The lower-bound property gives . Conversely, the Lipschitz estimate gives for every . If , [F4], [F9] and convergence make the sum smaller than this positive gap for some , a contradiction. Hence , so a minimizer exists.
To prove uniqueness, let both have radius . If and , take in [F1]; at one sufficiently large the triangle inequality gives , a contradiction. If and , repeat step 3.2 with , the same , and the two fixed points . Their radii equal , so [F1] again gives a common tail, while [F5] makes the radius of their midpoint at most . By [F8] that midpoint lies in , the same contradiction. Thus .
Steps 4.1 and 4.2 give the asserted unique asymptotic center. The zero space is included: its only nonempty subset is the singleton and the radius is zero. A singleton is likewise immediate. The argument uses only real norms and real midpoints, so it is unchanged over complex scalars. The set is expressly nonempty; no minimizer is asserted for the empty set.
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.
Milman–Pettis theorem
Statement
Assume the relative Hahn–Banach principle HB and the Axiom of Countable Choice . Every real or complex uniformly convex Banach space is reflexive.
The ultrafilter lemma is not assumed.
Facts & Assumptions
Given: HB, , and a real or complex uniformly convex Banach space , with canonical map .
For every , uniform convexity supplies such that unit-ball vectors separated by at least have midpoint norm at most (Uniformly convex Banach space).
Under HB, if , a finite list and are fixed, some satisfies for every (Goldstine finite-data approximation, equivalently Goldstine's theorem).
The norm on a real or complex dual space is (The dual space X^* of a normed space and its dual norm).
Under HB, 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).
Under , 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 ()).
A Banach space is reflexive exactly when its canonical map onto the bidual is surjective (Reflexivity is surjectivity of the canonical map).
Proof
We first transfer uniform convexity to . Fix and take from [F1] a number for the separation threshold . Let satisfy . By [F3], choose with . In the complex case multiply by a scalar of modulus one, and in the real case change its sign if necessary, to obtain with .
Fix an arbitrary and , and put and . Apply [F2] separately to and , each time with the two tests and tolerance , obtaining . Then , so . By [F1], . Approximation at therefore gives If the left side exceeded , taking to be half that positive gap would contradict this inequality. Hence . Taking the supremum over by [F3] yields .
Thus , with its given dual norm, is uniformly convex: the modulus at may be taken to be any modulus of at . Notice that step 2.1 used two finite-data witnesses only after were fixed; it selected no sequence or family of witnesses.
Let have norm one and let . Put and let be the bidual modulus established in step 3.1. Set . By [F3] choose with , and rotate or change its sign to get with . By [F2], choose with . Hence , and The contrapositive of the bidual uniform-convexity estimate gives .
It follows that is norm dense in . Indeed, the zero vector is . For nonzero and a prescribed , apply step 4.1 to with tolerance , obtaining ; then and .
By [F4], is an isometry, so its range is a normed subspace isometric to the complete space . Under the assumed , [F5] makes this range norm closed in . Step 5.1 puts every element of in its norm closure and hence in the range. Scaling then gives : the zero element is already in the range, and a nonzero element is its norm times an element of the bidual unit sphere. Thus is surjective, and [F6] says that is reflexive.
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 , then and step 6.1 is immediate. All scalar inequalities use real parts, so the proof covers both real and complex scalars.
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 is not reflexive, then for every there are a separable closed linear subspace and a sequence in such that
and
where and means finite convex hull.
Facts & Assumptions
Given: the ultrafilter lemma, DC, HB, a nonreflexive real Banach space , and .
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).
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).
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).
DC is the entire-relation chain principle. Countable Choice 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 -indexed chain, The Axiom of Countable Choice ()).
Under , a complete normed subspace of a normed space is closed (A complete normed subspace is closed under countable choice).
A nonempty at most countable set admits a surjection from ; separability means having an at most countable dense subset (A nonempty set is at most countable iff it is a surjective image of , Separability: the existence of an at most countable dense subset).
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).
The dual norm is the supremum over the closed unit ball, and annihilators use the notation (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.
We first derive the exact Countable Choice instance used below. For a sequence of nonempty sets, let consist of all finite histories with for , starting with the empty history, and relate to every one-term extension by a member of . This relation is entire. DC gives a chain of successively extended histories, whose union chooses one element of every . Thus the assumed DC supplies every application of below; we do not use the unproved bibliographic remark “DC implies ” as a theorem.
By the contrapositive of [F1], choose a norm-bounded sequence in with no weakly convergent subsequence. If bounds all , then , since an sequence is constantly zero. Replacing by , which preserves and reflects weak convergence of subsequences, we may assume . Put . By [F2], is a separable closed Banach subspace, and its intrinsic weak topology is the relative weak topology inherited from .
The space is not reflexive. Otherwise [F1], applied to the bounded sequence in the Banach space , would give a subsequence converging weakly in . Equality of the two weak topologies in [F2] would make the same subsequence weakly convergent in , contrary to step 1.2. In particular .
Let be the canonical map and . By [F3], is an isometry, so is isometric to the complete space . Step 1.1 and [F5] therefore make norm closed in . It is proper because is not reflexive.
Choose and put . Closedness of gives . Since and is the infimum of the nonempty set , choose with . Define . Then , translation by does not change distance to the linear subspace , and hence No simultaneous family is chosen here.
Since is nonzero and separable, take a nonempty at most countable norm-dense subset and, by [F6], one surjection from onto . Repetitions are harmless.
For set Then inside . The inclusion follows by evaluation. Conversely, if vanishes on , define by . Since , the rule is a well-defined linear functional on . Finite-dimensional linear algebra extends to a functional on , using only finitely many choices. Thus .
The quotient-norm identity holds. For , restriction gives . Conversely [F7] extends to some with ; then vanishes on , so step 6.1 puts in and yields the reverse inequality. Since , step 4.1 now gives
For each , the last strict inequality and the dual-norm definition supply with and . Replacing by if necessary and then setting gives , , and . By [F7], has an extension with . Therefore the set of all such pairs is nonempty.
Apply the instance from step 1.1 to , writing the selected pair as . Then , , , and whenever . For fixed and , density supplies with ; for , Hence for every .
Let be any finite convex combination, where , , and , and let . Restriction to and step 9.1 give Since , restriction cannot increase norm, and therefore Taking the infimum over both nonempty sets proves .
Steps 1.2 and 2.1 provide the required separable closed , step 9.1 gives the pointwise-null dual-ball sequence, and step 10.1 gives the asserted annihilator separation. The endpoints are excluded exactly as stated; 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.
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.
James convex-block norm-attainment criterion
Statement
Assume the Axiom of Dependent Choice (DC) and the relative Hahn–Banach principle HB. Let be a real Banach space, let , and let be a sequence in . For every bounded sequence in put
Suppose
where is the finite convex hull. If is any sequence of positive reals with , then there are and a sequence in such that, for every ,
and, for every ,
In addition, assume the ultrafilter lemma. If is nonreflexive, then some does not attain its norm on .
Facts & Assumptions
Given: DC, HB, a real Banach space , , a dual-ball sequence satisfying the displayed separation, and positive weights of sum one. The ultrafilter lemma is assumed only for the final nonreflexive consequence.
For a bounded real sequence, limsup and liminf are finite real numbers; limsup is subadditive, reflection exchanges limsup and liminf, and liminf is realized by a subsequence (Limit superior and limit inferior of a real sequence as and in , The tail suprema of any real sequence are nonincreasing in , so the limit superior exists for every sequence, whenever the right-hand side is defined in , and dually for , , with the reflection of exchanging , The limit inferior is the least subsequential limit in ).
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).
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).
The dual norm is the supremum of absolute values on the closed unit ball. Since the scalar field is complete, 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).
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 -indexed chain).
A strictly increasing subsequence index map satisfies , and the real geometric-series formula holds for every ratio of absolute value less than one (A strictly increasing index map satisfies , For , , and for the series diverges).
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
We first record two elementary properties of . For a bounded sequence , say , the function is finite, positively homogeneous, and subadditive: homogeneity follows directly from tail suprema and subadditivity from [F1]. Apply [F2] to the zero functional on dominated by . The extension satisfies , while applying this inequality at and using [F1] gives . Hence , so and . Thus is nonempty and, when , lies in .
Let be the set of sequences for which at every . It is nonempty because . For each , every such convex combination satisfies , so the receding-tail definition gives and therefore . Flattening two finite convex combinations proves when . A subsequence of also belongs to : its th index is at least by [F6].
Reindex the weights by positive integers, for . Extend the corresponding reindexing of the dual sequence to a genuine zero-based library sequence by setting and for . The duplicate initial term does not change any scalar limsup, so , and . Put , so , , every , and . Choose explicitly . Then 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}
Now additionally assume the ultrafilter lemma and that is nonreflexive. Apply [F7] with the same to obtain and , pointwise null on , with its convex hull at distance at least from . If , then for the defining inequality at and gives and . Hence , and the separation hypothesis of the technical criterion holds.
Set . Suppose that and the sequences have been constructed. For and , define and let be the infimum, over all such , of . Step 1.1 makes every nonempty. All displayed functionals have norm at most two, because all the convex blocks and all members of lie in the dual unit ball; hence and [F3] makes the infimum legitimate.
For , any admissible is in the convex hull of the original sequence and by steps 1.2–1.3. The separation hypothesis therefore gives for every admissible , so .
Suppose . The induction will arrange that is a subsequence of some . Consequently by step 1.2. For an admissible at stage , both and lie in , and so does Also by flattening. Since every stage- candidate supplies a stage- candidate of the same supremum. Hence . Together with step 3.1, for all .
The definition of the positive number supplies and such that \alpha_m\le\sup S_m(y_m^*,z^{(m)})<\alpha_m(1+\varepsilon_m).\tag{2} Because , choose for which the norm inside (2) is greater than . By [F4] and the balance of , there is on which the same functional, without absolute-value signs, has value greater than that number. The bounded scalar sequence has a subsequence converging to its liminf by [F1]; denote the corresponding dual sequence by .
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 , 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 with (2) and the strict lower inequality. No simultaneous selection outside this DC application is being hidden.
The induction has produced the positive-indexed family . Make it a genuine sequence by putting and for . For fixed and every , repeated flattening of the relations in steps 4.1–5.1 gives . Ignoring the single duplicated initial term in , 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, is a subsequence of .
Fix . Since by (3) and the -evaluations of converge to the liminf of those of , The last inequality follows by applying the definition at and using limsup reflection. Replacing by therefore preserves the strict lower evaluation chosen in step 5.1. The upper estimate follows from 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}
By steps 2.1 and 4.1, is nondecreasing and bounded above by , so [F3] gives a limit . The series is absolutely convergent and hence convergent in the Banach space by [F4]. If and the functional inside (4) is , then . Since , (4) gives . Because , this is .
It remains to prove the strict prefix estimate. Put , , and . The upper half of (4) and give . The exact identity and induction yield Since , . Using 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 , where .
Define the asserted zero-based sequence by . It and differ only by a one-place shift and a duplicated first term, so their scalar limsups agree and . Step 9.1 is therefore the asserted infinite-series equality for every , while (5) with replaced by is exactly Relabeling as proves the technical criterion, including the first term and every positive weight sequence.
Put and , and take the positive zero-based weights . By [F6] they sum to one; their tails satisfy . Apply the technical criterion to obtain , , and choose one , which is possible by step 1.1. The absolutely convergent series has .
Fix . Step 1.1 gives and . Since , there is an arbitrarily late , and in particular one with , such that . Split before , at , and after . The prefix estimate at , the displayed scalar inequality, and give because . Applying the same argument to gives . Therefore for every : is nonzero but attains its norm nowhere on the closed unit ball.
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 are used in (1) and step 13.1.
Source notes
Megginson's Lemma 1.13.12 proves nonemptiness of . 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 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 .
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 is reflexive if and only if every attains its norm on the closed unit ball: there is with . This includes .
Facts & Assumptions
Given: the ultrafilter lemma, DC, HB, and a real or complex Banach space .
Reflexivity is surjectivity of the canonical map ; 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).
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).
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 -indexed chain, Assuming the ultrafilter lemma, an arbitrary product of compact Hausdorff spaces is compact).
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.
Suppose is reflexive and let . If , then attains its norm. If , define on the one-dimensional scalar-linear subspace by . Then , so . By [F2] it extends to with . Reflexivity and [F1] give with and . Hence , so attains its norm on .
For the reverse implication, first suppose that is real and every member of attains its norm. If were nonreflexive, [F3] would supply that attains its norm nowhere on , a contradiction. Thus is reflexive.
Now suppose is complex and every complex-linear member of attains its norm. Let be the same additive normed space with scalars restricted to . It remains a real Banach space because its norm and Cauchy sequences are unchanged. For define Real linearity gives , hence is complex linear, and . The inequalities and follow respectively from and, for each , choosing a unit scalar with and observing . Thus .
By hypothesis, attains its norm at some . Choose a unit scalar with (take if the value is zero). Then and Hence every member of attains its norm. The real implication in step 1.2 shows that is reflexive.
To pass back to the complex space without an unproved slogan, let be complex linear. For put . Step 1.3 makes a bounded real-linear functional on , with . Real reflexivity from step 2.1 supplies such that for every real-dual . If and , then the formula in step 1.3 gives , so . Apply the same equality to the complex functional : complex linearity gives and . Thus for every . Therefore is onto and is complex-reflexive.
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 , 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].
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 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.
Quantitative Bishop–Phelps support functional construction
Statement
Assume the Axiom of Dependent Choice (DC) and the relative Hahn–Banach principle HB. Let be a nonempty closed bounded convex subset of a real Banach space . For every and every there are and such that
In fact, the construction below gives the strict bound .
Facts & Assumptions
Given: DC, HB, and as in the statement.
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).
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 -indexed chain).
Every bounded monotone real sequence converges, and every nonempty subset of 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, Every nonempty set bounded below has an infimum).
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).
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.
Choose a real number with . The restriction is continuous and bounded above because is bounded. By [F1], with its norm metric is complete. Fix one , possible because is nonempty, and for define Each is nonempty because it contains , and it is closed because is continuous in .
If and , then Thus and . Since is bounded above and is nonempty, its supremum is a real number. For every and every , the defining approximation property of the supremum supplies with
Let a state be a nonempty finite sequence in which starts at the fixed and, at each earlier index , has and 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 with both displayed properties for every .
The ascent condition gives Consequently the partial sums of are nondecreasing and bounded above by . By [F3] the series converges, hence its tails tend to zero and is Cauchy. Completeness gives a limit .
Transitivity in step 2.1 makes every tail point , , belong to ; closedness gives for every . If , then transitivity also puts in every , and the approximate-supremum condition gives Letting and using continuity yields . But also gives , so . Therefore and the corresponding non-strict inequality holds for every .
Put Because is convex and contains zero, is a convex cone: for the sum is zero if , and otherwise equals . Step 5.1 and real linearity give This includes .
For define The set being infimized is nonempty because . Step 6.1 and the reverse triangle inequality give every one of its terms at least , while gives a term equal to . Thus [F3] makes a finite real and -\eta\|x\|\le p(x)\le\eta\|x\|.\tag{1} Both bounds are uniform in the choice of .
The cone identities imply for , and (1) gives . If , then and Taking infima first over and then over proves . Hence is sublinear.
Apply [F4] to the zero functional on , dominated by , to obtain a real-linear with . Applying this at and and using (1) gives , so and by [F5]. For , the candidate in the infimum gives , whence and . Thus the extension dominates on the support cone.
Set . Then and . For every , the vector lies in , so step 9.1 gives Thus attains its supremum on at . The proof permits a singleton , , and the closed-boundary cases; DC is used only in step 3.1 and HB only in step 9.1.
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.
Bishop phelps
Statement
Assume the Axiom of Dependent Choice (DC) and the relative Hahn–Banach principle HB.
- If is a nonempty closed bounded convex subset of a real Banach space , then the real-linear functionals attaining their supremum on are norm dense in .
- Consequently, the norm-attaining functionals are norm dense in the dual of every real Banach space.
- 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.
Under DC and HB, for a nonempty closed bounded convex set in a real Banach space, every and admit and with and for every (Quantitative Bishop–Phelps support functional construction, The axiom of dependent choice: a relation in which every element is related to something admits an -indexed chain, The real dominated-extension principle as an additional hypothesis over ZF).
For a real or complex normed space, the dual norm is (The dual space X^* of a normed space and its dual norm).
Proof
Proof technique: quantitative approximation followed by unit-ball symmetry and complexification.
Let be real, let be as in claim 1, and fix and . By [F1] there are and such that and for every . Thus , and arbitrary and prove the asserted norm density.
Now let be complex and write for its realification. For define . Real linearity gives and . For any , choose a unit scalar with when the value is nonzero, and take otherwise. Then , while ; therefore and . The correspondence is real-linear, and for complex-linear , .
Take in step 1.1. Since is symmetric, by [F2]. Hence the approximating satisfies at some and is norm-attaining. This includes , which attains norm zero at zero.
Fix and . Apply the real claim 1 to the same set inside and to . It gives a real functional and with and on . Put . Step 1.2 applied to gives . Because the complex unit ball is symmetric, [F2] and step 1.2 give But and , so and attains its norm.
The three density assertions follow from steps 1.1, 2.1 and 2.2. If , 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.
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.
Separable dual implies separable primal
Statement
Assume the Axiom of Countable Choice and the relative Hahn–Banach principle HB. If the continuous dual of a real or complex normed space is norm separable, then is norm separable.
Facts & Assumptions
Given: , HB, a real or complex normed space , and the hypothesis that is separable in its norm topology.
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 ).
The dual norm is (The dual space X^* of a normed space and its dual norm).
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).
The rationals are countable and dense in the reals. Products of two at most countable sets are at most countable, and under a countable union of at most countable sets is at most countable ( 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 , The Axiom of Countable Choice ()).
Proof
If , then itself is a finite dense subset of , so the conclusion holds. Henceforth suppose .
By [F1], choose an at most countable norm-dense subset . Enlarge it by the zero functional, so it is nonempty and [F1] supplies a sequence whose range is . This sequence is norm dense in .
For each , if set ; otherwise let The set is nonempty by [F2]. Apply to the family and choose for every . This is the only selection of an arbitrary countable family in the proof.
Let in the real case and in the complex case, and let be the -linear span of the sequence . The field 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 , so is at most countable. Density of in shows that is norm dense in the real or complex linear span of the .
Let vanish on . Then for every . Given , norm density of gives an with . By the definition of in step 1.3, where the first inequality is also true when . Therefore . Since this holds for every , .
Suppose that the norm closure were a proper subset of . It is a nonempty closed real-linear subspace, and in the complex case it is complex-linear because is dense in . Choose . By [F3] there is a nonzero strictly separating from . Because is a subspace and is bounded on one side there, scaling forces for every . In the complex case, applying this also to gives . Thus vanishes on , contradicting step 2.2. Consequently .
The at most countable set is norm dense in by steps 2.1 and 3.1, so is separable by [F1]. The use of 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.
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 , makes the countability and choice steps explicit, and uses Gaussian-rational coefficients to cover complex normed spaces.
Separable reflexive space has separable dual
Statement
Assume the Axiom of Countable Choice and the relative Hahn–Banach principle HB. If a real or complex Banach space is reflexive and norm separable, then its continuous dual is norm separable.
Facts & Assumptions
Given: , HB, and a real or complex separable reflexive Banach space .
A space is separable precisely when it has an at most countable dense subset (Separability: the existence of an at most countable dense subset).
Reflexivity says that the canonical map is a surjective isometric embedding (Reflexivity is surjectivity of the canonical map).
Under and HB, a real or complex normed space whose continuous dual is norm separable is itself norm separable (Separable dual implies separable primal).
Proof
By [F1], fix an at most countable norm-dense set . Its image is at most countable: the restriction of the injective map is a bijection from onto that image.
The image is norm dense in . Indeed, for and , surjectivity in [F2] gives with , and density of gives with ; the isometry in [F2] then gives . Thus is norm separable by [F1].
Apply [F3] to the normed space . Its continuous dual is , which is separable by step 2.1, so is norm separable. No new selection or separation is made here: and HB are used exactly through [F3].
Source notes
Brezis proves the same implication by identifying with and applying the separable-dual theorem to . Reflexivity is essential: Brezis's Remark 19 records as separable with nonseparable dual ; that warning is source context and is not used as a supplier in the proof above.
Clarkson inequalities in both exponent ranges
Statement
Let be a measure space, let , and let over either or .
- If , then
- If and , then
At both formulas are the same equality.
Facts & Assumptions
Given: A measure space , a real number , and for or .
For , the conjugate exponent is and satisfies (Conjugate exponents, including the endpoint conventions).
Real powers on positive bases obey the product, quotient, and iterated power laws; is continuous and differentiable on with derivative (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).
The natural logarithm is the inverse of the exponential, is continuous and strictly increasing, obeys the product and quotient laws, and has derivative (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).
The sum, product, quotient, and chain rules compute derivatives; the sign of a derivative on an interval gives the corresponding monotonicity, and a continuous real function takes every intermediate value (Sums, scalar multiples, products and quotients: , , , and when , The chain rule, in one line from Carathéodory: if is differentiable at and is differentiable at , then is differentiable at with , On an interval , for continuous on and differentiable at every interior point: throughout gives nondecreasing, gives increasing, and give the two decreasing forms; conversely a nondecreasing has and a nonincreasing has wherever it is differentiable, and no strict converse is claimed, Intermediate value theorem, by bisection with a canonical left-half rule: a continuous function on takes every value between and ).
For conjugate finite exponents , two-term Hölder gives (Holder's inequality for finite sums and conjugate real exponents)
Real and complex consist of a.e. classes of measurable representatives with and addition, subtraction, scalar multiplication, and the norm are representative-independent (The function space for , Complex Lp classes and Euclidean test-function conventions, The norm descends to the quotient and makes a normed space for , Complex Holder, Minkowski, and the quotient norm).
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
Suppose and let . For , first : if , divide by and use for and ; the zero case is equality. Also . For this is equality. For , apply [F5] with conjugate and to and , then raise to the th power.
Suppose and put . For , define We will prove . Set and ; by [F1], . For , put and 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 . The estimate holds whenever , while . Continuity, [F4], and strict decrease therefore give a unique at which vanishes. Thus increases before and decreases after it.
Suppose , put , , and . For measurable representatives of , let and . These numbers are finite by [F7]. If , the inequality below is immediate. If , set Then and . Two-term Hölder [F5], applied pointwise to and , gives M=\int_S(\lambda A+\eta B)\,d\mu\le\int_S(A^r+B^r)^{1/r}\,d\mu. \tag{7}
For real or complex scalars , [F6] and coordinate expansion give the scalar parallelogram identity Apply both inequalities of step 1.1, first to and then to . Since , this yields |a+b|^p+|a-b|^p\le2^{p-1}(|a|^p+|b|^p). \tag{1}
For every sufficiently small , for example the final inequality holds whenever . On the other hand , and strict decrease on gives there. Consequently continuity and the monotonicity from step 1.2 give a unique such that on and on .
Define, for , 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 , implies ; hence as , and logarithm continuity proves that extends continuously by . By step 2.2 it first strictly decreases and then strictly increases. It eventually becomes positive: the derivative test applied to gives , while ; hence whenever . By the logarithm and real-power laws, the logarithm of the left side is , so it is positive there. Thus [F4] gives a unique such that on and on .
Choose measurable representatives of and ; every pointwise inequality below is unchanged by modifying them on a null set. If , integrate (1), use [F7]–[F8], and divide by : The integrals are finite because by the normed-space structure in [F7].
Put The two terms are positive. Since is strictly increasing, the sign of is the sign of the logarithm of their ratio, namely 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 is at an endpoint. Finally This proves \big((1+t)^q+(1-t)^q\big)^{1/q}\le2^{1/q}(1+t^p)^{1/p}. \tag{5}
For arbitrary real , the unordered pair equals . 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 is immediate.
The same estimate holds for complex . The case where either is zero follows directly, so swap them if necessary and suppose . Put , , and ; the last inequality follows from . The two terms below swap if changes sign, so For , let Its derivative is Thus . Apply (5) to , then multiply by using [F6], to obtain (6) over as well.
Raise the complex-or-real scalar estimate (6) to the th power. Since , it says pointwise that Use this in (7), then use [F7]–[F8]: Raising to gives a factor . Dividing by and using yields
Step 3.2 proves the first claim, and step 6.1 proves the second for . At one has , 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.
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 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 , and step 1.3 spells out the two-coordinate Hölder duality behind the required integral inequality.
is uniformly convex for
Statement
Assume countable choice . Let be a measure space and let . Then both and , with their usual norms, are uniformly convex.
More precisely, for one may use
At the two formulas agree.
Facts & Assumptions
Given: Countable choice, a measure space , a real number , a scalar field , and .
A real or complex Banach space is uniformly convex if every admits a such that unit-ball vectors with satisfy (Uniformly convex Banach space).
The usual quotient formulas give norms on real and complex . Under countable choice these spaces are complete for (The Axiom of Countable Choice (), The norm descends to the quotient and makes a normed space for , Complex Holder, Minkowski, and the quotient norm, Riesz-Fischer completeness of for , Complex Lp completeness and almost-everywhere subsequences).
If , the Clarkson inequalities (Clarkson inequalities in both exponent ranges) say
and, when and ,
These assertions hold for both real and complex scalars.
Norms are nonnegative and absolutely homogeneous (A norm on a real vector space, the induced metric, and the dictionary with the metric axioms).
For , is positive when , has derivative on , and is therefore strictly increasing there; the convention extends this strict increase to (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, The exponential is positive and satisfies , On an interval , for continuous on and differentiable at every interior point: throughout gives nondecreasing, gives increasing, and give the two decreasing forms; conversely a nondecreasing has and a nonincreasing has wherever it is differentiable, and no strict converse is claimed).
Proof
By [F2], with its usual norm is complete for either choice of . 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 spaces are the zero Banach space.
Let lie in its closed unit ball and suppose . Put Absolute homogeneity gives .
Suppose . The first inequality in [F3] and give By step 1.2 and strict increase of the positive th power, Both sides are nonnegative. If , then and hence . Otherwise the iterated-power law gives , and strict increase of the positive th power yields Here . Thus , so ; applying strict increase of the positive power, including its zero-base convention, shows . Hence . At the root is and .
Suppose and put . Then . The second inequality in [F3] has right side at most , because and the positive power is increasing. Consequently Repeating step 2.1 with in place of gives and the same strict-power argument proves , with . When , one has , so this is the same modulus as in step 2.1.
For the fixed , choose the displayed number 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 . Therefore is uniformly convex. The only use of is through the real and complex completeness results in [F2]; Clarkson's inequalities and the modulus calculation are choice-free.
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 completeness interfaces both carry that hypothesis.
Real and complex are Banach
Statement
For either scalar field , the space with the supremum norm is a Banach space. No choice principle is used.
Facts & Assumptions
Given: A scalar field and a supremum-norm Cauchy sequence in .
The space consists of the bounded scalar sequences which tend to zero and carries the supremum norm (The sequence spaces c_0 and ell-infinity).
Every real Cauchy sequence converges in , without choice (The reals are complete), and every complex Cauchy sequence converges in (The complex plane is complete, and convergence is equivalent to convergence of real and imaginary parts).
A uniquely specified image of a set is a set by Replacement (The Axiom Schema of Replacement: for each formula , if defines a class function on then its image on is a set).
A normed space is Banach exactly when every norm-Cauchy sequence converges to a point of the space (Banach space).
Proof
Fix . Since the scalar sequence is Cauchy. By [F2] it has a unique limit, say . The formula sending to the ordered pair is single-valued, so [F3] collects these pairs into the graph of one scalar sequence . This uses uniqueness and Replacement, not a choice of one limit from each of many non-singleton sets.
The sequence is bounded. Choose so that whenever . For every coordinate , letting tend to infinity in gives . Therefore for every .
In fact in the supremum norm. Given , choose so that for all . Fix and . Passing to the coordinatewise limit as yields . Taking the supremum over gives
The uniform limit still tends to zero. Given , use step 3.1 with tolerance to fix an with . Since , [F1] gives such that for all . Hence Together with boundedness from step 2.1, this says .
Thus every supremum-norm Cauchy sequence in real or complex converges in that norm to an element of . 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.
Remarks
This A-page lemma is the direct completeness supplier needed by the companion reflexivity examples. The already published proof that 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
- Bühler–Salamon, Functional Analysis
- Gerald Teschl, Topics in Real and Functional Analysis
- Haim Brezis, Functional Analysis, Sobolev Spaces and Partial Differential Equations
- Gerald B. Folland, Real Analysis, 2nd ed.
- John K. Hunter, Measure Theory
- Haase, The Functional Analysis of Quantum Information Theory
- Brezis, Functional Analysis, Sobolev Spaces and Partial Differential Equations
- Gerald Teschl, Topics in Real and Functional Analysis (2017)
- Harald Hanche-Olsen, Topological vector spaces
- Teck-Cheong Lim, On Asymptotic Centers and Fixed Points of Nonexpansive Mappings
- Robert E. Megginson, An Introduction to Banach Space Theory (1998)
- Philip D. Loewen and Xianfu Wang, A Generalized Variational Principle, Canadian Journal of Mathematics 53 (2001), 1174–1193
- Haim Brezis, Functional Analysis, Sobolev Spaces and Partial Differential Equations, Theorem 3.26
- Bühler–Salamon, Functional Analysis, Theorem 2.73(i)
- Haim Brezis, Functional Analysis, Sobolev Spaces and Partial Differential Equations, Corollary 3.27
- Bühler–Salamon, Functional Analysis, Theorem 2.73(ii)
- Kuriyama, Miyagi, Okada and Miyoshi, Elementary proof of Clarkson's inequalities and their generalization
- Ken Kuriyama, Mitsuhiro Miyagi, Mari Okada and Tetsuhiko Miyoshi, Elementary proof of Clarkson's inequalities and their generalization