Home / Sem 1 / MTH174 / Unit 1 Subjective

Unit1 - Subjective Questions

MTH174 • Practice Questions with Detailed Answers

Define elementary operations on a matrix. List the three types of elementary row operations.

Elementary operations (or transformations) on a matrix are specific operations applied to the rows (or columns) that do not change the rank or the solution set of the linear equations represented by the matrix.

The three types of elementary row operations are:

Interchange of two rows: Denoted by $R_i \leftrightarrow R_j$ , which means the $i$ -th row and $j$ -th row are swapped.
Multiplication of a row by a non-zero scalar: Denoted by $R_i \rightarrow k R_i$ , where $k \neq 0$ . The elements of the $i$ -th row are multiplied by a constant $k$ .
Addition of a scalar multiple of one row to another row: Denoted by $R_i \rightarrow R_i + k R_j$ . The elements of the $i$ -th row are replaced by the sum of themselves and $k$ times the corresponding elements of the $j$ -th row.

Explain the concept of the 'Rank of a Matrix' and how elementary operations affect it.

The Rank of a Matrix, denoted by $\rho(A)$ , is defined as the maximum number of linearly independent row vectors (or column vectors) in the matrix. Alternatively, it is the order of the highest-order non-zero minor of the matrix.

Effect of elementary operations:
Elementary operations (row or column) do not alter the rank of a matrix. Matrices that can be transformed into one another by a sequence of elementary operations are called equivalent matrices (denoted as $A \sim B$ ). Because elementary operations preserve linear independence, the rank remains invariant. This property is utilized to find the rank by reducing the matrix into simpler forms like the Echelon form or Normal form.

Describe the process of finding the rank of a matrix by reducing it to Row Echelon form.

To find the rank of a matrix using the Row Echelon form, follow these steps:

Use elementary row operations to make the first element of the first row (the leading entry or pivot) non-zero (preferably 1).
Use the first row to create zeros in all positions below this leading entry in the first column.
Move to the second row and second column. Make the diagonal element non-zero, and use it to create zeros in all positions below it in the second column.
Repeat this process for all subsequent rows until the matrix is in an upper triangular-like shape where all entries below the leading diagonals are zero.

Once the matrix is in Row Echelon form, the rank of the matrix is equal to the number of non-zero rows (rows with at least one non-zero element).

What is the Normal form (Canonical form) of a matrix? How is it used to determine the rank?

The Normal form of a matrix of rank $r$ is an identity matrix of order $r$ , potentially augmented with blocks of zeros to match the original dimensions of the matrix.

Every non-zero matrix $A$ of order $m \times n$ can be reduced using a sequence of elementary row and column operations into one of the following standard forms:

$\begin{bmatrix} I_r & 0 \\ 0 & 0 \end{bmatrix}$
$\begin{bmatrix} I_r \\ 0 \end{bmatrix}$
$\begin{bmatrix} I_r & 0 \end{bmatrix}$
$I_r$

where $I_r$ is the identity matrix of order $r$ . The integer $r$ in this normal form represents the rank of the matrix. This method involves applying both row and column operations until only the main diagonal has 1s (up to $r$ terms) and all other elements are 0.

Explain the Gauss-Jordan method for finding the inverse of a square matrix.

The Gauss-Jordan method is a technique to find the inverse of a non-singular square matrix $A$ of order $n$ using elementary row operations.

Steps:

Form an augmented matrix $[A | I]$ , where $I$ is the identity matrix of the same order $n$ .
Apply a sequence of elementary row operations on this augmented matrix to transform the left side (matrix $A$ ) into the identity matrix $I$ .
Whenever a row operation is applied to the left side, the exact same operation is applied simultaneously to the right side (initially $I$ ).
Once the left side becomes $I$ , the augmented matrix will be in the form $[I | B]$ .
The resulting matrix $B$ on the right side is the inverse of $A$ , i.e., $A^{-1} = B$ .

Note: Only row operations must be used throughout the process.

State the conditions for consistency of a system of non-homogeneous linear equations using matrix rank.

Consider a system of $m$ non-homogeneous linear equations in $n$ variables, represented in matrix form as $AX = B$ .
Let $A$ be the coefficient matrix and $[A|B]$ be the augmented matrix.

According to the Rouché-Capelli Theorem, the system is:

Consistent (has a solution) if the rank of the coefficient matrix equals the rank of the augmented matrix. .
- Unique Solution: If $\rho(A) = \rho([A|B]) = n$ (number of unknowns), the system has exactly one solution.
- Infinite Solutions: If $\rho(A) = \rho([A|B]) = r < n$ , the system has infinitely many solutions. We choose $n-r$ variables arbitrarily to express the solution.
Inconsistent (no solution) if the rank of the coefficient matrix is strictly less than the rank of the augmented matrix. $\rho(A) < \rho([A|B])$ .

Describe the conditions for trivial and non-trivial solutions in a homogeneous system of linear equations.

A homogeneous system of linear equations is of the form $AX = 0$ , where $A$ is an $m \times n$ coefficient matrix and $X$ is the column vector of $n$ unknowns.
This system is always consistent because $X = 0$ is always a solution. This is called the trivial solution.

Conditions for Solutions:
Let $r$ be the rank of matrix $A$ , i.e., $r = \rho(A)$ .

Trivial Solution Only: If $r = n$ (rank equals the number of unknowns), the system has a unique solution, which is the trivial solution $x_1 = 0, x_2 = 0, \dots, x_n = 0$ . For a square matrix $A$ ( $n \times n$ ), this occurs when $|A| \neq 0$ .
Non-Trivial Solutions (Infinite Solutions): If $r < n$ (rank is less than the number of unknowns), the system has infinitely many non-trivial solutions. To find them, $n - r$ variables are assigned arbitrary values. For a square matrix $A$ , this occurs when $|A| = 0$ .

Define eigenvalues and eigenvectors of a square matrix. What is the characteristic equation?

Let $A$ be a square matrix of order $n$ .

Eigenvalue: A scalar $\lambda$ is called an eigenvalue (or latent root, characteristic root) of $A$ if there exists a non-zero column vector $X$ such that:
$AX = \lambda X$

Eigenvector: The non-zero vector $X$ that satisfies the above equation for a specific eigenvalue $\lambda$ is called the eigenvector (or latent vector, characteristic vector) corresponding to $\lambda$ .

Characteristic Equation: The equation $AX = \lambda X$ can be rewritten as $(A - \lambda I)X = 0$ , where $I$ is the identity matrix. For this homogeneous system to have a non-trivial solution (since $X \neq 0$ ), the determinant of the coefficient matrix must be zero:
$|A - \lambda I| = 0$
This polynomial equation in $\lambda$ is known as the characteristic equation of matrix $A$ . Its roots are the eigenvalues of $A$ .

State any five important properties of eigenvalues.

Here are five key properties of eigenvalues for a square matrix $A$ of order $n$ :

Sum of Eigenvalues: The sum of the eigenvalues of $A$ is equal to the trace of $A$ (the sum of its principal diagonal elements).
$\lambda_1 + \lambda_2 + \dots + \lambda_n = \text{Trace}(A)$
Product of Eigenvalues: The product of the eigenvalues of $A$ is equal to the determinant of $A$ .
$\lambda_1 \lambda_2 \dots \lambda_n = |A|$
Eigenvalues of Inverse: If $\lambda$ is an eigenvalue of a non-singular matrix $A$ , then $1/\lambda$ (or $\lambda^{-1}$ ) is an eigenvalue of $A^{-1}$ .
Eigenvalues of Matrix Powers: If $\lambda$ is an eigenvalue of $A$ , then $\lambda^k$ is an eigenvalue of $A^k$ for any positive integer $k$ .
Eigenvalues of Transpose: A matrix $A$ and its transpose $A^T$ share the exact same eigenvalues.

Explain the step-by-step procedure to determine the eigenvectors of a given $3 \times 3$ matrix.

To find the eigenvectors of a $3 \times 3$ matrix $A$ , follow these steps:

Find the Characteristic Equation: Construct the matrix $(A - \lambda I)$ and set its determinant to zero: $|A - \lambda I| = 0$ .
Solve for Eigenvalues: Solve the resulting cubic polynomial equation to find the three eigenvalues, say $\lambda_1, \lambda_2, \lambda_3$ .
Find Eigenvectors for each Eigenvalue: For each eigenvalue :
- Substitute $\lambda_i$ into the matrix equation $(A - \lambda_i I)X = 0$ , where $X = \begin{bmatrix} x_1 \\ x_2 \\ x_3 \end{bmatrix}$ .
- This yields a homogeneous system of three linear equations.
- Solve this system using matrix reduction or Cramer's rule (cross-multiplication method) for any two independent equations.
- The fundamental non-zero solution gives the eigenvector corresponding to $\lambda_i$ .
Repeat: Repeat step 3 for all distinct eigenvalues. If an eigenvalue is repeated, find the number of linearly independent eigenvectors (based on the rank of $(A - \lambda_i I)$ ).

State and explain the Cayley-Hamilton Theorem.

Cayley-Hamilton Theorem Statement:
"Every square matrix satisfies its own characteristic equation."

Explanation:
Let $A$ be a square matrix of order $n$ . The characteristic equation of $A$ is given by $|A - \lambda I| = 0$ .
Expanding this determinant yields a polynomial in $\lambda$ of degree $n$ :
$P(\lambda) = (-1)^n \lambda^n + c_{n-1} \lambda^{n-1} + \dots + c_1 \lambda + c_0 = 0$

According to the Cayley-Hamilton theorem, if we replace the scalar $\lambda$ with the matrix $A$ , the resulting matrix polynomial evaluates to the null matrix (zero matrix) $O$ :
$(-1)^n A^n + c_{n-1} A^{n-1} + \dots + c_1 A + c_0 I = O$
where $I$ is the identity matrix of order $n$ and $O$ is the zero matrix of order $n$ .

How can the Cayley-Hamilton theorem be used to find the inverse of a matrix?

The Cayley-Hamilton theorem states that a matrix $A$ satisfies its characteristic equation:
$A^n + c_{n-1} A^{n-1} + \dots + c_1 A + c_0 I = O$

To find the inverse $A^{-1}$ , we assume $A$ is non-singular ( $|A| \neq 0$ , which implies $c_0 \neq 0$ ).

Steps:

Multiply the entire characteristic matrix equation by $A^{-1}$ :
$A^{-1} (A^n + c_{n-1} A^{n-1} + \dots + c_1 A + c_0 I) = A^{-1} O$
$A^{n-1} + c_{n-1} A^{n-2} + \dots + c_1 I + c_0 A^{-1} = O$
Isolate the term containing $A^{-1}$ :
$c_0 A^{-1} = - (A^{n-1} + c_{n-1} A^{n-2} + \dots + c_1 I)$
Divide by $c_0$ (which is equal to $(-1)^n |A|$ ) to get the inverse:
$A^{-1} = -\frac{1}{c_0} (A^{n-1} + c_{n-1} A^{n-2} + \dots + c_1 I)$
This method requires calculating powers of $A$ up to $n-1$ , avoiding cofactor and adjugate calculations.

Differentiate between the Algebraic Multiplicity and Geometric Multiplicity of an eigenvalue.

When analyzing the eigenvalues of a matrix, two types of multiplicities arise:

Algebraic Multiplicity (AM):
- It is the number of times a particular eigenvalue $\lambda$ appears as a root of the characteristic equation $|A - \lambda I| = 0$ .
- For example, if the characteristic polynomial is factored as $(\lambda - 2)^3 (\lambda - 5) = 0$ , the algebraic multiplicity of $\lambda=2$ is 3, and for $\lambda=5$ it is 1.
Geometric Multiplicity (GM):
- It is the maximum number of linearly independent eigenvectors associated with the eigenvalue $\lambda$ .
- Mathematically, it is the dimension of the eigenspace corresponding to $\lambda$ , given by $n - \rho(A - \lambda I)$ , where $n$ is the order of the matrix.

Relationship:
For any eigenvalue, the geometric multiplicity is always greater than or equal to 1, and less than or equal to its algebraic multiplicity: $1 \leq GM \leq AM$

What are the characteristics of eigenvalues for Real Symmetric matrices and Orthogonal matrices?

1. Real Symmetric Matrices:
A real matrix $A$ is symmetric if $A = A^T$ .

Property of Eigenvalues: All eigenvalues of a real symmetric matrix are strictly real numbers. They cannot be complex conjugates.
Furthermore, eigenvectors corresponding to distinct eigenvalues of a real symmetric matrix are always orthogonal to each other.

2. Orthogonal Matrices:
A square matrix $A$ is orthogonal if $A^T A = A A^T = I$ , meaning $A^T = A^{-1}$ .

Property of Eigenvalues: The eigenvalues of an orthogonal matrix always have an absolute value (modulus) of 1. If the eigenvalues are real, they must be $+1$ or $-1$ . If they are complex, they exist as conjugate pairs of the form $e^{i\theta}$ and $e^{-i\theta}$ , so their magnitude $|e^{i\theta}| = 1$ .

Explain the concept of Diagonalization of a matrix. When is a matrix diagonalizable?

Diagonalization:
A square matrix $A$ of order $n$ is diagonalizable if it is similar to a diagonal matrix $D$ . This means there exists a non-singular matrix $P$ (called the modal matrix) such that:
$P^{-1} A P = D$
The diagonal entries of $D$ are the eigenvalues of $A$ , and the columns of $P$ are the corresponding linearly independent eigenvectors of $A$ .

Conditions for Diagonalizability:
A matrix $A$ of order $n$ is diagonalizable if and only if it has exactly $n$ linearly independent eigenvectors.

If all $n$ eigenvalues are distinct, the matrix is automatically diagonalizable.
If there are repeated eigenvalues, the matrix is diagonalizable only if the Geometric Multiplicity (GM) equals the Algebraic Multiplicity (AM) for every eigenvalue. If $GM < AM$ for any eigenvalue, the matrix is defective and cannot be diagonalized.

Prove or explain why eigenvectors corresponding to distinct eigenvalues are linearly independent.

Let $A$ be a square matrix. Suppose $\lambda_1$ and $\lambda_2$ are distinct eigenvalues ( $\lambda_1 \neq \lambda_2$ ) with corresponding non-zero eigenvectors $X_1$ and $X_2$ . We must show that $c_1 X_1 + c_2 X_2 = 0$ implies $c_1 = c_2 = 0$ .

Start with the linear combination:
$c_1 X_1 + c_2 X_2 = 0 \quad \text{--- (Eq 1)}$
Multiply both sides by matrix $A$ :
$c_1 A X_1 + c_2 A X_2 = 0$
Since $AX_1 = \lambda_1 X_1$ and $AX_2 = \lambda_2 X_2$ :
$c_1 \lambda_1 X_1 + c_2 \lambda_2 X_2 = 0 \quad \text{--- (Eq 2)}$
Multiply Eq 1 by $\lambda_1$ :
$c_1 \lambda_1 X_1 + c_2 \lambda_1 X_2 = 0 \quad \text{--- (Eq 3)}$
Subtract Eq 3 from Eq 2:
$c_2 (\lambda_2 - \lambda_1) X_2 = 0$
Since $X_2$ is an eigenvector, $X_2 \neq 0$ . Also, given distinct eigenvalues, $\lambda_2 - \lambda_1 \neq 0$ .
Therefore, we must have $c_2 = 0$ .
Substituting $c_2 = 0$ into Eq 1 gives $c_1 X_1 = 0$ , implying $c_1 = 0$ (since $X_1 \neq 0$ ).

Since $c_1 = c_2 = 0$ , $X_1$ and $X_2$ are linearly independent. This proof extends to any number of distinct eigenvalues.

Describe the Gauss Elimination method for solving a system of linear simultaneous equations.

Gauss Elimination is a systematic method for solving a system of linear equations $AX = B$ by transforming the coefficient matrix into an upper triangular matrix using elementary row operations.

Steps:

Form the Augmented Matrix: Write the system in the augmented form $[A | B]$ .
Forward Elimination:
- Use elementary row operations to eliminate the first variable ( $x_1$ ) from the second row onwards, using the first row.
- Next, eliminate the second variable ( $x_2$ ) from the third row onwards using the second row.
- Continue this process until the coefficient matrix $A$ part of the augmented matrix becomes an upper triangular matrix (all entries below the main diagonal are zero).
Back Substitution:
- Once in upper triangular form, the last row gives a simple equation in one variable (e.g., $c_n x_n = d_n$ ), allowing you to solve for $x_n$ .
- Substitute $x_n$ back into the second-to-last equation to find $x_{n-1}$ .
- Continue back-substituting upwards to find all unknown variables.

What is meant by the inverse of a matrix? State the condition for its existence.

Definition:
The inverse of a square matrix $A$ of order $n$ is another square matrix of the same order, denoted by $A^{-1}$ , such that multiplying them together yields the identity matrix $I_n$ .
Mathematically: $A A^{-1} = A^{-1} A = I_n$

Condition for Existence:
A matrix has an inverse if and only if it is a non-singular matrix.

A matrix is non-singular if its determinant is non-zero, i.e., $|A| \neq 0$ .
If $|A| = 0$ , the matrix is singular, its rank is less than $n$ , and the inverse does not exist.
The inverse, when it exists, is unique and can be calculated using the adjugate method $A^{-1} = \frac{\text{adj}(A)}{|A|}$ or through elementary row operations (Gauss-Jordan method).

How can you use the Cayley-Hamilton theorem to find higher powers of a matrix $A$ ?

The Cayley-Hamilton theorem states that a matrix satisfies its characteristic equation. If $A$ is an $n \times n$ matrix, its characteristic equation is:
$A^n + c_{n-1} A^{n-1} + \dots + c_1 A + c_0 I = O$

To find a higher power $A^m$ (where $m > n$ ), you can use this theorem to reduce the polynomial degree:

Express $A^n$ in lower powers:
Rewrite the theorem to isolate the highest power $n$ :
$A^n = - c_{n-1} A^{n-1} - \dots - c_1 A - c_0 I$
Multiply by $A$ :
To find $A^{n+1}$ , multiply the equation by $A$ :
$A^{n+1} = - c_{n-1} A^n - c_{n-2} A^{n-1} - \dots - c_0 A$
Substitute $A^n$ :
Replace the $A^n$ term on the right side with its lower-power equivalent from step 1. This expresses $A^{n+1}$ entirely in terms of powers of $A$ up to $n-1$ .
Repeat:
Continue this process of multiplying by $A$ and substituting to express any power $A^m$ as a linear combination of $I, A, A^2, \dots, A^{n-1}$ .

Briefly discuss two engineering applications of eigenvalues and eigenvectors.

Eigenvalues and eigenvectors are fundamental tools in engineering with numerous applications. Two prominent examples include:

Mechanical Vibrations and Resonance (Civil/Mechanical Engineering):
In the structural analysis of buildings, bridges, or mechanical systems, the equations of motion are expressed in matrix form $M\ddot{x} + Kx = 0$ , where $M$ is the mass matrix and $K$ is the stiffness matrix. The eigenvalues of the system $M^{-1}K$ represent the natural frequencies (or resonant frequencies) of the structure, while the corresponding eigenvectors represent the mode shapes (the pattern of vibration). Understanding these prevents resonance failures.
Stability Analysis in Control Systems (Electrical/Control Engineering):
In state-space representation, a control system is defined by $\dot{x} = Ax + Bu$ . The stability of the system is determined by the eigenvalues of the system matrix $A$ (often called poles). If all eigenvalues have negative real parts, the system is asymptotically stable. The eigenvectors help in decoupling the system equations for easier analysis and design of controllers.

Unit2