Alphabeta Math
Pipeline-generated
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

Reflexivity and Eberlein Smulian — Examples

1 · Prerequisites

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 Lp and p spaces, whereas c0 and the selected 1 endpoint are nonreflexive. The canonical c0c0 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 1 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

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

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 0<ε2 the parallelogram identity gives the modulus

δ(ε)=11ε2/4.

Facts & Assumptions

Given: A real or complex inner product space H, complete for its induced norm, and a real number 0<ε2.

[F1]

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 x=x,x (The norm v=v,v induced by a real or complex inner product).

[F2]

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

[F3]

A normed space complete for its norm metric is Banach (Banach space). Such a space is uniformly convex exactly when for every ε(0,2] a positive δ gives the required midpoint drop for every pair in its closed unit ball (Uniformly convex Banach space).

[F4]

Every nonnegative real has a unique nonnegative square root, and squaring is strictly increasing on the nonnegative reals (Square roots exist: a unique a0 with (a)2=a; the positives are {x2:x0}, Squaring is monotone on the nonnegatives).

Proof

technique · Expand the two squared inner-product norms, then read an explicit positive modulus from the parallelogram identity
1.1

By [F2], the induced function is a norm. The assumed completeness and [F3] therefore make H a real or complex Banach space. This also covers the zero Hilbert space.

F2F3given
1.2

For arbitrary x,yH, expand with [F1]: x+y2=x2+x,y+y,x+y2, while xy2=x2x,yy,x+y2. Adding cancels the two cross terms, over both scalar fields, and gives x+y2+xy2=2x2+2y2.

F1
2.1

Now let x,y lie in the closed unit ball and suppose xyε. By [F2] and step 1.2, x+y22=x2+y22xy241ε24. The radicand r=1ε2/4 belongs to [0,1) because 0<ε2. Let s=r0 as in [F4]. If s1, then either s=1 or strict monotonicity of squaring gives s2>1, whereas s2=r<1; hence s<1. Since both (x+y)/2 and s are nonnegative, their squared inequality and strict monotonicity of squaring give x+y2s=1δ(ε). Thus δ(ε)=1s>0. At ε=2, r=s=0 and δ(2)=1.

step 1.2F2F4given
3.1

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 H is uniformly convex. No choice principle is used: the square root in the displayed formula is unique by [F4].

step 1.1step 2.1F3F4

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.

ExampleConstruction: AI-adaptedVerification: AI-adaptedaudited 2026-09-14Open item page →

Reflexivity of p and Lp

Statement

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

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

Facts & Assumptions

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

[F1]

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

[F2]

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

[F4]

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

[F5]

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

Proof

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

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

F1given
1.2

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

F3given
1.3

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

F4

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

2.1

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

step 1.1F2

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

3.1

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

step 1.1step 2.1step 1.2step 1.3F1F3F5

Remarks

Source notes

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

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

c0 is not reflexive

Statement

The Banach spaces c0(R) and c0(C) are not reflexive. Under the standard bilinear sequence dualities, their canonical bidual maps are the proper inclusions

c0(K)(K).

Facts & Assumptions

Given: A scalar field K{R,C}.

[F1]

The supremum-norm space c0(K) is Banach without choice (Real and complex c0 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).

[F2]

Bilinear sequence pairing gives the isometric identification c0(K)=1(K). The dual of real 1 is real , and the dual of complex 1 is complex , with the same no-conjugation pairing (The continuous dual of c0 is ell-one, Counting measure specializes the representation theorem to p and q, The complex continuous dual of ell-one is ell-infinity).

[F3]

The space c0 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

technique · Compute canonical evaluation under the two published sequence-duality identifications and exhibit a missing bidual element
1.1

Let T:1(K)c0(K) be the isometric bijection from [F2], so T(a)(x)=n=0anxn. Identify (1(K)) with (K) through [F2]. Both identifications use this bilinear series pairing, including over C.

F2given
2.1

For xc0 and a1, Jc0(x)(T(a))=T(a)(x)=n=0anxn. The functional on the right is represented, under the second identification in step 1.1, by the bounded sequence x itself. Hence the composite c0Jc0c0 is precisely the canonical inclusion xx.

step 1.1F2
3.1

The constant sequence 1=(1,1,) lies in , has norm one, and does not tend to zero. Thus [F3] gives 1c0, so step 2.1 exhibits a concrete member of c0 outside the range of Jc0.

step 2.1F3
4.1

The canonical map is not onto. Since c0(K) 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.

step 2.1step 3.1F1
CounterexampleConstruction: AI-generatedVerification: AI-generatedjudge pass (gpt-5.6-terra)audited 2026-09-14Open item page →

Weak and norm topologies differ on 1 despite identical convergent sequences

Statement

On each of the infinite-dimensional spaces 1(R) and 1(C), 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 K{R,C} and X=1(K).

[F1]

The weak topology is generated by finite intersections of inverse images of scalar open sets under members of X; it is contained in the norm topology (Weak topology on a normed space).

[F2]

The norm induces the metric d(x,y)=xy, 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).

[F3]

The coordinate sequences en belong to 1(K) and satisfy en1=1; finite coordinate sums have their usual 1 norm (Finite truncations approximate null and summable sequences).

[F4]

If a linear map has finite-dimensional domain, then its domain dimension is its nullity plus its rank (Rank-nullity: dimFV=nullityT+rankT).

[F5]

Both real and complex 1 have the Schur property: weak convergence of sequences implies norm convergence (Real and complex ell one have the Schur property).

Refutation

technique · Assume the norm-open unit ball were weakly open; a finite basic weak neighborhood inside it would contain a nonzero common kernel and all its scalar multiples
1.1

Let B={xX:x1<1}. It is norm-open by [F2]. Suppose for contradiction that it is weakly open. Since 0B, [F1] supplies a finite basic weak neighborhood U=j=1mfj1(Vj) with 0UB, where fjX and each scalar-open Vj contains zero. The case m=0 means U=X and already contradicts UB, since 2e0B.

F1F2F3assume-contra
2.1

Assume m1. Let E=span{e0,,em} and define the linear map A:EKm,A(x)=(f1(x),,fm(x)). The coordinate vectors are linearly independent by their explicit coordinates, so dimE=m+1, whereas rankAm. Rank--nullity [F4] therefore gives a nonzero vkerA.

F3F4step 1.1
3.1

For every scalar λ, each fj(λv)=0Vj, so λvU. Since v0, choose the positive real scalar λ=2/v1. Absolute homogeneity gives λv1=2, hence λvB. This contradicts UB.

step 1.1step 2.1F2discharge-contradiction: step 1.1
4.1

Thus the norm-open ball B is not weakly open. Since [F1] says the weak topology is contained in the norm topology, the containment is strict over both scalar fields.

step 1.1step 3.1F1
5.1

Norm convergence implies weak convergence because the weak topology is coarser by [F1]. Conversely, [F5] turns every weakly convergent sequence in X 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.

F1F5step 4.1
6.1

The witness uses m+1 explicit coordinate vectors for an arbitrary finite list of m 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.

step 1.1step 2.1step 3.1step 5.1F3F4
RemarkRemark: Literature-sourcedProof: Not applicableaudited 2026-09-14 sources checked 2026-09-14 not proved hereOpen item page →
Recorded, not proved here. This statement is included so the library can refer to it honestly, with a citation to the literature. It is not proved anywhere in this library: the track that would prove it has not been developed here yet.

Complex Bishop--Phelps for general convex sets

Statement

Lomonosov constructed a complex Banach space X1 and a closed bounded convex set S1X1 having no support points. Here a support point is a point xS1 at which some nonzero complex-linear functional attains

supyS1f(y).

Equivalently in his construction, the zero functional is the only functional whose modulus attains its supremum on S1.

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 H. Lemmas 1--2 and Theorem 1 use powers, the maximum-modulus principle, a norm-preserving extension to C(M) 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 S1 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.

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

Norm-attaining functionals on a Hilbert space

Statement

Assume the Axiom of Countable Choice. Let H be a real or complex Hilbert space, meaning an inner product space complete for its induced norm. Every bounded linear functional fH attains its norm on the closed unit ball. More precisely, if f0, then there is a unique yH{0} such that

f(x)=x,y(xH),

and f attains its norm at y/y. The zero functional is represented by y=0 and attains its norm at every point of the closed unit ball.

Facts & Assumptions

Given: The Axiom of Countable Choice ACω, a real or complex Hilbert space H, and a bounded linear functional fH.

[F1]

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 x=x,x (The norm v=v,v 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).

[F2]

Completeness for the norm metric makes H a Banach space (Banach space). The dual H consists of bounded scalar-linear functionals and has norm f=supx1f(x) (The dual space X^* of a normed space and its dual norm). Consequently f(x)fx for every xH.

[F3]

Every nonempty real set bounded below has an infimum, and if d is that infimum then for every η>0 the set contains a point smaller than d+η (Every nonempty set bounded below has an infimum, Epsilon characterisation of the infimum).

[F4]

For every positive real η some reciprocal 1/n is smaller than η (For every ε>0 in a complete ordered field there is a natural n1 with 1/n<ε).

[F5]

A closed linear subspace of a Banach space is Banach (A closed subspace of a Banach space is Banach).

[F6]

Countable Choice selects one element from every member of an N-indexed family of nonempty sets (The Axiom of Countable Choice (ACω)). It is used below only to select the countable sequence of approximate minimizers.

[F7]

Cauchy–Schwarz gives x,yxy in either scalar field (Cauchy–Schwarz: u,vuv, with equality exactly for linearly dependent vectors).

Proof

technique · Construct the Riesz vector as the shortest point of an affine hyperplane, proving existence of that point from a countably chosen minimizing sequence and the parallelogram identity
1.1

If f=0, take y=0. Then f(x)=x,0 and f=0=f(x) for every x in the closed unit ball, including x=0 when H={0}. Hence assume from now on that f0; in particular H{0} and f>0.

F1F2
1.2

Choose wH with f(w)0 and put v=w/f(w), so f(v)=1. Let M=kerf. It is a linear subspace, and the following estimate proves that it is closed and hence Banach.

F1F2F5

Indeed, if xM, then

r=f(x)2f>0,

and hx<r implies

f(h)f(x)f(hx)>f(x)fr=f(x)2>0.

Thus the open ball B(x,r) misses M, so the complement of M is open. By [F5], M is therefore a Banach space with the restricted norm. [F1, F2, F5]

2.1

The set D={vu:uM} is nonempty (take u=0) and bounded below by 0, so [F3] gives d=infD; the functional estimate below also proves that this infimum is positive.

step 1.2F2F3

For every uM,

1=f(vu)fvu,

and hence d1/f>0. [step 1.2, F2, F3]

3.1

For each natural n, define the following set of approximate minimizers and use Countable Choice to select from all of them.

step 2.1F3F6

An={uM:vu<d+1n+1}.

Each An is nonempty by [F3]. Apply ACω once to this family and choose mnAn for every n. Thus, with rn=vmn,

drn<d+1n+1.

This is the sole use of choice in the proof. [F3, F6]

4.1

Put an=vmn. Expanding squared norms and using that the kernel contains midpoints gives the estimate below.

step 2.1step 3.1F1

anak2+an+ak2=2an2+2ak2.

Since (mn+mk)/2M, the definition of d gives (an+ak)/2d. 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]

5.1

The sequence (mn) is Cauchy by the following explicit use of the reciprocal bound in the estimate from step 4.1.

step 3.1step 4.1F4

Given ε>0, set

η=min{1,ε28d+4}>0.

By [F4], choose N so that 1/(N+1)<η. For n,kN, step 3.1 and the eventual monotonicity of reciprocals give rn,rk<d+η. Using η1 in (1),

mnmk2<4(d+η)24d2=8dη+4η2(8d+4)ηε2.

Both sides before squaring are nonnegative, so mnmk<ε. [step 3.1, step 4.1, F4]

6.1

Since M is Banach, mnm for some mM; the minimizing bounds and triangle inequality show that this limit realizes the infimum.

step 1.2step 2.1step 3.1step 5.1F1F4F5

The triangle inequality gives

dvmvmn+mnm.

Given ε>0, step 3.1, [F4], and convergence let us make the two terms on the right smaller than d+ε/2 and ε/2, respectively. Thus vm<d+ε for every ε>0, while d is a lower bound, so vm=d. [step 1.2, step 2.1, step 3.1, step 5.1, F1, F4, F5]

7.1

Set z=vm. Then f(z)=1, and z0 because z=d>0; real variations, and then the iu variation over the complex field, prove that z is orthogonal to the kernel.

step 2.1step 6.1F1

For uM and tR, minimality of m and m+tuM give

\|z-tu\|^2-\|z\|^2 =t^2\|u\|^2-2t\operatorname{Re}\langle z,u\rangle\ge0.\tag{2}

If Rez,u0, then u0 and taking t=Rez,u/u2 makes the right side of (2) negative. Hence Rez,u=0. Over C, apply the same conclusion to iuM; the linear-first convention gives z,iu=iz,u, whose real part is Imz,u. Thus in either scalar field z,u=0 for every uM. [step 2.1, step 6.1, F1]

8.1

For arbitrary xH, subtracting f(x)z puts the remainder in the kernel and yields the unique representing vector.

step 7.1F1

Indeed, the vector u=xf(x)z lies in M. Step 7.1 and conjugate symmetry give u,z=0, so

x,z=f(x)z2.

Consequently, with y=z/z2,

f(x)=x,y(xH).

If another vector y represented f, then x,yy=0 for all x; choosing x=yy and using positive definiteness gives y=y. [step 7.1, F1]

9.1

Cauchy–Schwarz supplies the upper bound, and evaluation at the normalized representing vector supplies equality and norm attainment.

step 1.1step 8.1F1F2F7

By [F7], f(x)xy, so fy. Conversely the unit vector x0=y/y satisfies

f(x0)=yy,y=y,

where the last number is positive real. Thus f=y=f(x0), and f attains its norm at x0. 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 N-indexed selection in step 3.1, which is why the statement explicitly assumes ACω.

Sources