Orthogonal matrices geometry help

In summary, the conversation is about proving that the set of n by n orthogonal matrices, denoted by O(n), is a group under the operation of matrix multiplication. The participants discuss the proofs for parts a), b), and c) of the problem, and the importance of showing that I is in O(n) and how it relates to proving A^-1 is in O(n). They also briefly discuss the simplicity of proving part a) and the use of the fact that XtX = I to prove that an n x n matrix X is in O(n).
  • #1
Pearce_09
74
0
Hello again,
This question confuses me for a reason. I read the questions and they sound to simple and to easy to answer. So maybe its something I am reading wrong and not answering. Help would be greatly apreciated.

first off
Let O(n) = { A | A is an n x n matrix with A^t A = I } be the set of n by n orthogonal matrices. Show that

a) I "is in" O(n)
b) If A, B "is in" O(n), then AB "is in" O(n) and that
c) If A "is in" O(n), then A^-1 "is in" O(n)

now a) just seems so simple i just don't know how to answer somthing like that

and for b) i have
-- if A,B "is in" O(n)

AA^t = I
BB^t = I

if AA^t = I , and BB^t = I then,
AA^t = BB^t

-- show AB "is in" O(n)

AB(AB)^t = I
ABB^tA^t = I
since BB^t = AA^t
AA^tAA^t = I
therefore since AA^t = I then AA^tAA^t = I and
therefore AB = I

now does this last statement change the process of the question

(In other words, this problem asks you to show that using the operation of matrix multiplication, O(n) is a group.)
does this statement change the way i should approach a)b)c)
thanks for you time
regards,
adam
 
Physics news on Phys.org
  • #2
Your proof for part ii) does too much:

(AB)t(AB) = BtAtAB = Bt(AtA)B = BtIB = BtB = I

You should know that in general, if X and Y are square matrices, and XY = I, then YX = I. To prove that A-1 is in O(n), use the fact that A-1 = At and the stuff in the previous sentence. In general, to prove that an n x n matrix X is in O(n) you need to prove that XtX = I.
 
  • #3
hello AKG,
thanks for the help, well for everything.
There is just one thing, part a). Isnt it completely obvious that I "is in" the set of orthogonal matrices. I just can't wrap my mind around proving somthing so simple.
thanks again
adam
 
  • #4
Check the last sentence of my previous post for how to prove I is in O(n).
 
  • #5
oh yes, that's directed to a).. i see now. thanks again
 

FAQ: Orthogonal matrices geometry help

What is an orthogonal matrix?

An orthogonal matrix is a square matrix where the columns and rows are orthogonal (perpendicular) to each other. This means that the dot product of any two columns or rows is equal to 0.

What is the significance of orthogonal matrices in geometry?

Orthogonal matrices have several important applications in geometry. They can be used to represent rotations, reflections, and other transformations in 2D and 3D space. They are also useful for solving systems of linear equations and for calculating distances and angles between vectors.

How do you determine if a matrix is orthogonal?

To determine if a matrix is orthogonal, you can check if its inverse is equal to its transpose. In other words, if A is an orthogonal matrix, then A-1 = AT. Additionally, you can check if the dot product of any two columns or rows is equal to 0.

Can an orthogonal matrix have complex numbers?

Yes, an orthogonal matrix can have complex numbers. In fact, the columns and rows of an orthogonal matrix can be any set of orthonormal vectors, which can include complex numbers.

How are orthogonal matrices used in computer graphics?

Orthogonal matrices are used in computer graphics to represent 3D rotations and translations. They are also used in projection matrices to convert 3D coordinates to 2D coordinates for display on a screen. Additionally, they are useful for performing other transformations, such as shearing and scaling, on 3D objects.

Similar threads

Back
Top