ConceptComplete

Orthonormal Basis

An orthonormal basis is a basis whose vectors are pairwise orthogonal and each has unit length. It is the most computationally convenient type of basis: coordinates are computed by inner products, projections are trivial, and the matrix of any linear transformation has special structure.


Definition

Definition6.8Orthonormal set and orthonormal basis

A set of vectors {e1,…,ek}\{e_1, \ldots, e_k\} in an inner product space VV is orthonormal if:

⟨ei,ej⟩=δij={1if i=j,0if i≠j.\langle e_i, e_j \rangle = \delta_{ij} = \begin{cases} 1 & \text{if } i = j, \\ 0 & \text{if } i \neq j. \end{cases}

An orthonormal set that is also a basis for VV is called an orthonormal basis (ONB).

ExampleStandard orthonormal basis

The standard basis {e1,…,en}\{e_1, \ldots, e_n\} of Rn\mathbb{R}^n (or Cn\mathbb{C}^n) with the standard inner product is the prototypical orthonormal basis.

In R3\mathbb{R}^3: e1=(1,0,0)e_1 = (1,0,0), e2=(0,1,0)e_2 = (0,1,0), e3=(0,0,1)e_3 = (0,0,1), with ei⋅ej=δije_i \cdot e_j = \delta_{ij}.

ExampleA rotated orthonormal basis in R^2

e1′=(12,12)e_1' = \left(\frac{1}{\sqrt{2}}, \frac{1}{\sqrt{2}}\right), e2′=(12,−12)e_2' = \left(\frac{1}{\sqrt{2}}, -\frac{1}{\sqrt{2}}\right).

⟨e1′,e1′⟩=12+12=1\langle e_1', e_1' \rangle = \frac{1}{2} + \frac{1}{2} = 1 ✓, ⟨e2′,e2′⟩=1\langle e_2', e_2' \rangle = 1 ✓, ⟨e1′,e2′⟩=12−12=0\langle e_1', e_2' \rangle = \frac{1}{2} - \frac{1}{2} = 0 ✓.

This is an orthonormal basis obtained by rotating the standard basis by 45°45°.

ExampleOrthonormal polynomials (Legendre)

On P2\mathcal{P}_2 with ⟨f,g⟩=∫−11f(x)g(x) dx\langle f, g \rangle = \int_{-1}^{1} f(x)g(x)\,dx, the normalized Legendre polynomials form an ONB:

P0(x)=12P_0(x) = \frac{1}{\sqrt{2}}, P1(x)=32⋅xP_1(x) = \sqrt{\frac{3}{2}} \cdot x, P2(x)=52⋅3x2−12P_2(x) = \sqrt{\frac{5}{2}} \cdot \frac{3x^2 - 1}{2}.

These satisfy ⟨Pi,Pj⟩=δij\langle P_i, P_j \rangle = \delta_{ij}.


Coordinate representation

Theorem6.1Fourier coefficients

If {e1,…,en}\{e_1, \ldots, e_n\} is an orthonormal basis for VV, then every v∈Vv \in V can be written as:

v=∑i=1n⟨v,ei⟩ ei.v = \sum_{i=1}^n \langle v, e_i \rangle \, e_i.

The scalars ci=⟨v,ei⟩c_i = \langle v, e_i \rangle are the Fourier coefficients (or coordinates) of vv with respect to the ONB. No matrix inversion is needed -- just compute inner products.

ExampleCoordinates in a non-standard ONB

ONB for R3\mathbb{R}^3: e1=12(1,1,0)e_1 = \frac{1}{\sqrt{2}}(1, 1, 0), e2=12(1,−1,0)e_2 = \frac{1}{\sqrt{2}}(1, -1, 0), e3=(0,0,1)e_3 = (0, 0, 1).

For v=(3,1,5)v = (3, 1, 5):

  • c1=⟨v,e1⟩=12(3+1)=42=22c_1 = \langle v, e_1 \rangle = \frac{1}{\sqrt{2}}(3 + 1) = \frac{4}{\sqrt{2}} = 2\sqrt{2}.
  • c2=⟨v,e2⟩=12(3−1)=2c_2 = \langle v, e_2 \rangle = \frac{1}{\sqrt{2}}(3 - 1) = \sqrt{2}.
  • c3=⟨v,e3⟩=5c_3 = \langle v, e_3 \rangle = 5.

Check: 22⋅12(1,1,0)+2⋅12(1,−1,0)+5(0,0,1)=(2,2,0)+(1,−1,0)+(0,0,5)=(3,1,5)2\sqrt{2} \cdot \frac{1}{\sqrt{2}}(1,1,0) + \sqrt{2} \cdot \frac{1}{\sqrt{2}}(1,-1,0) + 5(0,0,1) = (2,2,0) + (1,-1,0) + (0,0,5) = (3,1,5) ✓.

ExampleFourier coefficients for functions

In L2[−π,π]L^2[-\pi, \pi] with ONB {12π,cos⁡(nx)π,sin⁡(nx)π}n≥1\{\frac{1}{\sqrt{2\pi}}, \frac{\cos(nx)}{\sqrt{\pi}}, \frac{\sin(nx)}{\sqrt{\pi}}\}_{n \geq 1}:

The Fourier coefficients of ff are a0=12π∫−ππf(x) dxa_0 = \frac{1}{\sqrt{2\pi}}\int_{-\pi}^{\pi} f(x)\,dx, an=1π∫−ππf(x)cos⁡(nx) dxa_n = \frac{1}{\sqrt{\pi}}\int_{-\pi}^{\pi} f(x)\cos(nx)\,dx, etc.

This is the classical Fourier series, viewed as coordinate expansion in an orthonormal basis.


Parseval's identity

Theorem6.2Parseval's identity

For any vector vv in an inner product space with orthonormal basis {e1,…,en}\{e_1, \ldots, e_n\}:

∥v∥2=∑i=1n∣⟨v,ei⟩∣2.\|v\|^2 = \sum_{i=1}^n |\langle v, e_i \rangle|^2.

This is the generalization of the Pythagorean theorem to nn dimensions.

ExampleParseval's identity in R^3

v=(3,4,0)v = (3, 4, 0), standard ONB {e1,e2,e3}\{e_1, e_2, e_3\}:

∥v∥2=9+16+0=25=32+42+02=∣⟨v,e1⟩∣2+∣⟨v,e2⟩∣2+∣⟨v,e3⟩∣2\|v\|^2 = 9 + 16 + 0 = 25 = 3^2 + 4^2 + 0^2 = |\langle v, e_1 \rangle|^2 + |\langle v, e_2 \rangle|^2 + |\langle v, e_3 \rangle|^2 ✓.

With the rotated ONB from the previous example (v=(3,1,5)v = (3, 1, 5)): ∥v∥2=9+1+25=35\|v\|^2 = 9 + 1 + 25 = 35 and (22)2+(2)2+52=8+2+25=35(2\sqrt{2})^2 + (\sqrt{2})^2 + 5^2 = 8 + 2 + 25 = 35 ✓.

ExampleParseval for polynomials

f(x)=xf(x) = x on [−1,1][-1, 1] with Legendre ONB. ∥f∥2=∫−11x2 dx=23\|f\|^2 = \int_{-1}^1 x^2\,dx = \frac{2}{3}.

⟨f,P0⟩=12∫−11x dx=0\langle f, P_0 \rangle = \frac{1}{\sqrt{2}} \int_{-1}^1 x\,dx = 0, ⟨f,P1⟩=32∫−11x2 dx=32⋅23=26\langle f, P_1 \rangle = \sqrt{\frac{3}{2}} \int_{-1}^1 x^2\,dx = \sqrt{\frac{3}{2}} \cdot \frac{2}{3} = \frac{2}{\sqrt{6}}, ⟨f,P2⟩=0\langle f, P_2 \rangle = 0 (by symmetry, xx is odd and P2P_2 is even).

∣⟨f,P1⟩∣2=46=23=∥f∥2|\langle f, P_1 \rangle|^2 = \frac{4}{6} = \frac{2}{3} = \|f\|^2 ✓. The function xx lies entirely in the span of P1P_1.


Bessel's inequality

TheoremBessel's inequality

For any orthonormal set {e1,…,ek}\{e_1, \ldots, e_k\} (not necessarily a basis) and any v∈Vv \in V:

∑i=1k∣⟨v,ei⟩∣2≤∥v∥2.\sum_{i=1}^k |\langle v, e_i \rangle|^2 \leq \|v\|^2.

Equality holds if and only if v∈span⁡{e1,…,ek}v \in \operatorname{span}\{e_1, \ldots, e_k\}.

ExampleBessel's inequality with an incomplete ONB

In R3\mathbb{R}^3, take the partial ONB {e1,e2}\{e_1, e_2\} (just the first two standard vectors). For v=(3,4,5)v = (3, 4, 5):

∣⟨v,e1⟩∣2+∣⟨v,e2⟩∣2=9+16=25≤50=9+16+25=∥v∥2|\langle v, e_1 \rangle|^2 + |\langle v, e_2 \rangle|^2 = 9 + 16 = 25 \leq 50 = 9 + 16 + 25 = \|v\|^2.

The gap 50−25=25=∣⟨v,e3⟩∣250 - 25 = 25 = |\langle v, e_3 \rangle|^2 is the "energy" in the missing direction.


Matrix representation

TheoremMatrix of a linear transformation in an ONB

If T:V→VT: V \to V is a linear transformation and {e1,…,en}\{e_1, \ldots, e_n\} is an orthonormal basis, then the matrix entries are:

aij=⟨Tej,ei⟩.a_{ij} = \langle Te_j, e_i \rangle.

For self-adjoint operators (T∗=TT^* = T), the matrix is symmetric (real case) or Hermitian (complex case) in any ONB.

ExampleMatrix entries via inner products

T:R2→R2T: \mathbb{R}^2 \to \mathbb{R}^2 defined by T(x,y)=(2x+y,x+3y)T(x, y) = (2x + y, x + 3y) with ONB e1′=12(1,1)e_1' = \frac{1}{\sqrt{2}}(1, 1), e2′=12(1,−1)e_2' = \frac{1}{\sqrt{2}}(1, -1).

Te1′=12(3,4)Te_1' = \frac{1}{\sqrt{2}}(3, 4), Te2′=12(1,−2)Te_2' = \frac{1}{\sqrt{2}}(1, -2).

a11=⟨Te1′,e1′⟩=12(3+4)=72a_{11} = \langle Te_1', e_1' \rangle = \frac{1}{2}(3 + 4) = \frac{7}{2}, a21=⟨Te1′,e2′⟩=12(3−4)=−12a_{21} = \langle Te_1', e_2' \rangle = \frac{1}{2}(3 - 4) = -\frac{1}{2}, a12=⟨Te2′,e1′⟩=12(1−2)=−12a_{12} = \langle Te_2', e_1' \rangle = \frac{1}{2}(1 - 2) = -\frac{1}{2}, a22=⟨Te2′,e2′⟩=12(1+2)=32a_{22} = \langle Te_2', e_2' \rangle = \frac{1}{2}(1 + 2) = \frac{3}{2}.

Matrix in the new ONB: (7/2−1/2−1/23/2)\begin{pmatrix} 7/2 & -1/2 \\ -1/2 & 3/2 \end{pmatrix} (symmetric, as expected since AT=AA^T = A in the standard basis implies A′=A′TA' = A'^T in any ONB).


Constructing orthonormal bases

ExampleNormalizing an orthogonal basis

Given orthogonal basis {(1,1,0),(1,−1,2),(−1,1,1)}\{(1, 1, 0), (1, -1, 2), (-1, 1, 1)\}:

Norms: ∥(1,1,0)∥=2\|(1,1,0)\| = \sqrt{2}, ∥(1,−1,2)∥=6\|(1,-1,2)\| = \sqrt{6}, ∥(−1,1,1)∥=3\|(-1,1,1)\| = \sqrt{3}.

ONB: {12(1,1,0),16(1,−1,2),13(−1,1,1)}\left\{\frac{1}{\sqrt{2}}(1,1,0), \frac{1}{\sqrt{6}}(1,-1,2), \frac{1}{\sqrt{3}}(-1,1,1)\right\}.

Verify: 12⋅6(1−1+0)=0\frac{1}{\sqrt{2} \cdot \sqrt{6}}(1 - 1 + 0) = 0 ✓, and similarly for other pairs.

ExampleFrom arbitrary basis to ONB (preview of Gram-Schmidt)

Starting with {(1,1,0),(1,0,1)}\{(1, 1, 0), (1, 0, 1)\} in R3\mathbb{R}^3 (linearly independent but not orthogonal):

Step 1: u1=(1,1,0)u_1 = (1, 1, 0), e1=12(1,1,0)e_1 = \frac{1}{\sqrt{2}}(1, 1, 0).

Step 2: u2=(1,0,1)−⟨(1,0,1),e1⟩e1=(1,0,1)−12⋅12(1,1,0)=(1,0,1)−12(1,1,0)=(12,−12,1)u_2 = (1, 0, 1) - \langle (1,0,1), e_1 \rangle e_1 = (1, 0, 1) - \frac{1}{\sqrt{2}} \cdot \frac{1}{\sqrt{2}}(1, 1, 0) = (1, 0, 1) - \frac{1}{2}(1, 1, 0) = (\frac{1}{2}, -\frac{1}{2}, 1).

e2=u2∥u2∥=13/2(12,−12,1)=16(1,−1,2)e_2 = \frac{u_2}{\|u_2\|} = \frac{1}{\sqrt{3/2}}(\frac{1}{2}, -\frac{1}{2}, 1) = \frac{1}{\sqrt{6}}(1, -1, 2).

The ONB for span⁡{(1,1,0),(1,0,1)}\operatorname{span}\{(1,1,0), (1,0,1)\} is {e1,e2}\{e_1, e_2\}.

ExampleONB in C^2

e1=12(1,i)e_1 = \frac{1}{\sqrt{2}}(1, i), e2=12(i,1)e_2 = \frac{1}{\sqrt{2}}(i, 1).

⟨e1,e1⟩=12(1⋅1+i⋅(−i))=12(1+1)=1\langle e_1, e_1 \rangle = \frac{1}{2}(1 \cdot 1 + i \cdot (-i)) = \frac{1}{2}(1 + 1) = 1 ✓.

⟨e1,e2⟩=12(1⋅(−i)+i⋅1)=12(−i+i)=0\langle e_1, e_2 \rangle = \frac{1}{2}(1 \cdot (-i) + i \cdot 1) = \frac{1}{2}(-i + i) = 0 ✓.

⟨e2,e2⟩=12(i⋅(−i)+1⋅1)=12(1+1)=1\langle e_2, e_2 \rangle = \frac{1}{2}(i \cdot (-i) + 1 \cdot 1) = \frac{1}{2}(1 + 1) = 1 ✓.


Summary

RemarkWhy orthonormal bases are preferred

Orthonormal bases are the gold standard for inner product spaces:

  • Coordinates are computed by inner products: ci=⟨v,ei⟩c_i = \langle v, e_i \rangle (no system of equations to solve).
  • Norms are computed by Parseval: ∥v∥2=∑∣ci∣2\|v\|^2 = \sum |c_i|^2.
  • Projections are immediate: proj⁡W(v)=∑i⟨v,ei⟩ei\operatorname{proj}_W(v) = \sum_{i} \langle v, e_i \rangle e_i.
  • Change-of-basis matrices are orthogonal/unitary (hence easy to invert: P−1=PTP^{-1} = P^T).
  • The Gram--Schmidt process guarantees that every inner product space has an ONB, so we never need to work without one.