To solve the problem, we need to find the number of invertible integer matrices that satisfy the following conditions:
Orthogonality: , which implies that is an orthogonal matrix.
Commutation with : , where is the given diagonal matrix.
Step 1: Analyze the Matrix
The matrix is given by:
This is a diagonal matrix with distinct eigenvalues (with multiplicity 2) and .
Step 2: Commutation Condition
For a matrix to commute with , it must preserve the eigenspaces of . Since has two distinct eigenvalues (2 and 3), must be block-diagonal with respect to these eigenspaces. Specifically:
The first two rows and columns of correspond to the eigenvalue 2.
The third row and column correspond to the eigenvalue 3.
Thus, must have the form:
where:
is a orthogonal matrix (since is orthogonal).
is a scalar such that (to preserve orthogonality), implying .
Step 3: Orthogonal Matrices with Integer Entries
The orthogonal matrices with integer entries are precisely the signed permutation matrices (i.e., matrices with exactly one non-zero entry of in each row and column). There are 8 such matrices:
The identity matrix:
The negation of the identity matrix:
The two permutation matrices:
The four signed permutation matrices with one and one :
Step 4: Combine with the Scalar
For each of the 8 possible matrices , we have two choices for ( or ). This gives a total of:
Step 5: Verify Invertibility
All orthogonal matrices are invertible by definition, so all 16 matrices are invertible.
Conclusion
The number of invertible integer matrices satisfying the given conditions is 16.
Final Answer:
Comments
Post a Comment