Pythagorean theorem based on cross product.

tony700
Messages
5
Reaction score
0
I was developing a pythagorean theorem proof based on the cross product of two vectors..Below is my final solution...My problem is I had to get around using the distance/magnitude formula because that is using the pythagorean theorem to prove the pythagorean theorem. But after searching, it may be true that the cross product itself is a generalization of the pythagorean theorem. I'm asking anyone to look at this proof who is real saavy with Linear Algebra and vectors to let me know if cross-product can or cannot be used to prove the pythagorean theorem..My final solution to ascertain the distance of the orthogonal vector, was to use a number line and absolute value based on the standard conventions of the orthogonal vector itself. Thank you for any help?

http://www.scribd.com/doc/202754816/3-d-Cross-Product-Proof-3-Vectors-Orthogonal-Solution
 
Last edited by a moderator:
Physics news on Phys.org
I think asserting the length of X to be \sqrt{A^2+B^2} is fine. It's not immediately clear how you actually proved the pythagorean theorem though, since you haven't drawn any right triangles whose sides and hypotenuse have been calculated.

The statement that |YxZ| = area of parallelogram is far from obvious to me given that you are restricting yourself to never using the pythagorean theorem.
 
The Pythagorean theorem is so fundamental that I would be very surprised if much of math in your proof did not depend on it. I don't know if you have seen the proof of his theorem, but it is very basic. He proved it before the number system was even a system. Fractions were not understood. He thought it was a religion.

I can't resist recommending this for your Pythagorean entertainment: http://www.youtube.com/watch?v=X1E7I7_r3Cw
 
##\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