Skip to main content

1.11 Transformation Matrix in New Basis

Lets look at how transformation matrices of a linear mapping $T: V \to W$ change if we change the bases in $V$ and W.

Consider two ordered bases of  $V$
$B= ( b_1,b_2,......,b_n)$
$\tilde{B}=( \tilde{b_1},\tilde{b_2},......,\tilde{b_n})$
Consider two ordered bases of W
$C= ( c_1,c_2,......,c_n)$
$\tilde{C}=( \tilde{c_1},\tilde{c_2},......,\tilde{c_m})$

Let $A\in \mathbb{R}^{m \times n}$ be the transformation matrix from $V \to W $ with respect to basic $B$ and $C$ and $\tilde{A}\in \mathbb{R}^{m \times n}$ be the transformation matrix from $V \to W$ with respect to basis $\tilde{B}$ and $\tilde{C}$.

We will find out how $A$ and $\tilde{A}$ are related ie; how we can transform $A$ to $\tilde{A}$.

The transformation matrix $\tilde{A}=T^{-1} A S $

Here $S \in \mathbb{R}^{n \times n}$ is the  transformation matrix that maps coordinates with respect to $\tilde{B}$ into coordinates with respect to $B$ and  $T \in \mathbb{R}^{m \times m}$ is the  transformation matrix that maps coordinates with respect to $\tilde{C}$ into coordinates with respect to $C$.
Lets consider a transformation matrix with respect to the standard basis(B)
$A=\displaystyle \left[\begin{matrix}1 & 2\\2 & 1\end{matrix}\right]$

If we define a new basis  in $\mathbb{R}^2$
$S=\displaystyle \left[\begin{matrix}1 & 1\\1 & -1\end{matrix}\right]$
 
Then any vector in the new basis can be transformed with a new transformation matrix which is easier to work $\tilde{A}=S^{-1}AS$
     $\tilde{A}=  \left[\begin{matrix}-1 & -1\\-1 & 1\end{matrix}\right]  \left[\begin{matrix}1 & 2\\2 & 1\end{matrix}\right]  \left[\begin{matrix}1 & 1\\1 & -1\end{matrix}\right] =  \left[\begin{matrix}3 & 0\\0 & 1\end{matrix}\right]$

It is noted that we obtain a diagonal matrix which is easier to work than the original transformation matrix.

import numpy as np
B=np.array([[1,1],[1,-1]])
A=np.array([[2,1],[1,2]])
Ab=np.linalg.inv(B).dot(A.dot(B))
print("new transformation matrix in base B")
print(Ab)

o/p
new transformation matrix in base B 
[[3. 0.] 
[0. 1.]]

import numpy as np
Bn=np.array([[1,0,1],[1,1,0],[0,1,1]])
Cn=np.array([[1,1,0,1],[1,0,1,0],[0,1,1,0],[0,0,0,1]])
A=np.array([[1,2,0],[-1,1,3],[3,7,1],[-1,2,4]])
print("Tranformation Matrix A defined in stardard basis")
print(A)
S=Bn
T=Cn
print("New Basis")
print(S)
print(T)
print("Tranformation matrix in New basis is")
An=A.dot(S)
An=np.linalg.inv(T).dot(An)
print(An)

o/p

Transformation Matrix A defined in standard basis
[[ 1  2  0]
 [-1  1  3]
 [ 3  7  1]
 [-1  2  4]]
New Basis-S
[[1 0 1]
 [1 1 0]
 [0 1 1]]
New Basis-T
[[1 1 0 1] [1 0 1 0] [0 1 1 0] [0 0 0 1]] Transformation matrix in New basis is [[-4. -4. -2.] [ 6. 0. 0.] [ 4. 8. 4.] [ 1. 6. 3.]]

Example:

Given the linear transformation $T(x,y,z,w)=(x+2y-z,x+w)$.Find the matrix representation of the above transformation. Find the matrix representation with respect to the bases $B_1=\{(1,0,0,0),(1,1,0,0),(1,1,1,0),(1,1,1,1)\}$ for $\mathbb{R}^4$ and $B_2=\{(1,1),(1,0)\}$ for $\mathbb{R}^2$

Transformation matrix in standard basis
$A=\begin{bmatrix}
1&2&-1&0 \\
1&0&0&1
\end{bmatrix}$

New Basis transformation matrix
$S=\begin{bmatrix}
1&1&1&1 \\
0&1&1&1\\
0&0&1&1\\
0&0&0&1
\end{bmatrix}$
New Basis transformation matrix
$T=\begin{bmatrix}
1&1 \\
1&0\\
\end{bmatrix}$
Inverse of $T$ is
$T=\begin{bmatrix}
0&1 \\
1&-1\\
\end{bmatrix}$

So the transformation matrix in new basis is  $\tilde{A}=T^{-1} A S $
$\tilde{A}=\begin{bmatrix}0&1 \\
1&-1\\
\end{bmatrix} \begin{bmatrix}
1&2&-1&0 \\
1&0&0&1
\end{bmatrix}\begin{bmatrix}
1&1&1&1 \\
0&1&1&1\\
0&0&1&1\\
0&0&0&1
\end{bmatrix}$

$\tilde{A}=\begin{bmatrix}
1&1&1&2 \\
0&2&1&0
\end{bmatrix}$

Comments

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...

Vectors in Machine Learning

As data scientists we work with data in various formats such as text images and numerical values We often use vectors to represent data in a structured and efficient manner especially in machine learning applications In this blog post we will explore what vectors are in terms of machine learning their significance and how they are used What is a Vector? In mathematics, a vector is a mathematical object that has both magnitude and direction. In machine learning, a vector is a mathematical representation of a set of numerical values. Vectors are usually represented as arrays or lists of numbers, and each number in the list represents a specific feature or attribute of the data. For example, suppose we have a dataset of houses, and we want to predict their prices based on their features such as the number of bedrooms, the size of the house, and the location. We can represent each house as a vector, where each element of the vector represents a specific feature of the house, such as the nu...

2.14 Singular Value Decomposition

The Singular Value Decomposition ( SVD) of a matrix is a central matrix decomposition method in linear algebra.It can be applied to all matrices,not only to square matrices and it always exists.It has been referred to as the 'fundamental theorem of linear algebra'( strang 1993). SVD Theorem: Let $A^{m \times n}$ be a rectangular matrix of rank $r \in [0,min(m,n)]$. The SVD of A is a decomposition of the form. $A= U \Sigma V^T $ with an orthogonal matrix $U \in \mathbb{R}^{m \times m}$ with column vectors $u_i, i=1,\ldots,m$ and an orthogonal matrix $V \in \mathbb{R}^{n \times n}$ with column vectors $v_j, j=1,\ldots,n$.Moreover, $\Sigma$ is an $m \times n$ matrix with $\sum_{ii} = \sigma \ge 0$ and $\sigma_{ij}=0, i \ne j$. The diagonal entries $\Sigma_i=1,\ldots,r$ of $\sigma$ are called singular values . $u_i$ are called left singular vectors , and $v_j$ are called right singular vectors .By convention singular values are ordered ie; $\sigma_1 \ge \sigma_2 \ldots \sigma_r \...