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:

| a | X | Y | Z |
| M | 3, 1 | 0, 0 | β1, 2 |
| N | 0, 0 | 1, 3 | 0.5, 1 |
Which set of strategy profiles survives iterated elimination of strictly dominated strategies?
| L | R | |
| U | 0, 0 | 0, βc |
| D | βc, 0 | 1 β c, 1 β c |
