Orientation preserving and determinants

Click For Summary
SUMMARY

The discussion centers on proving two theorems related to 3x3 matrices and their determinants. The first theorem states that a 3x3 matrix A is orientation preserving if and only if the determinant of A, denoted as det(A), is greater than zero. The second theorem asserts that for any two 3x3 matrices A and B, the determinant of their product equals the product of their determinants, expressed as det(AB) = det(A) * det(B). The proofs involve manipulating determinants and leveraging properties of matrix multiplication.

PREREQUISITES
  • Understanding of 3x3 matrices and their properties
  • Familiarity with determinants and their calculations
  • Knowledge of linear transformations and orientation
  • Basic concepts of matrix multiplication
NEXT STEPS
  • Study the properties of determinants in linear algebra
  • Learn how to compute determinants for 3x3 matrices
  • Explore proofs involving elementary matrices and their determinants
  • Investigate the implications of orientation in linear transformations
USEFUL FOR

Mathematicians, students of linear algebra, and anyone interested in understanding matrix theory and determinants.

JSG31883
Messages
13
Reaction score
0
Can someone help me prove two theorems? I know they both are true, but can't come up with proofs.

1) Prove that a 3x3 matrix A is orientation preserving iff det(A)>0.

2) Prove that for A, B (both 3x3 matrices) that det(AB)=detA*detB. (A, B may or may not be invertible).

THANK YOU!
 
Physics news on Phys.org
I'm not entirely sure about this one. Let (v w x) be the 3x3 matrix with vectors v, w, and x as columns.

A is orientation preserving

if and only if

det (Av Aw Ax) > 0 iff det (v w x) > 0

if and only if

det (A(v w x)) > 0 iff det (v w x) > 0

if and only if

det(A)det(v w x) > 0 iff det (v w x) > 0 (using number 2. which you need to prove)

if and only if

det(A) > 0

2. I can't think of an easy way to do it, but if you actually expand it out in full, you will be able to show it.
 
for 2) how can I expand it out? You say if I expand it out I will be able to show it...
 
Take two general matrices, for example, take A to be:

(a11 a12 a13)
(a21 a22 a23)
(a31 a32 a33)

and B to be something similar. Actually compute the product AB and then compute it's determinant, and similarly compute the determinants |A| and |B|, then their product. You'll get some big, long, ugly expressions, but you'll be able to cancel them to show that they're equal.
 
Expanding out 2) will be disgusting (but would certainly work). Another way is to first prove it for elementary matrices, then show that any invertible matrix is the product of elementary matrices and you've pretty much handled the invertible case. A or B non-invertible is easier, assuming you know non-invertible<=>determinant is zero (or can prove this).
 

Similar threads

  • · Replies 20 ·
Replies
20
Views
3K
  • · Replies 20 ·
Replies
20
Views
3K
Replies
15
Views
2K
Replies
13
Views
4K
  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 2 ·
Replies
2
Views
3K
  • · Replies 6 ·
Replies
6
Views
6K
  • · Replies 4 ·
Replies
4
Views
3K
Replies
2
Views
2K
  • · Replies 2 ·
Replies
2
Views
3K