Solved Exercises on Orthogonal and Orthonormal Bases in Linear Algebra

Master orthogonal and orthonormal bases: vector orthogonality, normalization, Gram-Schmidt process, and applications through these 5 detailed exercises.

Solution: Exercises 1 to 3
1 Vector Orthogonality Check
Exercise 1
Determine if the vectors
\(\vec{u} = \begin{pmatrix} 2 \\ 3 \\ 1 \end{pmatrix}\)
and
\(\vec{v} = \begin{pmatrix} -3 \\ 2 \\ 0 \end{pmatrix}\)
are orthogonal.
Definition:

Orthogonal vectors: Two vectors \(\vec{u}\) and \(\vec{v}\) are orthogonal if their dot product equals zero: \(\vec{u} \cdot \vec{v} = 0\)

Orthogonality test method:
  1. Calculate the dot product \(\vec{u} \cdot \vec{v}\)
  2. Apply the dot product formula: \(\vec{u} \cdot \vec{v} = u_1v_1 + u_2v_2 + u_3v_3\)
  3. Check if the result equals zero
Vectors
\(\vec{u} = \begin{pmatrix} 2 \\ 3 \\ 1 \end{pmatrix}, \vec{v} = \begin{pmatrix} -3 \\ 2 \\ 0 \end{pmatrix}\)
Dot Product
\(2(-3) + 3(2) + 1(0)\)
Result
\(0\)
Step 1: Identify vector components

\(\vec{u} = \begin{pmatrix} u_1 \\ u_2 \\ u_3 \end{pmatrix} = \begin{pmatrix} 2 \\ 3 \\ 1 \end{pmatrix}\) and \(\vec{v} = \begin{pmatrix} v_1 \\ v_2 \\ v_3 \end{pmatrix} = \begin{pmatrix} -3 \\ 2 \\ 0 \end{pmatrix}\)

Step 2: Apply dot product formula

\(\vec{u} \cdot \vec{v} = u_1v_1 + u_2v_2 + u_3v_3\)

\(\vec{u} \cdot \vec{v} = (2)(-3) + (3)(2) + (1)(0)\)

Step 3: Calculate each product

\(2 \times -3 = -6\), \(3 \times 2 = 6\), \(1 \times 0 = 0\)

Step 4: Sum the products

\(-6 + 6 + 0 = 0\)

Step 5: Conclusion

Since \(\vec{u} \cdot \vec{v} = 0\), the vectors are orthogonal

Vectors \(\vec{u}\) and \(\vec{v}\) are orthogonal
Final answer:

\(\vec{u} \cdot \vec{v} = -6 + 6 + 0 = 0\), therefore the vectors are orthogonal

Applied rules:

• Dot Product: \(\vec{u} \cdot \vec{v} = \sum_{i=1}^{n} u_i v_i\)

• Orthogonality: \(\vec{u} \perp \vec{v} \iff \vec{u} \cdot \vec{v} = 0\)

• Component Multiplication: Multiply corresponding components

2 Vector Normalization
Exercise 2
Normalize the vector
\(\vec{w} = \begin{pmatrix} 4 \\ -3 \\ 0 \end{pmatrix}\)
to obtain a unit vector.
Definition:

Unit vector: A vector with magnitude (norm) equal to 1. To normalize a vector \(\vec{v}\), divide it by its norm: \(\hat{v} = \frac{\vec{v}}{||\vec{v}||}\)

Original Vector
\(\vec{w} = \begin{pmatrix} 4 \\ -3 \\ 0 \end{pmatrix}\)
Norm Calculation
\(||\vec{w}|| = \sqrt{4^2 + (-3)^2 + 0^2}\)
Normalized Vector
\(\hat{w} = \frac{1}{5}\begin{pmatrix} 4 \\ -3 \\ 0 \end{pmatrix}\)
Step 1: Calculate the norm of \(\vec{w}\)

\(||\vec{w}|| = \sqrt{w_1^2 + w_2^2 + w_3^2}\)

\(||\vec{w}|| = \sqrt{4^2 + (-3)^2 + 0^2} = \sqrt{16 + 9 + 0} = \sqrt{25} = 5\)

Step 2: Apply normalization formula

\(\hat{w} = \frac{\vec{w}}{||\vec{w}||} = \frac{1}{5}\begin{pmatrix} 4 \\ -3 \\ 0 \end{pmatrix}\)

Step 3: Calculate normalized components

\(\hat{w}_1 = \frac{4}{5}\), \(\hat{w}_2 = \frac{-3}{5}\), \(\hat{w}_3 = \frac{0}{5} = 0\)

Step 4: Verify the result

\(||\hat{w}|| = \sqrt{(\frac{4}{5})^2 + (\frac{-3}{5})^2 + 0^2} = \sqrt{\frac{16}{25} + \frac{9}{25}} = \sqrt{\frac{25}{25}} = 1\)

\(\hat{w} = \begin{pmatrix} \frac{4}{5} \\ -\frac{3}{5} \\ 0 \end{pmatrix}\)
Final answer:

The normalized vector is \(\hat{w} = \begin{pmatrix} \frac{4}{5} \\ -\frac{3}{5} \\ 0 \end{pmatrix}\)

Applied rules:

• Vector Norm: \(||\vec{v}|| = \sqrt{\sum_{i=1}^{n} v_i^2}\)

• Normalization: \(\hat{v} = \frac{\vec{v}}{||\vec{v}||}\)

• Unit Vector Property: \(||\hat{v}|| = 1\)

3 Orthogonal Basis Verification
Exercise 3
Verify if the set
\(\left\{ \begin{pmatrix} 1 \\ 0 \\ 0 \end{pmatrix}, \begin{pmatrix} 0 \\ 1 \\ 0 \end{pmatrix}, \begin{pmatrix} 0 \\ 0 \\ 1 \end{pmatrix} \right\}\)
forms an orthogonal basis for \(\mathbb{R}^3\).
Definition:

Orthogonal basis: A basis where all vectors are pairwise orthogonal (their dot products equal zero)

Basis Set
\(\{ \vec{e_1}, \vec{e_2}, \vec{e_3} \}\)
Dot Products
\(\vec{e_i} \cdot \vec{e_j} = 0\) for \(i \neq j\)
Result
All dot products = 0
Step 1: Identify the vectors

\(\vec{e_1} = \begin{pmatrix} 1 \\ 0 \\ 0 \end{pmatrix}\), \(\vec{e_2} = \begin{pmatrix} 0 \\ 1 \\ 0 \end{pmatrix}\), \(\vec{e_3} = \begin{pmatrix} 0 \\ 0 \\ 1 \end{pmatrix}\)

Step 2: Check all pairwise dot products

\(\vec{e_1} \cdot \vec{e_2} = (1)(0) + (0)(1) + (0)(0) = 0\)

\(\vec{e_1} \cdot \vec{e_3} = (1)(0) + (0)(0) + (0)(1) = 0\)

\(\vec{e_2} \cdot \vec{e_3} = (0)(0) + (1)(0) + (0)(1) = 0\)

Step 3: Verify linear independence

These are standard basis vectors, which are linearly independent by definition

Step 4: Confirm spanning property

Three linearly independent vectors in \(\mathbb{R}^3\) span the space

Step 5: Conclusion

All vectors are pairwise orthogonal and form a basis, so this is an orthogonal basis

This is the standard orthogonal basis for \(\mathbb{R}^3\)
Final answer:

Yes, this set forms an orthogonal basis for \(\mathbb{R}^3\) because all vectors are pairwise orthogonal and linearly independent

Applied rules:

• Orthogonality Test: Check all pairwise dot products equal zero

• Basis Requirements: Linear independence + spanning

• Dimension Count: Need n vectors for \(\mathbb{R}^n\)

Key Concepts and Formulas
\(\vec{u} \cdot \vec{v} = \sum_{i=1}^{n} u_i v_i\)
Dot Product Formula
Orthogonal
\(\vec{u} \perp \vec{v} \iff \vec{u} \cdot \vec{v} = 0\)
Perpendicular vectors
Normalization
\(\hat{v} = \frac{\vec{v}}{||\vec{v}||}\)
Unit vector
Orthonormal
\(\langle \vec{e_i}, \vec{e_j} \rangle = \delta_{ij}\)
Kronecker delta
Key definitions:

Orthogonal vectors: Vectors whose dot product equals zero, indicating they are perpendicular

Orthonormal vectors: Orthogonal vectors that also have unit length (norm = 1)

Orthogonal basis: A basis where all vectors are pairwise orthogonal

Orthonormal basis: An orthogonal basis where all vectors have unit length

Complete methodology:
  1. Orthogonality test: Calculate dot product and check if it equals zero
  2. Normalization: Divide vector by its norm to get unit vector
  3. Gram-Schmidt process: Convert any basis to orthogonal basis
  4. Verification: Check all pairwise dot products for orthogonality
Tip 1: In \(\mathbb{R}^n\), an orthogonal basis has n pairwise orthogonal vectors.
Tip 2: Orthonormal bases simplify projections and coordinate calculations.
Tip 3: The standard basis is always orthonormal.
Tip 4: Always verify linear independence when checking for a basis.
Common errors: Forgetting to normalize after orthogonalizing, miscalculating dot products, not checking linear independence.
Exam preparation: Master the Gram-Schmidt process, practice normalization, memorize orthogonality conditions.
Formulas to know by heart:

• Dot product: \(\vec{u} \cdot \vec{v} = \sum_{i=1}^{n} u_i v_i\)

• Vector norm: \(||\vec{v}|| = \sqrt{\vec{v} \cdot \vec{v}}\)

• Normalization: \(\hat{v} = \frac{\vec{v}}{||\vec{v}||}\)

• Orthogonality: \(\vec{u} \perp \vec{v} \iff \vec{u} \cdot \vec{v} = 0\)

• Gram-Schmidt: \(\vec{u_k} = \vec{v_k} - \sum_{i=1}^{k-1} \text{proj}_{\vec{u_i}}\vec{v_k}\)

Solution: Exercises 4 to 5
4 Gram-Schmidt Process
Exercise 4
Apply the Gram-Schmidt process to convert the basis
\(\left\{ \begin{pmatrix} 1 \\ 1 \\ 0 \end{pmatrix}, \begin{pmatrix} 1 \\ 0 \\ 1 \end{pmatrix}, \begin{pmatrix} 0 \\ 1 \\ 1 \end{pmatrix} \right\}\)
into an orthogonal basis.
Definition:

Gram-Schmidt process: A method to construct an orthogonal basis from any given basis using vector projections

Input Vectors
\(\vec{v_1}, \vec{v_2}, \vec{v_3}\)
Orthogonalization
\(\vec{u_1}, \vec{u_2}, \vec{u_3}\)
Result
Orthogonal basis
Step 1: Set first vector

\(\vec{u_1} = \vec{v_1} = \begin{pmatrix} 1 \\ 1 \\ 0 \end{pmatrix}\)

Step 2: Calculate second orthogonal vector

\(\vec{u_2} = \vec{v_2} - \text{proj}_{\vec{u_1}}\vec{v_2}\)

\(\text{proj}_{\vec{u_1}}\vec{v_2} = \frac{\vec{v_2} \cdot \vec{u_1}}{\vec{u_1} \cdot \vec{u_1}}\vec{u_1}\)

\(\vec{v_2} \cdot \vec{u_1} = (1)(1) + (0)(1) + (1)(0) = 1\)

\(\vec{u_1} \cdot \vec{u_1} = (1)^2 + (1)^2 + (0)^2 = 2\)

\(\text{proj}_{\vec{u_1}}\vec{v_2} = \frac{1}{2}\begin{pmatrix} 1 \\ 1 \\ 0 \end{pmatrix} = \begin{pmatrix} 1/2 \\ 1/2 \\ 0 \end{pmatrix}\)

\(\vec{u_2} = \begin{pmatrix} 1 \\ 0 \\ 1 \end{pmatrix} - \begin{pmatrix} 1/2 \\ 1/2 \\ 0 \end{pmatrix} = \begin{pmatrix} 1/2 \\ -1/2 \\ 1 \end{pmatrix}\)

Step 3: Calculate third orthogonal vector

\(\vec{u_3} = \vec{v_3} - \text{proj}_{\vec{u_1}}\vec{v_3} - \text{proj}_{\vec{u_2}}\vec{v_3}\)

\(\text{proj}_{\vec{u_1}}\vec{v_3} = \frac{\vec{v_3} \cdot \vec{u_1}}{\vec{u_1} \cdot \vec{u_1}}\vec{u_1} = \frac{(0)(1) + (1)(1) + (1)(0)}{2}\begin{pmatrix} 1 \\ 1 \\ 0 \end{pmatrix} = \frac{1}{2}\begin{pmatrix} 1 \\ 1 \\ 0 \end{pmatrix}\)

\(\text{proj}_{\vec{u_2}}\vec{v_3} = \frac{\vec{v_3} \cdot \vec{u_2}}{\vec{u_2} \cdot \vec{u_2}}\vec{u_2}\)

\(\vec{v_3} \cdot \vec{u_2} = (0)(1/2) + (1)(-1/2) + (1)(1) = 1/2\)

\(\vec{u_2} \cdot \vec{u_2} = (1/2)^2 + (-1/2)^2 + (1)^2 = 3/2\)

\(\text{proj}_{\vec{u_2}}\vec{v_3} = \frac{1/2}{3/2}\begin{pmatrix} 1/2 \\ -1/2 \\ 1 \end{pmatrix} = \frac{1}{3}\begin{pmatrix} 1/2 \\ -1/2 \\ 1 \end{pmatrix} = \begin{pmatrix} 1/6 \\ -1/6 \\ 1/3 \end{pmatrix}\)

\(\vec{u_3} = \begin{pmatrix} 0 \\ 1 \\ 1 \end{pmatrix} - \begin{pmatrix} 1/2 \\ 1/2 \\ 0 \end{pmatrix} - \begin{pmatrix} 1/6 \\ -1/6 \\ 1/3 \end{pmatrix} = \begin{pmatrix} -2/3 \\ 2/3 \\ 2/3 \end{pmatrix}\)

Step 4: Verify orthogonality

\(\vec{u_1} \cdot \vec{u_2} = (1)(1/2) + (1)(-1/2) + (0)(1) = 0\)

\(\vec{u_1} \cdot \vec{u_3} = (1)(-2/3) + (1)(2/3) + (0)(2/3) = 0\)

\(\vec{u_2} \cdot \vec{u_3} = (1/2)(-2/3) + (-1/2)(2/3) + (1)(2/3) = 0\)

Orthogonal basis: \(\left\{ \begin{pmatrix} 1 \\ 1 \\ 0 \end{pmatrix}, \begin{pmatrix} 1/2 \\ -1/2 \\ 1 \end{pmatrix}, \begin{pmatrix} -2/3 \\ 2/3 \\ 2/3 \end{pmatrix} \right\}\)
Final answer:

The orthogonal basis is \(\left\{ \begin{pmatrix} 1 \\ 1 \\ 0 \end{pmatrix}, \begin{pmatrix} 1/2 \\ -1/2 \\ 1 \end{pmatrix}, \begin{pmatrix} -2/3 \\ 2/3 \\ 2/3 \end{pmatrix} \right\}\)

Applied rules:

• Gram-Schmidt Formula: \(\vec{u_k} = \vec{v_k} - \sum_{i=1}^{k-1} \text{proj}_{\vec{u_i}}\vec{v_k}\)

• Vector Projection: \(\text{proj}_{\vec{u}}\vec{v} = \frac{\vec{v} \cdot \vec{u}}{\vec{u} \cdot \vec{u}}\vec{u}\)

• Orthogonality Verification: Check all pairwise dot products equal zero

5 Orthonormal Basis Construction
Exercise 5
Convert the orthogonal basis from Exercise 4 into an orthonormal basis.
Definition:

Orthonormal basis: An orthogonal basis where all vectors have unit length (norm = 1)

Orthogonal Basis
\(\{ \vec{u_1}, \vec{u_2}, \vec{u_3} \}\)
Normalize
\(\hat{u_i} = \frac{\vec{u_i}}{||\vec{u_i}||}\)
Orthonormal Basis
\(\{ \hat{u_1}, \hat{u_2}, \hat{u_3} \}\)
Step 1: Calculate norm of \(\vec{u_1}\)

\(||\vec{u_1}|| = \sqrt{1^2 + 1^2 + 0^2} = \sqrt{2}\)

\(\hat{u_1} = \frac{1}{\sqrt{2}}\begin{pmatrix} 1 \\ 1 \\ 0 \end{pmatrix} = \begin{pmatrix} \frac{1}{\sqrt{2}} \\ \frac{1}{\sqrt{2}} \\ 0 \end{pmatrix}\)

Step 2: Calculate norm of \(\vec{u_2}\)

\(||\vec{u_2}|| = \sqrt{(1/2)^2 + (-1/2)^2 + 1^2} = \sqrt{1/4 + 1/4 + 1} = \sqrt{3/2}\)

\(\hat{u_2} = \frac{1}{\sqrt{3/2}}\begin{pmatrix} 1/2 \\ -1/2 \\ 1 \end{pmatrix} = \begin{pmatrix} \frac{1/\sqrt{6}} \\ \frac{-1/\sqrt{6}} \\ \frac{2/\sqrt{6}} \end{pmatrix}\)

Step 3: Calculate norm of \(\vec{u_3}\)

\(||\vec{u_3}|| = \sqrt{(-2/3)^2 + (2/3)^2 + (2/3)^2} = \sqrt{4/9 + 4/9 + 4/9} = \sqrt{12/9} = \frac{2\sqrt{3}}{3}\)

\(\hat{u_3} = \frac{3}{2\sqrt{3}}\begin{pmatrix} -2/3 \\ 2/3 \\ 2/3 \end{pmatrix} = \begin{pmatrix} \frac{-1}{\sqrt{3}} \\ \frac{1}{\sqrt{3}} \\ \frac{1}{\sqrt{3}} \end{pmatrix}\)

Step 4: Verify orthonormality

Check: \(\hat{u_i} \cdot \hat{u_j} = 0\) for \(i \neq j\) and \(\hat{u_i} \cdot \hat{u_i} = 1\)

Step 5: Present final orthonormal basis

\(\left\{ \begin{pmatrix} \frac{1}{\sqrt{2}} \\ \frac{1}{\sqrt{2}} \\ 0 \end{pmatrix}, \begin{pmatrix} \frac{1}{\sqrt{6}} \\ \frac{-1}{\sqrt{6}} \\ \frac{2}{\sqrt{6}} \end{pmatrix}, \begin{pmatrix} \frac{-1}{\sqrt{3}} \\ \frac{1}{\sqrt{3}} \\ \frac{1}{\sqrt{3}} \end{pmatrix} \right\}\)

Orthonormal basis: \(\left\{ \begin{pmatrix} \frac{1}{\sqrt{2}} \\ \frac{1}{\sqrt{2}} \\ 0 \end{pmatrix}, \begin{pmatrix} \frac{1}{\sqrt{6}} \\ \frac{-1}{\sqrt{6}} \\ \frac{2}{\sqrt{6}} \end{pmatrix}, \begin{pmatrix} \frac{-1}{\sqrt{3}} \\ \frac{1}{\sqrt{3}} \\ \frac{1}{\sqrt{3}} \end{pmatrix} \right\}\)
Final answer:

The orthonormal basis is \(\left\{ \begin{pmatrix} \frac{1}{\sqrt{2}} \\ \frac{1}{\sqrt{2}} \\ 0 \end{pmatrix}, \begin{pmatrix} \frac{1}{\sqrt{6}} \\ \frac{-1}{\sqrt{6}} \\ \frac{2}{\sqrt{6}} \end{pmatrix}, \begin{pmatrix} \frac{-1}{\sqrt{3}} \\ \frac{1}{\sqrt{3}} \\ \frac{1}{\sqrt{3}} \end{pmatrix} \right\}\)

Applied rules:

• Normalization: Divide each vector by its norm

• Orthonormality: All vectors have norm 1 and are mutually orthogonal

• Verification: Check \(\hat{u_i} \cdot \hat{u_j} = \delta_{ij}\) (Kronecker delta)

Complete Theory: Orthogonal and Orthonormal Bases
\(\langle \vec{e_i}, \vec{e_j} \rangle = \delta_{ij}\)
Orthonormality Condition
Key definitions:

Inner Product: A generalization of the dot product denoted \(\langle \vec{u}, \vec{v} \rangle\)

Orthogonal Set: A set of vectors where every pair has zero inner product

Orthonormal Set: An orthogonal set where every vector has norm 1

Orthogonal Complement: The set of all vectors orthogonal to a given subspace

Complete methodology:
  1. Orthogonality Check: Compute all pairwise inner products
  2. Gram-Schmidt Process: Convert any basis to orthogonal basis
  3. Normalization: Scale each vector to have unit length
  4. Verification: Ensure orthonormality conditions are met
Tip 1: Orthonormal bases make coordinate computations much simpler.
Tip 2: The projection of a vector onto an orthonormal basis is just the inner product with each basis vector.
Tip 3: Fourier series are expansions in terms of an orthonormal basis of trigonometric functions.
Tip 4: QR decomposition uses the Gram-Schmidt process.
Applications: Signal processing, quantum mechanics, computer graphics, data compression, machine learning.
Advanced Uses: Principal Component Analysis (PCA), Singular Value Decomposition (SVD), eigenvalue problems.
Formulas to know by heart:

• Inner product: \(\langle \vec{u}, \vec{v} \rangle = \sum_{i=1}^{n} u_i \overline{v_i}\)

• Vector norm: \(||\vec{v}|| = \sqrt{\langle \vec{v}, \vec{v} \rangle}\)

• Normalization: \(\hat{v} = \frac{\vec{v}}{||\vec{v}||}\)

• Orthogonality: \(\vec{u} \perp \vec{v} \iff \langle \vec{u}, \vec{v} \rangle = 0\)

• Gram-Schmidt: \(\vec{u_k} = \vec{v_k} - \sum_{i=1}^{k-1} \frac{\langle \vec{v_k}, \vec{u_i} \rangle}{\langle \vec{u_i}, \vec{u_i} \rangle}\vec{u_i}\)

Visualization: Vector Spaces and Bases
Exercise 6: Geometric Interpretation
Understanding geometric relationships in vector spaces:
- Orthogonal vectors are perpendicular
- Normalized vectors have unit length
- Orthonormal bases form coordinate systems

Analysis: The visualization shows how orthogonal and orthonormal bases provide coordinate systems for vector spaces.

  • Standard basis: \(\vec{e_1} = (1,0,0), \vec{e_2} = (0,1,0), \vec{e_3} = (0,0,1)\)
  • Orthogonal basis: Vectors perpendicular but possibly different lengths
  • Orthonormal basis: Perpendicular unit vectors

Questions & Answers

Question: I'm confused about the difference between orthogonal and orthonormal bases. Could you explain the key distinctions?

Answer: Great question! The distinction is fundamental:

  • Orthogonal basis: All vectors are pairwise orthogonal (dot products equal zero), but they may have any non-zero length.
  • Orthonormal basis: All vectors are pairwise orthogonal AND each vector has unit length (norm = 1).

In mathematical terms, for vectors \(\vec{u_i}\) and \(\vec{u_j}\) in the basis:

  • Orthogonal: \(\langle \vec{u_i}, \vec{u_j} \rangle = 0\) when \(i \neq j\)
  • Orthonormal: \(\langle \vec{u_i}, \vec{u_j} \rangle = \delta_{ij}\) (Kronecker delta)

Any orthogonal basis can be converted to an orthonormal basis by normalizing each vector (dividing by its norm).

Question: Why is the Gram-Schmidt process important, and when should I use it?

Answer: The Gram-Schmidt process is crucial for several reasons:

  • Constructing orthogonal bases: Given any basis, it creates an orthogonal one that spans the same space.
  • Numerical stability: Orthogonal bases reduce computational errors in numerical algorithms.
  • QR decomposition: Forms the foundation for one of the most important matrix decompositions.

Use it when you need an orthogonal or orthonormal basis from an arbitrary set of vectors, especially in applications like:

  • Solving least squares problems
  • Computing eigenvalues
  • Signal processing
  • Machine learning feature extraction

The process preserves the span of the original vectors while ensuring orthogonality.

Question: How do orthonormal bases relate to coordinate transformations and why are they preferred?

Answer: Orthonormal bases significantly simplify coordinate transformations:

  • Coordinate computation: To find coordinates of vector \(\vec{v}\) in orthonormal basis \(\{\vec{e_1}, ..., \vec{e_n}\}\), just compute \(\vec{v} = \sum_{i=1}^{n} \langle \vec{v}, \vec{e_i} \rangle \vec{e_i}\).
  • No inverse needed: The transformation matrix is orthogonal (its transpose is its inverse).
  • Preserves distances: Lengths and angles are preserved under orthogonal transformations.

They are preferred because:

  • Computations are numerically stable
  • Geometric intuition is preserved
  • Many physical laws take simpler forms in orthonormal coordinates
  • Matrix operations become more efficient

This is why orthonormal bases are fundamental in physics, engineering, and computer graphics.