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.

Hilbert Space Geometry and Riesz Representation — Examples

1 · Prerequisites

2 · Summary

The companion computes the projection in elementary models: the standard inner products on coordinates, on square-summable sequences and on quotient L2, the Gram-matrix formula for a finite-dimensional subspace with its invertibility and basis independence, the mean as the projection onto the constants, and the distance formula dist(x,M)=xPMx with its Pythagoras identity. It exhibits boundary phenomena as well: an inner-product space that is not complete, a norm that fails the parallelogram law for every exponent other than the Hilbertian one, and a nearest-point map to a closed convex set that is neither additive nor homogeneous. Adjoint computations for the shift, for multiplication by a bounded function and for an integral operator with square integrable kernel close the page, using the complex L2 pairing, Hölder's inequality and Fubini for the kernel case.

3 · Logical flowchart

4 · Definitions, theorems and proofs

None yet.

5 · Examples, counterexamples and false statements

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

The standard inner products make K n, ell two and quotient L two Hilbert spaces

Example

Assume the Axiom of Countable Choice. Let K be R or C and let (X,A,μ) be a measure space. Then the following are real or complex Hilbert spaces with the displayed first-variable-linear pairings, whose induced lengths are the standard norms:

  1. Kn with x,y=j<nxjyj, for each natural n;
  2. 2(N;K) with x,y=k0xkyk;
  3. the quotient L2(μ;K) with [f],[g]=Xfgdμ.

In the real case conjugation is the identity, so the pairings read xy=jxjyj and fgdμ.

Facts & Assumptions

[A1]

In a real or complex inner-product space the pairing is linear in the first argument and conjugate-linear and conjugate-symmetric in the second, positive definite, and the induced length is the square root of the diagonal pairing (Real and complex inner-product spaces and their induced length).

[A2]

For complex scalars z2=zz0 with z=0 exactly for z=0, and zw=zw (Conjugation is an involutive real-field automorphism, zz=z2, and modulus is definite, multiplicative, and subadditive). The real field embeds in the complex field (C=R[x]/(x2+1) is a field, every element is uniquely a+bi, and every nonzero element has inverse (abi)/(a2+b2)); for an embedded real t, conjugation fixes t and the complex modulus is t2, the real absolute value (Real and imaginary parts, complex conjugation, and modulus). Thus these same identities restrict to real scalars.

[A3]

A normed space admitting a finite basis is a Banach space (Every finite-dimensional normed space is Banach), the induced length of an inner product is a norm (The induced length is a norm), and a Hilbert space is an inner-product space complete for its induced norm (Hilbert space).

[A4]

On (N,P(N),#) every scalar function is measurable, and the counting-measure dictionary gives f2d#=kf(k)2 (p is the Lp space of counting measure). Applying the same nonnegative identity to the positive and negative parts of the real and imaginary parts of an integrable complex function gives its absolutely convergent series as its integral, by the defining real/complex integral formulas (Integrable real and complex functions, and their integrals). Almost-everywhere equality is equality everywhere, since only the empty set has zero counting measure (p is the Lp space of counting measure, Counting measure on an arbitrary set).

[A5]

On the quotient L2(μ;C) the pairing [f],[g]=fg is representative-independent and satisfies the inner-product axioms, with f,f=f22 (The complex L2 pairing is well-defined and satisfies Cauchy–Schwarz).

[A6]

Under countable choice, complex Lp is complete and the complex L2 pairing and its Cauchy–Schwarz inequality are available; the real Lp spaces are complete for the same hypothesis (Complex completeness, density, and inner product: the consumer interface, Riesz-Fischer completeness of Lp for 1p, The space Lp(μ) as the quotient by null functions).

[A7]

Countable Choice is the hypothesis used by the cited Lp completeness theorems; the complex L2 pairing theorem [A5] itself is choice-free (The Axiom of Countable Choice (ACω)).

Verification

technique · direct

Given: A scalar field K{R,C}, a natural n and a measure space (X,A,μ).

1.1

On Kn the displayed pairing is linear in the first argument and conjugate symmetric by distributing each finite sum and applying the scalar conjugation identities of [A2], and positive definite because j<nxj2=0 forces every xj=0 and hence every xj=0 by [A2]; the induced length is (j<nxj2)1/2, a norm by [A3]. The coordinate vectors ej, j<n, span by x=j<nxjej and are independent by reading each coordinate, hence form an ordered basis (the empty basis if n=0). The finite-basis completeness theorem [A3] therefore applies; so Kn is a Hilbert space for this pairing.

A1A2A3
1.2

On 2(N;K) the pairing is the counting-measure integral of fg by [A4], so x,y=k0xkyk with absolutely convergent series, since 2xkykxk2+yk2 and [A4] applies to the summable right-hand side; the complex case is [A5] and the real case is the restriction of [A5] to real-valued classes, where conjugation is the identity, so in both cases the axioms of [A1] hold and the induced length is the 2 norm; completeness is the counting-measure instance of [A6].

A1A4A5A6A7
1.3

On the quotient L2(μ;K) the displayed pairing is well defined on a.e. classes and satisfies the inner-product axioms with [f],[f]=[f]22 by [A5] in the complex case and by the same statement restricted to real-valued classes in the real case, and completeness is [A6].

A1A5A6A7
2.1

Hence Kn, 2(N;K) and L2(μ;K) are inner-product spaces complete for the induced norms, that is Hilbert spaces, with the pairings displayed in the statement.

step 1.1step 1.2step 1.3A3
ExampleConstruction: AI-adaptedVerification: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-22Open item page →

Projection onto a finite-dimensional subspace by a Gram matrix

Example

Assume the Axiom of Countable Choice. Let H be a real or complex Hilbert space, let v1,,vn be a linearly independent finite list in H, put M=span{v1,,vn}, and for xH set

Gij=vi,vj,bi=x,vi(1i,jn).

Then M is closed, and the Hilbert projection of x onto M is

PMx=j=1ncjvj,where cKn is the unique solution of GTc=b.

The result does not depend on the chosen independent spanning list: any other such list produces the same vector PMx and its own unique coefficient vector solving the corresponding system.

Facts & Assumptions

[A2]

A finite-dimensional subspace of a normed space is closed, and the Hilbert projection PM is characterised by PMxM and xPMxM (A finite-dimensional normed subspace is closed, The Hilbert orthogonal projection onto a closed subspace).

[A3]

S={v:v,s=0 for all sS} and the pairing is linear in the first argument and conjugate-linear in the second (Orthogonality and the orthogonal complement, The Hilbert orthogonal projection onto a closed subspace).

[A4]

Countable Choice is the hypothesis under which the Hilbert projection is defined (The Axiom of Countable Choice (ACω)).

Verification

technique · direct

Given: Countable Choice, a Hilbert space H, an independent list v1,,vnH, its span M and a vector xH.

1.1

The Gram matrix G is invertible by [A1], so GT is invertible and c=(GT)1b is the unique solution of GTc=b; and M is closed by [A2].

A1A2A4
2.1

With m=jcjvjM one has xm,vi=x,vijcjvj,vi=bi(GTc)i=0 for every i, and hence xm,w=0 for every w=iaiviM by conjugate-linearity in the second argument.

A3step 1.1algebra
3.1

Therefore mM and xmM, so m satisfies the two defining properties of the Hilbert projection and PMx=m=jcjvj.

step 1.1step 2.1A2
4.1

Basis independence and uniqueness: if w1,,wn is another independent list with the same span M, its Gram matrix again has nonzero determinant and the same argument gives PMx as a linear combination of the wi with the unique coefficient vector solving the corresponding system; since PMxM is the same vector, the two displayed formulas agree, and the coefficient vector is unique because GT is invertible.

step 3.1A1A2
ExampleConstruction: AI-adaptedVerification: AI-adaptedaudited 2026-09-22Open item page →

Projection onto the constants is the mean

Example

Assume the Axiom of Countable Choice. Let (X,A,μ) be a measure space with 0<μ(X)<, let K be R or C, and let ML2(μ;K) be the one-dimensional subspace of classes of constant functions, spanned by 1 with [f],[1]=Xfdμ. Then M is closed and the Hilbert projection of [f] onto M is

PM[f]=(1μ(X)Xfdμ)[1],

the mean of f; in particular PM[f] is the unique constant c with X(fc)dμ=0.

Facts & Assumptions

[A1]

L2(μ;K) with the pairing [f],[g]=fg is a Hilbert space under countable choice, and the constants form a finite-dimensional, hence closed, subspace (The standard inner products make K n, ell two and quotient L two Hilbert spaces, A finite-dimensional normed subspace is closed).

[A2]

Cauchy–Schwarz bounds fgf2g2; in particular Xfdμ=[f],[1] is finite when μ(X)< (Cauchy-Schwarz inequality for L2, The complex L2 pairing is well-defined and satisfies Cauchy–Schwarz).

[A3]

The Hilbert projection is characterised by PM[f]M and [f]PM[f]M (The Hilbert orthogonal projection onto a closed subspace).

[A4]

Countable Choice is the standing choice hypothesis (The Axiom of Countable Choice (ACω)), while existence and uniqueness of the projection onto a closed subspace are supplied by the Hilbert-projection interface (The Hilbert orthogonal projection onto a closed subspace).

Verification

technique · direct

Given: Countable Choice, a measure space with 0<μ(X)<, a class [f]L2(μ;K) and the constants M=span{[1]}.

1.1

The integral Xfdμ is finite by [A2], the constant μ(X) is finite and positive, and M is a closed one-dimensional subspace by [A1].

A1A2A4
2.1

Put c0=μ(X)1Xfdμ and m=c0[1]; then mM and [f]m,[1]=X(fc0)dμ=Xfdμc0μ(X)=0, so [f]mM.

step 1.1A3algebra
3.1

By the characterisation of the Hilbert projection, PM[f]=m=(μ(X)1Xfdμ)[1]; conversely, any constant c with X(fc)dμ=0 has [f]c[1]M, so c=c0 by uniqueness of the projection, and for a probability measure the constant is the mean of f.

step 2.1A3
ExampleConstruction: AI-adaptedVerification: AI-adaptedaudited 2026-09-22Open item page →

Distance to a closed subspace

Example

Assume the Axiom of Countable Choice. Let M be a closed linear subspace of a real or complex Hilbert space H, let xH and let PM be the Hilbert projection. Then for every mM

xm2=xPMx2+PMxm2,

and consequently

dist(x,M)=infmMxm=xPMx,

the infimum being attained uniquely at m=PMx.

Facts & Assumptions

[A1]

PMxM and xPMxM, and M is a linear subspace (The Hilbert orthogonal projection onto a closed subspace).

[A2]

For pairwise orthogonal vectors u+v2=u2+v2 (Pythagoras and finite orthogonal sums).

[A3]

A vector of M is orthogonal to every vector of M, and M is closed under addition (Orthogonality and the orthogonal complement).

[A4]

Countable Choice is the hypothesis under which PM is defined (The Axiom of Countable Choice (ACω)).

Verification

technique · direct

Given: Countable Choice, a closed subspace M of a Hilbert space H, a vector x and the projection PMx.

1.1

For mM write xm=(xPMx)+(PMxm); the first summand lies in M and the second in M, so the two are orthogonal and Pythagoras gives xm2=xPMx2+PMxm2.

A1A2A3A4
2.1

Since PMxm20, step 1.1 gives xmxPMx for every mM, with equality exactly at m=PMx; hence the infimum of the distances is xPMx, attained uniquely there.

step 1.1A1
CounterexampleConstruction: AI-adaptedVerification: AI-adaptedaudited 2026-09-22Open item page →

An inner-product space need not be complete

Statement refuted

Every inner-product space is complete for its induced norm.

Facts & Assumptions

[A1]

The p-series m11/m2 converges, and a convergent sequence of reals is Cauchy (For rational p>0, 1/kp converges iff p>1, Every convergent sequence is Cauchy, Limits and Cauchy sequences of reals).

[A2]

On counting measure the integral of f2 is the series of the f(k)2, and almost-everywhere equality is equality everywhere, so the norm of a finitely supported sequence is (kxk2)1/2 (p is the Lp space of counting measure, Counting measure on an arbitrary set).

[A3]

The pairing is linear in the first argument, conjugate-linear in the second and positive definite, and Cauchy–Schwarz gives x,yxy (Real and complex inner-product spaces and their induced length, Cauchy–Schwarz: x,yxy, with equality exactly for dependent pairs).

[A4]

A metric space is complete when every Cauchy sequence converges in it, and a Hilbert space is complete for its induced norm (Complete metric space: every Cauchy sequence converges in the space, Hilbert space).

Counterexample

technique · direct

Given: The space c00 of finitely supported real or complex sequences with the pairing x,y=kxkyk, a finite sum for x,yc00.

1.1

The pairing is an inner product on c00: linearity in the first argument and conjugate symmetry are finite-sum algebra, and x,x=kxk2=0 forces every coordinate xk to vanish; the induced length is the 2 norm of the finitely supported sequence.

A2A3
1.2

Let u(N) be the sequence with uk(N)=1/(k+1) for k<N and uk(N)=0 for kN; each u(N) lies in c00, and for M>N one has u(M)u(N)2=Nk<M1/(k+1)2=N<mM1/m2, a difference of partial sums of the convergent p-series, which tends to 0 as N,M by [A1]; hence (u(N)) is Cauchy in the 2 norm.

A1A2
2.1

Suppose vc00 were a limit of (u(N)) in the induced norm; then for each fixed k, Cauchy–Schwarz applied to vu(N) and the k-th coordinate vector gives vkuk(N)vu(N), so vk=limNuk(N)=1/(k+1) for every k, and v has infinitely many nonzero coordinates, contrary to finite support.

step 1.2A3
3.1

Hence the Cauchy sequence (u(N)) in the inner-product space c00 has no limit there, so c00 is not complete for its induced norm, and the statement that every inner-product space is complete is false.

step 1.1step 2.1A4
CounterexampleConstruction: AI-adaptedVerification: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-22Open item page →

A norm need not satisfy the parallelogram law

Statement refuted

Every norm on a real vector space containing two linearly independent vectors is induced by an inner product, equivalently satisfies the parallelogram law.

Facts & Assumptions

[A1]

A norm is induced by an inner product if and only if it satisfies the parallelogram law x+y2+xy2=2x2+2y2 (Jordan–von Neumann: a norm is induced by an inner product exactly when it satisfies the parallelogram law).

[A2]

For 1p< the space p is the quotient Lp(#) of counting measure on N, whose norm is fp=(fpd#)1/p=(kakp)1/p, while f=supkak; almost-everywhere equality is equality everywhere (p is the Lp space of counting measure, The space Lp(μ) as the quotient by null functions, Counting measure on an arbitrary set).

[A3]

Rational powers of a fixed base b>1 are strictly increasing in the exponent, and satisfy (br)s=brs and br+s=brbs (Monotonicity of rar and of aar, Laws of rational exponents, Rational powers ar of a positive base).

Counterexample

technique · direct

Given: A rational p with 1p<, p2, and the coordinate vectors e1,e2 of the sequence space p, together with the case of the supremum norm .

1.1

In p the function f=e1+e2 has fp=1 at the two indices 0,1 and 0 elsewhere, so e1+e2p=(1+1)1/p=21/p, and likewise e1e2p=21/p because f=1 at the same two indices; in the two norms are e1±e2=1.

A2A3
2.1

The parallelogram law in p would therefore read 222/p=4, that is 22/p=2=21, which by strict monotonicity of the rational powers of base 2 forces 2/p=1, that is p=2; for p2 it fails, and in the two sides are 2 and 4, so it fails there too.

step 1.1A3algebra
3.1

By the Jordan–von Neumann characterisation, the norm of p with p2, and the supremum norm of , are therefore not induced by any inner product on a space containing the two linearly independent coordinate vectors: the parallelogram law fails on e1,e2, and it would hold on every pair of vectors if an inducing inner product existed.

step 2.1A1A4
CounterexampleConstruction: AI-adaptedVerification: AI-adaptedaudited 2026-09-22Open item page →

Nearest-point maps to convex sets need not be linear

Statement refuted

The nearest-point map PC of a nonempty closed convex set C in a Hilbert space is linear.

Facts & Assumptions

[A1]

R with the pairing (s,t)st is a real inner-product space whose induced norm is the absolute value (Real and complex inner-product spaces and their induced length, A norm on a real vector space, the induced metric, and the dictionary with the metric axioms), and it is complete, hence a Hilbert space (Complete metric space: every Cauchy sequence converges in the space, Banach space, Hilbert space).

[A2]

A set C is convex when (1t)u+tvC for all u,vC and 0t1, and the nearest point of a nonempty closed convex subset of a Hilbert space is the point minimising the distance (Convex sets and continuous real-hyperplane separation in a normed space, Hilbert space).

Counterexample

technique · direct

Given: The Hilbert space R of [A1] and the closed convex set C=[0,).

1.1

C is closed and convex, and is nonempty with 0C.

A1A2
2.1

For t0 the point c=t lies in C with tc=0, so PC(t)=t; for t<0 and any cC one has tc=ctt=t0 with equality exactly at c=0, so PC(t)=0.

step 1.1A1A2algebra
3.1

Hence PC(t)=max{t,0}; this map is not additive, since PC(1)+PC(1)=1+0=10=PC(0), and it is not homogeneous either, since PC(1)=01=PC(1).

step 2.1algebra
4.1

Therefore the nearest-point map of a nonempty closed convex set in a Hilbert space need not be linear, so the statement refuted is false.

step 3.1
ExampleConstruction: AI-adaptedVerification: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-22Open item page →

Adjoints of shifts, multiplication and integral operators

Example

Assume the Axiom of Countable Choice. Then:

  1. On 2(N;K) the right shift S(x0,x1,x2,)=(0,x0,x1,) has Hilbert adjoint the left shift L(y0,y1,y2,)=(y1,y2,y3,).
  2. For mL(X,μ;C) the multiplication operator Mm[f]=[mf] on complex L2(μ) is bounded and Mm=Mm.
  3. Let (X,A,μ) and (Y,B,ν) be σ-finite measure spaces and let k represent a class in L2(μ×ν;C). Then (Kf)(x)=Yk(x,y)f(y)dν(y) defines a bounded operator K:L2(ν)L2(μ) independently of the representatives of k and f, and its adjoint is Kg(y)=Xk(x,y)g(x)dμ(x).

Facts & Assumptions

[A1]

The Hilbert adjoint of T is the unique operator with Tx,y=x,Ty (The Hilbert-space adjoint of a bounded operator).

[A2]

2 carries the first-variable-linear pairing x,y=kxkyk and is a Hilbert space; the complex L2 pairing is f,g=fg with Cauchy–Schwarz f,gf2g2 (The standard inner products make K n, ell two and quotient L two Hilbert spaces, Complex completeness, density, and inner product: the consumer interface, Complex Lp classes and Euclidean test-function conventions).

[A3]

For mL and fL2 the product mf lies in L2 with mf2mf2 (Complex Holder, Minkowski, and the quotient norm).

[A4]

On a σ-finite product, Tonelli applies to nonnegative measurable functions and Fubini to L1 functions, with the iterated integrals equal to the product integral (Tonelli's theorem for nonnegative measurable functions on a sigma-finite product, Fubini's theorem for L^1 functions on a sigma-finite product, Finite, sigma-finite, and semifinite measures).

[A5]

Countable Choice is the hypothesis under which the adjoint and the L2 completions are available (The Axiom of Countable Choice (ACω)).

Verification

technique · direct

Given: The spaces and operators of the statement.

1.1

For x,y2 the series in Sx,y=n0(Sx)nyn=n1xn1yn=k0xkyk+1=x,Ly converge absolutely by Cauchy–Schwarz, so S=L by uniqueness of the adjoint.

A1A2
1.2

The multiplication operator satisfies Mmf2mf2 by [A3], and Mmf,g=mfg=fmg=f,Mmg for all f,gL2, so Mm is bounded with Mm=Mm.

A1A2A3
1.3

For fL2(ν) put h(x):=(Yk(x,y)2dν(y))1/2[0,+]. Wherever the section integral converges absolutely, the Cauchy–Schwarz inequality in the y-variable gives Yk(x,y)f(y)dν(y)Yk(x,y)f(y)dν(y)h(x)f2; by Tonelli [A4] applied to the nonnegative (μ×ν)-measurable function k2, the function h2 is μ-measurable with Xh(x)2dμ(x)=k22<+, so hL2(μ) and h(x)<+ for μ-almost every x. Hence (Kf)(x)=Yk(x,y)f(y)dν(y) is defined and finite for μ-almost every x, and it is μ-measurable after zero extension: Tonelli [A4] makes the section integrals of the positive and negative parts of Re(kf) and Im(kf) μ-measurable, and on the conull set where the integral of kf is finite the real and imaginary parts of (Kf)(x) are differences of these measurable functions. Since Kfhf2 almost everywhere and hf2L2(μ), the class of Kf lies in L2(μ) with Kf2k2f2. Finally, if k=k and f=f almost everywhere, then the function (x,y)k(x,y)f(y)k(x,y)f(y) is nonnegative and measurable with vanishing product integral, so for μ-almost every x its section vanishes ν-almost everywhere by Tonelli [A4], that is, Kf=Kf μ-almost everywhere.

A2A4
2.1

For fL2(ν) and gL2(μ) the function (x,y)k(x,y)f(y)g(x) lies in L1(μ×ν): with h as in step 1.3, Tonelli and Cauchy–Schwarz in L2(μ) give X×Yk(x,y)f(y)g(x)d(μ×ν)=Xg(x)(Yk(x,y)f(y)dν(y))dμ(x)f2Xh(x)g(x)dμ(x)f2h2g2=k2f2g2<+. Hence Fubini [A4] applies and Kf,g=XYk(x,y)f(y)g(x)dν(y)dμ(x)=Yf(y)Xk(x,y)g(x)dμ(x)dν(y)=f,Kg with Kg(y)=Xk(x,y)g(x)dμ(x); applying the same estimate to the conjugate kernel k, which also lies in L2(μ×ν) with the same norm, gives Kg2k2g2, so K is a bounded operator and is the Hilbert adjoint of K.

step 1.3A1A2A4
3.1

Steps 1.1, 1.2 and 2.1 exhibit the three displayed adjoints, so the claimed formulas hold, under the countable-choice hypothesis recorded in [A5].

step 1.1step 1.2step 2.1A5

Sources