2.6 MCQs-Matrices and Determinants

MCQs


Matrices and Determinants

Basic Concepts and Definitions

1. A matrix is defined as:

  1. A rectangular array of numbers arranged in rows and columns

  2. A single column of numbers

  3. A square table of numbers

  4. A collection of mathematical functions

chevron-rightShow me the answerhashtag

Answer: 1. A rectangular array of numbers arranged in rows and columns

Explanation: A matrix is a rectangular arrangement of numbers (called elements or entries) organized in rows and columns. The size of a matrix is described by its order: m×nm \times n, where mm is the number of rows and nn is the number of columns.

Example: A 2×32 \times 3 matrix:

2. The element a23a_{23} in matrix AA refers to:

  1. Element in row 2, column 3

  2. Element in row 3, column 2

  3. The sum of elements in row 2 and column 3

  4. The product of elements in row 2 and column 3

chevron-rightShow me the answerhashtag

Answer: 1. Element in row 2, column 3

Explanation: In matrix notation, aija_{ij} represents the element located at the i-th row and j-th column. Therefore, a23a_{23} is the element in the second row and third column.

Example: If A=(123456)A = \begin{pmatrix} 1 & 2 & 3 \\ 4 & 5 & 6 \end{pmatrix}, then a23=6a_{23} = 6.

3. A square matrix is one where:

  1. All elements are equal

  2. Number of rows equals number of columns

  3. Number of rows is greater than number of columns

  4. Number of columns is greater than number of rows

chevron-rightShow me the answerhashtag

Answer: 2. Number of rows equals number of columns

Explanation: A square matrix has the same number of rows and columns (m=nm = n). The order of a square matrix is typically written as n×nn \times n or simply as order nn.

Example: A 3×33 \times 3 square matrix:

4. The identity matrix of order 3 is:

  1. (000000000)\begin{pmatrix} 0 & 0 & 0 \\ 0 & 0 & 0 \\ 0 & 0 & 0 \end{pmatrix}

  2. (111111111)\begin{pmatrix} 1 & 1 & 1 \\ 1 & 1 & 1 \\ 1 & 1 & 1 \end{pmatrix}

  3. (100010001)\begin{pmatrix} 1 & 0 & 0 \\ 0 & 1 & 0 \\ 0 & 0 & 1 \end{pmatrix}

  4. (010101010)\begin{pmatrix} 0 & 1 & 0 \\ 1 & 0 & 1 \\ 0 & 1 & 0 \end{pmatrix}

chevron-rightShow me the answerhashtag

Answer: 3. (100010001)\begin{pmatrix} 1 & 0 & 0 \\ 0 & 1 & 0 \\ 0 & 0 & 1 \end{pmatrix}

Explanation: The identity matrix, denoted by InI_n, is a square matrix with 1's on the main diagonal and 0's elsewhere. For any square matrix AA of the same order, AI=IA=AAI = IA = A.

The general form of an n×nn \times n identity matrix is:

Types of Matrices

5. A diagonal matrix is:

  1. A matrix with non-zero elements only on the main diagonal

  2. A matrix with all elements equal

  3. A matrix with zeros on the main diagonal

  4. A matrix with all elements non-zero

chevron-rightShow me the answerhashtag

Answer: 1. A matrix with non-zero elements only on the main diagonal

Explanation: A diagonal matrix is a square matrix where all elements outside the main diagonal are zero. The elements on the main diagonal can be zero or non-zero.

Example of a 3×33 \times 3 diagonal matrix:

6. Which matrix is both symmetric and skew-symmetric?

  1. Identity matrix

  2. Zero matrix

  3. Diagonal matrix

  4. No such matrix exists

chevron-rightShow me the answerhashtag

Answer: 2. Zero matrix

Explanation:

  • A symmetric matrix satisfies AT=AA^T = A.

  • A skew-symmetric matrix satisfies AT=AA^T = -A.

  • For a matrix to be both symmetric and skew-symmetric, we must have A=ATA = A^T and A=ATA = -A^T, which implies A=AA = -A, so 2A=02A = 0, thus A=0A = 0.

  • Therefore, only the zero matrix satisfies both conditions.

7. A matrix AA is symmetric if:

  1. A=ATA = -A^T

  2. A=ATA = A^T

  3. A=A1A = A^{-1}

  4. A=AA = -A

chevron-rightShow me the answerhashtag

Answer: 2. A=ATA = A^T

Explanation: A symmetric matrix is equal to its transpose. This means that for all ii and jj, aij=ajia_{ij} = a_{ji}. Symmetric matrices are always square.

Example of a symmetric matrix:

Note that s12=s21=2s_{12} = s_{21} = 2, s13=s31=3s_{13} = s_{31} = 3, and s23=s32=5s_{23} = s_{32} = 5.

Matrix Operations

8. For two matrices AA and BB to be added, they must:

  1. Have the same number of elements

  2. Have the same order (same number of rows and columns)

  3. Both be square matrices

  4. Have the same determinant

chevron-rightShow me the answerhashtag

Answer: 2. Have the same order (same number of rows and columns)

Explanation: Matrix addition is defined only for matrices of the same order. If AA is m×nm \times n and BB is p×qp \times q, then A+BA + B exists only if m=pm = p and n=qn = q.

Example: If A=(1234)A = \begin{pmatrix} 1 & 2 \\ 3 & 4 \end{pmatrix} and B=(5678)B = \begin{pmatrix} 5 & 6 \\ 7 & 8 \end{pmatrix}, then:

9. If AA is a 2×32 \times 3 matrix and BB is a 3×43 \times 4 matrix, then the product ABAB:

  1. Is a 2×42 \times 4 matrix

  2. Is a 3×33 \times 3 matrix

  3. Is a 2×32 \times 3 matrix

  4. Does not exist

chevron-rightShow me the answerhashtag

Answer: 1. Is a 2×42 \times 4 matrix

Explanation: For matrix multiplication ABAB to be defined, the number of columns in AA must equal the number of rows in BB. If AA is m×nm \times n and BB is n×pn \times p, then ABAB is m×pm \times p.

Here, AA is 2×32 \times 3 and BB is 3×43 \times 4, so:

  • Number of columns in AA = 3

  • Number of rows in BB = 3 ✓ (condition satisfied)

  • Resulting matrix ABAB will be 2×42 \times 4.

10. The transpose of matrix A=(123456)A = \begin{pmatrix} 1 & 2 & 3 \\ 4 & 5 & 6 \end{pmatrix} is:

  1. (142536)\begin{pmatrix} 1 & 4 \\ 2 & 5 \\ 3 & 6 \end{pmatrix}

  2. (123456)\begin{pmatrix} 1 & 2 \\ 3 & 4 \\ 5 & 6 \end{pmatrix}

  3. (123456)\begin{pmatrix} 1 & 2 & 3 \\ 4 & 5 & 6 \end{pmatrix}

  4. (654321)\begin{pmatrix} 6 & 5 & 4 \\ 3 & 2 & 1 \end{pmatrix}

chevron-rightShow me the answerhashtag

Answer: 1. (142536)\begin{pmatrix} 1 & 4 \\ 2 & 5 \\ 3 & 6 \end{pmatrix}

Explanation: The transpose of a matrix AA, denoted ATA^T, is obtained by interchanging rows and columns. If AA is m×nm \times n, then ATA^T is n×mn \times m.

For the given matrix:

Its transpose is:

11. For any square matrix AA, the trace is defined as:

  1. The product of diagonal elements

  2. The sum of all elements

  3. The sum of diagonal elements

  4. The determinant of the matrix

chevron-rightShow me the answerhashtag

Answer: 3. The sum of diagonal elements

Explanation: The trace of a square matrix AA, denoted tr(AA), is the sum of its diagonal elements. For an n×nn \times n matrix A=[aij]A = [a_{ij}]:

Example: For A=(1234)A = \begin{pmatrix} 1 & 2 \\ 3 & 4 \end{pmatrix}, tr(AA) = 1 + 4 = 5.

Determinants

12. The determinant of a 2×22 \times 2 matrix A=(abcd)A = \begin{pmatrix} a & b \\ c & d \end{pmatrix} is:

  1. ad+bcad + bc

  2. adbcad - bc

  3. abcdab - cd

  4. acbdac - bd

chevron-rightShow me the answerhashtag

Answer: 2. adbcad - bc

Explanation: For a 2×22 \times 2 matrix, the determinant is calculated as:

Example:

13. The determinant of a 3×33 \times 3 matrix A=(abcdefghi)A = \begin{pmatrix} a & b & c \\ d & e & f \\ g & h & i \end{pmatrix} using the first row is:

  1. a(eifh)b(difg)+c(dheg)a(ei - fh) - b(di - fg) + c(dh - eg)

  2. a(eifh)+b(difg)+c(dheg)a(ei - fh) + b(di - fg) + c(dh - eg)

  3. a(eifh)b(difg)c(dheg)a(ei - fh) - b(di - fg) - c(dh - eg)

  4. a(ei+fh)b(di+fg)+c(dh+eg)a(ei + fh) - b(di + fg) + c(dh + eg)

chevron-rightShow me the answerhashtag

Answer: 1. a(eifh)b(difg)+c(dheg)a(ei - fh) - b(di - fg) + c(dh - eg)

Explanation: The determinant of a 3×33 \times 3 matrix can be expanded along any row or column. Expanding along the first row:

14. If all elements of a row (or column) of a square matrix are zeros, then its determinant is:

  1. 1

  2. 0

  3. The product of diagonal elements

  4. Cannot be determined

chevron-rightShow me the answerhashtag

Answer: 2. 0

Explanation: If any row or column of a matrix consists entirely of zeros, then the determinant of that matrix is zero. This property can be understood by expanding the determinant along that row or column.

Example:

Because expanding along the second row gives: 0×(some cofactor)+0×(some cofactor)+0×(some cofactor)=00 \times (\text{some cofactor}) + 0 \times (\text{some cofactor}) + 0 \times (\text{some cofactor}) = 0.

15. If two rows (or columns) of a square matrix are identical, then its determinant is:

  1. 1

  2. 0

  3. Twice the value of the determinant

  4. The square of the determinant

chevron-rightShow me the answerhashtag

Answer: 2. 0

Explanation: If two rows or two columns of a square matrix are identical, then its determinant is zero. This property comes from the fact that swapping two identical rows doesn't change the matrix, but swapping any two rows changes the sign of the determinant. Thus, det(A)=det(A)\det(A) = -\det(A), which implies det(A)=0\det(A) = 0.

Example:

Properties of Determinants

16. If each element of a row (or column) of a determinant is multiplied by a constant kk, then the value of the determinant:

  1. Becomes kk times the original determinant

  2. Becomes 1/k1/k times the original determinant

  3. Remains unchanged

  4. Becomes k2k^2 times the original determinant

chevron-rightShow me the answerhashtag

Answer: 1. Becomes kk times the original determinant

Explanation: If each element of a row (or column) is multiplied by kk, the determinant gets multiplied by kk. This is because the determinant is a linear function of each row/column separately.

Example: If D=abcd=adbcD = \begin{vmatrix} a & b \\ c & d \end{vmatrix} = ad - bc, then:

17. If any two rows (or columns) of a determinant are interchanged, then the value of the determinant:

  1. Remains the same

  2. Changes sign

  3. Becomes zero

  4. Becomes doubled

chevron-rightShow me the answerhashtag

Answer: 2. Changes sign

Explanation: Interchanging any two rows (or columns) of a determinant changes its sign. This property is fundamental to the alternating nature of determinants.

Example: Let D=abcd=adbcD = \begin{vmatrix} a & b \\ c & d \end{vmatrix} = ad - bc. If we interchange rows:

18. The determinant of a matrix and its transpose are:

  1. Negatives of each other

  2. Reciprocals of each other

  3. Equal

  4. Unrelated

chevron-rightShow me the answerhashtag

Answer: 3. Equal

Explanation: For any square matrix AA, the determinant of AA equals the determinant of its transpose: det(A)=det(AT)\det(A) = \det(A^T).

Example:

Both determinants are equal to -2.

19. If AA and BB are square matrices of the same order, then det(AB)\det(AB) equals:

  1. det(A)+det(B)\det(A) + \det(B)

  2. det(A)det(B)\det(A) - \det(B)

  3. det(A)×det(B)\det(A) \times \det(B)

  4. det(A)/det(B)\det(A) / \det(B)

chevron-rightShow me the answerhashtag

Answer: 3. det(A)×det(B)\det(A) \times \det(B)

Explanation: This is the multiplicative property of determinants. For square matrices AA and BB of the same order: det(AB)=det(A)×det(B)\det(AB) = \det(A) \times \det(B).

Example:

Indeed, det(A)×det(B)=1×6=6=det(AB)\det(A) \times \det(B) = 1 \times 6 = 6 = \det(AB).

Matrix Inverses

20. A square matrix AA is invertible (non-singular) if and only if:

  1. det(A)=0\det(A) = 0

  2. det(A)0\det(A) \neq 0

  3. AA is symmetric

  4. AA is diagonal

chevron-rightShow me the answerhashtag

Answer: 2. det(A)0\det(A) \neq 0

Explanation: A square matrix AA has an inverse (denoted A1A^{-1}) if and only if its determinant is non-zero. Such matrices are called non-singular or invertible. If det(A)=0\det(A) = 0, the matrix is singular and does not have an inverse.

The inverse satisfies: AA1=A1A=IAA^{-1} = A^{-1}A = I, where II is the identity matrix.

21. The inverse of a 2×22 \times 2 matrix A=(abcd)A = \begin{pmatrix} a & b \\ c & d \end{pmatrix} is:

  1. 1adbc(dbca)\frac{1}{ad-bc} \begin{pmatrix} d & -b \\ -c & a \end{pmatrix}

  2. 1adbc(dbca)\frac{1}{ad-bc} \begin{pmatrix} -d & b \\ c & -a \end{pmatrix}

  3. 1ad+bc(dbca)\frac{1}{ad+bc} \begin{pmatrix} d & -b \\ -c & a \end{pmatrix}

  4. 1adbc(dbca)\frac{1}{ad-bc} \begin{pmatrix} d & b \\ c & a \end{pmatrix}

chevron-rightShow me the answerhashtag

Answer: 1. 1adbc(dbca)\frac{1}{ad-bc} \begin{pmatrix} d & -b \\ -c & a \end{pmatrix}

Explanation: For a 2×22 \times 2 matrix, the inverse formula is:

This formula works only when det(A)=adbc0\det(A) = ad - bc \neq 0.

Verification: AA1=(abcd)1adbc(dbca)=1adbc(adbc00adbc)=(1001)AA^{-1} = \begin{pmatrix} a & b \\ c & d \end{pmatrix} \cdot \frac{1}{ad-bc} \begin{pmatrix} d & -b \\ -c & a \end{pmatrix} = \frac{1}{ad-bc} \begin{pmatrix} ad-bc & 0 \\ 0 & ad-bc \end{pmatrix} = \begin{pmatrix} 1 & 0 \\ 0 & 1 \end{pmatrix}.

22. If AA is an invertible matrix, then (A1)1(A^{-1})^{-1} equals:

  1. AA

  2. ATA^T

  3. II

  4. A-A

chevron-rightShow me the answerhashtag

Answer: 1. AA

Explanation: The inverse of an inverse gives back the original matrix. This is similar to how (x1)1=x(x^{-1})^{-1} = x for non-zero numbers.

Formally, if AA is invertible, then A1A^{-1} exists and AA1=A1A=IAA^{-1} = A^{-1}A = I. By definition, (A1)1(A^{-1})^{-1} is the matrix that when multiplied by A1A^{-1} gives II. Since A(A1)=IA(A^{-1}) = I, we have (A1)1=A(A^{-1})^{-1} = A.

23. For invertible matrices AA and BB of the same order, (AB)1(AB)^{-1} equals:

  1. A1B1A^{-1}B^{-1}

  2. B1A1B^{-1}A^{-1}

  3. ABAB

  4. BABA

chevron-rightShow me the answerhashtag

Answer: 2. B1A1B^{-1}A^{-1}

Explanation: The inverse of a product is the product of the inverses in reverse order. To verify:

Similarly:

Thus, B1A1B^{-1}A^{-1} is indeed the inverse of ABAB.

Solving Linear Equations

24. The system of linear equations AX=BAX = B has a unique solution if:

  1. det(A)=0\det(A) = 0

  2. det(A)0\det(A) \neq 0

  3. AA is a square matrix

  4. BB is the zero vector

chevron-rightShow me the answerhashtag

Answer: 2. det(A)0\det(A) \neq 0

Explanation: For a system of linear equations AX=BAX = B, where AA is an n×nn \times n coefficient matrix:

  • If det(A)0\det(A) \neq 0, then AA is invertible, and the system has a unique solution: X=A1BX = A^{-1}B.

  • If det(A)=0\det(A) = 0, then either there is no solution or infinitely many solutions.

This result is known as Cramer's Rule when applied to each variable individually.

25. Using Cramer's Rule, the solution for xx in the system: a1x+b1y=c1a_1x + b_1y = c_1 a2x+b2y=c2a_2x + b_2y = c_2 is:

  1. c1b1c2b2a1b1a2b2\frac{\begin{vmatrix} c_1 & b_1 \\ c_2 & b_2 \end{vmatrix}}{\begin{vmatrix} a_1 & b_1 \\ a_2 & b_2 \end{vmatrix}}

  2. a1c1a2c2a1b1a2b2\frac{\begin{vmatrix} a_1 & c_1 \\ a_2 & c_2 \end{vmatrix}}{\begin{vmatrix} a_1 & b_1 \\ a_2 & b_2 \end{vmatrix}}

  3. a1b1a2b2c1b1c2b2\frac{\begin{vmatrix} a_1 & b_1 \\ a_2 & b_2 \end{vmatrix}}{\begin{vmatrix} c_1 & b_1 \\ c_2 & b_2 \end{vmatrix}}

  4. b1c1b2c2a1b1a2b2\frac{\begin{vmatrix} b_1 & c_1 \\ b_2 & c_2 \end{vmatrix}}{\begin{vmatrix} a_1 & b_1 \\ a_2 & b_2 \end{vmatrix}}

chevron-rightShow me the answerhashtag

Answer: 1. c1b1c2b2a1b1a2b2\frac{\begin{vmatrix} c_1 & b_1 \\ c_2 & b_2 \end{vmatrix}}{\begin{vmatrix} a_1 & b_1 \\ a_2 & b_2 \end{vmatrix}}

Explanation: Cramer's Rule states that for the system: a1x+b1y=c1a_1x + b_1y = c_1 a2x+b2y=c2a_2x + b_2y = c_2

Let D=a1b1a2b2D = \begin{vmatrix} a_1 & b_1 \\ a_2 & b_2 \end{vmatrix} (determinant of the coefficient matrix).

Let Dx=c1b1c2b2D_x = \begin{vmatrix} c_1 & b_1 \\ c_2 & b_2 \end{vmatrix} (replace the x-coefficients with constants).

Let Dy=a1c1a2c2D_y = \begin{vmatrix} a_1 & c_1 \\ a_2 & c_2 \end{vmatrix} (replace the y-coefficients with constants).

If D0D \neq 0, then:

Special Matrices and Properties

26. An orthogonal matrix satisfies:

  1. AT=AA^T = A

  2. AT=AA^T = -A

  3. AT=A1A^T = A^{-1}

  4. A2=AA^2 = A

chevron-rightShow me the answerhashtag

Answer: 3. AT=A1A^T = A^{-1}

Explanation: An orthogonal matrix is a square matrix whose transpose equals its inverse: AT=A1A^T = A^{-1}. Equivalently, AAT=ATA=IAA^T = A^TA = I.

Properties of orthogonal matrices:

  1. The columns (and rows) are orthonormal vectors (unit vectors that are mutually perpendicular).

  2. det(A)=±1\det(A) = \pm 1.

  3. Preserves lengths and angles: for any vector xx, Ax=x\|Ax\| = \|x\|.

Example: Rotation matrices are orthogonal.

27. For an orthogonal matrix AA, the determinant det(A)\det(A) equals:

  1. 0

  2. 1

  3. -1

  4. 1 or -1

chevron-rightShow me the answerhashtag

Answer: 4. 1 or -1

Explanation: For an orthogonal matrix AA, we have AAT=IAA^T = I. Taking determinants on both sides: det(AAT)=det(I)\det(AA^T) = \det(I) det(A)det(AT)=1\det(A)\det(A^T) = 1 Since det(AT)=det(A)\det(A^T) = \det(A), we get: [det(A)]2=1[\det(A)]^2 = 1 Thus, det(A)=±1\det(A) = \pm 1.

Orthogonal matrices with determinant +1 are called proper orthogonal matrices (rotations). Those with determinant -1 are called improper orthogonal matrices (reflections).

28. A nilpotent matrix is one where:

  1. A2=AA^2 = A

  2. A2=IA^2 = I

  3. Ak=0A^k = 0 for some positive integer kk

  4. AT=AA^T = A

chevron-rightShow me the answerhashtag

Answer: 3. Ak=0A^k = 0 for some positive integer kk

Explanation: A nilpotent matrix is a square matrix AA such that Ak=0A^k = 0 for some positive integer kk. The smallest such kk is called the index of nilpotency.

Properties:

  1. All eigenvalues of a nilpotent matrix are 0.

  2. The determinant and trace are both 0.

  3. The only nilpotent matrix that is diagonalizable is the zero matrix.

Example: A=(0100)A = \begin{pmatrix} 0 & 1 \\ 0 & 0 \end{pmatrix} is nilpotent because A2=(0000)=0A^2 = \begin{pmatrix} 0 & 0 \\ 0 & 0 \end{pmatrix} = 0.

29. The adjoint (adjugate) of a matrix AA is related to its inverse by:

  1. A1=1det(A)adj(A)A^{-1} = \frac{1}{\det(A)} \cdot \text{adj}(A)

  2. A1=det(A)adj(A)A^{-1} = \det(A) \cdot \text{adj}(A)

  3. A1=adj(A)A^{-1} = \text{adj}(A)

  4. A1=adj(A)det(A)A^{-1} = \frac{\text{adj}(A)}{\det(A)}

chevron-rightShow me the answerhashtag

Answer: 1. A1=1det(A)adj(A)A^{-1} = \frac{1}{\det(A)} \cdot \text{adj}(A)

Explanation: The adjoint (or adjugate) of a square matrix AA, denoted adj(AA), is the transpose of the cofactor matrix of AA.

The relationship between the inverse and adjoint is:

This formula holds when det(A)0\det(A) \neq 0.

Additionally, we have: Aadj(A)=adj(A)A=det(A)IA \cdot \text{adj}(A) = \text{adj}(A) \cdot A = \det(A) \cdot I.

30. The rank of a matrix is:

  1. The number of non-zero rows in its row echelon form

  2. The number of columns in the matrix

  3. The determinant of the matrix

  4. The trace of the matrix

chevron-rightShow me the answerhashtag

Answer: 1. The number of non-zero rows in its row echelon form

Explanation: The rank of a matrix is the maximum number of linearly independent rows (or columns) in the matrix. Equivalently, it is the number of non-zero rows in its row echelon form or reduced row echelon form.

Properties:

  1. Rank(AA) ≤ min(number of rows, number of columns)

  2. Rank(AA) = Rank(ATA^T)

  3. For an n×nn \times n matrix AA, if Rank(AA) = nn, then AA is invertible (non-singular).

The rank gives important information about the solutions of linear systems and the invertibility of matrices.