EXERCISE SESSION 4 · ETH ZURICH · HS19 · linalg
Invertible and Orthogonal Matrices Invertible matrices, elementary matrices, orthogonal/unitary matrices
SB
Steven Battilana Quant · ex-ETH
Invertible Matrices
Definition
A matrix A ∈ E n × n A \in \mathbb{E}^{n \times n} A ∈ E n × n is called invertible
⟺ ∃ ! B ∈ E n × n \Longleftrightarrow \exists !B \in \mathbb{E}^{n \times n} ⟺ ∃ ! B ∈ E n × n such that A B = B A = 𝟙 AB = BA = \text{𝟙} A B = B A = 𝟙 .
𝟙 : = ( 1 0 ⋯ 0 0 ⋱ ⋱ ⋮ ⋮ ⋱ ⋱ 0 0 ⋯ 0 1 ) = ^ identity matrix \text{𝟙} := \begin{pmatrix} 1 & 0 & \cdots & 0\\ 0 & \ddots & \ddots & \vdots\\ \vdots & \ddots & \ddots & 0\\ 0 & \cdots & 0 & 1 \end{pmatrix} \quad \mathrel{\hat{=}} \text{identity matrix} 𝟙 := 1 0 ⋮ 0 0 ⋱ ⋱ ⋯ ⋯ ⋱ ⋱ 0 0 ⋮ 0 1 = ^ identity matrix B B B is then called the inverse of A A A and is usually denoted by B = A − 1 B=A^{-1} B = A − 1 .
Definition
For a 2 × 2 2 \times 2 2 × 2 matrix you can use the following definition to compute the inverse.
A − 1 = ( a b c d ) − 1 = 1 det ( A ) ( d − b − c a ) = 1 a d − b c ( d − b − c a ) . \begin{aligned} A^{-1} &= \begin{pmatrix} a & b\\ c & d \end{pmatrix}^{-1}\\ &= \frac{1}{\det(A)} \begin{pmatrix} d & -b\\ -c & a \end{pmatrix}\\ &= \frac{1}{ad - bc} \begin{pmatrix} d & -b\\ -c & a \end{pmatrix}. \end{aligned} A − 1 = ( a c b d ) − 1 = det ( A ) 1 ( d − c − b a ) = a d − b c 1 ( d − c − b a ) .
Definition
A matrix A ∈ E n × n A \in \mathbb{E}^{n \times n} A ∈ E n × n is called symmetric/Hermitian if: A = A H . \quad A = A^H. A = A H .
Satz
Let A ∈ E n × n A \in \mathbb{E}^{n \times n} A ∈ E n × n ; then the following hold:
A is invertible ⟺ A is regular ⟺ ∀ b ∈ E n , linear system A x = b : ∃ ! x ∈ E n s.t. x = A − 1 b ⟺ rank ( A ) = n (" A has full rank") \begin{aligned} A \text{ is invertible } &\Longleftrightarrow A \text{ is regular}\\ &\Longleftrightarrow \forall b \in \mathbb{E}^n,\,\, \text{linear system } Ax=b: \quad \exists! x \in \mathbb{E}^n \text{ s.t.}\quad x=A^{-1}b\\ &\Longleftrightarrow \text{rank}(A)=n \quad \text{ ("}A\text{ has full rank")} \end{aligned} A is invertible ⟺ A is regular ⟺ ∀ b ∈ E n , linear system A x = b : ∃ ! x ∈ E n s.t. x = A − 1 b ⟺ rank ( A ) = n (" A has full rank")
Definition
If m m m is an arbitrary natural number, 1 ≤ i , j ≤ m 1\leq i,j \leq m 1 ≤ i , j ≤ m with i ≠ j , λ ∈ E i\neq j,\, \lambda \in \mathbb{E} i = j , λ ∈ E and A ∈ E m × m A \in \mathbb{E}^{m \times m} A ∈ E m × m , then the matrices P i j , S i ( λ ) , E i j ( λ ) ∈ E m × m P_{ij}, S_i(\lambda), E_{ij}(\lambda) \in \mathbb{E}^{m \times m} P ij , S i ( λ ) , E ij ( λ ) ∈ E m × m are called elementary matrices .
(i) To swap row i i i with row j j j , multiply from the left by the permutation matrix : P i j A P_{ij}A P ij A
P i j = ⋱ ⋱ ⋱ i -th column ⋱ ⋱ ⋱ ⋱ j -th column ⋱ ⋱ ⋱ ⋱ ( ⋱ ⋱ ⋱ ⋱ ⋱ ⋱ ⋱ ⋱ ⋱ ⋱ ⋱ 1 ⋱ ⋱ ⋱ 1 ⋱ 0 ⋱ 1 ⋱ 1 ⋱ ⋱ ⋱ 1 ⋱ 1 ⋱ 0 ⋱ 1 ⋱ ⋱ ⋱ 1 ⋱ ⋱ ⋱ ⋱ ⋱ ⋱ ⋱ ⋱ ⋱ ⋱ ⋱ ⋱ ) ⋱ ⋱ ⋱ ⋱ i -th row ⋱ ⋱ ⋱ ⋱ j -th row ⋱ ⋱ ⋱ P_{ij} = \begin{array}{cccl} & \begin{array}{ccccccccccc} \phantom{\ddots} & \phantom{\ddots} & \phantom{\ddots} & \mathclap{\scriptsize\text{$i$-th column}}\phantom{\ddots} & \phantom{\ddots} & \phantom{\ddots} & \phantom{\ddots} & \mathclap{\scriptsize\text{$j$-th column}}\phantom{\ddots} & \phantom{\ddots} & \phantom{\ddots} & \phantom{\ddots} \end{array} & & \\ \left(\vphantom{\begin{array}{c} \ddots \\ \ddots \\ \ddots \\ \ddots \\ \ddots \\ \ddots \\ \ddots \\ \ddots \\ \ddots \\ \ddots \\ \ddots \end{array}}\right. & \begin{array}{ccccccccccc} \mathclap{1}\phantom{\ddots} & & & & & & & & & & \\ & \mathclap{\ddots}\phantom{\ddots} & & & & & & & & & \\ & & \mathclap{1}\phantom{\ddots} & & & & & & & & \\ & & & \mathclap{0}\phantom{\ddots} & & & & \mathclap{1}\phantom{\ddots} & & & \\ & & & & \mathclap{1}\phantom{\ddots} & & & & & & \\ & & & & & \mathclap{\ddots}\phantom{\ddots} & & & & & \\ & & & & & & \mathclap{1}\phantom{\ddots} & & & & \\ & & & \mathclap{1}\phantom{\ddots} & & & & \mathclap{0}\phantom{\ddots} & & & \\ & & & & & & & & \mathclap{1}\phantom{\ddots} & & \\ & & & & & & & & & \mathclap{\ddots}\phantom{\ddots} & \\ & & & & & & & & & & \mathclap{1}\phantom{\ddots} \end{array} & \left.\vphantom{\begin{array}{c} \ddots \\ \ddots \\ \ddots \\ \ddots \\ \ddots \\ \ddots \\ \ddots \\ \ddots \\ \ddots \\ \ddots \\ \ddots \end{array}}\right) & \begin{array}{l} \vphantom{\ddots} \\ \vphantom{\ddots} \\ \vphantom{\ddots} \\ \vphantom{\ddots}\scriptsize\text{$i$-th row} \\ \vphantom{\ddots} \\ \vphantom{\ddots} \\ \vphantom{\ddots} \\ \vphantom{\ddots}\scriptsize\text{$j$-th row} \\ \vphantom{\ddots} \\ \vphantom{\ddots} \\ \vphantom{\ddots} \end{array} \end{array} P ij = ⋱ ⋱ ⋱ ⋱ ⋱ ⋱ ⋱ ⋱ ⋱ ⋱ ⋱ ⋱ ⋱ ⋱ i -th column ⋱ ⋱ ⋱ ⋱ j -th column ⋱ ⋱ ⋱ ⋱ 1 ⋱ ⋱ ⋱ 1 ⋱ 0 ⋱ 1 ⋱ 1 ⋱ ⋱ ⋱ 1 ⋱ 1 ⋱ 0 ⋱ 1 ⋱ ⋱ ⋱ 1 ⋱ ⋱ ⋱ ⋱ ⋱ ⋱ ⋱ ⋱ ⋱ ⋱ ⋱ ⋱ ⋱ ⋱ ⋱ ⋱ i -th row ⋱ ⋱ ⋱ ⋱ j -th row ⋱ ⋱ ⋱ Remark: For permutation matrices we have: P i j T = P i j − 1 = P i j P_{ij}^T = P_{ij}^{-1} = P_{ij} P ij T = P ij − 1 = P ij .
(ii) To multiply row i i i by λ ≠ 0 \lambda \neq 0 λ = 0 , multiply from the left: S i ( λ ) A S_i(\lambda)A S i ( λ ) A
S i ( λ ) = ⋱ ⋱ ⋱ i -th column ⋱ ⋱ ⋱ ⋱ ( ⋱ ⋱ ⋱ ⋱ ⋱ ⋱ ⋱ 1 ⋱ ⋱ ⋱ 1 ⋱ λ ⋱ 1 ⋱ ⋱ ⋱ 1 ⋱ ⋱ ⋱ ⋱ ⋱ ⋱ ⋱ ⋱ ) ⋱ ⋱ ⋱ ⋱ i -th row ⋱ ⋱ ⋱ S_i(\lambda) = \begin{array}{cccl} & \begin{array}{ccccccc} \phantom{\ddots} & \phantom{\ddots} & \phantom{\ddots} & \mathclap{\scriptsize\text{$i$-th column}}\phantom{\ddots} & \phantom{\ddots} & \phantom{\ddots} & \phantom{\ddots} \end{array} & & \\ \left(\vphantom{\begin{array}{c} \ddots \\ \ddots \\ \ddots \\ \ddots \\ \ddots \\ \ddots \\ \ddots \end{array}}\right. & \begin{array}{ccccccc} \mathclap{1}\phantom{\ddots} & & & & & & \\ & \mathclap{\ddots}\phantom{\ddots} & & & & & \\ & & \mathclap{1}\phantom{\ddots} & & & & \\ & & & \mathclap{\lambda}\phantom{\ddots} & & & \\ & & & & \mathclap{1}\phantom{\ddots} & & \\ & & & & & \mathclap{\ddots}\phantom{\ddots} & \\ & & & & & & \mathclap{1}\phantom{\ddots} \end{array} & \left.\vphantom{\begin{array}{c} \ddots \\ \ddots \\ \ddots \\ \ddots \\ \ddots \\ \ddots \\ \ddots \end{array}}\right) & \begin{array}{l} \vphantom{\ddots} \\ \vphantom{\ddots} \\ \vphantom{\ddots} \\ \vphantom{\ddots}\scriptsize\text{$i$-th row} \\ \vphantom{\ddots} \\ \vphantom{\ddots} \\ \vphantom{\ddots} \end{array} \end{array} S i ( λ ) = ⋱ ⋱ ⋱ ⋱ ⋱ ⋱ ⋱ ⋱ ⋱ ⋱ i -th column ⋱ ⋱ ⋱ ⋱ 1 ⋱ ⋱ ⋱ 1 ⋱ λ ⋱ 1 ⋱ ⋱ ⋱ 1 ⋱ ⋱ ⋱ ⋱ ⋱ ⋱ ⋱ ⋱ ⋱ ⋱ ⋱ ⋱ i -th row ⋱ ⋱ ⋱ (iii) To replace row i i i by (row i + λ ⋅ i+\lambda \cdot i + λ ⋅ row j j j ), multiply from the left: E i j ( λ ) A E_{ij}(\lambda)A E ij ( λ ) A
E i j ( λ ) = ⋱ ⋱ ⋱ i -th column ⋱ ⋱ ⋱ ⋱ j -th column ⋱ ⋱ ⋱ ⋱ ( ⋱ ⋱ ⋱ ⋱ ⋱ ⋱ ⋱ ⋱ ⋱ ⋱ ⋱ 1 ⋱ ⋱ ⋱ 1 ⋱ 1 ⋱ λ ⋱ 1 ⋱ ⋱ ⋱ 1 ⋱ 0 ⋱ 1 ⋱ 1 ⋱ ⋱ ⋱ 1 ⋱ ⋱ ⋱ ⋱ ⋱ ⋱ ⋱ ⋱ ⋱ ⋱ ⋱ ⋱ ) ⋱ ⋱ ⋱ ⋱ i -th row ⋱ ⋱ ⋱ ⋱ j -th row ⋱ ⋱ ⋱ E_{ij}(\lambda) = \begin{array}{cccl} & \begin{array}{ccccccccccc} \phantom{\ddots} & \phantom{\ddots} & \phantom{\ddots} & \mathclap{\scriptsize\text{$i$-th column}}\phantom{\ddots} & \phantom{\ddots} & \phantom{\ddots} & \phantom{\ddots} & \mathclap{\scriptsize\text{$j$-th column}}\phantom{\ddots} & \phantom{\ddots} & \phantom{\ddots} & \phantom{\ddots} \end{array} & & \\ \left(\vphantom{\begin{array}{c} \ddots \\ \ddots \\ \ddots \\ \ddots \\ \ddots \\ \ddots \\ \ddots \\ \ddots \\ \ddots \\ \ddots \\ \ddots \end{array}}\right. & \begin{array}{ccccccccccc} \mathclap{1}\phantom{\ddots} & & & & & & & & & & \\ & \mathclap{\ddots}\phantom{\ddots} & & & & & & & & & \\ & & \mathclap{1}\phantom{\ddots} & & & & & & & & \\ & & & \mathclap{1}\phantom{\ddots} & & & & \mathclap{\lambda}\phantom{\ddots} & & & \\ & & & & \mathclap{1}\phantom{\ddots} & & & & & & \\ & & & & & \mathclap{\ddots}\phantom{\ddots} & & & & & \\ & & & & & & \mathclap{1}\phantom{\ddots} & & & & \\ & & & \mathclap{0}\phantom{\ddots} & & & & \mathclap{1}\phantom{\ddots} & & & \\ & & & & & & & & \mathclap{1}\phantom{\ddots} & & \\ & & & & & & & & & \mathclap{\ddots}\phantom{\ddots} & \\ & & & & & & & & & & \mathclap{1}\phantom{\ddots} \end{array} & \left.\vphantom{\begin{array}{c} \ddots \\ \ddots \\ \ddots \\ \ddots \\ \ddots \\ \ddots \\ \ddots \\ \ddots \\ \ddots \\ \ddots \\ \ddots \end{array}}\right) & \begin{array}{l} \vphantom{\ddots} \\ \vphantom{\ddots} \\ \vphantom{\ddots} \\ \vphantom{\ddots}\scriptsize\text{$i$-th row} \\ \vphantom{\ddots} \\ \vphantom{\ddots} \\ \vphantom{\ddots} \\ \vphantom{\ddots}\scriptsize\text{$j$-th row} \\ \vphantom{\ddots} \\ \vphantom{\ddots} \\ \vphantom{\ddots} \end{array} \end{array} E ij ( λ ) = ⋱ ⋱ ⋱ ⋱ ⋱ ⋱ ⋱ ⋱ ⋱ ⋱ ⋱ ⋱ ⋱ ⋱ i -th column ⋱ ⋱ ⋱ ⋱ j -th column ⋱ ⋱ ⋱ ⋱ 1 ⋱ ⋱ ⋱ 1 ⋱ 1 ⋱ 0 ⋱ 1 ⋱ ⋱ ⋱ 1 ⋱ λ ⋱ 1 ⋱ 1 ⋱ ⋱ ⋱ 1 ⋱ ⋱ ⋱ ⋱ ⋱ ⋱ ⋱ ⋱ ⋱ ⋱ ⋱ ⋱ ⋱ ⋱ ⋱ ⋱ i -th row ⋱ ⋱ ⋱ ⋱ j -th row ⋱ ⋱ ⋱
Algorithm recipe: computing the inverse
Given: A ∈ E n × n A \in \mathbb{E}^{n \times n} A ∈ E n × n
Wanted: A − 1 A^{-1} A − 1
Write down the scheme ( A ∣ 𝟙 ) (A|\text{𝟙}) ( A ∣ 𝟙 )
Use Gaussian elimination to transform A A A into the identity matrix
( A ∣ 𝟙 ) ⇝ ⋯ ⇝ ( 𝟙 ∣ A − 1 ) (A|\text{𝟙}) \leadsto \dots \leadsto (\text{𝟙}|A^{-1}) ( A ∣ 𝟙 ) ⇝ ⋯ ⇝ ( 𝟙 ∣ A − 1 )
Check A − 1 A = A A − 1 = 𝟙 A^{-1}A = AA^{-1} = \text{𝟙} A − 1 A = A A − 1 = 𝟙
Example 1
Given: A ∈ R 3 × 3 A \in \mathbb{R}^{3 \times 3} A ∈ R 3 × 3 :
A = ( 3 2 6 1 1 3 − 3 − 2 − 5 ) A = \begin{pmatrix} 3 & 2 & 6\\ 1 & 1 & 3\\ -3 & -2 & -5 \end{pmatrix} A = 3 1 − 3 2 1 − 2 6 3 − 5 Wanted: A − 1 A^{-1} A − 1
Show solution Hide solution ( 3 2 6 1 0 0 1 1 3 0 1 0 − 3 − 2 − 5 0 0 1 ) ⇝ ( i i ) − l 21 ⋅ ( i ) ( 3 2 6 1 0 0 0 1 3 1 − 1 3 1 0 − 3 − 2 − 5 0 0 1 ) \left(\begin{array}{ccc|ccc} 3 & 2 & 6 & 1 & 0 & 0\\ 1 & 1 & 3 & 0 & 1 & 0\\ -3 & -2 & -5 & 0 & 0 & 1 \end{array}\right) \overset{(ii)-l_{21} \cdot (i)}{\leadsto} \left(\begin{array}{ccc|ccc} 3 & 2 & 6 & 1 & 0 & 0\\ 0 & \frac{1}{3} & 1 & -\frac{1}{3} & 1 & 0\\ -3 & -2 & -5 & 0 & 0 & 1 \end{array}\right) 3 1 − 3 2 1 − 2 6 3 − 5 1 0 0 0 1 0 0 0 1 ⇝ ( ii ) − l 21 ⋅ ( i ) 3 0 − 3 2 3 1 − 2 6 1 − 5 1 − 3 1 0 0 1 0 0 0 1 ⇝ ( i i i ) − l 31 ⋅ ( i ) ( 3 2 6 1 0 0 0 1 3 1 − 1 3 1 0 0 0 1 1 0 1 ) ⇝ ( i i ) − 1 1 ⋅ ( i i i ) ( 3 2 6 1 0 0 0 1 3 0 − 4 3 1 − 1 0 0 1 1 0 1 ) \overset{(iii)-l_{31} \cdot (i)}{\leadsto} \left(\begin{array}{ccc|ccc} 3 & 2 & 6 & 1 & 0 & 0\\ 0 & \frac{1}{3} & 1 & -\frac{1}{3} & 1 & 0\\ 0 & 0 & 1 & 1 & 0 & 1 \end{array}\right) \overset{(ii)- \frac{1}{1} \cdot (iii)}{\leadsto} \left(\begin{array}{ccc|ccc} 3 & 2 & 6 & 1 & 0 & 0\\ 0 & \frac{1}{3} & 0 & -\frac{4}{3} & 1 & -1\\ 0 & 0 & 1 & 1 & 0 & 1 \end{array}\right) ⇝ ( iii ) − l 31 ⋅ ( i ) 3 0 0 2 3 1 0 6 1 1 1 − 3 1 1 0 1 0 0 0 1 ⇝ ( ii ) − 1 1 ⋅ ( iii ) 3 0 0 2 3 1 0 6 0 1 1 − 3 4 1 0 1 0 0 − 1 1 ⇝ ( i ) − 6 1 ⋅ ( i i i ) ( 3 2 0 − 5 0 − 6 0 1 3 0 − 4 3 1 − 1 0 0 1 1 0 1 ) ⇝ ( i ) − 2 1 / 3 ⋅ ( i i ) ( 3 0 0 3 − 6 0 0 1 3 0 − 4 3 1 − 1 0 0 1 1 0 1 ) \overset{(i)- \frac{6}{1} \cdot (iii)}{\leadsto} \left(\begin{array}{ccc|ccc} 3 & 2 & 0 & -5 & 0 & -6\\ 0 & \frac{1}{3} & 0 & -\frac{4}{3} & 1 & -1\\ 0 & 0 & 1 & 1 & 0 & 1 \end{array}\right) \overset{(i)- \frac{2}{1/3} \cdot (ii)}{\leadsto} \left(\begin{array}{ccc|ccc} 3 & 0 & 0 & 3 & -6 & 0\\ 0 & \frac{1}{3} & 0 & -\frac{4}{3} & 1 & -1\\ 0 & 0 & 1 & 1 & 0 & 1 \end{array}\right) ⇝ ( i ) − 1 6 ⋅ ( iii ) 3 0 0 2 3 1 0 0 0 1 − 5 − 3 4 1 0 1 0 − 6 − 1 1 ⇝ ( i ) − 1/3 2 ⋅ ( ii ) 3 0 0 0 3 1 0 0 0 1 3 − 3 4 1 − 6 1 0 0 − 1 1 ⇝ ( i ) ⋅ 1 3 ( 1 0 0 1 − 2 0 0 1 3 0 − 4 3 1 − 1 0 0 1 1 0 1 ) ⇝ ( i i ) ⋅ 3 ( 1 0 0 1 − 2 0 0 1 0 − 4 3 − 3 0 0 1 1 0 1 ) \overset{(i) \cdot \frac{1}{3}}{\leadsto} \left(\begin{array}{ccc|ccc} 1 & 0 & 0 & 1 & -2 & 0\\ 0 & \frac{1}{3} & 0 & -\frac{4}{3} & 1 & -1\\ 0 & 0 & 1 & 1 & 0 & 1 \end{array}\right) \overset{(ii) \cdot 3}{\leadsto} \left(\begin{array}{ccc|ccc} 1 & 0 & 0 & 1 & -2 & 0\\ 0 & 1 & 0 & -4 & 3 & -3\\ 0 & 0 & 1 & 1 & 0 & 1 \end{array}\right) ⇝ ( i ) ⋅ 3 1 1 0 0 0 3 1 0 0 0 1 1 − 3 4 1 − 2 1 0 0 − 1 1 ⇝ ( ii ) ⋅ 3 1 0 0 0 1 0 0 0 1 1 − 4 1 − 2 3 0 0 − 3 1 ⟹ A − 1 = ( 1 − 2 0 − 4 3 − 3 1 0 1 ) \Longrightarrow \quad A^{-1} = \begin{pmatrix} 1 & -2 & 0\\ -4 & 3 & -3\\ 1 & 0 & 1 \end{pmatrix} ⟹ A − 1 = 1 − 4 1 − 2 3 0 0 − 3 1
Orthogonal and Unitary Matrices
Definition
A complex n × n n \times n n × n matrix A A A is called unitary if A H A = A A H = 𝟙 A^HA = AA^H = \text{𝟙} A H A = A A H = 𝟙 .
A real n × n n \times n n × n matrix A A A is called orthogonal if A T A = A A T = 𝟙 A^TA = AA^T = \text{𝟙} A T A = A A T = 𝟙 .
Satz
If A , B ∈ E n × n A,B \in \mathbb{E}^{n \times n} A , B ∈ E n × n are unitary (or orthogonal) matrices, then:
(i) A A A is regular
(ii) A − 1 = A H A^{-1} = A^H A − 1 = A H (or A − 1 = A T A^{-1} = A^T A − 1 = A T )
(iii) A − 1 A^{-1} A − 1 is unitary (orthogonal)
(iv) A B AB A B is unitary (orthogonal)
Definition
The Kronecker delta is defined by:
δ i j = { 1 , i = j 0 , i ≠ j \delta_{ij} = \begin{cases} 1, \quad i=j\\ 0, \quad i \neq j \end{cases} δ ij = { 1 , i = j 0 , i = j
Definition unit vectors
e 1 : = ( 1 0 ⋮ 0 ) , e 2 : = ( 0 1 0 ⋮ 0 ) , e i : = ( 0 ⋮ 0 1 0 ⋮ 0 ) , e n : = ( 0 ⋮ 0 1 ) e_1 := \begin{pmatrix} 1\\ 0\\ \vdots\\ 0 \end{pmatrix}, e_2 := \begin{pmatrix} 0\\ 1\\ 0\\ \vdots\\ 0 \end{pmatrix}, e_i := \begin{pmatrix} 0\\ \vdots\\ 0\\ 1\\ 0\\ \vdots\\ 0 \end{pmatrix}, e_n := \begin{pmatrix} 0\\ \vdots\\ 0\\ 1 \end{pmatrix} e 1 := 1 0 ⋮ 0 , e 2 := 0 1 0 ⋮ 0 , e i := 0 ⋮ 0 1 0 ⋮ 0 , e n := 0 ⋮ 0 1
Example 2
⟨ e 1 , e 2 ⟩ = 0 \langle e_1, e_2 \rangle = 0 ⟨ e 1 , e 2 ⟩ = 0
⟨ e 1 , e 1 ⟩ = 1 \langle e_1, e_1 \rangle = 1 ⟨ e 1 , e 1 ⟩ = 1
Definition orthonormal
Let a , b ∈ E n a,b \in \mathbb{E}^n a , b ∈ E n . The vectors a , b a,b a , b are orthonormal if the following conditions are satisfied:
The vectors are normalised, i.e.: ∥ a ∥ = 1 and ∥ b ∥ = 1. \Vert a \Vert = 1 \quad \text{and} \quad \Vert b \Vert = 1. ∥ a ∥ = 1 and ∥ b ∥ = 1. The vectors are orthogonal, i.e.: ⟨ a , b ⟩ = 0. \langle a, b \rangle = 0. ⟨ a , b ⟩ = 0.