Orientation preserving 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).
 
##\textbf{Exercise 10}:## I came across the following solution online: Questions: 1. When the author states in "that ring (not sure if he is referring to ##R## or ##R/\mathfrak{p}##, but I am guessing the later) ##x_n x_{n+1}=0## for all odd $n$ and ##x_{n+1}## is invertible, so that ##x_n=0##" 2. How does ##x_nx_{n+1}=0## implies that ##x_{n+1}## is invertible and ##x_n=0##. I mean if the quotient ring ##R/\mathfrak{p}## is an integral domain, and ##x_{n+1}## is invertible then...
The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...
When decomposing a representation ##\rho## of a finite group ##G## into irreducible representations, we can find the number of times the representation contains a particular irrep ##\rho_0## through the character inner product $$ \langle \chi, \chi_0\rangle = \frac{1}{|G|} \sum_{g\in G} \chi(g) \chi_0(g)^*$$ where ##\chi## and ##\chi_0## are the characters of ##\rho## and ##\rho_0##, respectively. Since all group elements in the same conjugacy class have the same characters, this may be...
Back
Top