Skip to content
homeaboutworkprojectsthesiswritingresume
Loading
~/blog/inner-product-spaces0%dark
  1. home/
  2. writing/
  3. Inner Product Spaces

10 May 2026 · 6 min read · updated 13 June 2026

Inner Product Spaces

An inner product equips a vector space with length and angle, and so with orthogonality, the single structure that makes the geometry of projection and spectral decomposition possible. We define inner product spaces, prove the Cauchy-Schwarz inequality, show the induced norm is a norm and obeys the parallelogram law, prove the converse that a norm with the parallelogram law comes from an inner product, and prove the Pythagorean identity and Bessel's inequality for orthonormal systems. A complete inner product space is a Hilbert space, the setting of every later projection and eigenvalue argument.

  • 2 equations
  • 14 results
  • 10 connections
  • functional-analysis
  • hilbert-space
  • linear-algebra
On this page▾
  • Inner products
  • Cauchy-Schwarz and the triangle inequality
  • The parallelogram law
  • Orthogonality
  • Hilbert spaces

6 min left

  • Inner products1m
  • Cauchy-Schwarz and the triangle inequality1m
  • The parallelogram law1m
  • Orthogonality2m
  • Hilbert spaces1m

A norm measures length, but it does not by itself measure angle. The extra structure that does is an inner product, and with angle comes orthogonality, the relation the rest of the subject rests on. Two orthogonal vectors are independent in the strongest geometric sense, and projecting onto a subspace, expanding in an orthonormal basis, and diagonalising an operator all reduce to manipulating it. This post builds that geometry from the axioms and assumes the language of metric and normed spaces [1], [2]. We work over the real field throughout; the complex case differs only by conjugations.

#Inner products

Definition1

An inner product on a real vector space VVV is a function ⟨⋅,⋅⟩:V×V→R\ip{\cdot}{\cdot}:V\times V\to\R⟨⋅,⋅⟩:V×V→R that is symmetric, ⟨x,y⟩=⟨y,x⟩\ip{x}{y}=\ip{y}{x}⟨x,y⟩=⟨y,x⟩, linear in the first argument, ⟨αx+βx′,y⟩=α⟨x,y⟩+β⟨x′,y⟩\ip{\alpha x+\beta x'}{y}=\alpha \ip{x}{y}+\beta\ip{x'}{y}⟨αx+βx′,y⟩=α⟨x,y⟩+β⟨x′,y⟩, and positive definite, ⟨x,x⟩≥0\ip{x}{x}\ge 0⟨x,x⟩≥0 with equality only at x=0x=0x=0. The pair (V,⟨⋅,⋅⟩)(V,\ip{\cdot}{\cdot})(V,⟨⋅,⋅⟩) is an inner product space, and ∥x∥=⟨x,x⟩\norm{x}=\sqrt{\ip{x}{x}}∥x∥=⟨x,x⟩​ is the induced norm.

Euclidean space carries ⟨x,y⟩=∑ixiyi\ip{x}{y}=\sum_i x_iy_i⟨x,y⟩=∑i​xi​yi​. The space of square-integrable functions carries ⟨f,g⟩=∫fg\ip{f}{g}=\int fg⟨f,g⟩=∫fg, the model that the Lebesgue space L2L^2L2 makes rigorous. Symmetry and first-argument linearity together give linearity in the second argument, since ⟨x,αy+βy′⟩=⟨αy+βy′,x⟩=α⟨y,x⟩+β⟨y′,x⟩=α⟨x,y⟩+β⟨x,y′⟩\ip{x}{\alpha y+\beta y'}=\ip{\alpha y+\beta y'}{x}=\alpha\ip{y}{x}+\beta\ip{y'}{x} =\alpha\ip{x}{y}+\beta\ip{x}{y'}⟨x,αy+βy′⟩=⟨αy+βy′,x⟩=α⟨y,x⟩+β⟨y′,x⟩=α⟨x,y⟩+β⟨x,y′⟩, so the inner product is bilinear. The decisive consequence of positive definiteness is the following inequality, which binds the inner product to the norm.

#Cauchy-Schwarz and the triangle inequality

Theorem2

For all x,yx,yx,y in an inner product space, ∣⟨x,y⟩∣≤∥x∥ ∥y∥\abs{\ip{x}{y}}\le\norm{x}\,\norm{y}∣⟨x,y⟩∣≤∥x∥∥y∥, with equality if and only if xxx and yyy are linearly dependent.

Proof

If y=0y=0y=0 both sides vanish. Otherwise set t=⟨x,y⟩/∥y∥2t=\ip{x}{y}/\norm{y}^2t=⟨x,y⟩/∥y∥2 and expand the nonnegative quantity

0≤∥x−ty∥2=∥x∥2−2t⟨x,y⟩+t2∥y∥2=∥x∥2−⟨x,y⟩2∥y∥2,(1)0\le\norm{x-ty}^2=\norm{x}^2-2t\ip{x}{y}+t^2\norm{y}^2=\norm{x}^2-\frac{\ip{x}{y}^2}{\norm{y}^2}, \tag{1}0≤∥x−ty∥2=∥x∥2−2t⟨x,y⟩+t2∥y∥2=∥x∥2−∥y∥2⟨x,y⟩2​,(1)

using bilinearity. Rearranging gives ⟨x,y⟩2≤∥x∥2∥y∥2\ip{x}{y}^2\le\norm{x}^2\norm{y}^2⟨x,y⟩2≤∥x∥2∥y∥2, which is the inequality. Equality holds exactly when ∥x−ty∥2=0\norm{x-ty}^2=0∥x−ty∥2=0, that is when x=tyx=tyx=ty, the dependent case.

Proposition3

The induced norm is a norm, in particular ∥x+y∥≤∥x∥+∥y∥\norm{x+y}\le\norm{x}+\norm{y}∥x+y∥≤∥x∥+∥y∥.

Proof

Positivity and homogeneity are immediate from the definition. For the triangle inequality, note ⟨x,y⟩≤∣⟨x,y⟩∣≤∥x∥∥y∥\ip{x}{y}\le\abs{\ip{x}{y}}\le\norm{x}\norm{y}⟨x,y⟩≤∣⟨x,y⟩∣≤∥x∥∥y∥, the first since every real is at most its absolute value and the second by Theorem 2, so with bilinearity

∥x+y∥2=∥x∥2+2⟨x,y⟩+∥y∥2≤∥x∥2+2∥x∥∥y∥+∥y∥2=(∥x∥+∥y∥)2,(2)\norm{x+y}^2=\norm{x}^2+2\ip{x}{y}+\norm{y}^2\le\norm{x}^2+2\norm{x}\norm{y}+\norm{y}^2 =(\norm{x}+\norm{y})^2, \tag{2}∥x+y∥2=∥x∥2+2⟨x,y⟩+∥y∥2≤∥x∥2+2∥x∥∥y∥+∥y∥2=(∥x∥+∥y∥)2,(2)

and taking square roots finishes it.

So every inner product space is a normed space, and the Cauchy-Schwarz inequality is what makes the inner product jointly continuous, since ∣⟨x,y⟩−⟨x′,y′⟩∣≤∣⟨x−x′,y⟩∣+∣⟨x′,y′−y⟩∣≤∥x−x′∥∥y∥+∥x′∥∥y′−y∥\abs{\ip{x}{y}-\ip{x'}{y'}}\le\abs{\ip{x-x'}{y}} +\abs{\ip{x'}{y'-y}}\le\norm{x-x'}\norm{y}+\norm{x'}\norm{y'-y}∣⟨x,y⟩−⟨x′,y′⟩∣≤∣⟨x−x′,y⟩∣+∣⟨x′,y′−y⟩∣≤∥x−x′∥∥y∥+∥x′∥∥y′−y∥, which tends to 000 as (x′,y′)→(x,y)(x',y')\to(x,y)(x′,y′)→(x,y).

#The parallelogram law

Inner-product norms are special among norms. They satisfy an identity that the supremum norm, for example, does not.

Proposition4

The induced norm satisfies the parallelogram law ∥x+y∥2+∥x−y∥2=2∥x∥2+2∥y∥2\norm{x+y}^2+\norm{x-y}^2=2\norm{x}^2+2\norm{y}^2∥x+y∥2+∥x−y∥2=2∥x∥2+2∥y∥2.

Proof

Expand both squares by bilinearity. The sum is (∥x∥2+2⟨x,y⟩+∥y∥2)+(∥x∥2−2⟨x,y⟩+∥y∥2)=2∥x∥2+2∥y∥2(\norm{x}^2+2\ip{x}{y}+\norm{y}^2)+(\norm{x}^2-2\ip{x}{y}+\norm{y}^2)=2\norm{x}^2+2\norm{y}^2(∥x∥2+2⟨x,y⟩+∥y∥2)+(∥x∥2−2⟨x,y⟩+∥y∥2)=2∥x∥2+2∥y∥2, the cross terms cancelling.

The converse holds, so the parallelogram law characterises which norms come from an inner product.

Theorem5

If a norm on a real vector space satisfies the parallelogram law, then the polarisation formula ⟨x,y⟩=14(∥x+y∥2−∥x−y∥2)\ip{x}{y}=\tfrac14\big(\norm{x+y}^2-\norm{x-y}^2\big)⟨x,y⟩=41​(∥x+y∥2−∥x−y∥2) defines an inner product inducing that norm.

Proof

Symmetry and ⟨x,x⟩=∥x∥2\ip{x}{x}=\norm{x}^2⟨x,x⟩=∥x∥2 are read off the formula, and ⟨x,x⟩>0\ip{x}{x}>0⟨x,x⟩>0 for x≠0x\neq 0x=0. For additivity in the first argument, apply the parallelogram law to the pairs (x+z,y)(x+z,y)(x+z,y) and (x−z,y)(x-z,y)(x−z,y) and subtract, which yields ⟨x+z,y⟩+⟨x−z,y⟩=2⟨x,y⟩\ip{x+z}{y}+\ip{x-z}{y}=2\ip{x}{y}⟨x+z,y⟩+⟨x−z,y⟩=2⟨x,y⟩ after the norms recombine. Setting z=xz=xz=x gives ⟨2x,y⟩=2⟨x,y⟩\ip{2x}{y}=2\ip{x}{y}⟨2x,y⟩=2⟨x,y⟩ since ⟨0,y⟩=0\ip{0}{y}=0⟨0,y⟩=0, and feeding this back turns the relation into the Cauchy additivity equation ⟨u,y⟩+⟨v,y⟩=⟨u+v,y⟩\ip{u}{y}+\ip{v}{y}=\ip{u+v}{y}⟨u,y⟩+⟨v,y⟩=⟨u+v,y⟩ for all u,vu,vu,v. Additivity forces ⟨qx,y⟩=q⟨x,y⟩\ip{qx}{y}=q\ip{x}{y}⟨qx,y⟩=q⟨x,y⟩ for every rational qqq, and since t↦⟨tx,y⟩t\mapsto\ip{tx}{y}t↦⟨tx,y⟩ is continuous (it is built from the continuous norm), the identity extends to all real ttt, giving homogeneity. The form is therefore bilinear, symmetric, and positive definite, an inner product, and it induces the original norm.

Together the two results say a normed space is an inner product space exactly when its norm satisfies the parallelogram law.

#Orthogonality

Vectors xxx and yyy are orthogonal, written x⊥yx\perp yx⊥y, when ⟨x,y⟩=0\ip{x}{y}=0⟨x,y⟩=0. Orthogonality turns the triangle inequality into an equality.

Proposition6

If x⊥yx\perp yx⊥y then ∥x+y∥2=∥x∥2+∥y∥2\norm{x+y}^2=\norm{x}^2+\norm{y}^2∥x+y∥2=∥x∥2+∥y∥2. More generally, for pairwise orthogonal x1,…,xnx_1,\dots,x_nx1​,…,xn​, ∥∑ixi∥2=∑i∥xi∥2\norm{\sum_i x_i}^2=\sum_i\norm{x_i}^2∥∑i​xi​∥2=∑i​∥xi​∥2.

Proof

Expanding ∥∑ixi∥2=∑i,j⟨xi,xj⟩\norm{\sum_i x_i}^2=\sum_{i,j}\ip{x_i}{x_j}∥∑i​xi​∥2=∑i,j​⟨xi​,xj​⟩ by bilinearity, every cross term with i≠ji\neq ji=j vanishes by orthogonality, leaving ∑i⟨xi,xi⟩=∑i∥xi∥2\sum_i\ip{x_i}{x_i}=\sum_i\norm{x_i}^2∑i​⟨xi​,xi​⟩=∑i​∥xi​∥2.

A family (ei)(e_i)(ei​) is orthonormal when ⟨ei,ej⟩=δij\ip{e_i}{e_j}=\delta_{ij}⟨ei​,ej​⟩=δij​. The coefficients of a vector against an orthonormal family are its projections, and the sum of their squares cannot exceed the vector's squared norm.

Theorem7

For an orthonormal family e1,…,ene_1,\dots,e_ne1​,…,en​ and any xxx, the coefficients ci=⟨x,ei⟩c_i=\ip{x}{e_i}ci​=⟨x,ei​⟩ satisfy Bessel's inequality ∑i=1nci2≤∥x∥2\sum_{i=1}^n c_i^2\le\norm{x}^2∑i=1n​ci2​≤∥x∥2, and the residual x−∑icieix-\sum_i c_i e_ix−∑i​ci​ei​ is orthogonal to every eje_jej​.

Proof

Let p=∑icieip=\sum_i c_i e_ip=∑i​ci​ei​ and r=x−pr=x-pr=x−p. For each jjj, ⟨r,ej⟩=⟨x,ej⟩−∑ici⟨ei,ej⟩=cj−cj=0\ip{r}{e_j}=\ip{x}{e_j}-\sum_i c_i\ip{e_i}{e_j} =c_j-c_j=0⟨r,ej​⟩=⟨x,ej​⟩−∑i​ci​⟨ei​,ej​⟩=cj​−cj​=0, so the residual is orthogonal to every eje_jej​ and hence to ppp. Pythagoras applied to x=p+rx=p+rx=p+r gives ∥x∥2=∥p∥2+∥r∥2≥∥p∥2=∑ici2\norm{x}^2=\norm{p}^2+\norm{r}^2\ge\norm{p}^2=\sum_i c_i^2∥x∥2=∥p∥2+∥r∥2≥∥p∥2=∑i​ci2​, the orthonormality making ∥p∥2=∑ici2\norm{p}^2=\sum_i c_i^2∥p∥2=∑i​ci2​.

Bessel's inequality is the finite shadow of the expansion theory to come. The vector p=∑icieip=\sum_i c_i e_ip=∑i​ci​ei​ is the orthogonal projection of xxx onto the span of the eie_iei​, the closest point of that subspace, and the residual is the projection error. When an orthonormal family is large enough that the residual vanishes for every xxx, Bessel's inequality becomes the Parseval equality and the family is a basis, the subject of a later post.

#Hilbert spaces

Definition8

A Hilbert space is an inner product space that is complete in the induced norm, meaning every Cauchy sequence converges.

Finite-dimensional inner product spaces are automatically complete, by the equivalence of norms proved for finite-dimensional spaces and the completeness of Euclidean space. The interesting Hilbert spaces are infinite-dimensional, the sequence space ℓ2\ell^2ℓ2 and the function space L2L^2L2, whose completeness is a theorem rather than an automatic fact and is the subject of the next post. Completeness lets an orthogonal series converge to an actual vector, turning Bessel's inequality into a working expansion, the projection theorem into an existence result, and the spectral theorem into a decomposition. Geometry supplies the angles, completeness the limits; their combination is the Hilbert space.

[1]
W. Rudin, Functional Analysis, 2nd ed. McGraw-Hill, 1991.
[2]
J. B. Conway, A Course in Functional Analysis, 2nd ed. Springer, 1990.

Part 1 of 7 in Hilbert Spaces and Operators

next →L-squared and Completeness

Explore connections

see in the atlas →

related

  • Orthonormal Bases
  • Projection and Riesz Representation
  • Bounded Operators and the Adjoint

referenced by (7)

  • Bounded Operators and the Adjoint
  • Compact Operators and the Spectral Theorem
  • L-squared and Completeness
  • Orthonormal Bases
  • Projection and Riesz Representation
  • Second-Order Processes and Mean-Square Calculus
  • +1 more
cite
@misc{inner-product-spaces,
  author = {Zac Kienzle},
  title  = {Inner Product Spaces},
  year   = {2026},
  month  = {05},
  url    = {https://zackienzle.com/blog/inner-product-spaces}
}