Skip to main content

2.4 Angles between vectors and Orthogonality

In addition to enabling the definition of lengths of vectors, as well as the distance between two vectors, inner products also capture the geometry of a vector space by defining the angle $\omega$ between two vectors.
Assume $x \ne 0, y \ne 0$, then

$ -1 \le  \frac{<x,y> }{\left \| x \right \|\left \| y\right \|}$ $  \le 1$

therefore there exist a unique $\omega \in [0,\pi]$ with

$ cos \omega=  \frac{<x,y> }{\left \| x \right \|\left \| y\right \|}$

The number $\omega$ is the angle between the vectors $x$ and $y$. Intuitively, the angle between two vectors tells us how similar their orientations are. For example, using the dot product, the angle between $x$ and $y = 4x$, i.e., y is a scaled version of x, is 0: Their orientation is the same.

Example ( university question)
Lets consider the angle between $x=[1,1]^T \in \mathbb{R}^2$ and $y=[1,2]^T \in \mathbb{R}^2$.If we use dot product as the inner product

$cos \omega=\frac{<x,y>}{\sqrt{<x,x><y,y>}}=\frac{x^Ty}{\sqrt{x^Txy^Ty}}=\frac{3}{\sqrt{10}}$

and the angle between the two vectors is $arccos(\frac{3}{\sqrt{10}}) \approx 0.32 rad$, which corresponds to about $18^{\circ}$.

# calculating angle between vectors
from math import sqrt
import numpy as np
# define data
x =np.array([1,1])
y =np.array([1,2])
print("x")
print(x)
print("y")
print(y)

cosw = x.dot(y)/(sqrt(x.dot(x)*y.dot(y)))
print("angle between vectors in radiance")
print(np.arccos(cosw))
print("angle between vectors in degrees")
print(np.arccos(cosw)*180.0/np.pi)

O/P
x 
[1 1] 
y 
[1 2] 
angle between vectors in radiance 
0.3217505543966423 
angle between vectors in degrees 
18.434948822922017

Orthogonality
Two vectors $x$ and $y$ are orthogonal if and only if $<x,y>=0$, and we write $x \perp y$. If additionally $\left \| x \right \| = 1 = \left \| y \right \|$, i.e., the vectors are unit vectors, then $x$ and $y$ are orthonormal.
An implication of this definition is that the 0-vector is orthogonal to every vector in the vector space.

Note: vectors that are orthogonal with respect to one inner product do not have to be orthogonal with respect to different inner product.

Example:University question
Are the vectors $x = [2, 5 ,1]^𝑇$ and $y = [9, −3 ,6]^𝑇 $ orthogonal?. Justify your answer.

Their  dot product is $2*9 + 5* -3 + 1*6=18-15+6=9$, which is not equal to zero.
So the vectors are not orthogonal.

The angle between them is $(\theta)=arccos(9/\sqrt{30}.\sqrt{126})$, which is not 90 degrees.

Example:University question
Determine whether the vectors
$a=\begin{bmatrix}
3\\
0\\
-2
\end{bmatrix} b=\begin{bmatrix}
2\\
0\\
3
\end{bmatrix}$ are orthogonal or not

The dot product $a.b=6+0-6=0$. Hence the vectors are orthogonal

Comments

Post a Comment

Popular posts from this blog

Mathematics for Machine Learning- CST 284 - KTU Minor Notes - Dr Binu V P

  Introduction About Me Syllabus Course Outcomes and Model Question Paper University Question Papers and Evaluation Scheme -Mathematics for Machine learning CST 284 KTU Overview of Machine Learning What is Machine Learning (video) Learn the Seven Steps in Machine Learning (video) Linear Algebra in Machine Learning Module I- Linear Algebra 1.Geometry of Linear Equations (video-Gilbert Strang) 2.Elimination with Matrices (video-Gilbert Strang) 3.Solving System of equations using Gauss Elimination Method 4.Row Echelon form and Reduced Row Echelon Form -Python Code 5.Solving system of equations Python code 6. Practice problems Gauss Elimination ( contact) 7.Finding Inverse using Gauss Jordan Elimination  (video) 8.Finding Inverse using Gauss Jordan Elimination-Python code Vectors in Machine Learning- Basics 9.Vector spaces and sub spaces 10.Linear Independence 11.Linear Independence, Basis and Dimension (video) 12.Generating set basis and span 13.Rank of a Matrix 14.Linear Mapping...
Post a Comment
Read more

1.1 Solving system of equations using Gauss Elimination Method

Elementary Transformations Key to solving a system of linear equations are elementary transformations that keep the solution set the same, but that transform the equation system into a simpler form: Exchange of two equations (rows in the matrix representing the system of equations) Multiplication of an equation (row) with a constant  Addition of two equations (rows) Add a scalar multiple of one row to the other. Row Echelon Form A matrix is in row-echelon form if All rows that contain only zeros are at the bottom of the matrix; correspondingly,all rows that contain at least one nonzero element are on top of rows that contain only zeros. Looking at nonzero rows only, the first nonzero number from the left pivot (also called the pivot or the leading coefficient) is always strictly to the right of the  pivot of the row above it. The row-echelon form is where the leading (first non-zero) entry of each row has only zeroes below it. These leading entries are called...
Post a Comment
Read more

2.11 Eigen Value and Eigen Vectors

Eigenvalues and Eigenvectors Geometrically, an eigenvector, corresponding to a real nonzero eigenvalue, points in a direction in which it is stretched by the transformation and the eigenvalue is the factor by which it is stretched. If the eigenvalue is negative, the direction is reversed. Definition: Let $A \in \mathbb{R}^{n \times n}$ be a square matrix. Then $\lambda \in \mathbb{R}$ is an eigen value of $A$ and $ x \in \mathbb{R}^n /{0} $ is the corresponding eigen vector of  $A$ if       $Ax=\lambda x$ We call this as Eigenvalue equation The following statements are equivalent $\lambda$ is the eigen value of $A$ There exist an $x \in \mathbb{R}^n/0$ with $Ax=\lambda x$ or equivalently $(A-\lambda I_n)x=0$ can be solved non trivially i.e., $x \ne 0$ $rank(A-\lambda I) \le n$ $det(A-\lambda I) =0$ collinearity and codirection Two vectors that point in the same direction are called codirected.Two vectors are collinear if they point in the same or opposite directio...
Post a Comment
Read more