Orthonormality

The construction of orthogonality of vectors is motivated by a desire to extend the intuitive notion of perpendicular vectors to higher-dimensional spaces. In the Cartesian plane, two vectors are said to be perpendicular if the angle between them is 90° (i.e. if they form a right angle). This definition can be formalized in Cartesian space by defining the dot product and specifying that two vectors in the plane are orthogonal if their dot product is zero.

Similarly, the construction of the norm of a vector is motivated by a desire to extend the intuitive notion of the length of a vector to higher-dimensional spaces. In Cartesian space, the norm of a vector is the square root of the vector dotted with itself. That is,

${\displaystyle \|\mathbf {x} \|={\sqrt {\mathbf {x} \cdot \mathbf {x} }}}$

Many important results in linear algebra deal with collections of two or more orthogonal vectors. But often, it is easier to deal with vectors of unit length. That is, it often simplifies things to only consider vectors whose norm equals 1. The notion of restricting orthogonal pairs of vectors to only those of unit length is important enough to be given a special name. Two vectors which are orthogonal and of length 1 are said to be orthonormal.

What does a pair of orthonormal vectors in 2-D Euclidean space look like?

Let u = (x₁, y₁) and v = (x₂, y₂). Consider the restrictions on x₁, x₂, y₁, y₂ required to make u and v form an orthonormal pair.

• From the orthogonality restriction, u • v = 0.
• From the unit length restriction on u, ||u|| = 1.
• From the unit length restriction on v, ||v|| = 1.

Expanding these terms gives 3 equations:

1. ${\displaystyle x_{1}x_{2}+y_{1}y_{2}=0\quad }$
2. ${\displaystyle {\sqrt {{x_{1}}^{2}+{y_{1}}^{2}}}=1}$
3. ${\displaystyle {\sqrt {{x_{2}}^{2}+{y_{2}}^{2}}}=1}$

Converting from Cartesian to polar coordinates, and considering Equation ${\displaystyle (2)}$ and Equation ${\displaystyle (3)}$ immediately gives the result r₁ = r₂ = 1. In other words, requiring the vectors be of unit length restricts the vectors to lie on the unit circle.

After substitution, Equation ${\displaystyle (1)}$ becomes ${\displaystyle \cos \theta _{1}\cos \theta _{2}+\sin \theta _{1}\sin \theta _{2}=0}$. Rearranging gives ${\displaystyle \tan \theta _{1}=-\cot \theta _{2}}$. Using a trigonometric identity to convert the cotangent term gives

${\displaystyle \tan(\theta _{1})=\tan \left(\theta _{2}+{\tfrac {\pi }{2}}\right)}$

${\displaystyle \Rightarrow \theta _{1}=\theta _{2}+{\tfrac {\pi }{2}}}$

It is clear that in the plane, orthonormal vectors are simply radii of the unit circle whose difference in angles equals 90°.

Let ${\displaystyle {\mathcal {V}}}$ be an inner-product space. A set of vectors

${\displaystyle \left\{u_{1},u_{2},\ldots ,u_{n},\ldots \right\}\in {\mathcal {V}}}$

is called orthonormal if and only if

${\displaystyle \forall i,j:\langle u_{i},u_{j}\rangle =\delta _{ij}}$

where ${\displaystyle \delta _{ij}\,}$ is the Kronecker delta and ${\displaystyle \langle \cdot ,\cdot \rangle }$ is the inner product defined over ${\displaystyle {\mathcal {V}}}$.

Orthonormal sets are not especially significant on their own. However, they display certain features that make them fundamental in exploring the notion of diagonalizability of certain operators on vector spaces.

Orthonormal sets have certain very appealing properties, which make them particularly easy to work with.

• Theorem. If {e₁, e₂, ..., e_n} is an orthonormal list of vectors, then $${\displaystyle \forall {\textbf {a}}:=[a_{1},\cdots ,a_{n}];\ \|a_{1}{\textbf {e}}_{1}+a_{2}{\textbf {e}}_{2}+\cdots +a_{n}{\textbf {e}}_{n}\|^{2}=|a_{1}|^{2}+|a_{2}|^{2}+\cdots +|a_{n}|^{2}}$$
• Theorem. Every orthonormal list of vectors is linearly independent.

• Gram-Schmidt theorem. If {v₁, v₂,...,v_n} is a linearly independent list of vectors in an inner-product space ${\displaystyle {\mathcal {V}}}$, then there exists an orthonormal list {e₁, e₂,...,e_n} of vectors in ${\displaystyle {\mathcal {V}}}$ such that span(e₁, e₂,...,e_n) = span(v₁, v₂,...,v_n).

Proof of the Gram-Schmidt theorem is constructive, and discussed at length elsewhere. The Gram-Schmidt theorem, together with the axiom of choice, guarantees that every vector space admits an orthonormal basis. This is possibly the most significant use of orthonormality, as this fact permits operators on inner-product spaces to be discussed in terms of their action on the space's orthonormal basis vectors. What results is a deep relationship between the diagonalizability of an operator and how it acts on the orthonormal basis vectors. This relationship is characterized by the Spectral Theorem.

The standard basis for the coordinate space Fⁿ is

{e1, e2,...,en}   where	e1 = (1, 0, ..., 0)
	e2 = (0, 1, ..., 0)
	${\displaystyle \vdots }$
	en = (0, 0, ..., 1)

Any two vectors e_i, e_j where i≠j are orthogonal, and all vectors are clearly of unit length. So {e₁, e₂,...,e_n} forms an orthonormal basis.

When referring to real-valued functions, usually the L² inner product is assumed unless otherwise stated. Two functions ${\displaystyle \phi (x)}$ and ${\displaystyle \psi (x)}$ are orthonormal over the interval ${\displaystyle [a,b]}$ if

${\displaystyle (1)\quad \langle \phi (x),\psi (x)\rangle =\int _{a}^{b}\phi (x)\psi (x)dx=0,\quad {\rm {and}}}$

${\displaystyle (2)\quad ||\phi (x)||_{2}=||\psi (x)||_{2}=\left[\int _{a}^{b}|\phi (x)|^{2}dx\right]^{\frac {1}{2}}=\left[\int _{a}^{b}|\psi (x)|^{2}dx\right]^{\frac {1}{2}}=1.}$

The Fourier series is a method of expressing a periodic function in terms of sinusoidal basis functions. Taking C[−π,π] to be the space of all real-valued functions continuous on the interval [−π,π] and taking the inner product to be

${\displaystyle \langle f,g\rangle =\int _{-\pi }^{\pi }f(x)g(x)dx}$

it can be shown that

${\displaystyle \left\{{\frac {1}{\sqrt {2\pi }}},{\frac {\sin(x)}{\sqrt {\pi }}},{\frac {\sin(2x)}{\sqrt {\pi }}},\ldots ,{\frac {\sin(nx)}{\sqrt {\pi }}},{\frac {\cos(x)}{\sqrt {\pi }}},{\frac {\cos(2x)}{\sqrt {\pi }}},\ldots ,{\frac {\cos(nx)}{\sqrt {\pi }}}\right\},\quad n\in \mathbb {N} }$

forms an orthonormal set.

However, this is of little consequence, because C[−π,π] is infinite-dimensional, and a finite set of vectors cannot span it. But, removing the restriction that n be finite makes the set dense in C[−π,π] and therefore an orthonormal basis of C[−π,π].

• Orthogonalization
• Orthonormal function system

• Axler, Sheldon (1997), Linear Algebra Done Right (2nd ed.), Berlin, New York: Springer-Verlag, p. 106–110, ISBN 978-0-387-98258-8
• Chen, Wai-Kai (2009), Fundamentals of Circuits and Filters (3rd ed.), Boca Raton: CRC Press, p. 62, ISBN 978-1-4200-5887-1