Command Palette

Search for a command to run...

Linear Methods of AI

Definition of Determinant

Basic Concepts of Determinant

Determinant is a very important mathematical tool in linear algebra. Think of determinant as a "strength" measure of a matrix, it tells us how much change a space undergoes when transformed by that matrix.

Every square matrix has one unique determinant value. This value can be positive, negative, or zero, and each tells us different information about the matrix.

Determinant is a special function that takes a square matrix and produces one real number:

det:Rn×nR:AdetA\det : \mathbb{R}^{n \times n} \to \mathbb{R} : A \mapsto \det A

This function is unique because it has three characteristic properties that no other function has.

Three Determining Properties of Determinant

Linear Property on Each Row

Determinant is linear on each row of the matrix. This means, if we change one row, the determinant will change linearly.

When we add two vectors in one row:

det(a1ai+aian)=det(a1aian)\det \begin{pmatrix} a_1 \\ \vdots \\ a_i + a_i' \\ \vdots \\ a_n \end{pmatrix} = \det \begin{pmatrix} a_1 \\ \vdots \\ a_i \\ \vdots \\ a_n \end{pmatrix}
+det(a1aian)+ \det \begin{pmatrix} a_1 \\ \vdots \\ a_i' \\ \vdots \\ a_n \end{pmatrix}

When we multiply one row by a scalar:

det(a1λaian)\det \begin{pmatrix} a_1 \\ \vdots \\ \lambda \cdot a_i \\ \vdots \\ a_n \end{pmatrix}
=λdet(a1aian)= \lambda \cdot \det \begin{pmatrix} a_1 \\ \vdots \\ a_i \\ \vdots \\ a_n \end{pmatrix}

Antisymmetric Property

Determinant is antisymmetric, if there are two identical rows, the determinant immediately becomes zero:

det(aa)=0\det \begin{pmatrix} \vdots \\ a \\ \vdots \\ a \\ \vdots \end{pmatrix} = 0

This makes sense because if two rows are the same, the matrix cannot have full rank.

Normalization Property

Determinant is normalized so that the determinant of the identity matrix is always 1:

detI=1\det I = 1

Where II is an identity matrix of any size.

Matrix Operations and Determinant

If we multiply the entire matrix by a scalar λ\lambda, the determinant will be affected by the power of n:

det(λA)=λndetA\det(\lambda A) = \lambda^n \cdot \det A

This is because each row is multiplied by λ\lambda, and there are nn total rows.

When we swap two rows of a matrix, the determinant changes sign:

detB=detA\det B = -\det A

Interestingly, when we add a multiple of one row to another row, the determinant doesn't change:

det(ajai+λaj)\det \begin{pmatrix} \vdots \\ a_j \\ \vdots \\ a_i + \lambda a_j \\ \vdots \end{pmatrix}
=det(ajai)= \det \begin{pmatrix} \vdots \\ a_j \\ \vdots \\ a_i \\ \vdots \end{pmatrix}

Multiplying a row by scalar λ0\lambda \neq 0 changes the determinant to detA=λdetA\det A' = \lambda \cdot \det A. Swapping rows changes the sign to detA=detA\det A' = -\det A. Adding multiples of other rows doesn't change the determinant at all.

Relationship with Matrix Invertibility

Determinant is key to understanding whether a matrix can be inverted. For a square matrix A, the following conditions are equivalent:

  1. Matrix A is invertible
  2. There exists an inverse matrix A1A^{-1} that satisfies AA1=IAA^{-1} = I
  3. Full rank matrix: rank(A)=n\text{rank}(A) = n
  4. Trivial kernel: ker(A)={0}\ker(A) = \{0\}
  5. Columns are linearly independent
  6. Rows are linearly independent
  7. Determinant is not zero: detA0\det A \neq 0

If the determinant is zero, the matrix "flattens" space to a lower dimension, so the transformation cannot be inverted.

If the rows of a matrix are linearly dependent, the determinant must be zero. This happens because of the antisymmetric property of determinant, linear dependence creates a situation where we can make identical rows through linear operations.

Multiplication Properties and Similar Matrices

One of the most useful properties of determinant is how it interacts with matrix multiplication:

det(AB)=detAdetB\det(AB) = \det A \cdot \det B

If matrix AA is invertible, the determinant of its inverse is:

det(A1)=1detA\det(A^{-1}) = \frac{1}{\det A}

Two matrices AA and BB are called similar if there exists an invertible matrix SS such that:

B=S1ASB = S^{-1}AS

Similar matrices have the same determinant. The proof is simple:

detB=det(S1AS)\det B = \det(S^{-1}AS)
=det(S1)detAdetS= \det(S^{-1}) \cdot \det A \cdot \det S
=1detSdetAdetS=detA= \frac{1}{\det S} \cdot \det A \cdot \det S = \det A

When performing Gaussian elimination with pp row swaps, the determinant of the resulting matrix RR is:

detR=(1)pdetA\det R = (-1)^p \cdot \det A

This provides a practical method for calculating determinants.

Common Mistakes About Determinant

It's important to remember that determinant is not additive:

det(A+B)detA+detB\det(A + B) \neq \det A + \det B

As a simple example:

det((1001)+(1001))\det\left(\begin{pmatrix} 1 & 0 \\ 0 & 1 \end{pmatrix} + \begin{pmatrix} 1 & 0 \\ 0 & 1 \end{pmatrix}\right)
=det(2002)=4= \det\begin{pmatrix} 2 & 0 \\ 0 & 2 \end{pmatrix} = 4

But:

det(1001)+det(1001)\det\begin{pmatrix} 1 & 0 \\ 0 & 1 \end{pmatrix} + \det\begin{pmatrix} 1 & 0 \\ 0 & 1 \end{pmatrix}
=1+1=2= 1 + 1 = 2

Clearly 424 \neq 2, so determinant is not additive on matrix addition.