CUET UG Mathematics Booster Test 2 - Adjoint, Inverse Matrices and Applications of Determinants
📌 Answers are locked once submitted — results and explanations appear at the end.
QUESTION 1 OF 20
Which statements are true for a square matrix \(A\)?
I. \(adj(A)\)is the transpose of the cofactor matrix
II. \(A(adjA)=∣A∣I\)
III. \(adj(A)\)is always symmetric
QUESTION 2 OF 20
Arrange the steps to form \(adj(A)\):
1. Identify element \(a_{ij}\)
2. Compute minor \(M_{ij}\)
3. Form cofactor \(A_{ij}=(-1)^{\left(i,\ j\right)}M_{ij}\)
4. Transpose the cofactor matrix
QUESTION 3 OF 20
Match expressions:
| List I | List II |
|---|---|
| 1. \(A(adjA)\) | a. \(A_{ji}\) |
| 2. \(∣adjA∣\) | b. \(∣A∣^{2}\)(for 3×3) |
| 3. Elements of \(\operatorname{adj}\,A\) | c. \(∣A∣I\) |
QUESTION 4 OF 20
If \(∣A∣=4\) for a 3×3 matrix, find \(∣adjA∣\).
\(∣adjA∣=∣A∣^{\left(n,\ 1\right)}=4^{2}=16\)
QUESTION 5 OF 20
Assertion (A): If \(A\) is singular, \(A^{-1}\)does not exist.
Reason (R):
\(A^{-1}=\frac{\operatorname{adj}\,A}{∣A∣}\)
So, division by zero is not defined.
QUESTION 6 OF 20
If a matrix maps non-zero vectors to the zero vector, then:
QUESTION 7 OF 20
If a determinant is non-zero, then the matrix is:
QUESTION 8 OF 20
Identify incorrect statement:
QUESTION 9 OF 20
\(∣A∣=\int_{1}^{e}\,\frac{1}{x} dx=lne=1adjA=\left(\begin{pmatrix}2 & 0\\ 0 & 2\end{pmatrix}\right)A^{-1}=\frac{1}{1}\left(\begin{pmatrix}2 & 0\\ 0 & 2\end{pmatrix}\right)=\left(\begin{pmatrix}2 & 0\\ 0 & 2\end{pmatrix}\right)\)
QUESTION 10 OF 20
For a matrix transformation to be reversible:
QUESTION 11 OF 20
Determinants \(∣A∣\)and \(∣B∣\)are independently chosen from \(\left\{1,\ 2\right\}\).
Find \(P(∣AB∣=2)\), given \(∣AB∣=∣A∣∣B∣\).
Possible pairs: \(\left(1,1),(1,2),(2,1),(2,2\right)\)
Products: \(1,2,2,4\)
Favourable cases: \(2\rightarrow 2\) cases out of 4
\(P=\frac{2}{4}=\frac{1}{2}\)
QUESTION 12 OF 20
If \(AB=BA=I\), then \(B\) is:
QUESTION 13 OF 20
Which are valid dimensional conditions?
I. \(A\) is \(n\times n\)
II. \(X\) is \(n\times 1\)
III. \(B\) is \(1\times n\)
QUESTION 14 OF 20
Correct logical steps:
1. Form \(AX=B\)
2. Premultiply: \(A^{-1}(AX)=A^{-1}B\)
3. Use associativity: \((A^{-1}A)X=IX\)
4. Conclude \(X=A^{-1}B\)
QUESTION 15 OF 20
Assertion (A): A consistent system always has exactly one solution.
Reason (R): Infinite solutions indicate inconsistency.
QUESTION 16 OF 20
Match the Following
| List I | List II |
|---|---|
| 1. \(∣A∣\neq 0\) | a. Inconsistent |
| 2. \(∣A∣=0\) and \((adjA)B\neq O\) | b. Consistent (infinite solutions) |
| 3. \(∣A∣=0\) and \((adjA)B=O\) | c. Unique solution |
QUESTION 17 OF 20
Three planes intersecting uniquely meet at:
QUESTION 18 OF 20
Identify incorrect statement when \(∣A∣=0\):
QUESTION 19 OF 20
Equations:
\(2x+3y=8,x-2y=-3\)
Coefficient matrix:
\(A=\left(\begin{pmatrix}2 & 3\\ 1 & -2\end{pmatrix}\right)∣A∣=2(-2)-3(1)=-4-3=-7\)
QUESTION 20 OF 20
If \(AX=O\) and \(∣A∣\neq 0\), then:
Test Complete!
Answer Review
1 Which statements are true for a square matrix \(A\)?
I. \(adj(A)\)is the transpose of the cofactor matrix
II. \(A(adjA)=∣A∣I\)
III. \(adj(A)\)is always symmetric
Adjoint is transpose of cofactor matrix. Matrix-adjoint product equals determinant times identity. Adjoint need not always be symmetric.
The adjoint of a matrix is defined as the transpose of its cofactor matrix. Also: \(A(adjA)=∣A∣I\) Thus statements I and II are true. However, \(adj(A)\)is not always symmetric unless the original matrix has special properties. Therefore statement III is false. Hence Option C is correct.
- Option A → Ignores the standard identity \(A(adjA)=∣A∣I\).
- Option B → Omits the definition of adjoint as transpose of cofactor matrix.
- Option D → Adjoint matrices are not necessarily symmetric for arbitrary matrices.
Used: Elimination
Application:
- Check each statement against standard adjoint matrix properties.
Final Logic:
- Only statements I and II hold universally.
"Adjoint = transpose of cofactors."
2 Arrange the steps to form \(adj(A)\):
1. Identify element \(a_{ij}\)
2. Compute minor \(M_{ij}\)
3. Form cofactor \(A_{ij}=(-1)^{\left(i,\ j\right)}M_{ij}\)
4. Transpose the cofactor matrix
Begin with matrix elements. Find minors and cofactors systematically. Transpose final cofactor matrix.
To form \(adj(A)\): 1. Identify matrix elements. 2. Compute corresponding minors. Apply sign rule to obtain cofactors: 3. \(A_{ij}=(-1)^{i+j}M_{ij}\) 4. Transpose the cofactor matrix. Thus the correct sequence is 1,2,3,4. Hence Option A is correct.
- Option B → Cannot compute cofactors before identifying matrix positions properly.
- Option C → Cofactors require minors first; order is reversed incorrectly.
- Option D → Transpose is the final step, not the first.
Used: Contextual/Tonal Matching
Application:
- Follow the logical construction process of adjoint matrices step-by-step.
Final Logic:
- Minor precedes cofactor, transpose comes last.
"Minor → cofactor → transpose."
3 Match expressions:
| List I | List II |
|---|---|
| 1. \(A(adjA)\) | a. \(A_{ji}\) |
| 2. \(∣adjA∣\) | b. \(∣A∣^{2}\)(for 3×3) |
| 3. Elements of \(\operatorname{adj}\,A\) | c. \(∣A∣I\) |
Product with adjoint gives determinant identity. Adjoint determinant follows exponent rule. Adjoint entries are transposed cofactors.
For a square matrix: \(A(adjA)=∣A∣I\) Thus 1–c. For a 3×3 matrix: \(∣adjA∣=∣A∣^{2}\) giving 2–b. Elements of adjoint are cofactors arranged transposed, hence \(A_{ji}\), giving 3–a. Therefore Option D is correct.
- Option A → Confuses determinant identity with adjoint entries.
- Option B → Product identity and determinant rule are mismatched.
- Option C → Incorrectly swaps determinant property and adjoint elements.
Used: Option Grouping
Application:
- Associate each standard adjoint formula with its correct interpretation.
Final Logic:
- Adjoint identities uniquely determine the matching order.
"Adjoint flips cofactors."
4 If \(∣A∣=4\) for a 3×3 matrix, find \(∣adjA∣\).
\(∣adjA∣=∣A∣^{\left(n,\ 1\right)}=4^{2}=16\)
Use adjoint determinant property. For order 3, exponent becomes 2. \(4^{2}=16\).
For an \(n\times n\) matrix: \(∣adjA∣=∣A∣^{n-1}\) Since matrix order is 3: \(∣adjA∣=4^{2}=16\) Hence Option B is correct. Other options use incorrect exponents or direct determinant copying.
- Option A → Uses determinant directly instead of squaring.
- Option C → Incorrectly cubes the determinant.
- Option D → Does not satisfy adjoint determinant formula.
Used: Substitution
Application:
- Apply adjoint-determinant relation carefully using matrix order.
Final Logic:
- For 3×3 matrices, exponent equals 2.
"Adjoint power = one less than order."
5 Assertion (A): If \(A\) is singular, \(A^{-1}\)does not exist.
Reason (R):
\(A^{-1}=\frac{\operatorname{adj}\,A}{∣A∣}\)
So, division by zero is not defined.
Singular matrices have zero determinant. Inverse formula divides by determinant. Division by zero is impossible.
A matrix is singular when: \(∣A∣=0\) The inverse formula is: \(A^{-1}=\frac{\operatorname{adj}\,A}{∣A∣}\) Since division by zero is undefined, inverse cannot exist for singular matrices. Thus both Assertion and Reason are true, and Reason correctly explains Assertion.
- Option A → Both statements are valid determinant properties.
- Option B → Reason is mathematically correct and explains the assertion.
- Option D → Assertion is true because singular matrices are noninvertible.
Used: Contextual/Tonal Matching
Application:
- Connect inverse existence directly with determinant value.
Final Logic:
- Zero determinant prevents inverse formation.
"Zero determinant → no inverse."
6 If a matrix maps non-zero vectors to the zero vector, then:
Invertible matrices preserve nonzero vectors. Mapping to zero implies information loss. Such matrices are singular.
If a nonzero vector is mapped to the zero vector, the transformation loses uniqueness. Hence the matrix cannot have an inverse. Such matrices are singular or non-invertible. Therefore Option C is correct. Identity and orthogonal matrices always preserve nonzero vectors.
- Option A → Identity matrix maps vectors to themselves, never to zero.
- Option B → Invertible matrices cannot collapse nonzero vectors into zero.
- Option D → Orthogonal matrices preserve vector lengths and directions.
Used: Elimination
Application:
- Interpret matrix invertibility geometrically through vector mapping.
Final Logic:
- Collapsing vectors to zero destroys invertibility.
"Zero output means no inverse."
7 If a determinant is non-zero, then the matrix is:
Nonzero determinant implies invertibility. Such matrices are nonsingular. Singular matrices have determinant zero.
A square matrix with: \(∣A∣\neq 0\) is called nonsingular and possesses an inverse. Hence Option C is correct. Singular matrices specifically have determinant zero. Null or zero matrices usually have determinant zero and are noninvertible.
- Option A → Singular matrices always have determinant zero.
- Option B → Null matrices cannot have nonzero determinant.
- Option D → Zero matrices have determinant zero, not nonzero.
Used: Elimination
Application:
- Apply the determinant criterion for matrix classification.
Final Logic:
- Nonzero determinant defines nonsingular matrices.
"Nonzero determinant = nonsingular."
8 Identify incorrect statement:
Invertible matrices require nonzero determinant. Matrix inverses are unique. Double inverse returns original matrix.
An invertible matrix must satisfy: \(∣A∣\neq 0\) Hence Option A is incorrect. Option B correctly defines inverse matrices. Option C is true because inverses are unique. Option D is also correct: \(\left(A^{-1})^{-1},\ A\right.\)
- Option B → Correct inverse definition using identity matrix multiplication.
- Option C → A matrix cannot possess two distinct inverses.
- Option D → Taking inverse twice restores the original matrix.
Used: Extreme Word Filter
Application:
- Check whether determinant-zero condition contradicts invertibility.
Final Logic:
- Invertibility always requires nonzero determinant.
"No inverse when determinant vanishes."
9 \(∣A∣=\int_{1}^{e}\,\frac{1}{x} dx=lne=1adjA=\left(\begin{pmatrix}2 & 0\\ 0 & 2\end{pmatrix}\right)A^{-1}=\frac{1}{1}\left(\begin{pmatrix}2 & 0\\ 0 & 2\end{pmatrix}\right)=\left(\begin{pmatrix}2 & 0\\ 0 & 2\end{pmatrix}\right)\)
Determinant evaluates to 1. Inverse formula uses adjoint divided by determinant. Matrix remains unchanged after division.
Since: \(∣A∣=\int_{1}^{e}\,\frac{1}{x}dx=1\) the inverse formula becomes: \(A^{-1}=\frac{\operatorname{adj}\,A}{∣A∣}=\frac{1}{1}\left(\begin{pmatrix}2 & 0\\ 0 & 2\end{pmatrix}\right)\) Thus: \(A^{-1}=\left(\begin{pmatrix}2 & 0\\ 0 & 2\end{pmatrix}\right)\) Hence Option B is correct.
- Option A → Identity matrix would arise only if adjoint itself were identity.
- Option C → Incorrect reciprocal scaling has been applied.
- Option D → Determinant value equals 1, not \(e\).
Used: Substitution
Application:
- Evaluate determinant first, then apply inverse formula directly.
Final Logic:
- Division by 1 leaves adjoint unchanged.
"Determinant one keeps adjoint same."
10 For a matrix transformation to be reversible:
Reversible transformations require invertibility. Invertibility requires nonzero determinant. Zero determinant collapses dimensions.
A matrix transformation is reversible only when the matrix has an inverse. This occurs precisely when: \(∣A∣\neq 0\) Zero determinant implies loss of dimension or area collapse, making reversal impossible. Therefore Option D is correct.
- Option A → Determinant zero produces singular, nonreversible transformations.
- Option B → Zero area indicates collapse and loss of invertibility.
- Option C → Adjoint may be nonzero even for singular matrices.
Used: Elimination
Application:
- Connect geometric reversibility with determinant condition.
Final Logic:
- Only nonzero determinants permit inverse transformations.
"Reversible means determinant nonzero."
11 Determinants \(∣A∣\)and \(∣B∣\)are independently chosen from \(\left\{1,\ 2\right\}\).
Find \(P(∣AB∣=2)\), given \(∣AB∣=∣A∣∣B∣\).
Possible pairs: \(\left(1,1),(1,2),(2,1),(2,2\right)\)
Products: \(1,2,2,4\)
Favourable cases: \(2\rightarrow 2\) cases out of 4
\(P=\frac{2}{4}=\frac{1}{2}\)
Use determinant product property. Count favourable determinant products. Probability equals favourable over total cases.
Given: \(∣AB∣=∣A∣∣B∣\) Possible determinant pairs are: \(\left(1,1),(1,2),(2,1),(2,2\right)\) Products become: \(1,2,2,4\) Two outcomes produce determinant 2. Total outcomes are four: \(P=\frac{2}{4}=\frac{1}{2}=0.5\) Hence Option A is correct.
- Option B → Counts only one favourable case instead of two.
- Option C → Incorrectly assumes three favourable products equal 2.
- Option D → Not all determinant products equal 2.
Used: Substitution
Application:
- List all determinant combinations and evaluate products systematically.
Final Logic:
- Two favourable cases out of four give probability 0.5.
"Product rule + counting cases."
12 If \(AB=BA=I\), then \(B\) is:
Identity product defines inverse matrices. Left and right inverses coincide. \(B\) must equal inverse of \(A\).
By definition, if: \(AB=BA=I\) then \(B\) is the inverse of \(A\): \(AA^{-1}=A^{-1}A=I\) Thus \(B=A^{-1}\). Hence Option C is correct. Adjoint and identity matrices satisfy different properties.
- Option A → Adjoint alone does not necessarily produce identity.
- Option B → Squaring a matrix is unrelated to inverse definition.
- Option D → Identity matrix equals inverse only when \(A=I\).
Used: Contextual/Tonal Matching
Application:
- Use the standard matrix inverse definition directly.
Final Logic:
- Identity multiplication characterizes inverses uniquely.
"Product gives identity → inverse found."
13 Which are valid dimensional conditions?
I. \(A\) is \(n\times n\)
II. \(X\) is \(n\times 1\)
III. \(B\) is \(1\times n\)
Matrix equation is \(AX=B\). Dimensions must satisfy multiplication rules. \(B\) should be \(n\times 1\), not \(1\times n\).
For: \(AX=B\) if \(A\) is \(n\times n\) and \(X\) is \(n\times 1\), then product \(AX\) becomes \(n\times 1\). Therefore \(B\) must also be \(n\times 1\). Statement III is false because \(1\times n\) dimensions are incompatible. Hence Option B is correct.
- Option A → Ignores the required column-vector dimension for \(X\).
- Option C → Statement III is dimensionally incompatible.
- Option D → \(B\) cannot be a row vector in the equation \(AX=B\).
Used: Dimensional/Unit Analysis
Application:
- Check matrix multiplication compatibility carefully.
Final Logic:
- \(AX\) and \(B\) must have identical dimensions.
"Matrix product dimensions must match."
14 Correct logical steps:
1. Form \(AX=B\)
2. Premultiply: \(A^{-1}(AX)=A^{-1}B\)
3. Use associativity: \((A^{-1}A)X=IX\)
4. Conclude \(X=A^{-1}B\)
Start with matrix equation. Multiply by inverse matrix. Simplify using identity property.
To solve: \(AX=B\) premultiply both sides by \(A^{-1}\): \(A^{-1}(AX)=A^{-1}B\) Using associativity: \((A^{-1}A)X=IX\) Since: \(A^{-1}A=I\) we obtain: \(X=A^{-1}B\) Thus Option A gives the correct logical order.
- Option B → Reverses the derivation sequence completely.
- Option C → Concludes solution before simplification steps are completed.
- Option D → Associativity step must follow premultiplication, not precede it.
Used: Contextual/Tonal Matching
Application:
- Follow the algebraic derivation process in exact sequence.
Final Logic:
- Premultiplication precedes simplification and final conclusion.
"Multiply inverse, simplify, conclude."
15 Assertion (A): A consistent system always has exactly one solution.
Reason (R): Infinite solutions indicate inconsistency.
Consistent systems may have infinite solutions. Infinite solutions still satisfy equations. Both statements are false.
A consistent system is one that has at least one solution. It may have either a unique solution or infinitely many solutions. Therefore Assertion is false. Infinite solutions still satisfy all equations simultaneously, so they indicate consistency, not inconsistency. Hence Reason is also false. Therefore Option A is correct.
- Option B → Assertion is false because consistency does not imply uniqueness.
- Option C → Infinite solutions do not imply inconsistency.
- Option D → Reason is also false since infinite solutions remain consistent.
Used: Extreme Word Filter
Application:
- Check whether the word "always" creates an incorrect universal claim.
Final Logic:
- Consistency includes both unique and infinite solutions.
"Consistent means at least one solution."
16 Match the Following
| List I | List II |
|---|---|
| 1. \(∣A∣\neq 0\) | a. Inconsistent |
| 2. \(∣A∣=0\) and \((adjA)B\neq O\) | b. Consistent (infinite solutions) |
| 3. \(∣A∣=0\) and \((adjA)B=O\) | c. Unique solution |
Nonzero determinant gives unique solution. Singular inconsistent systems fail compatibility. Zero determinant may still allow infinite solutions.
If: \(∣A∣\neq 0\) the system has a unique solution. If: \(∣A∣=0, (adjA)B\neq O\) the system is inconsistent. If: \(∣A∣=0, (adjA)B=O\) the system is consistent with infinitely many solutions. Hence matching becomes: 1–c, 2–a, 3–b.
- Option A → Unique solution and inconsistency conditions are interchanged incorrectly.
- Option C → Nonzero determinant cannot produce infinitely many solutions.
- Option D → Singular compatible systems are not inconsistent.
Used: Option Grouping
Application:
- Group determinant conditions into unique, inconsistent, and infinite-solution cases.
Final Logic:
- Only nonzero determinant guarantees uniqueness.
"Zero determinant needs compatibility check."
17 Three planes intersecting uniquely meet at:
Unique intersection means exactly one common solution. Three planes correspond to three equations. One solution means one common point.
In three-dimensional geometry, each plane represents a linear equation. If three planes intersect uniquely, the corresponding system has exactly one solution. Geometrically, this means all three planes meet at one common point. Hence Option C is correct.
- Option A → A line occurs when infinitely many common points exist.
- Option B → No point indicates inconsistency among planes.
- Option D → Three separate lines do not represent a unique common intersection.
Used: Contextual/Tonal Matching
Application:
- Interpret algebraic uniqueness geometrically.
Final Logic:
- Unique solution corresponds to one common intersection point.
"One solution → one point."
18 Identify incorrect statement when \(∣A∣=0\):
Singular systems may be consistent or inconsistent. Zero determinant prevents uniqueness. Compatibility condition determines consistency.
When: \(∣A∣=0\) the matrix is singular and inverse does not exist. A unique solution becomes impossible. However, the system may still be either consistent or inconsistent depending on: \((adjA)B\) Therefore Option B is incorrect because consistency is not guaranteed.
- Option A → Singular matrices cannot possess inverses.
- Option C → Compatibility conditions determine system behavior correctly.
- Option D → Unique solutions require nonzero determinant.
Used: Extreme Word Filter
Application:
- Check the universal claim "always consistent" carefully.
Final Logic:
- Singular systems may still be inconsistent.
"Zero determinant ≠ always consistent."
19 Equations:
\(2x+3y=8,x-2y=-3\)
Coefficient matrix:
\(A=\left(\begin{pmatrix}2 & 3\\ 1 & -2\end{pmatrix}\right)∣A∣=2(-2)-3(1)=-4-3=-7\)
Use determinant formula \(ad-bc\). Multiply diagonal terms carefully. Subtract cross products.
For: \(A=\left(\begin{pmatrix}2 & 3\\ 1 & -2\end{pmatrix}\right)\) determinant: \(∣A∣=2(-2)-3(1)=-4-3=-7\) Hence Option D is correct. Other values result from incorrect arithmetic or omission of subtraction.
- Option A → Determinant does not vanish after correct calculation.
- Option B → Incorrect simplification of determinant formula.
- Option C → Omits subtraction of the second product term.
Used: Substitution
Application:
- Apply the 2×2 determinant formula directly.
Final Logic:
- \(ad-bc=-7\).
"Multiply diagonals, subtract cross."
20 If \(AX=O\) and \(∣A∣\neq 0\), then:
Nonzero determinant implies invertibility. Premultiply by inverse matrix. Only zero vector solution remains.
Since: \(∣A∣\neq 0\) matrix \(A\) is invertible. From: \(AX=O\) premultiply by \(A^{-1}\): \(A^{-1}(AX)=A^{-1}OIX=OX=O\) Hence only the trivial solution exists. Therefore Option A is correct.
- Option B → \(X\) is fully determined after multiplying by inverse.
- Option C → Infinite solutions occur only for singular matrices.
- Option D → Solution vector cannot equal coefficient matrix.
Used: Substitution
Application:
- Use inverse multiplication to isolate the unknown vector.
Final Logic:
- Invertible matrices allow only the trivial homogeneous solution.
"Invertible homogeneous system → trivial solution."
