Orthogonal and Diagonal Matrices

Click For Summary
SUMMARY

This discussion focuses on the properties of orthogonal and diagonal matrices, specifically 2x2 and 3x3 matrices. It establishes that all diagonal matrices are orthogonal, provided that the diagonal elements are either 1 or -1, ensuring that the product of the diagonal elements equals 1. An example of a 3x3 orthogonal matrix that is not diagonal is provided, which includes a rotation matrix. The discussion emphasizes the importance of understanding matrix transposition and inversion in determining orthogonality.

PREREQUISITES
  • Understanding of matrix operations, specifically transposition and inversion.
  • Familiarity with the definitions of orthogonal and diagonal matrices.
  • Knowledge of linear algebra concepts, including the Gram-Schmidt process.
  • Basic understanding of rotation matrices in three-dimensional space.
NEXT STEPS
  • Study the properties of diagonal matrices in detail, focusing on conditions for orthogonality.
  • Learn about the Gram-Schmidt process for orthogonalization of vectors.
  • Explore the construction of rotation matrices and their applications in 3D transformations.
  • Investigate the implications of matrix norms and magnitudes in the context of orthogonality.
USEFUL FOR

Students and professionals in mathematics, particularly those studying linear algebra, as well as anyone involved in computer graphics or engineering applications requiring matrix transformations.

RJLiberator
Gold Member
Messages
1,094
Reaction score
63

Homework Statement


Find all 2 x 2 and 3 x 3 orthogonal matrices which are diagonal. Construct an example of a 3 x 3 orthogonal matrix which is not diagonal.

Homework Equations


Diagonal Matrix = All components are 0 except for the diagonal, for a 2x2 matrix, this would mean components a and d may or may not be 0, while b and c must be 0.
Orthogonal IF: A^-1=A^T

The Attempt at a Solution


So, if I have a diagonal 2x2 matrix, then it is automatically considered orthogonal for all values of a and d. [/B]
I cannot think of a possibility where this doesn't hold.

for a 3x3 matrix, this problem seems substantially more difficult as I have to calculate the inverse of the 3x3 diagonal matrix. The transpose should be easy to calculate. It is simply the same matrix.
So, if the transpose of this 3x3 matrix has to equal the inverse, we don't need to do the inverse calculation.

We can say all 3x3 matrices that are diagonal are also orthogonal.

Now to construct an example of a 3x3 orthogonal matrix which is not diagonal, is a bit more difficult. I see that it has to be over the field of real numbers, but not getting further on this yet.
 
Physics news on Phys.org
RJLiberator said:

Homework Statement


Find all 2 x 2 and 3 x 3 orthogonal matrices which are diagonal. Construct an example of a 3 x 3 orthogonal matrix which is not diagonal.

Homework Equations


Diagonal Matrix = All components are 0 except for the diagonal, for a 2x2 matrix, this would mean components a and d may or may not be 0, while b and c must be 0.
Orthogonal IF: A^-1=A^T

The Attempt at a Solution


So, if I have a diagonal 2x2 matrix, then it is automatically considered orthogonal for all values of a and d. [/B]
I cannot think of a possibility where this doesn't hold.

for a 3x3 matrix, this problem seems substantially more difficult as I have to calculate the inverse of the 3x3 diagonal matrix. The transpose should be easy to calculate. It is simply the same matrix.
So, if the transpose of this 3x3 matrix has to equal the inverse, we don't need to do the inverse calculation.
Are you certain of this definition? I have seen some definitions that simply use the idea that the dot product of rows or columns is zero.
Using this definition...Is there not some magnitude requirement so that A inverse can be equal to A transpose?
i.e.:
## \begin{pmatrix} a& 0 &0 \\0& b &0 \\0& 0 &c \end{pmatrix}^T = ?, \quad \begin{pmatrix} a& 0 &0 \\0& b &0 \\0& 0 &c \end{pmatrix}^{-1} = ? ##

We can say all 3x3 matrices that are diagonal are also orthogonal.

Now to construct an example of a 3x3 orthogonal matrix which is not diagonal, is a bit more difficult. I see that it has to be over the field of real numbers, but not getting further on this yet.
For the construction, you can either use a physical example, like a rotated and tiled x,y,z axis, or just pick any old vector, and construct a second and third vector to complete the orthogonal set. Gram-Schmitt can be useful for this.
 
  • Like
Likes RJLiberator
RJLiberator said:

Homework Statement


Find all 2 x 2 and 3 x 3 orthogonal matrices which are diagonal. Construct an example of a 3 x 3 orthogonal matrix which is not diagonal.

Homework Equations


Diagonal Matrix = All components are 0 except for the diagonal, for a 2x2 matrix, this would mean components a and d may or may not be 0, while b and c must be 0.
Orthogonal IF: A^-1=A^T

The Attempt at a Solution


So, if I have a diagonal 2x2 matrix, then it is automatically considered orthogonal for all values of a and d. [/B]
I cannot think of a possibility where this doesn't hold.
I can. For example, the transpose of the matrix
$$A = \begin{pmatrix} 2 & 0 \\ 0 & 2 \end{pmatrix}$$ is not the inverse of A.
 
  • Like
Likes RJLiberator
Ah, I had made a foolish mistake in my original calculation of the inverse of a diagonal matrix. The result is actually [ 1/a, 0, 0, 1/d ]

Would this mean a*d must equal 1 for a matrix to be orthogonal and diagonal?
 
After taking the 3x3 inverse of a diagonal matrix, I see that it has a similar condition to a 2x2 matrix in this situation.

The transpose of a diagonal matrix is just itself.
The inverse of the matrix here, is the reciprocal of itself.
 
  • Like
Likes RUber
Since I have come to this conclusion,

It seems the only orthogonal and Diagonal matrixes are the inverse matrices since a=1/a b=1/b c =1/c and so on.

Is this the conclusion to the first part of this problem stating "find all possible orthogonal and diagonal 2x2 3x3 matrices?"
 
Looks right to me. So, a combination of ones and negative ones.
Any luck on the second part?
 
It's a bit more difficult.

I see what you stated above, but I am unaware of Gram-schmitt for this problem.

A rotated X,Y,Z axis seems like a great idea, one that I should explore, but not quite sure how to start it at this moment.
 
Maybe a more general approach is called for.
You have the constraints that ## A^TA = I##
Which can be seen by terms as:
##\begin{pmatrix} a&b&c\\d&e&f \\g&h&i \end{pmatrix}\begin{pmatrix} a&d&g\\b&e&h \\c&f&i \end{pmatrix} = \begin{pmatrix} 1&0&0\\0&1&0 \\0&0&1 \end{pmatrix}##
Multiplying this out, you get a set of 6 constraints for 9 variables, meaning that you have 3 free variables. So...if you pick a number between zero and one for a, d, and g, you should be able to solve for the other equations by solving the system.
 
  • #10
I spoke with my linear algebra teacher for this problem.

He suggested the possibility of matrix

\begin{bmatrix}
1 & 0 & 0 \\
0 & 0 & 1 \\
0 & -1 & 0
\end{bmatrix}

Which has the rotation matrix in the bottom right 2x2 section, by 90 degrees.

The Transpose of this matrix does equal the inverse of the matrix which concludes that it is orthogonal but not diagonal.

So this is an example constructed, which satisfies the problem requirement. Permitting I have a good understanding of diagonal and orthogonal matrices in my first part here, I've successfully completed this assignment.

I would like to explore your route here in your last post, as it seems more general and fundamental then me winging an example up.
 
Last edited:
  • #11
Granted, that is not diagonal...but it is clearly the same basic structure as the identity.

For a bit more of a challenge, you could rotate the system about the z-axis 45 degrees counter-clockwise...now your x-hat is pointing to ## ( \frac{\sqrt{2}}{2} \, \frac{\sqrt{2}}{2} \, 0)## and your y-hat is pointing to ## ( -\frac{\sqrt{2}}{2} \, \frac{\sqrt{2}}{2} \, 0)##. Your z-axis is still the same and can be represented by (0,0,1).

Or more generally, say you have a unit vector ( a, b, c ) such that a^2 + b^2 + c^2 = 1.
You can choose ( d, e, f ) such that one of the terms is zero, say, d. Then you know that be = -cf, which means f = kb and e = -kc, where k is a scaling factor to get you to unit length. By definition, ## k = \frac{1}{\sqrt{1-a^2}}.##
And so on and so forth to complete the matrix satisfying the constraints.
 
Last edited:
  • Like
Likes RJLiberator
  • #12
Indeed, there is some good information for me to look at here.

I thank you for helping me through this problem and giving me some thoughts to work on as I continue this thought process.

For the most part, I do understand what you are saying here in the latest post, it is starting to click, I believe I just need more of a fundamental understanding of matrix operations and what's going on before I truly understand it.
That should come soon in my semester :).

Regards.
 

Similar threads

  • · Replies 2 ·
Replies
2
Views
1K
Replies
9
Views
2K
  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 3 ·
Replies
3
Views
1K
Replies
10
Views
2K
  • · Replies 46 ·
2
Replies
46
Views
9K
  • · Replies 4 ·
Replies
4
Views
15K
  • · Replies 14 ·
Replies
14
Views
4K
  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 3 ·
Replies
3
Views
4K