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 — Examples
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
- Inner Product Spaces, Gram-Schmidt, Projections and Adjoints
- 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
- Reflexivity and Eberlein Smulian
- 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
The examples put the abstract criteria into familiar spaces. The parallelogram identity gives an explicit modulus of uniform convexity for real and complex Hilbert spaces. Under the assumptions stated in each item, the open exponent range gives reflexive and spaces, whereas and the selected endpoint are nonreflexive. The canonical calculation exhibits the constant-one sequence as a concrete missing bidual vector.
Schur's theorem and a finite-common-kernel argument show that the weak and norm topologies on are different even though they have exactly the same convergent sequences. The Bishop--Phelps boundary remark records Lomonosov's complex general-convex counterexample without using it as a local proof supplier. Finally, a direct nearest-point proof of Riesz representation shows, under Countable Choice, that every bounded functional on a real or complex Hilbert space attains its norm; the zero functional and the library's linear-first convention are handled explicitly.
3 · Logical flowchart
4 · Definitions, theorems and proofs
None yet.
5 · Examples, counterexamples and false statements
Hilbert spaces are uniformly convex
Statement
Here a Hilbert space means a real or complex inner product space that is complete for its induced norm. Every Hilbert space is uniformly convex. More precisely, for the parallelogram identity gives the modulus
Facts & Assumptions
Given: A real or complex inner product space , complete for its induced norm, and a real number .
The inner product is linear in the first variable, conjugate-linear in the second, conjugate symmetric, and positive definite (Real and complex inner product spaces, with the inner product linear in the first argument). Its induced norm is (The norm induced by a real or complex inner product).
The induced function is nonnegative, definite, absolutely homogeneous, and satisfies the triangle inequality (The inner-product norm is definite, homogeneous, and satisfies the triangle inequality).
A normed space complete for its norm metric is Banach (Banach space). Such a space is uniformly convex exactly when for every a positive gives the required midpoint drop for every pair in its closed unit ball (Uniformly convex Banach space).
Every nonnegative real has a unique nonnegative square root, and squaring is strictly increasing on the nonnegative reals (Square roots exist: a unique with ; the positives are , Squaring is monotone on the nonnegatives).
Proof
By [F2], the induced function is a norm. The assumed completeness and [F3] therefore make a real or complex Banach space. This also covers the zero Hilbert space.
For arbitrary , expand with [F1]: while Adding cancels the two cross terms, over both scalar fields, and gives
Now let lie in the closed unit ball and suppose . By [F2] and step 1.2, The radicand belongs to because . Let as in [F4]. If , then either or strict monotonicity of squaring gives , whereas ; hence . Since both and are nonnegative, their squared inequality and strict monotonicity of squaring give Thus . At , and .
Step 2.1 applies to every closed-unit-ball pair satisfying the separation hypothesis and supplies a positive number depending only on . Therefore [F3] proves that is uniformly convex. No choice principle is used: the square root in the displayed formula is unique by [F4].
Remarks
The definition of Hilbert space needed by this example is given explicitly in the statement. The proof uses only the earlier inner-product page and does not cite the later Hilbert-space geometry and Riesz-representation page.
Reflexivity of and
Statement
Assume countable choice . For every measure space and every , both real and complex are reflexive. In particular, real and complex are reflexive in this exponent range.
The open range is essential. Real and complex are not reflexive. If, in addition to , the ultrafilter lemma, dependent choice, and the relative Hahn--Banach principle are assumed, then real and complex and are not reflexive. In particular, counting measure gives an endpoint counterexample.
Facts & Assumptions
Given: Countable choice, an arbitrary measure space, an exponent , and a scalar field ; for the endpoint clause also the ultrafilter lemma, DC, and relative HB.
Under , real and complex over an arbitrary measure space are reflexive for (The Axiom of Countable Choice (), Reflexivity of Lp for one less p less infinity).
On counting measure on , real is exactly real with the same norm. For complex functions, the complex definition uses the same integral of the real nonnegative modulus ; applying the counting-measure identity to that modulus gives . Since counting measure has no nonempty null set, its a.e. quotient is equality everywhere, so complex is isometrically complex as well ( is the space of counting measure, Complex Lp classes and Euclidean test-function conventions).
Under the ultrafilter lemma, DC, and relative HB, neither real nor complex is reflexive (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, Ell one is not reflexive).
Real and complex are Banach without choice (Real and complex are Banach). A Banach space is reflexive exactly when its canonical evaluation map is onto (Reflexivity is surjectivity of the canonical map). The bilinear sequence-pairing identifications give ; the real dual of is by counting-measure duality, and the complex dual is by the complex sequence theorem (The continuous dual of c0 is ell-one, Counting measure specializes the representation theorem to and , The complex continuous dual of ell-one is ell-infinity). A sequence lies in exactly when it tends to zero, while contains every bounded sequence (The sequence spaces c_0 and ell-infinity).
is a closed linear subspace of (c_0 is a closed subspace of ell-infinity). Under the assumed relative Hahn--Banach principle, every closed linear subspace of a reflexive real or complex Banach space is reflexive (Closed subspaces of reflexive spaces are reflexive).
Proof
The first assertion is exactly [F1]: under , both scalar versions of are reflexive for every measure space and every . Empty and zero measure spaces are included; their spaces are zero and the cited theorem still applies.
Under the three additional principles stated for the endpoint clause, [F3] gives nonreflexivity of both real and complex . Those principles are used here only through that cited corollary.
The conclusion needs none of those additional principles. Fix . By [F4], is a Banach space. Let be the isometric bijection in [F4], so . Identify with by [F4], using the same bilinear series pairing. For and , Thus, under the composite identification , the canonical image is exactly the bounded sequence . The constant sequence belongs to but not to by [F4], so it is a concrete bidual element outside . Hence is not onto and [F4] proves that real and complex are not reflexive.
Under relative Hahn--Banach, suppose were reflexive. Then it would be a reflexive Banach space, and [F5] would make its closed subspace reflexive, contradicting the preceding canonical-image calculation. Hence is not reflexive, for either scalar field. The ultrafilter lemma and DC in the endpoint hypotheses are needed for the selected proof, not for this argument. [F4, F5]
Give counting measure. By [F2], the real or complex space in step 1.1 is isometrically the corresponding . Reflexivity therefore gives the asserted sequence-space specialization.
For counting measure, no nonempty subset is null, so the essential-supremum norm on is the ordinary supremum norm and its a.e. equivalence is equality. Thus is isometrically ; Step 1.3 supplies the claimed endpoint counterexample under its exact assumptions. [F2, F4, step 1.3]
Steps 1.1 and 2.1 prove the positive result in the entire open exponent range, while steps 1.2, 1.3, and 2.1 provide the promised failures outside it. Countable choice is used through the arbitrary-measure theorem. The ultrafilter lemma, DC, and relative HB are additionally used only for the selected proof; the direct canonical-image proof for is choice-free. No assertion about reflexivity of or on every measure space is made.
Remarks
- The ultrafilter lemma is a hypothesis of the endpoint clause, not a result consumed from its proof: the clause above states the assumption 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; this example assumes the lemma and inherits no part of that AC-based proof.
Source notes
Teschl's sequence-space examples after Theorem 4.20 identify reflexivity of for and compute the canonical image of as the proper inclusion (printed p. 116). The arbitrary-measure and complex-scalar claims here use the stronger local suppliers listed above. The endpoint retains the exact assumptions of the library's selected Schur/Eberlein--Smulian proof rather than silently weakening them from the source's classical setting.
is not reflexive
Statement
The Banach spaces and are not reflexive. Under the standard bilinear sequence dualities, their canonical bidual maps are the proper inclusions
Facts & Assumptions
Given: A scalar field .
The supremum-norm space is Banach without choice (Real and complex are Banach), and a Banach space is reflexive exactly when its canonical evaluation map into the bidual is onto (Reflexivity is surjectivity of the canonical map).
Bilinear sequence pairing gives the isometric identification . The dual of real is real , and the dual of complex is complex , with the same no-conjugation pairing (The continuous dual of c0 is ell-one, Counting measure specializes the representation theorem to and , The complex continuous dual of ell-one is ell-infinity).
The space consists exactly of the bounded scalar sequences tending to zero, while consists of all bounded scalar sequences (The sequence spaces c_0 and ell-infinity).
Proof
Let be the isometric bijection from [F2], so . Identify with through [F2]. Both identifications use this bilinear series pairing, including over .
For and , The functional on the right is represented, under the second identification in step 1.1, by the bounded sequence itself. Hence the composite is precisely the canonical inclusion .
The constant sequence lies in , has norm one, and does not tend to zero. Thus [F3] gives , so step 2.1 exhibits a concrete member of outside the range of .
The canonical map is not onto. Since is Banach, [F1] therefore proves that it is not reflexive. The calculation covers both scalar fields, including their identical bilinear convention, and uses no choice principle.
Weak and norm topologies differ on despite identical convergent sequences
Statement
On each of the infinite-dimensional spaces and , the weak topology is strictly coarser than the norm topology. Nevertheless, a sequence converges weakly if and only if it converges in norm.
Facts & Assumptions
Given: A scalar field and .
The weak topology is generated by finite intersections of inverse images of scalar open sets under members of ; it is contained in the norm topology (Weak topology on a normed space).
The norm induces the metric , and every metric-open set, including the open unit ball, is available as a norm-open set (A norm on a real vector space, the induced metric, and the dictionary with the metric axioms).
The coordinate sequences belong to and satisfy ; finite coordinate sums have their usual norm (Finite truncations approximate null and summable sequences).
If a linear map has finite-dimensional domain, then its domain dimension is its nullity plus its rank (Rank-nullity: ).
Both real and complex have the Schur property: weak convergence of sequences implies norm convergence (Real and complex ell one have the Schur property).
Refutation
Let . It is norm-open by [F2]. Suppose for contradiction that it is weakly open. Since , [F1] supplies a finite basic weak neighborhood with , where and each scalar-open contains zero. The case means and already contradicts , since .
Assume . Let and define the linear map The coordinate vectors are linearly independent by their explicit coordinates, so , whereas . Rank--nullity [F4] therefore gives a nonzero .
For every scalar , each , so . Since , choose the positive real scalar . Absolute homogeneity gives , hence . This contradicts .
Thus the norm-open ball is not weakly open. Since [F1] says the weak topology is contained in the norm topology, the containment is strict over both scalar fields.
Norm convergence implies weak convergence because the weak topology is coarser by [F1]. Conversely, [F5] turns every weakly convergent sequence in into a norm-convergent sequence. The two topologies therefore have exactly the same convergent sequences even though step 4.1 proves that they are different.
The witness uses explicit coordinate vectors for an arbitrary finite list of functionals, so it also covers one functional and a list containing zero or repeated functionals. The empty list was handled in step 1.1. Only finite-dimensional rank--nullity and one formula-defined rescaling are used; there is no choice principle, and no assertion about nets having the same convergence behavior is made.
Complex Bishop--Phelps for general convex sets
Statement
Lomonosov constructed a complex Banach space and a closed bounded convex set having no support points. Here a support point is a point at which some nonzero complex-linear functional attains
Equivalently in his construction, the zero functional is the only functional whose modulus attains its supremum on .
Consequently the real general-convex-set conclusion in Bishop phelps has no unrestricted complex analogue. There is no conflict with that local theorem: under its declared DC and relative Hahn--Banach assumptions it proves the complex result only for the closed unit ball, not for every closed bounded convex set.
Remarks
Externally proved; not proved here. Lomonosov first takes the closed convex hull of the point evaluations inside a predual of . Lemmas 1--2 and Theorem 1 use powers, the maximum-modulus principle, a norm-preserving extension to on the maximal ideal space, and Riesz representation to show that its support functionals form only the line spanned by the identity function. He then quotients the predual by the line spanned by evaluation at zero. The dual of the quotient is the annihilator of that evaluation, whose intersection with the preceding support-functional line is zero; Theorem 2 concludes that the quotient image has no support points.
This item records only that source boundary. It is not a dependency of any other item in this pair, and neither a citation nor the summary above is treated as a local proof of Lomonosov's analytic construction.
Norm-attaining functionals on a Hilbert space
Statement
Assume the Axiom of Countable Choice. Let be a real or complex Hilbert space, meaning an inner product space complete for its induced norm. Every bounded linear functional attains its norm on the closed unit ball. More precisely, if , then there is a unique such that
and attains its norm at . The zero functional is represented by and attains its norm at every point of the closed unit ball.
Facts & Assumptions
Given: The Axiom of Countable Choice , a real or complex Hilbert space , and a bounded linear functional .
The inner product is linear in its first variable, conjugate-linear in its second, conjugate symmetric, and positive definite (Real and complex inner product spaces, with the inner product linear in the first argument). It induces the norm (The norm induced by a real or complex inner product), which is definite, homogeneous, and satisfies the triangle inequality (The inner-product norm is definite, homogeneous, and satisfies the triangle inequality).
Completeness for the norm metric makes a Banach space (Banach space). The dual consists of bounded scalar-linear functionals and has norm (The dual space X^* of a normed space and its dual norm). Consequently for every .
Every nonempty real set bounded below has an infimum, and if is that infimum then for every the set contains a point smaller than (Every nonempty set bounded below has an infimum, Epsilon characterisation of the infimum).
For every positive real some reciprocal is smaller than (For every in a complete ordered field there is a natural with ).
A closed linear subspace of a Banach space is Banach (A closed subspace of a Banach space is Banach).
Countable Choice selects one element from every member of an -indexed family of nonempty sets (The Axiom of Countable Choice ()). It is used below only to select the countable sequence of approximate minimizers.
Cauchy–Schwarz gives in either scalar field (Cauchy–Schwarz: , with equality exactly for linearly dependent vectors).
Proof
If , take . Then and for every in the closed unit ball, including when . Hence assume from now on that ; in particular and .
Choose with and put , so . Let . It is a linear subspace, and the following estimate proves that it is closed and hence Banach.
Indeed, if , then
and implies
Thus the open ball misses , so the complement of is open. By [F5], is therefore a Banach space with the restricted norm. [F1, F2, F5]
The set is nonempty (take ) and bounded below by , so [F3] gives ; the functional estimate below also proves that this infimum is positive.
For every ,
and hence . [step 1.2, F2, F3]
For each natural , define the following set of approximate minimizers and use Countable Choice to select from all of them.
Each is nonempty by [F3]. Apply once to this family and choose for every . Thus, with ,
This is the sole use of choice in the proof. [F3, F6]
Put . Expanding squared norms and using that the kernel contains midpoints gives the estimate below.
Since , the definition of gives . Therefore
\|m_n-m_k\|^2\le2r_n^2+2r_k^2-4d^2.\tag{1}
This is the estimate used below. [step 2.1, step 3.1, F1]
The sequence is Cauchy by the following explicit use of the reciprocal bound in the estimate from step 4.1.
Given , set
By [F4], choose so that . For , step 3.1 and the eventual monotonicity of reciprocals give . Using in (1),
Both sides before squaring are nonnegative, so . [step 3.1, step 4.1, F4]
Since is Banach, for some ; the minimizing bounds and triangle inequality show that this limit realizes the infimum.
The triangle inequality gives
Given , step 3.1, [F4], and convergence let us make the two terms on the right smaller than and , respectively. Thus for every , while is a lower bound, so . [step 1.2, step 2.1, step 3.1, step 5.1, F1, F4, F5]
Set . Then , and because ; real variations, and then the variation over the complex field, prove that is orthogonal to the kernel.
For and , minimality of and give
\|z-tu\|^2-\|z\|^2 =t^2\|u\|^2-2t\operatorname{Re}\langle z,u\rangle\ge0.\tag{2}
If , then and taking makes the right side of (2) negative. Hence . Over , apply the same conclusion to ; the linear-first convention gives , whose real part is . Thus in either scalar field for every . [step 2.1, step 6.1, F1]
For arbitrary , subtracting puts the remainder in the kernel and yields the unique representing vector.
Indeed, the vector lies in . Step 7.1 and conjugate symmetry give , so
Consequently, with ,
If another vector represented , then for all ; choosing and using positive definiteness gives . [step 7.1, F1]
Cauchy–Schwarz supplies the upper bound, and evaluation at the normalized representing vector supplies equality and norm attainment.
By [F7], , so . Conversely the unit vector satisfies
where the last number is positive real. Thus , and attains its norm at . Together with the zero case in step 1.1, this proves every clause, including both scalar fields and the zero Hilbert space. [step 1.1, step 8.1, F1, F2, F7] ∎
Remarks
The construction is a local proof of the Riesz representation needed for this example; it does not cite the later Hilbert-space geometry page. The argument is choice-free except for the one -indexed selection in step 3.1, which is why the statement explicitly assumes .