Generalizing Cross Products: Finding Orthogonal Vectors in n-Dimensional Space?

[rvadd]

I'm taking multivariate calculus and my teacher just introduced the concept of cross products a week ago. Reading the Wikipedia page, I see that cross products only work in three and seven dimensions, which is puzzling.

One use of the cross product for our class is to find the vector orthogonal to the 2 given vectors. My question is can this be generalized to n dimensions to find the vector orthogonal to the n-1 given vectors? Also what is the formal method/operation of doing this?

For example, given u = \left(1,0,0,0\right), v = \left(0,1,0,0\right), w = \left(0,0,1,0\right), the vector orthogonal to u, v, and w is given by:

<br /> \left|\begin{array}{cccc}<br /> e_{1} &amp; e_{2} &amp; e_{3} &amp; e_{4} \\<br /> 1 &amp; 0 &amp; 0 &amp; 0 \\<br /> 0 &amp; 1 &amp; 0 &amp; 0 \\<br /> 0 &amp; 0 &amp; 1 &amp; 0 \end{array}\right|<br /> = e_{4}<br />

I read a bit about Hodge duality, exterior products, and k-vectors. Much of it was confusing, so could you clarify if you use them as I have little background in linear algebra or tensor theory.

 

[mfb]

Consider a nxn-matrix where the first n-1 columns (or rows) are filled with n-1 vectors. Now, for each entry in the remaining column (or row), use the determinant of the (n-1)x(n-1)-matrix you get by removing the last column (or row) and the row (or column) your entry is in.

This might look complicated, but it is easy to show for the conventional cross-product:

$$\begin{pmatrix} a_1 & b_1 &|& \color{red}{a_2b_3-b_2a_3}\\ \color{red}{a_2} & \color{red}{b_2} &|& a_3b_1-b_3a_1 \\ \color{red}{a_3} & \color{red}{b_3} &|& a_1b_2-b_1a_2 \end{pmatrix} $$

It gives a vector which is orthogonal to all other n-1 vectors.

 

[quasar987]

Here is an argument based on the fact that the scalar product is a nondegenerate bilinear form, meaning the map Rⁿ-->(Rⁿ)^*: x--><x, - > is surjective. (Indeed, if f:Rⁿ-->R is any linear map, then as a matrix, it is a 1xn matrix, i.e. a vector; call it x. Then f = <x, - >. Here, (Rⁿ)^* is the set of all linear maps Rⁿ-->R.)

Consider now the linear map f:Rⁿ-->R defined as "w --> determinant of the matrix whose first n-1 columns are the n-1 vectors v₁,...,v_n-1 you want the cross-product of, and whose n^th column is just w". This is linear by properties of the determinant. So, there exists a vector x such that f = <x, - >. This x is the cross-product of v₁,...,v_n-1 in the sense that <x,v_k> = 0 for all k (by the property of the determinant that says that if the columns of A are linearly dependent, then det(A)=0).

 

[mathwonk]

the generalized cross product is discussed, as here, on pages 83-4 of spivak's calculus on manifolds.

 

[rvadd]

Thank you for the responses. The Spivak reading was especially helpful. So, correct me if my interpretation is incorrect:

The generalized cross product in n dimensions has arity n-1, but its operands are all 1-vectors and thus the output will also be a 1-vector.

I guess this might be a different question altogether, but what makes 7 dimensions amenable to a nontrivial cross product with only 2 operands instead of 6?

 

[lurflurf]

^It is a matter of which properties to maintain. As the Wikipedia page states "The seven-dimensional cross product is (...) the only other non-trivial bilinear product of two vectors that is vector valued, anticommutative and orthogonal. This follows from the Cayley-Dickson construction, which yields algebras of order 2^n which in turn yield cross products in 2^n-1 space. The 0 and 1 dimensional cases are trivial and the 15,31,2^n-1,... cases do not have the desired properties, this leaves only the 3 and 7 dimensional cases.