MATRICES LEC3

Adjoint of a Matrix: The Short Trick Method

  • Introduction to the Adjoint Calculation:

    • The adjoint of a matrix is a critical component for finding the inverse, which is often tested in examinations.

    • While the traditional method involving cofactors (a11,a12,a13,…a_{11}, a_{12}, a_{13}, \dots) followed by a transpose is lengthy and prone to calculation errors, a shortcut method exists that provides the answer within 2 to 3 minutes.

    • Calculators often cannot help with these specific structural steps in symbolic or complex matrix problems, making the shortcut essential.

  • Step-by-Step Short Trick for a 3×33 \times 3 Adjoint:

    • Step 1: Write the Original Matrix: Let the matrix AA be:       (131143134)\begin{pmatrix} 1 & 3 & 1 \\ 1 & 4 & 3 \\ 1 & 3 & 4 \end{pmatrix}

    • Step 2: Expand Rows and Columns: Write down the matrix and then copy the first two rows below it. Then, take that entire expanded block and copy the first two columns to the right.

    • Step 3: Eliminate Borders: Strike out the first (top) row and the first (extreme left) column. You are left with a 4×44 \times 4 grid of numbers.

    • Step 4: Cross-Multiply in Pairs: Perform 2×22 \times 2 determinant-style cross-multiplication on adjacent elements.

      • For the first column of the adjoint: (4×4)−(3×3)=16−9=7(4 \times 4) - (3 \times 3) = 16 - 9 = 7. Next, (3×1)−(4×1)=3−4=−1(3 \times 1) - (4 \times 1) = 3 - 4 = -1. Then, (1×3)−(3×1)=3−3=0(1 \times 3) - (3 \times 1) = 3 - 3 = 0. (Note: Calculate vertically but write the results horizontally, or vice versa, to account for the transpose).

    • Step 5: Final Result: Following this process for the matrix provided in the example yields values that, once transposed, form the Adjoint. For example: (7−95−13−2−101)\begin{pmatrix} 7 & -9 & 5 \\ -1 & 3 & -2 \\ -1 & 0 & 1 \end{pmatrix} (values may vary based on specific transcript arithmetic).

  • Example 2 of Adjoint Shortcut:

    • Matrix elements: 1,2,31, 2, 3; 0,1,40, 1, 4; 5,2,05, 2, 0.

    • Method: Repeat first two rows and first two columns. Eliminate the top row and left column.

    • Calculations:

      • (1×0)−(2×4)=−8(1 \times 0) - (2 \times 4) = -8

      • (4×5)−(0×0)=20(4 \times 5) - (0 \times 0) = 20

      • (0×2)−(1×5)=−5(0 \times 2) - (1 \times 5) = -5

    • Continuing this yields the adjoint matrix elements through rapid 2×22 \times 2 subtraction.

Identity and Inverse Properties in Matrices

  • Identity Property Definition:

    • An identity property exists when an element aa is multiplied by an identity element ee such that the result is the original element aa.

    • In numbers: 2×1=22 \times 1 = 2. Here, 11 is the multiplicative identity.

    • In matrices: If Matrix AA is multiplied by the Unit Matrix (II), the result is Matrix AA. This is the Multiplicative Identity Property (A×I=AA \times I = A).

  • Additive Identity:

    • For numbers, the additive identity is 00 (e.g., 2+0=22 + 0 = 2).

    • In matrices, adding the Null Matrix (OO) to Matrix AA results in Matrix AA (A+O=AA + O = A).

  • Inverse Properties:

    • A number multiplied by its inverse yields the identity element (e.g., 2×12=12 \times \frac{1}{2} = 1).

    • Multiplicative Inverse: For a matrix AA, there exists an inverse A−1A^{-1} such that A×A−1=IA \times A^{-1} = I.

    • Additive Inverse: Adding a matrix to its negative (−A-A) results in the Null Matrix (A+(−A)=OA + (-A) = O).

  • Conditions for Inversion:

    • A matrix must be non-singular for an inverse to exist.

    • If the determinant is zero (det(A)=0det(A) = 0), the matrix is singular, and the multiplicative inverse does not exist.

Systems of Linear Equations

  • Matrix Representation of Equations:

    • Equations like 2x+3y+4z=12x + 3y + 4z = 1, 3x+y+6z=43x + y + 6z = 4, and x+y+z=11x + y + z = 11 can be converted into the matrix form Ax=BAx = B.

    • Coefficient Matrix (AA): Capture the coefficients of variables. Always follow alphabetical order (x,y,zx, y, z).

      • Example: Row 1 = (2,3,4)(2, 3, 4), Row 2 = (3,1,6)(3, 1, 6), Row 3 = (1,1,1)(1, 1, 1).

    • Variable Matrix (XX): A column matrix of variables (xyz)\begin{pmatrix} x \\ y \\ z \end{pmatrix}.

    • Constant Matrix (BB): A column matrix of values on the right side of the equals sign (1411)\begin{pmatrix} 1 \\ 4 \\ 11 \end{pmatrix}.

  • Classification of Systems:

    • Homogeneous System: If the constant matrix BB is a Null Matrix (B=0B = 0).

    • Non-Homogeneous System: If the constant matrix BB contains at least one non-zero element (B≠0B \neq 0).

General Laws and Properties of Matrix Operations

  • Commutative and Associative Laws:

    • Addition: Matrix addition is commutative (A+B=B+AA + B = B + A).

    • Multiplication: Matrix multiplication is NOT commutative (AB≠BAAB \neq BA).

    • Associative Law: Matrix multiplication is associative (A(BC)=(AB)CA(BC) = (AB)C).

  • Transpose and Inverse Laws:

    • Transpose of a Transpose: (AT)T=A(A^T)^T = A.

    • Inverse of an Inverse: (A−1)−1=A(A^{-1})^{-1} = A.

    • Sum Transpose: (A+B)T=AT+BT(A+B)^T = A^T + B^T.

    • Product Transpose (Reversal Law): (AB)T=BTAT(AB)^T = B^T A^T. For three matrices, (ABC)T=CTBTAT(ABC)^T = C^T B^T A^T.

    • Scalar Multiplication and Transpose: If kk is a constant, (kA)T=k(AT)(kA)^T = k(A^T).

    • Product Inverse: (AB)−1=B−1A−1(AB)^{-1} = B^{-1} A^{-1}.

    • Distributive Property: A(B+C)=AB+ACA(B+C) = AB + AC.

Determinant Shortcuts and Calculations

  • Triangular Matrix Shortcut:

    • If a matrix is Upper Triangular, Lower Triangular, or Diagonal (elements only on the main diagonal and zeros above/below), the determinant is simply the product of the diagonal elements.

    • Example: Determinant of (a000b000c)=abc\begin{pmatrix} a & 0 & 0 \\ 0 & b & 0 \\ 0 & 0 & c \end{pmatrix} = abc.

  • Zero Determinant Trick:

    • If any two rows or columns are identical, the determinant is 00.

    • Arithmetic Check: If subtracting Row 1 from Row 2 (R2−R1R_2 - R_1) yields the same result as subtracting Row 2 from Row 3 (R3−R2R_3 - R_2), the determinant is often 00.

  • Common Factors:

    • You can take a common factor out of an individual row or column in a determinant calculation. This simplifies large numbers.

    • Example: In (y2y18410936)\begin{pmatrix} y^2 & y & 1 \\ 8 & 4 & 10 \\ 9 & 3 & 6 \end{pmatrix}, you can take 22 out of the second row and 33 out of the third row to simplify the math.

  • Matrix Scaling and Determinants:

    • If a matrix AA of order n×nn \times n is multiplied by a scalar kk, the determinant of the new matrix is:       det(kA)=kn×det(A)det(kA) = k^n \times det(A)

    • Problem Example: If matrix AA is of order 33 and det(A)=2det(A) = 2, find det(2A)det(2A).

      • Method: Since order n=3n=3 and scalar k=2k=2, the answer is 23×2=8×2=162^3 \times 2 = 8 \times 2 = 16.

  • Minor Elements and Order Reduction:

    • Deleting the ithi^{th} row and jthj^{th} column of an n×nn \times n matrix results in a Minor Element with a reduced order of (n−1)×(n−1)(n-1) \times (n-1).

Questions & Discussion

  • Q: Why multiply every element by 2 in the determinant problem?

    • A: When we say 2A2A, we are multiplying the entire matrix by the scalar 22. In a 3×33 \times 3 matrix, this means all 9 elements are doubled. When calculating the determinant, a factor of 2 can be pulled out from each of the 3 rows, resulting in 2×2×2=82 \times 2 \times 2 = 8 multiplied by the original determinant value.

  • Q: Can we solve for variables like 'y' directly from a determinant?

    • A: Yes. By expanding the determinant, you create an equation. If the highest power of 'y' is 2, it forms a quadratic equation, meaning there will be two possible values for 'y'. You can verify these values by plugging the options from a multiple-choice question back into the simplified matrix.

  • Q: When should we apply properties versus direct expansion?

    • A: If a matrix has 0s or 1s, or shows clear patterns (arithmetic progressions in rows), properties are faster. In complex engineering exams (like ECAT or Aptitude tests), properties save significant time. If no pattern is obvious, direct expansion is the fallback.