Mathematics · Glossary

What is orthonormal family?

Definition 23.5 University Mathematics — Year 1 · Chapter 23 — Euclidean Spaces

xyx \perp y when x,y=0\langle x, y \rangle = 0. A family is orthogonal when its vectors are pairwise orthogonal, orthonormal when moreover each has norm 11. The orthogonal complement of a subspace FF is

F={xE:yF, x,y=0},F^{\perp} = \{x \in E : \forall y \in F,\ \langle x, y\rangle = 0\},

a subspace of EE.

Examples

Example 23.7 (Orthonormal coordinates, with a Parseval check)

Expand x=(1,2,3)x = (1, 2, 3) in the orthonormal basis of Exercise 23.3,

e1=12(1,1,0),e2=16(1,1,2),e3=13(1,1,1).e_1 = \tfrac{1}{\sqrt2}(1,1,0), \quad e_2 = \tfrac{1}{\sqrt6}(1,-1,2), \quad e_3 = \tfrac{1}{\sqrt3}(-1,1,1).

No system to solve — three inner products:

x,e1=32,x,e2=12+66=56,x,e3=1+2+33=43.\langle x, e_1\rangle = \frac{3}{\sqrt2}, \qquad \langle x, e_2\rangle = \frac{1 - 2 + 6}{\sqrt6} = \frac{5}{\sqrt6}, \qquad \langle x, e_3\rangle = \frac{-1 + 2 + 3}{\sqrt3} = \frac{4}{\sqrt3}.

Certification by the norm formula of the proposition:

92+256+163=27+25+326=14=x2=1+4+9.\frac{9}{2} + \frac{25}{6} + \frac{16}{3} = \frac{27 + 25 + 32}{6} = 14 = \norm{x}^2 = 1 + 4 + 9 .

This sum-of-squared-coordinates check (a finite Parseval identity) costs seconds and catches sign and normalization errors with near certainty — make it a habit whenever an orthonormal expansion is computed; its infinite-dimensional version, for the Fourier coefficients of Example 23.14, is a theorem of the Year 3 volume.

Example 23.9 (Gram–Schmidt on polynomials, in full)

Orthonormalize (1,X,X2)(1, X, X^2) in R2[X]\R_2[X] with P,Q=01PQ\langle P, Q\rangle = \int_0^1 PQ. Step 1: 12=1\norm{1}^2 = 1, so e1=1e_1 = 1. Step 2: w2=XX,11=X12w_2 = X - \langle X, 1\rangle\,1 = X - \frac12, and w22=01(x12)2 ⁣dx=112\norm{w_2}^2 = \int_0^1\bigl(x - \frac12\bigr)^2 \dd x = \frac1{12}: e2=12(X12)e_2 = \sqrt{12}\,\bigl(X - \frac12\bigr). Step 3: X2,e1=13\langle X^2, e_1\rangle = \frac13 and

X2,e2=1201x2(x12) ⁣dx=1212,sow3=X213(X12)=X2X+16.\langle X^2, e_2\rangle = \sqrt{12}\int_0^1 x^2\Bigl(x - \frac12\Bigr)\dd x = \frac{\sqrt{12}}{12}, \qquad\text{so}\qquad w_3 = X^2 - \frac13 - \Bigl(X - \frac12\Bigr) = X^2 - X + \frac16 .

Its norm was computed in Exercise 23.9: w32=1180\norm{w_3}^2 = \frac1{180}, whence e3=180(X2X+16)e_3 = \sqrt{180}\,\bigl(X^2 - X + \frac16\bigr). The polynomials 11, X12X - \frac12, X2X+16X^2 - X + \frac16 are, up to scale, the first Legendre polynomials of the interval [0,1]\intcc{0}{1}; the construction continues one degree at a time, each new polynomial orthogonal to all its predecessors. Note how the algorithm recycles earlier work: the projection subtracted at step 3 is exactly the best affine approximation of X2X^2 found in Example 23.12 — Gram–Schmidt is iterated orthogonal projection.

Example 23.11 (Projections never lengthen)

Applying Pythagoras to the split x=pF(x)+(xpF(x))x = p_F(x) + (x - p_F(x)):

pF(x)2=x2xpF(x)2x2,\norm{p_F(x)}^2 = \norm x^2 - \norm{x - p_F(x)}^2 \leq \norm x^2 ,

with equality iff xFx \in F. In an orthonormal basis (e1,,ek)(e_1, \dots, e_k) of FF this reads ikx,ei2x2\sum_{i \leq k}\langle x, e_i\rangle^2 \leq \norm x^2 (a Bessel inequality): however many orthonormal directions one measures, the squared coordinates never exceed the squared length — compare the exact equality of Example 23.7 when the family is a full basis. This one-line inequality is what makes Fourier coefficients summable in the Year 3 volume; here it already explains why adding more basis functions to a least squares fit can only decrease the residual.

Read in context →