Subsection OBC Orthonormal Bases and Coordinates

We learned about orthogonal sets of vectors in $\complex{m}$ back in Section O, and we also learned that orthogonal sets are automatically linearly independent (Theorem OSLI). When an orthogonal set also spans a subspace of $\complex{m}$, then the set is a basis. And when the set is orthonormal, then the set is an incredibly nice basis. We will back up this claim with a theorem, but first consider how you might manufacture such a set.

Suppose that $W$ is a subspace of $\complex{m}$ with basis $B$. Then $B$ spans $W$ and is a linearly independent set of nonzero vectors. We can apply the Gram-Schmidt Procedure (Theorem GSP) and obtain a linearly independent set $T$ such that $\spn{T}=\spn{B}=W$ and $T$ is orthogonal. In other words, $T$ is a basis for $W$, and is an orthogonal set. By scaling each vector of $T$ to norm 1, we can convert $T$ into an orthonormal set, without destroying the properties that make it a basis of $W$. In short, we can convert any basis into an orthonormal basis. Example GSTV, followed by Example ONTV, illustrates this process.

Unitary matrices (Definition UM) are another good source of orthonormal bases (and vice versa). Suppose that $Q$ is a unitary matrix of size $n$. Then the $n$ columns of $Q$ form an orthonormal set (Theorem CUMOS) that is therefore linearly independent (Theorem OSLI). Since $Q$ is invertible (Theorem UMI), we know $Q$ is nonsingular (Theorem NI), and then the columns of $Q$ span $\complex{n}$ (Theorem CSNM). So the columns of a unitary matrix of size $n$ are an orthonormal basis for $\complex{n}$.

Why all the fuss about orthonormal bases? Theorem VRRB told us that any vector in a vector space could be written, uniquely, as a linear combination of basis vectors. For an orthonormal basis, finding the scalars for this linear combination is extremely easy, and this is the content of the next theorem. Furthermore, with vectors written this way (as linear combinations of the elements of an orthonormal set) certain computations and analysis become much easier. Here is the promised theorem.

Theorem COB Coordinates and Orthonormal Bases

Suppose that $B=\set{\vectorlist{v}{p}}$ is an orthonormal basis of the subspace $W$ of $\complex{m}$. For any $\vect{w}\in W$, \begin{equation*} \vect{w}= \innerproduct{\vect{v}_1}{\vect{w}}\vect{v}_1+ \innerproduct{\vect{v}_2}{\vect{w}}\vect{v}_2+ \innerproduct{\vect{v}_3}{\vect{w}}\vect{v}_3+ \cdots+ \innerproduct{\vect{v}_p}{\vect{w}}\vect{v}_p \end{equation*}

Example CROB4 Coordinatization relative to an orthonormal basis, $\complex{4}$

A slightly less intimidating example follows, in three dimensions and with just real numbers.

Example CROB3 Coordinatization relative to an orthonormal basis, $\complex{3}$

Not only do the columns of a unitary matrix form an orthonormal basis, but there is a deeper connection between orthonormal bases and unitary matrices. Informally, the next theorem says that if we transform each vector of an orthonormal basis by multiplying it by a unitary matrix, then the resulting set will be another orthonormal basis. And more remarkably, any matrix with this property must be unitary! As an equivalence (Proof Technique E) we could take this as our defining property of a unitary matrix, though it might not have the same utility as Definition UM.

Theorem UMCOB Unitary Matrices Convert Orthonormal Bases

Let $A$ be an $n\times n$ matrix and $B=\set{\vectorlist{x}{n}}$ be an orthonormal basis of $\complex{n}$. Define \begin{align*} C&=\set{A\vect{x}_1,\,A\vect{x}_2,\,A\vect{x}_3,\,\dots,\,A\vect{x}_n} \end{align*}

Then $A$ is a unitary matrix if and only if $C$ is an orthonormal basis of $\complex{n}$.

Sage C Coordinates
(in context)