The matrix M is:
M = | α 1 |
| -6 1 |
Its eigenvalues are β and 4.
The trace of a matrix is the sum of its diagonal elements and equals the sum of its eigenvalues:
Trace(M) = α + 1
Since the eigenvalues are β and 4:
Trace(M) = β + 4
Equating these:
α + 1 = β + 4 ⇒ α + β = 1
Conclusion: Option (A) is correct.
To find the eigenvector corresponding to β, we solve:
(M − βI) v = 0, where v is the eigenvector.
Subtracting βI from M:
M − βI = | α − β 1 |
| -6 1 − β |
The eigenvector v satisfies:
| α − β 1 | |x| = 0
| -6 1 − β | |y|
Assume v = | 2 | 1 |. Substituting:
Solving -12 + 1 − β = 0 gives β = -11.
Conclusion: Option (B) is correct.
The rank of M is the number of linearly independent rows or columns.
Since M has distinct eigenvalues (β and 4), the rank of M is 2, meaning it is invertible.
Conclusion: Option (C) is correct.
To check if M² + M is invertible, consider:
M² + M = M (M + I)
For M² + M to be invertible, neither M nor M + I should have zero as an eigenvalue.
However, further computation of the eigenvalues of M + I reveal that it may not satisfy this condition for all α.
Conclusion: Option (D) is incorrect.
The correct options are:
Let $ A = \begin{bmatrix} 2 & 2 + p & 2 + p + q \\4 & 6 + 2p & 8 + 3p + 2q \\6 & 12 + 3p & 20 + 6p + 3q \end{bmatrix} $ If $ \text{det}(\text{adj}(\text{adj}(3A))) = 2^m \cdot 3^n, \, m, n \in \mathbb{N}, $ then $ m + n $ is equal to:
The sum of the payoffs to the players in the Nash equilibrium of the following simultaneous game is ............
Player Y | ||
---|---|---|
C | NC | |
Player X | X: 50, Y: 50 | X: 40, Y: 30 |
X: 30, Y: 40 | X: 20, Y: 20 |