Skip to main content

2.10 Determinant and Trace of Matrix- Importance

Determinant

Determinants are defined for square matrices and it is a function that maps the matrix into a real number.Determinants are important concepts in linear algebra.It is used in the analysis and solution of system of linear equations. Determinant of a matrix is represented as $det(A)$ or $|A|$.

determinants are used for testing the invertibility.  A square matrix $A \in \mathbb{R}^{n \times n}$ is invertable if and only if $det(A) \ne 0$

For a diagonal, upper triangular and lower triangular matrix, the determinant is the product of its diagonal element

Determinant measures volume.If the two sides of the parallelogram is represented as a two columns of a matrix then the absolute value of the determinant represents volume.For a parallelepiped with three sides r,b,g then determinant of the 3x3 matrix $[ r b g ]$ is the volume of the solid.


Laplace expansion can be used to find determinant.It reduces the problem of computing the determinant of $ n \times n$ matrix into computing the determinant of  $(n-1) \times (n-1)$ matrices.

Consider a matrix $A \in \mathbb{R}^{n \times n}$ Then Laplace expansion along the column $j$ is

$det(A) =  \sum_{k=1}^{n} (-1)^{k+j} a_{kj} det(A_{k,j})$

Expansion along the row is 

$det(A) =  \sum_{k=1}^{n} (-1)^{k+j} a_{jk} det(A_{j,k})$

Here $A_{k,j} \in \mathbb{R}^(n-1) \times (n-1)$ is the submatrix of $A$ that we obtain when deleting row $k$ and column $j$.

Example 3 x 3 matrix:(Laplace Expansion to find the Determinants)


so $det(A)= -5$


import numpy as np
A=np.array([[1,2,3],[3,1,2],[0,0,1]])
detA=np.linalg.det(A)
print(" det(A)")
print(detA)
o/p
det(A) 
-5.000000000000001
Note: determinant can also be computed using Sarru's rule.

Properties of determinants
For  $A \in \mathbb{R}^{n \times n}$, the determinant exhibits the following properties.

$1.det(AB)=det(A).det(B)$
$2.det(A)=det(A^T)$
$3.det(A^{-1})=1/det(A)$
4.Similar matrices possess same determinant.So the determinant is invariant to the choice of basis of a linear mapping 
5.Adding a multiple of row/column to another does not change $det(A)$
6.Multiplication of a column/row by a scalar $k$ scales the determinant by$ k$
7.Swapping two rows/columns changes the sign of $det(A)$

We can use Gauss elimination to compute $det(A)$ by bringing $A $into row echelon form.For a triangular matrix the determinant is the product of diagonal elements. 

A square matrix $A \in \mathbb{R}^{n \times n}$ has $det(A) \ne 0$ if and only if $rank(A)=n$.In other words , A is invertible if and only if it is full rank.

Trace
The trace of a square matrix $A \in \mathbb{R}^{n \times n}$ is defined as 

$tr(A)=\sum_{i=1}^{n} a_{ii}$

ie: Trace is the sum of the diagonal elements of A

import numpy as np
A=np.array([[1,2,3],[3,1,2],[0,0,1]])
detA=np.trace(A)
print("A")
print(A)
print("Trace(A)")
print(detA)
o/p
[[1 2 3]
 [3 1 2] 
 [0 0 1]] 
Trace(A) 
3

Properties of trace

$1.tr(A+B)= tr(A)+tr(B)$
$2.tr(kA)=k tr(A)$
$3.tr(I_n)=n$
$4.tr(AB)=tr(BA)$
$5.tr(ABC)=tr(BCA)$  invariant under cyclic permutation
$6.tr(xy^T)=tr(y^Tx)=y^Tx$
$7.$ If A is a Transformation matrix for a linear mapping, for a different base B
     $A=S^{-1}AS$ 
     $tr(A)=tr(S^{-1}AS)=tr(SS^{-1}A)=tr(A)$
This shows that trace is independent of the basis in linear mapping.

Characteristic Polynomial
For $\lambda \in \mathbb{R}$ and a square matrix $A \in \mathbb{R}^{n \times n}$

$P_A(\lambda)=det(A-\lambda I )=C_0+C_1\lambda+C_2\lambda^2+\cdots+C_{n-1}\lambda^{n-1}+(-1)^n\lambda^n$
The characteristic polynomial will allow us to compute eigen values and eigen vectors.

In the characteristic polynomial
   $C_0=det(A)$
  $C_{n-1}=(-1)^{n-1}tr(A)$

Example:
Let $A=\begin{bmatrix}
2 & 1\\
1& 2
\end{bmatrix} $

The characteristic polynomial
$P_A(\lambda)=det(A-\lambda I )=\begin{vmatrix}
2-\lambda & 1\\
1& 2-\lambda
\end{vmatrix}=(2-\lambda)^2-1=3-4\lambda+\lambda^2$
Note that the determinant of the matrix $det(A)=3=C_0$ and the trace of the matrix $tr(A)=4=(-1)^{n-1}C_{n-1}=-4$

Finding characteristic polynomial using sympy

from sympy import Matrix
M=Matrix([[2,1],[1,2]])
M.charpoly().as_expr()

O/P
$\displaystyle \lambda^{2} - 4 \lambda + 3$

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