Linear Algebra: The transpose of A equals Inverse A, so

jinksys
Messages
122
Reaction score
0
If the transpose of A equals the Inverse of A, then det(A)=1.

False. However, I don't follow the logic.

If transA=InverseA, doesn't that mean the matrix is the identity matrix?

The explanation says that det(A)= 1 and -1.
 
Physics news on Phys.org
jinksys said:
If the transpose of A equals the Inverse of A, then det(A)=1.

False. However, I don't follow the logic.

If transA=InverseA, doesn't that mean the matrix is the identity matrix?

The explanation says that det(A)= 1 and -1.

If the transpose of A is the inverse of A, it does not have to be the identity matrix. All it says is that the columns of A are an orthonormal basis, as are the rows (check this by matrix multiplication).

Examples are rotation matrices, and reflection matrices (try constructing some 2x2 example to be sure).
 
Try looking at a simple case. How about 1x1 matrices? There is only one unknown -- write down the equations that define what it means for the transpose to equal the inverse.
 
If you start with det(AA^-1)=det(I) and consider that det(A^T)=det(A) you should be able to work this out.
 
Thread 'Use greedy vertex coloring algorithm to prove the upper bound of χ'
Hi! I am struggling with the exercise I mentioned under "Homework statement". The exercise is about a specific "greedy vertex coloring algorithm". One definition (which matches what my book uses) can be found here: https://people.cs.uchicago.edu/~laci/HANDOUTS/greedycoloring.pdf Here is also a screenshot of the relevant parts of the linked PDF, i.e. the def. of the algorithm: Sadly I don't have much to show as far as a solution attempt goes, as I am stuck on how to proceed. I thought...
Back
Top