Unit 2: Matrices and Determinants: Properties, Evaluation, Rank, and Inverse

This study material provides a comprehensive overview of determinants and matrices, essential topics in linear algebra. It covers their definitions, properties, evaluation methods, and practical applications, preparing students for exams with clear and concise explanations.

Determinants

A determinant is a scalar value that can be computed from the elements of a square matrix. It provides important information about the matrix, such as its invertibility and the volume scaling factor of the linear transformation described by the matrix.

Definition of Determinants

For a square matrix A, its determinant, denoted as det(A) or |A|, is a scalar value that is calculated from the elements of the matrix. Determinants are defined only for square matrices.

For a 3×3 matrix A = [[a₁₁, a₁₂, a₁₃], [a₂₁, a₂₂, a₂₃], [a₃₁, a₃₂, a₃₃]], its determinant is calculated as:

det(A) = a₁₁(a₂₂a₃₃ - a₂₃a₃₂) - a₁₂(a₂₁a₃₃ - a₂₃a₃₁) + a₁₃(a₂₁a₃₂ - a₂₂a₃₁)

Properties of Determinants

The following are important properties of determinants (statements only, without proof):

• Property 1: The determinant of a matrix remains unchanged if its rows and columns are interchanged (i.e., det(A) = det(A^T)).
• Property 2: If any two rows (or columns) of a matrix are interchanged, the sign of the determinant changes.
• Property 3: If any two rows (or columns) of a matrix are identical or proportional, then its determinant is zero.
• Property 4: If each element of a row (or column) of a matrix is multiplied by a constant k, then its determinant is multiplied by k.
• Property 5: If each element of a row (or column) can be expressed as a sum of two or more terms, then the determinant can be expressed as a sum of two or more determinants.
• Property 6: If, to any row (or column) of a matrix, a scalar multiple of another row (or column) is added, the value of the determinant remains unchanged.
• Property 7: If a matrix has a row or a column consisting entirely of zeros, its determinant is zero.
• Property 8: The determinant of the product of two square matrices of the same order is equal to the product of their individual determinants (i.e., det(AB) = det(A)det(B)).
• Property 9: The determinant of an identity matrix is 1.
• Property 10: The determinant of a triangular matrix (upper or lower) is the product of its diagonal elements.

Applications of Determinants

Determinants have various applications in mathematics and other fields:

• Solving Systems of Linear Equations: Determinants are used in Cramer's Rule to find the unique solution of a system of linear equations.
• Finding the Inverse of a Matrix: The inverse of a square matrix can be found using its determinant and adjugate matrix. A matrix is invertible if and only if its determinant is non-zero.
• Area and Volume: The absolute value of the determinant of a matrix formed by vectors can represent the area of a parallelogram (2D) or the volume of a parallelepiped (3D) spanned by those vectors.
• Eigenvalues: Determinants are used to find the eigenvalues of a matrix by solving the characteristic equation det(A - λI) = 0.

Evaluation of Determinants Using Transformations

Determinants of order 3 and higher can be evaluated more efficiently by using elementary row or column transformations to simplify the matrix, typically by creating zeros in a row or column to expand along it. The properties of determinants regarding row/column operations are crucial here.

Elementary Row Operations:

1. Interchanging any two rows (R_i ↔ R_j). This changes the sign of the determinant.
2. Multiplying all elements of a row by a non-zero scalar k (R_i → kR_i). This multiplies the determinant by k.
3. Adding to the elements of one row the corresponding elements of another row multiplied by a scalar k (R_i → R_i + kR_j). This leaves the determinant unchanged.

Steps for Evaluation:

1. Apply elementary row (or column) operations to transform the matrix into an upper or lower triangular matrix, or to create as many zeros as possible in a specific row or column.
2. Keep track of how each operation affects the determinant (e.g., sign changes for row swaps, scalar factors for row scaling).
3. Once the matrix is in a triangular form, its determinant is simply the product of its diagonal elements. If a row/column was chosen for expansion, expand along the row/column containing most zeros.

Example: Evaluate det(A) for A = [[1, 2, 3], [0, 1, 2], [5, 4, 1]]

R₃ → R₃ - 5R₁:

[[1, 2, 3], [0, 1, 2], [0, -6, -14]]

det(A) = 1 * (1*(-14) - 2*(-6)) = 1 * (-14 + 12) = -2

Matrices

A matrix is a rectangular array of numbers, symbols, or expressions, arranged in rows and columns. Matrices are fundamental tools in linear algebra for representing linear transformations, systems of linear equations, and organizing data.

Row Reduction and Echelon Forms

Row reduction, also known as Gaussian elimination, is a process of applying elementary row operations to a matrix to simplify it to an echelon form. The three elementary row operations are:

1. Row Swap: Interchange two rows (R_i ↔ R_j).
2. Row Scaling: Multiply a row by a non-zero scalar (R_i → kR_i).
3. Row Addition: Add a multiple of one row to another row (R_i → R_i + kR_j).

Row Echelon Form (REF)

A matrix is in Row Echelon Form if it satisfies the following conditions:

1. All non-zero rows are above any rows of all zeros.
2. The leading entry (the first non-zero number from the left) of a non-zero row is a 1 (called a leading 1).
3. Each leading 1 is in a column to the right of the leading 1 of the row above it.
4. All entries in a column below a leading 1 are zeros.

Reduced Row Echelon Form (RREF)

A matrix is in Reduced Row Echelon Form if it satisfies the conditions for Row Echelon Form, plus one additional condition:

1. Each column that contains a leading 1 has zeros everywhere else.

RREF is unique for every matrix.

Normal Forms

The normal form (or canonical form) of a matrix A of order m×n with rank r is obtained by applying elementary row and column operations to transform it into one of the following forms:

[[I_r, 0], [0, 0]]

where I_r is the identity matrix of order r, and 0 represents zero matrices of appropriate dimensions. This form is unique for a given matrix and is useful in determining the rank of a matrix.

Rank of a Matrix

The rank of a matrix is defined as the maximum number of linearly independent rows (row-rank) or linearly independent columns (column-rank) in the matrix. It is also equal to the order of the largest non-zero minor (determinant of a square submatrix) of the matrix. Alternatively, it is the number of non-zero rows in its row echelon form.

The rank of an m×n matrix A is denoted by rank(A) or ρ(A). The rank of a matrix A can be at most min(m, n).

Row-Rank and Column-Rank

The row-rank of a matrix is the maximum number of linearly independent row vectors in the matrix.

The column-rank of a matrix is the maximum number of linearly independent column vectors in the matrix.

Standard Theorem: For any matrix A, its row-rank is always equal to its column-rank. This common value is simply called the rank of the matrix. (Statement only)

Standard Theorems and Properties of Ranks

Here are some standard theorems and properties related to the rank of a matrix (statements only):

• Theorem 1: The rank of a matrix A is equal to the rank of its transpose A^T, i.e., rank(A) = rank(A^T).
• Theorem 2: If A is an m×n matrix and B is an n×p matrix, then rank(AB) ≤ min(rank(A), rank(B)).
• Theorem 3: If A and B are two matrices of the same order, then rank(A + B) ≤ rank(A) + rank(B).
• Theorem 4: If A is an m×n matrix, then rank(A) = 0 if and only if A is a zero matrix.
• Theorem 5: If A is an n×n square matrix, then A is non-singular (invertible) if and only if rank(A) = n.
• Theorem 6: Elementary row and column operations do not change the rank of a matrix.
• Theorem 7: If A is an m×n matrix and P and Q are non-singular matrices of order m and n respectively, then rank(PAQ) = rank(A).

Applications of Rank

The rank of a matrix has several important applications:

• Consistency of Linear Equations: For a system of linear equations AX = B, the system is consistent (has solutions) if and only if rank(A) = rank([A|B]), where [A|B] is the augmented matrix.
• Number of Solutions: If rank(A) = rank([A|B]) = n (number of variables), the system has a unique solution. If rank(A) = rank([A|B]) < n, the system has infinitely many solutions. If rank(A) ≠ rank([A|B]), the system has no solution.
• Linear Independence of Vectors: The rank of a matrix whose columns (or rows) are a set of vectors gives the number of linearly independent vectors in that set.
• Finding Inverse: An n×n matrix A has an inverse if and only if its rank is n.

Inverse of a Matrix

For a square matrix A, its inverse, denoted as A^-1, is a matrix such that when multiplied by A, it yields the identity matrix I. That is, AA^-1 = A^-1A = I.

A matrix is invertible (or non-singular) if and only if its determinant is non-zero (det(A) ≠ 0).

Methods to find the inverse of a matrix:

1. Adjoint Method

The inverse of a matrix A can be calculated using the formula:

A^-1 = (1 / det(A)) * adj(A)

where det(A) is the determinant of A, and adj(A) is the adjugate (or adjoint) of A. The adjugate of A is the transpose of the cofactor matrix of A.

2. Elementary Row Operations (Gauss-Jordan Method)

This method involves augmenting the matrix A with an identity matrix of the same order, forming [A|I]. Then, elementary row operations are applied to transform the left side (A) into the identity matrix. The same operations are applied to the right side (I), which will then become A^-1. If A cannot be transformed into I, then A^-1 does not exist.

[A|I] → [I|A^-1]