Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-14
How statement and proof provenance work

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

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

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

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

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

42 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources