Is the vector cross product only defined for 3D?












66












$begingroup$


Wikipedia introduces the vector product for two vectors $vec a$ and $vec b$ as
$$
vec a timesvec b=(| vec a| |vec b|sinTheta)vec n
$$
It then mentions that $vec n$ is the vector normal to the plane made by $vec a$ and $vec b$, implying that $vec a$ and $vec b$ are 3D vectors. Wikipedia mentions something about a 7D cross product, but I'm not going to pretend I understand that.



My idea, which remains unconfirmed with any source, is that a cross product can be thought of a vector which is orthogonal to all vectors which you are crossing. If, and that's a big IF, this is right over all dimensions, we know that for a set of $n-1$ $n$-dimensional vectors, there exists a vector which is orthogonal to all of them. The magnitude would have something to do with the area/volume/hypervolume/etc. made by the vectors we are crossing.



Am I right to guess that this multidimensional aspect of cross vectors exists or is that last part utter rubbish?










share|cite|improve this question











$endgroup$








  • 5




    $begingroup$
    If you put your $n-1$ vectors as rows in a matrix, fill in with a random row $n$ to get a square matrix, then take the adjoint matrix, then column $n$ of the adjoint is what you are asking about. This follows from $$ A cdot ; mbox{adj} ; A = det A cdot I $$ where the value of $det A$ is not relevant here.
    $endgroup$
    – Will Jagy
    Aug 23 '12 at 19:28












  • $begingroup$
    Yeah! The matrix determinant is something that I found was useful for calculating higher-dimensional cross products when I was fooling around on MMA. But I used a (-1)^n term, because there was an alternating negative sign that came out sometimes. Is that $I$?
    $endgroup$
    – VF1
    Aug 23 '12 at 19:30










  • $begingroup$
    $I$ refers to the (square) identity matrix. Is MMA Mixed Martial Arts?
    $endgroup$
    – Will Jagy
    Aug 23 '12 at 19:43






  • 1




    $begingroup$
    I think MAMA is a more amusing acronym for Mathematica than MMA!
    $endgroup$
    – rschwieb
    Aug 23 '12 at 20:16






  • 1




    $begingroup$
    @rschwieb, since you brought up Mathematica, the docs say some of the things in Eric's fine answer: "Cross[v1, v2, …] gives the dual (Hodge star) of the wedge product of the $v_i$, viewed as one-forms in $n$ dimensions."
    $endgroup$
    – J. M. is not a mathematician
    Aug 24 '12 at 1:16
















66












$begingroup$


Wikipedia introduces the vector product for two vectors $vec a$ and $vec b$ as
$$
vec a timesvec b=(| vec a| |vec b|sinTheta)vec n
$$
It then mentions that $vec n$ is the vector normal to the plane made by $vec a$ and $vec b$, implying that $vec a$ and $vec b$ are 3D vectors. Wikipedia mentions something about a 7D cross product, but I'm not going to pretend I understand that.



My idea, which remains unconfirmed with any source, is that a cross product can be thought of a vector which is orthogonal to all vectors which you are crossing. If, and that's a big IF, this is right over all dimensions, we know that for a set of $n-1$ $n$-dimensional vectors, there exists a vector which is orthogonal to all of them. The magnitude would have something to do with the area/volume/hypervolume/etc. made by the vectors we are crossing.



Am I right to guess that this multidimensional aspect of cross vectors exists or is that last part utter rubbish?










share|cite|improve this question











$endgroup$








  • 5




    $begingroup$
    If you put your $n-1$ vectors as rows in a matrix, fill in with a random row $n$ to get a square matrix, then take the adjoint matrix, then column $n$ of the adjoint is what you are asking about. This follows from $$ A cdot ; mbox{adj} ; A = det A cdot I $$ where the value of $det A$ is not relevant here.
    $endgroup$
    – Will Jagy
    Aug 23 '12 at 19:28












  • $begingroup$
    Yeah! The matrix determinant is something that I found was useful for calculating higher-dimensional cross products when I was fooling around on MMA. But I used a (-1)^n term, because there was an alternating negative sign that came out sometimes. Is that $I$?
    $endgroup$
    – VF1
    Aug 23 '12 at 19:30










  • $begingroup$
    $I$ refers to the (square) identity matrix. Is MMA Mixed Martial Arts?
    $endgroup$
    – Will Jagy
    Aug 23 '12 at 19:43






  • 1




    $begingroup$
    I think MAMA is a more amusing acronym for Mathematica than MMA!
    $endgroup$
    – rschwieb
    Aug 23 '12 at 20:16






  • 1




    $begingroup$
    @rschwieb, since you brought up Mathematica, the docs say some of the things in Eric's fine answer: "Cross[v1, v2, …] gives the dual (Hodge star) of the wedge product of the $v_i$, viewed as one-forms in $n$ dimensions."
    $endgroup$
    – J. M. is not a mathematician
    Aug 24 '12 at 1:16














66












66








66


35



$begingroup$


Wikipedia introduces the vector product for two vectors $vec a$ and $vec b$ as
$$
vec a timesvec b=(| vec a| |vec b|sinTheta)vec n
$$
It then mentions that $vec n$ is the vector normal to the plane made by $vec a$ and $vec b$, implying that $vec a$ and $vec b$ are 3D vectors. Wikipedia mentions something about a 7D cross product, but I'm not going to pretend I understand that.



My idea, which remains unconfirmed with any source, is that a cross product can be thought of a vector which is orthogonal to all vectors which you are crossing. If, and that's a big IF, this is right over all dimensions, we know that for a set of $n-1$ $n$-dimensional vectors, there exists a vector which is orthogonal to all of them. The magnitude would have something to do with the area/volume/hypervolume/etc. made by the vectors we are crossing.



Am I right to guess that this multidimensional aspect of cross vectors exists or is that last part utter rubbish?










share|cite|improve this question











$endgroup$




Wikipedia introduces the vector product for two vectors $vec a$ and $vec b$ as
$$
vec a timesvec b=(| vec a| |vec b|sinTheta)vec n
$$
It then mentions that $vec n$ is the vector normal to the plane made by $vec a$ and $vec b$, implying that $vec a$ and $vec b$ are 3D vectors. Wikipedia mentions something about a 7D cross product, but I'm not going to pretend I understand that.



My idea, which remains unconfirmed with any source, is that a cross product can be thought of a vector which is orthogonal to all vectors which you are crossing. If, and that's a big IF, this is right over all dimensions, we know that for a set of $n-1$ $n$-dimensional vectors, there exists a vector which is orthogonal to all of them. The magnitude would have something to do with the area/volume/hypervolume/etc. made by the vectors we are crossing.



Am I right to guess that this multidimensional aspect of cross vectors exists or is that last part utter rubbish?







linear-algebra vector-spaces vectors cross-product






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Jan 31 at 12:50









Khaled Oqab

515




515










asked Aug 23 '12 at 19:19









VF1VF1

8511919




8511919








  • 5




    $begingroup$
    If you put your $n-1$ vectors as rows in a matrix, fill in with a random row $n$ to get a square matrix, then take the adjoint matrix, then column $n$ of the adjoint is what you are asking about. This follows from $$ A cdot ; mbox{adj} ; A = det A cdot I $$ where the value of $det A$ is not relevant here.
    $endgroup$
    – Will Jagy
    Aug 23 '12 at 19:28












  • $begingroup$
    Yeah! The matrix determinant is something that I found was useful for calculating higher-dimensional cross products when I was fooling around on MMA. But I used a (-1)^n term, because there was an alternating negative sign that came out sometimes. Is that $I$?
    $endgroup$
    – VF1
    Aug 23 '12 at 19:30










  • $begingroup$
    $I$ refers to the (square) identity matrix. Is MMA Mixed Martial Arts?
    $endgroup$
    – Will Jagy
    Aug 23 '12 at 19:43






  • 1




    $begingroup$
    I think MAMA is a more amusing acronym for Mathematica than MMA!
    $endgroup$
    – rschwieb
    Aug 23 '12 at 20:16






  • 1




    $begingroup$
    @rschwieb, since you brought up Mathematica, the docs say some of the things in Eric's fine answer: "Cross[v1, v2, …] gives the dual (Hodge star) of the wedge product of the $v_i$, viewed as one-forms in $n$ dimensions."
    $endgroup$
    – J. M. is not a mathematician
    Aug 24 '12 at 1:16














  • 5




    $begingroup$
    If you put your $n-1$ vectors as rows in a matrix, fill in with a random row $n$ to get a square matrix, then take the adjoint matrix, then column $n$ of the adjoint is what you are asking about. This follows from $$ A cdot ; mbox{adj} ; A = det A cdot I $$ where the value of $det A$ is not relevant here.
    $endgroup$
    – Will Jagy
    Aug 23 '12 at 19:28












  • $begingroup$
    Yeah! The matrix determinant is something that I found was useful for calculating higher-dimensional cross products when I was fooling around on MMA. But I used a (-1)^n term, because there was an alternating negative sign that came out sometimes. Is that $I$?
    $endgroup$
    – VF1
    Aug 23 '12 at 19:30










  • $begingroup$
    $I$ refers to the (square) identity matrix. Is MMA Mixed Martial Arts?
    $endgroup$
    – Will Jagy
    Aug 23 '12 at 19:43






  • 1




    $begingroup$
    I think MAMA is a more amusing acronym for Mathematica than MMA!
    $endgroup$
    – rschwieb
    Aug 23 '12 at 20:16






  • 1




    $begingroup$
    @rschwieb, since you brought up Mathematica, the docs say some of the things in Eric's fine answer: "Cross[v1, v2, …] gives the dual (Hodge star) of the wedge product of the $v_i$, viewed as one-forms in $n$ dimensions."
    $endgroup$
    – J. M. is not a mathematician
    Aug 24 '12 at 1:16








5




5




$begingroup$
If you put your $n-1$ vectors as rows in a matrix, fill in with a random row $n$ to get a square matrix, then take the adjoint matrix, then column $n$ of the adjoint is what you are asking about. This follows from $$ A cdot ; mbox{adj} ; A = det A cdot I $$ where the value of $det A$ is not relevant here.
$endgroup$
– Will Jagy
Aug 23 '12 at 19:28






$begingroup$
If you put your $n-1$ vectors as rows in a matrix, fill in with a random row $n$ to get a square matrix, then take the adjoint matrix, then column $n$ of the adjoint is what you are asking about. This follows from $$ A cdot ; mbox{adj} ; A = det A cdot I $$ where the value of $det A$ is not relevant here.
$endgroup$
– Will Jagy
Aug 23 '12 at 19:28














$begingroup$
Yeah! The matrix determinant is something that I found was useful for calculating higher-dimensional cross products when I was fooling around on MMA. But I used a (-1)^n term, because there was an alternating negative sign that came out sometimes. Is that $I$?
$endgroup$
– VF1
Aug 23 '12 at 19:30




$begingroup$
Yeah! The matrix determinant is something that I found was useful for calculating higher-dimensional cross products when I was fooling around on MMA. But I used a (-1)^n term, because there was an alternating negative sign that came out sometimes. Is that $I$?
$endgroup$
– VF1
Aug 23 '12 at 19:30












$begingroup$
$I$ refers to the (square) identity matrix. Is MMA Mixed Martial Arts?
$endgroup$
– Will Jagy
Aug 23 '12 at 19:43




$begingroup$
$I$ refers to the (square) identity matrix. Is MMA Mixed Martial Arts?
$endgroup$
– Will Jagy
Aug 23 '12 at 19:43




1




1




$begingroup$
I think MAMA is a more amusing acronym for Mathematica than MMA!
$endgroup$
– rschwieb
Aug 23 '12 at 20:16




$begingroup$
I think MAMA is a more amusing acronym for Mathematica than MMA!
$endgroup$
– rschwieb
Aug 23 '12 at 20:16




1




1




$begingroup$
@rschwieb, since you brought up Mathematica, the docs say some of the things in Eric's fine answer: "Cross[v1, v2, …] gives the dual (Hodge star) of the wedge product of the $v_i$, viewed as one-forms in $n$ dimensions."
$endgroup$
– J. M. is not a mathematician
Aug 24 '12 at 1:16




$begingroup$
@rschwieb, since you brought up Mathematica, the docs say some of the things in Eric's fine answer: "Cross[v1, v2, …] gives the dual (Hodge star) of the wedge product of the $v_i$, viewed as one-forms in $n$ dimensions."
$endgroup$
– J. M. is not a mathematician
Aug 24 '12 at 1:16










6 Answers
6






active

oldest

votes


















51












$begingroup$

Yes, you are correct. You can generalize the cross product to $n$ dimensions by saying it is an operation which takes in $n-1$ vectors and produces a vector that is perpendicular to each one. This can be easily defined using the exterior algebra and Hodge star operator http://en.wikipedia.org/wiki/Hodge_dual: the cross product of $v_1,ldots,v_{n-1}$ is then just $*(v_1 wedge v_2 cdots wedge v_{n-1}$).



Then the magnitude of the cross product of n-1 vectors is the volume of the higher-dimensional parallelogram that they determine. Specifying the magnitude and being orthogonal to each of the vectors narrows the possiblity to two choices-- an orientation picks out one of these.






share|cite|improve this answer









$endgroup$









  • 5




    $begingroup$
    One caution with this construction: as Eric somewhat notes in passing (and as is also true in three dimensions), what you get here isn't strictly a vector in many senses of the word, but a covector. In particular, the cross-product construction isn't invariant under arbitrary linear transformations; instead, it transforms by the adjoint transform of whatever linear transformation is applied to its inputs. (This is an old issue in computer graphics, where normal 'vectors' to surfaces don't transform with the points on the surface.)
    $endgroup$
    – Steven Stadnicki
    Aug 23 '12 at 20:52






  • 9




    $begingroup$
    @Steven: Eric's defining his operation in terms of the Hodge star, which gives a genuine vector (but requires a choice of inner product and then a choice of orientation).
    $endgroup$
    – Qiaochu Yuan
    Aug 23 '12 at 22:02






  • 1




    $begingroup$
    Thanks for the reply. That was what I was looking for. I was only familiar with the wedge product through Stroke's Theorem, and I have yet to find out what the "exterior algebra" is. That's why I couldn't make the connection on my own.
    $endgroup$
    – VF1
    Aug 23 '12 at 23:09












  • $begingroup$
    @QiaochuYuan: this "choice of inner product"- is it the higher dimensional analogue of what we call "handedness" in three dimensions?
    $endgroup$
    – Arkya Chatterjee
    Aug 20 '16 at 10:38






  • 5




    $begingroup$
    @Arkya: no, it's the higher dimensional analogue of knowing what the lengths of vectors is. The choice of orientation is the higher dimensional analogue of handedness.
    $endgroup$
    – Qiaochu Yuan
    Aug 22 '16 at 22:33



















16












$begingroup$

The answer to this problem is sadly not very well-known. Suppose an r-ary operation on certain d-dimensional space V. Then, a r-fold d-dimensional "cross product" multilinear operation exists:



$$ (C_1times C_2times ldotstimes C_r): V^{dr}=underbrace{V^dtimes cdots times V^d}_{r}longrightarrow V^d$$



such as $$forall i=1,2,...,r$$ we have that



$$ (C_1times C_2times ldotstimes C_r)cdot C_i=0$$



$$ (C_1times C_2times ldotstimes C_r)cdot (C_1times C_2times ldotstimes C_r)=det (C_icdot C_j)$$



Eckmann (1943) and Whitehead (1963) solved this problem in the continuous case over real euclidean spaces, while Brown and Gray (1967) solved
the multilinear case. Moreover, the solution that I am going to provide is valid in any field with characteristic different of 2 and with $1leq rleq d$. The theorem (due to Eckmann, Whitehead, and Brown-Gray) says that the "generalized cross product" (including the 3d case) exists when:



A) $d$ is even, $r = 1$. A cross product exists in every even dimension with one single factor. This can be thought some kind of "Wick rotation" if you are aware of this concept in every even dimensions! This cross product with a single factor is a bit non-trivial but easy to understand.



B) $d$ is arbitrary, $r = d − 1$. A cross product exists in arbitrary dimension d and (d-1) factors. It is also said that an arbitrary (d-1)-fold cross product exists in any dimension. Just take the determinant of those (d-1) vectors with the versors $(e_1,...,e_r)$!



C) $d = 3, 7, r = 2$. A 2-fold cross vector exists in dimension 3 and 7. Therefore, the "bilinear" cross product can only exists with two factors in 3D and 7D. The 3D cross product is well known, the 7D cross product can be found (both in coordinate and free coordinate versions) in wikipedia.



D) $d = 8, r = 3$. A 3-fold cross product exists in eight dimensions. There, there is a non-trivial 3-fold cross in 8D, i.e., you can build a non-trivial cross product with 3 vectors in 8 dimensions. I haven't seen a coordinate expression for this but I believe someone did it (I could write a post about it, though, in my blog, in the near future).



This happens in euclidean signature, I suppose there are some variants in pseudo-euclidean metrics (and perhaps some non-trivial subcases; I have heard about a non-trivial 3-fold cross product in 4D but I can not find a reference). Moreover, you can find a similar conclusion in the book Clifford algebras and Spinors by P. Lounesto. Geometric algebra is very useful when handling with this vector stuff since vectors are just a particular grade of a polyvector/cliffor/blade...






share|cite|improve this answer











$endgroup$













  • $begingroup$
    I don't understand why we have to prove that a cross product exists for any given $d > r$ - for any set of vectors with size $r$, any matrix which has a column space defined by the basis of this set of vectors is guaranteed to have a rank of at most $r$, and so a null space of $d-r > 0$. Since this null space is always nontrivial, a vector satisfying the criteria for the cross product can always be found.
    $endgroup$
    – VF1
    Aug 8 '13 at 22:42



















11












$begingroup$

Well, it depends on what you mean by "the vector cross product." There is a generalization to $n$ dimensions which takes $n-1$ vectors as input and returns what can be thought of as a vector orthogonal to all of them. It generalizes to an operation taking $k$ vectors as input where $k le n$, but then the output is not something like a vector but something more complicated. See wedge product.



There is a more specific generalization to $7$ dimensions coming from multiplication in the octonions in the same way that the cross product can be thought of as coming from multiplication in the quaternions.






share|cite|improve this answer









$endgroup$













  • $begingroup$
    The cross-product in euclidean space is not the same as the cross-product in pseudo-euclidean spaces, but they can also be defined with the aid of split-octornions and quaternions in 4D and 8D, such as we would obtain modified cross products in 3D and 7D. I wonder if we can do that in any spacetime signature (the map above). Wedge product is defined in any spacetime dimension, but it is not the same as cross-product since wedge product is associative...
    $endgroup$
    – riemannium
    Aug 10 '13 at 12:32



















9












$begingroup$

The cross product is very closely related to the concept of quaternions. The cross product "identities" that operate on the unit vectors $rm mathbf{hat{i}}, mathbf{hat{j}}, mathbf{hat{k}}$ are essentially similar to the identities on the quaternion units (basis elements) $i,j,k$.



Notice that quaternions have four units: $1, i, j, k$, and the 3-D cross product works in vector spaces of dimension 4-1 = 3.



The seven-dimensional cross product is analogous to the octonions, and has a similar definition which I do not wish to enumerate here.



These are the only dimensions in which a "cross-product" of such a sort exists. The relation between the vector operation and multiplication of quaternions/octonions is the underlying reason why. Quaternions and Octonions compose what is known as a closed normed division algebra. And real closed division algebras can only have dimensions of 1,2,4,8.



As @QiaochuYuan mentions, the generalization to other dimensions yields something different than a vector -- such an operation exists and can be used in a similar way, but you do not have the niceness of retrieving a vector in the end.






share|cite|improve this answer











$endgroup$













  • $begingroup$
    Thanks. That explains why there is only a 3D and 7D cross product, and any other pattern I saw can be explained with the wedge product and exterior algebra of the system.
    $endgroup$
    – VF1
    Aug 23 '12 at 23:08






  • 1




    $begingroup$
    Why don't you get a vector in the end? Using Mathematica's Cross function is allowed over any number of vectors, so long as there's one more dimension than the number of vectors. Playing around with using matrices to find the cross product and using Cross, I found the result only differed by factors of -1 occasionally.
    $endgroup$
    – VF1
    Aug 24 '12 at 1:37












  • $begingroup$
    Because Mathematica implements the Hodge star, or at least something similar. Only for dimensions 3 and 7 do you have a "natural" cross product that yields a vector.
    $endgroup$
    – Emily
    Aug 24 '12 at 3:39










  • $begingroup$
    Do quaternions scale up beyond 8? Such as 16, 32, 64, 128...?
    $endgroup$
    – CoryG
    Sep 27 '16 at 20:12










  • $begingroup$
    @CoryG: You can create analogous structures with dimensions > 8, but it is shown that they are not closed normed division algebras, which means the "niceness" you get from that structure goes away.
    $endgroup$
    – Emily
    Oct 4 '16 at 14:35



















3












$begingroup$

See my answer here to see an example of a generalization of the cross product to 4 dimensions. Notice, this generalization works in $n$-dimensions and always return a vector orthogonal to all $n-1$ vectors you use. And, you calculate it almost exactly the same way you calculate the normal cross product, nothing complicated. To get the cross product of $n-1$ vectors of dimension $n$, you simply make a matrix which has top row with entries $i_1, i_2, ldots, i_n$, which generalize the normal $i, j, k$ in 3 dimensions. Then, your next $n-1$ rows are the $n-1$ vectors of dimension $n$. Now, take the determinant and you get your $n$-dimensional result.



Reference: I learned about this when I took a 4th semester of calculus in college, where we used Vector Calculus by Susan Jane Colley. It is introduced in the exercises for Section 1.6. One of the exercises is to prove that the new vector is orthogonal to the previous ones.






share|cite|improve this answer











$endgroup$





















    1












    $begingroup$

    Michael Hardy's conjecture is definitely not rubbish.



    I know of at least two definitions that apply to more than three dimensions. For both definitions, however, the resulting cross product is a vector subspace rather than a vector. (See Notes 1 and 2)



    As Mr Hardy notes, in three dimensions the conventional cross product of vectors a and b is a vector normal to a and b with length (ab)sin(Theta), where Theta is the angle between a and b. It has the property that its inner product (a x b)*c with any vector c is the volume of the parallelepiped having edges a, b and c. The vector c is uniquely defined and complements the {a, b} space(Note 3).



    In more than three dimensions, however, the normal to two vectors is not unique. For dimensions n > 3, the cross product may be defined to be the n-2 dimensional subspace normal to the two vectors. Alternately, the cross product may be defined to be the n-m dimensional subspace normal to m vectors, m>2. This later possibility is pursued here.



    Let the vectors w1, w2, w3, … , wm span an m-dimensional subspace Sm in the n-dimensional vector space V, where m = 2, 3, …, n-1. The cross product of the vectors w1, w2, w3, … , wm is then defined as cm:



            cm =  w1 x w2 x … x wm  

    = |s1||s2| … |sm| Cn-m,


    where



           sm  =   wm  -  [Sm-1]*wm     

    Sm = { s1, s2, … , sm}.


    Here Cn-m is the complementary space (Note 4)of Sm in V, defined as all vectors normal to Sm. The vector sm is normal to Sm-1 and [Sm-1]*wm is the projection(5) of wm onto Sm-1. The angle Thetam between wm and Sm-1*wm is given by Sm= |wm||sm|(Thetam), where |sm| and |wm| are the lengths of vectors sm and wm.



    If m = n-1 then Cn-m = C1, a vector normal to the other n-1 vectors. If m = n, the product |s1||s2| … |sm|is the volume of the parallelepiped having edges w1, w2, w3, … , wm. This definition agrees with the conventional one for n = 2, 3 but, unlike the conventional definition, yields a null vector if any of the w1, w2, w3, … , wm are dependent.



    In both definition, the cross product is a subspace rather than a vector. I have not yet explored the first definition or the relation of either to the Hodge star.



    NOTES:
    (1) For reference, the subspace of m (non-parallel) vectors in a larger n-dimensional space is just the collection of points that may be reached by adding any combination of m vectors with multiplicative coefficients. Any m non-parallel vectors "span" an m-dimensional subspace, m<=n.
    (2) In the above, the suffixes m and n are integers, lower case characters are vectors, and upper case characters are subspaces; the notation {x, y} indicates the space spanned by the vectors x and y; [S] indicates a set of orthonormal vectors in the space S; the symbol * indicates inner product.
    (3) in the sense that any point in V may be reached by a linear combination of a, b and c.
    (4) Halmos, Paul R., Finite Dimensional Vector Spaces, Second Edition, 1958, D. Van Nostrand Company, Inc., Princeton, N. J., p29.
    (5) P is a projection if PPx = Px for any vector x. (ibid. p73.) It can be shown that (Px)*(x – Px) = 0, so that x – Px is perpendicular to Px.






    share|cite|improve this answer









    $endgroup$














      Your Answer





      StackExchange.ifUsing("editor", function () {
      return StackExchange.using("mathjaxEditing", function () {
      StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
      StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
      });
      });
      }, "mathjax-editing");

      StackExchange.ready(function() {
      var channelOptions = {
      tags: "".split(" "),
      id: "69"
      };
      initTagRenderer("".split(" "), "".split(" "), channelOptions);

      StackExchange.using("externalEditor", function() {
      // Have to fire editor after snippets, if snippets enabled
      if (StackExchange.settings.snippets.snippetsEnabled) {
      StackExchange.using("snippets", function() {
      createEditor();
      });
      }
      else {
      createEditor();
      }
      });

      function createEditor() {
      StackExchange.prepareEditor({
      heartbeatType: 'answer',
      autoActivateHeartbeat: false,
      convertImagesToLinks: true,
      noModals: true,
      showLowRepImageUploadWarning: true,
      reputationToPostImages: 10,
      bindNavPrevention: true,
      postfix: "",
      imageUploader: {
      brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
      contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
      allowUrls: true
      },
      noCode: true, onDemand: true,
      discardSelector: ".discard-answer"
      ,immediatelyShowMarkdownHelp:true
      });


      }
      });














      draft saved

      draft discarded


















      StackExchange.ready(
      function () {
      StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f185991%2fis-the-vector-cross-product-only-defined-for-3d%23new-answer', 'question_page');
      }
      );

      Post as a guest















      Required, but never shown

























      6 Answers
      6






      active

      oldest

      votes








      6 Answers
      6






      active

      oldest

      votes









      active

      oldest

      votes






      active

      oldest

      votes









      51












      $begingroup$

      Yes, you are correct. You can generalize the cross product to $n$ dimensions by saying it is an operation which takes in $n-1$ vectors and produces a vector that is perpendicular to each one. This can be easily defined using the exterior algebra and Hodge star operator http://en.wikipedia.org/wiki/Hodge_dual: the cross product of $v_1,ldots,v_{n-1}$ is then just $*(v_1 wedge v_2 cdots wedge v_{n-1}$).



      Then the magnitude of the cross product of n-1 vectors is the volume of the higher-dimensional parallelogram that they determine. Specifying the magnitude and being orthogonal to each of the vectors narrows the possiblity to two choices-- an orientation picks out one of these.






      share|cite|improve this answer









      $endgroup$









      • 5




        $begingroup$
        One caution with this construction: as Eric somewhat notes in passing (and as is also true in three dimensions), what you get here isn't strictly a vector in many senses of the word, but a covector. In particular, the cross-product construction isn't invariant under arbitrary linear transformations; instead, it transforms by the adjoint transform of whatever linear transformation is applied to its inputs. (This is an old issue in computer graphics, where normal 'vectors' to surfaces don't transform with the points on the surface.)
        $endgroup$
        – Steven Stadnicki
        Aug 23 '12 at 20:52






      • 9




        $begingroup$
        @Steven: Eric's defining his operation in terms of the Hodge star, which gives a genuine vector (but requires a choice of inner product and then a choice of orientation).
        $endgroup$
        – Qiaochu Yuan
        Aug 23 '12 at 22:02






      • 1




        $begingroup$
        Thanks for the reply. That was what I was looking for. I was only familiar with the wedge product through Stroke's Theorem, and I have yet to find out what the "exterior algebra" is. That's why I couldn't make the connection on my own.
        $endgroup$
        – VF1
        Aug 23 '12 at 23:09












      • $begingroup$
        @QiaochuYuan: this "choice of inner product"- is it the higher dimensional analogue of what we call "handedness" in three dimensions?
        $endgroup$
        – Arkya Chatterjee
        Aug 20 '16 at 10:38






      • 5




        $begingroup$
        @Arkya: no, it's the higher dimensional analogue of knowing what the lengths of vectors is. The choice of orientation is the higher dimensional analogue of handedness.
        $endgroup$
        – Qiaochu Yuan
        Aug 22 '16 at 22:33
















      51












      $begingroup$

      Yes, you are correct. You can generalize the cross product to $n$ dimensions by saying it is an operation which takes in $n-1$ vectors and produces a vector that is perpendicular to each one. This can be easily defined using the exterior algebra and Hodge star operator http://en.wikipedia.org/wiki/Hodge_dual: the cross product of $v_1,ldots,v_{n-1}$ is then just $*(v_1 wedge v_2 cdots wedge v_{n-1}$).



      Then the magnitude of the cross product of n-1 vectors is the volume of the higher-dimensional parallelogram that they determine. Specifying the magnitude and being orthogonal to each of the vectors narrows the possiblity to two choices-- an orientation picks out one of these.






      share|cite|improve this answer









      $endgroup$









      • 5




        $begingroup$
        One caution with this construction: as Eric somewhat notes in passing (and as is also true in three dimensions), what you get here isn't strictly a vector in many senses of the word, but a covector. In particular, the cross-product construction isn't invariant under arbitrary linear transformations; instead, it transforms by the adjoint transform of whatever linear transformation is applied to its inputs. (This is an old issue in computer graphics, where normal 'vectors' to surfaces don't transform with the points on the surface.)
        $endgroup$
        – Steven Stadnicki
        Aug 23 '12 at 20:52






      • 9




        $begingroup$
        @Steven: Eric's defining his operation in terms of the Hodge star, which gives a genuine vector (but requires a choice of inner product and then a choice of orientation).
        $endgroup$
        – Qiaochu Yuan
        Aug 23 '12 at 22:02






      • 1




        $begingroup$
        Thanks for the reply. That was what I was looking for. I was only familiar with the wedge product through Stroke's Theorem, and I have yet to find out what the "exterior algebra" is. That's why I couldn't make the connection on my own.
        $endgroup$
        – VF1
        Aug 23 '12 at 23:09












      • $begingroup$
        @QiaochuYuan: this "choice of inner product"- is it the higher dimensional analogue of what we call "handedness" in three dimensions?
        $endgroup$
        – Arkya Chatterjee
        Aug 20 '16 at 10:38






      • 5




        $begingroup$
        @Arkya: no, it's the higher dimensional analogue of knowing what the lengths of vectors is. The choice of orientation is the higher dimensional analogue of handedness.
        $endgroup$
        – Qiaochu Yuan
        Aug 22 '16 at 22:33














      51












      51








      51





      $begingroup$

      Yes, you are correct. You can generalize the cross product to $n$ dimensions by saying it is an operation which takes in $n-1$ vectors and produces a vector that is perpendicular to each one. This can be easily defined using the exterior algebra and Hodge star operator http://en.wikipedia.org/wiki/Hodge_dual: the cross product of $v_1,ldots,v_{n-1}$ is then just $*(v_1 wedge v_2 cdots wedge v_{n-1}$).



      Then the magnitude of the cross product of n-1 vectors is the volume of the higher-dimensional parallelogram that they determine. Specifying the magnitude and being orthogonal to each of the vectors narrows the possiblity to two choices-- an orientation picks out one of these.






      share|cite|improve this answer









      $endgroup$



      Yes, you are correct. You can generalize the cross product to $n$ dimensions by saying it is an operation which takes in $n-1$ vectors and produces a vector that is perpendicular to each one. This can be easily defined using the exterior algebra and Hodge star operator http://en.wikipedia.org/wiki/Hodge_dual: the cross product of $v_1,ldots,v_{n-1}$ is then just $*(v_1 wedge v_2 cdots wedge v_{n-1}$).



      Then the magnitude of the cross product of n-1 vectors is the volume of the higher-dimensional parallelogram that they determine. Specifying the magnitude and being orthogonal to each of the vectors narrows the possiblity to two choices-- an orientation picks out one of these.







      share|cite|improve this answer












      share|cite|improve this answer



      share|cite|improve this answer










      answered Aug 23 '12 at 19:33









      Eric O. KormanEric O. Korman

      13.1k34264




      13.1k34264








      • 5




        $begingroup$
        One caution with this construction: as Eric somewhat notes in passing (and as is also true in three dimensions), what you get here isn't strictly a vector in many senses of the word, but a covector. In particular, the cross-product construction isn't invariant under arbitrary linear transformations; instead, it transforms by the adjoint transform of whatever linear transformation is applied to its inputs. (This is an old issue in computer graphics, where normal 'vectors' to surfaces don't transform with the points on the surface.)
        $endgroup$
        – Steven Stadnicki
        Aug 23 '12 at 20:52






      • 9




        $begingroup$
        @Steven: Eric's defining his operation in terms of the Hodge star, which gives a genuine vector (but requires a choice of inner product and then a choice of orientation).
        $endgroup$
        – Qiaochu Yuan
        Aug 23 '12 at 22:02






      • 1




        $begingroup$
        Thanks for the reply. That was what I was looking for. I was only familiar with the wedge product through Stroke's Theorem, and I have yet to find out what the "exterior algebra" is. That's why I couldn't make the connection on my own.
        $endgroup$
        – VF1
        Aug 23 '12 at 23:09












      • $begingroup$
        @QiaochuYuan: this "choice of inner product"- is it the higher dimensional analogue of what we call "handedness" in three dimensions?
        $endgroup$
        – Arkya Chatterjee
        Aug 20 '16 at 10:38






      • 5




        $begingroup$
        @Arkya: no, it's the higher dimensional analogue of knowing what the lengths of vectors is. The choice of orientation is the higher dimensional analogue of handedness.
        $endgroup$
        – Qiaochu Yuan
        Aug 22 '16 at 22:33














      • 5




        $begingroup$
        One caution with this construction: as Eric somewhat notes in passing (and as is also true in three dimensions), what you get here isn't strictly a vector in many senses of the word, but a covector. In particular, the cross-product construction isn't invariant under arbitrary linear transformations; instead, it transforms by the adjoint transform of whatever linear transformation is applied to its inputs. (This is an old issue in computer graphics, where normal 'vectors' to surfaces don't transform with the points on the surface.)
        $endgroup$
        – Steven Stadnicki
        Aug 23 '12 at 20:52






      • 9




        $begingroup$
        @Steven: Eric's defining his operation in terms of the Hodge star, which gives a genuine vector (but requires a choice of inner product and then a choice of orientation).
        $endgroup$
        – Qiaochu Yuan
        Aug 23 '12 at 22:02






      • 1




        $begingroup$
        Thanks for the reply. That was what I was looking for. I was only familiar with the wedge product through Stroke's Theorem, and I have yet to find out what the "exterior algebra" is. That's why I couldn't make the connection on my own.
        $endgroup$
        – VF1
        Aug 23 '12 at 23:09












      • $begingroup$
        @QiaochuYuan: this "choice of inner product"- is it the higher dimensional analogue of what we call "handedness" in three dimensions?
        $endgroup$
        – Arkya Chatterjee
        Aug 20 '16 at 10:38






      • 5




        $begingroup$
        @Arkya: no, it's the higher dimensional analogue of knowing what the lengths of vectors is. The choice of orientation is the higher dimensional analogue of handedness.
        $endgroup$
        – Qiaochu Yuan
        Aug 22 '16 at 22:33








      5




      5




      $begingroup$
      One caution with this construction: as Eric somewhat notes in passing (and as is also true in three dimensions), what you get here isn't strictly a vector in many senses of the word, but a covector. In particular, the cross-product construction isn't invariant under arbitrary linear transformations; instead, it transforms by the adjoint transform of whatever linear transformation is applied to its inputs. (This is an old issue in computer graphics, where normal 'vectors' to surfaces don't transform with the points on the surface.)
      $endgroup$
      – Steven Stadnicki
      Aug 23 '12 at 20:52




      $begingroup$
      One caution with this construction: as Eric somewhat notes in passing (and as is also true in three dimensions), what you get here isn't strictly a vector in many senses of the word, but a covector. In particular, the cross-product construction isn't invariant under arbitrary linear transformations; instead, it transforms by the adjoint transform of whatever linear transformation is applied to its inputs. (This is an old issue in computer graphics, where normal 'vectors' to surfaces don't transform with the points on the surface.)
      $endgroup$
      – Steven Stadnicki
      Aug 23 '12 at 20:52




      9




      9




      $begingroup$
      @Steven: Eric's defining his operation in terms of the Hodge star, which gives a genuine vector (but requires a choice of inner product and then a choice of orientation).
      $endgroup$
      – Qiaochu Yuan
      Aug 23 '12 at 22:02




      $begingroup$
      @Steven: Eric's defining his operation in terms of the Hodge star, which gives a genuine vector (but requires a choice of inner product and then a choice of orientation).
      $endgroup$
      – Qiaochu Yuan
      Aug 23 '12 at 22:02




      1




      1




      $begingroup$
      Thanks for the reply. That was what I was looking for. I was only familiar with the wedge product through Stroke's Theorem, and I have yet to find out what the "exterior algebra" is. That's why I couldn't make the connection on my own.
      $endgroup$
      – VF1
      Aug 23 '12 at 23:09






      $begingroup$
      Thanks for the reply. That was what I was looking for. I was only familiar with the wedge product through Stroke's Theorem, and I have yet to find out what the "exterior algebra" is. That's why I couldn't make the connection on my own.
      $endgroup$
      – VF1
      Aug 23 '12 at 23:09














      $begingroup$
      @QiaochuYuan: this "choice of inner product"- is it the higher dimensional analogue of what we call "handedness" in three dimensions?
      $endgroup$
      – Arkya Chatterjee
      Aug 20 '16 at 10:38




      $begingroup$
      @QiaochuYuan: this "choice of inner product"- is it the higher dimensional analogue of what we call "handedness" in three dimensions?
      $endgroup$
      – Arkya Chatterjee
      Aug 20 '16 at 10:38




      5




      5




      $begingroup$
      @Arkya: no, it's the higher dimensional analogue of knowing what the lengths of vectors is. The choice of orientation is the higher dimensional analogue of handedness.
      $endgroup$
      – Qiaochu Yuan
      Aug 22 '16 at 22:33




      $begingroup$
      @Arkya: no, it's the higher dimensional analogue of knowing what the lengths of vectors is. The choice of orientation is the higher dimensional analogue of handedness.
      $endgroup$
      – Qiaochu Yuan
      Aug 22 '16 at 22:33











      16












      $begingroup$

      The answer to this problem is sadly not very well-known. Suppose an r-ary operation on certain d-dimensional space V. Then, a r-fold d-dimensional "cross product" multilinear operation exists:



      $$ (C_1times C_2times ldotstimes C_r): V^{dr}=underbrace{V^dtimes cdots times V^d}_{r}longrightarrow V^d$$



      such as $$forall i=1,2,...,r$$ we have that



      $$ (C_1times C_2times ldotstimes C_r)cdot C_i=0$$



      $$ (C_1times C_2times ldotstimes C_r)cdot (C_1times C_2times ldotstimes C_r)=det (C_icdot C_j)$$



      Eckmann (1943) and Whitehead (1963) solved this problem in the continuous case over real euclidean spaces, while Brown and Gray (1967) solved
      the multilinear case. Moreover, the solution that I am going to provide is valid in any field with characteristic different of 2 and with $1leq rleq d$. The theorem (due to Eckmann, Whitehead, and Brown-Gray) says that the "generalized cross product" (including the 3d case) exists when:



      A) $d$ is even, $r = 1$. A cross product exists in every even dimension with one single factor. This can be thought some kind of "Wick rotation" if you are aware of this concept in every even dimensions! This cross product with a single factor is a bit non-trivial but easy to understand.



      B) $d$ is arbitrary, $r = d − 1$. A cross product exists in arbitrary dimension d and (d-1) factors. It is also said that an arbitrary (d-1)-fold cross product exists in any dimension. Just take the determinant of those (d-1) vectors with the versors $(e_1,...,e_r)$!



      C) $d = 3, 7, r = 2$. A 2-fold cross vector exists in dimension 3 and 7. Therefore, the "bilinear" cross product can only exists with two factors in 3D and 7D. The 3D cross product is well known, the 7D cross product can be found (both in coordinate and free coordinate versions) in wikipedia.



      D) $d = 8, r = 3$. A 3-fold cross product exists in eight dimensions. There, there is a non-trivial 3-fold cross in 8D, i.e., you can build a non-trivial cross product with 3 vectors in 8 dimensions. I haven't seen a coordinate expression for this but I believe someone did it (I could write a post about it, though, in my blog, in the near future).



      This happens in euclidean signature, I suppose there are some variants in pseudo-euclidean metrics (and perhaps some non-trivial subcases; I have heard about a non-trivial 3-fold cross product in 4D but I can not find a reference). Moreover, you can find a similar conclusion in the book Clifford algebras and Spinors by P. Lounesto. Geometric algebra is very useful when handling with this vector stuff since vectors are just a particular grade of a polyvector/cliffor/blade...






      share|cite|improve this answer











      $endgroup$













      • $begingroup$
        I don't understand why we have to prove that a cross product exists for any given $d > r$ - for any set of vectors with size $r$, any matrix which has a column space defined by the basis of this set of vectors is guaranteed to have a rank of at most $r$, and so a null space of $d-r > 0$. Since this null space is always nontrivial, a vector satisfying the criteria for the cross product can always be found.
        $endgroup$
        – VF1
        Aug 8 '13 at 22:42
















      16












      $begingroup$

      The answer to this problem is sadly not very well-known. Suppose an r-ary operation on certain d-dimensional space V. Then, a r-fold d-dimensional "cross product" multilinear operation exists:



      $$ (C_1times C_2times ldotstimes C_r): V^{dr}=underbrace{V^dtimes cdots times V^d}_{r}longrightarrow V^d$$



      such as $$forall i=1,2,...,r$$ we have that



      $$ (C_1times C_2times ldotstimes C_r)cdot C_i=0$$



      $$ (C_1times C_2times ldotstimes C_r)cdot (C_1times C_2times ldotstimes C_r)=det (C_icdot C_j)$$



      Eckmann (1943) and Whitehead (1963) solved this problem in the continuous case over real euclidean spaces, while Brown and Gray (1967) solved
      the multilinear case. Moreover, the solution that I am going to provide is valid in any field with characteristic different of 2 and with $1leq rleq d$. The theorem (due to Eckmann, Whitehead, and Brown-Gray) says that the "generalized cross product" (including the 3d case) exists when:



      A) $d$ is even, $r = 1$. A cross product exists in every even dimension with one single factor. This can be thought some kind of "Wick rotation" if you are aware of this concept in every even dimensions! This cross product with a single factor is a bit non-trivial but easy to understand.



      B) $d$ is arbitrary, $r = d − 1$. A cross product exists in arbitrary dimension d and (d-1) factors. It is also said that an arbitrary (d-1)-fold cross product exists in any dimension. Just take the determinant of those (d-1) vectors with the versors $(e_1,...,e_r)$!



      C) $d = 3, 7, r = 2$. A 2-fold cross vector exists in dimension 3 and 7. Therefore, the "bilinear" cross product can only exists with two factors in 3D and 7D. The 3D cross product is well known, the 7D cross product can be found (both in coordinate and free coordinate versions) in wikipedia.



      D) $d = 8, r = 3$. A 3-fold cross product exists in eight dimensions. There, there is a non-trivial 3-fold cross in 8D, i.e., you can build a non-trivial cross product with 3 vectors in 8 dimensions. I haven't seen a coordinate expression for this but I believe someone did it (I could write a post about it, though, in my blog, in the near future).



      This happens in euclidean signature, I suppose there are some variants in pseudo-euclidean metrics (and perhaps some non-trivial subcases; I have heard about a non-trivial 3-fold cross product in 4D but I can not find a reference). Moreover, you can find a similar conclusion in the book Clifford algebras and Spinors by P. Lounesto. Geometric algebra is very useful when handling with this vector stuff since vectors are just a particular grade of a polyvector/cliffor/blade...






      share|cite|improve this answer











      $endgroup$













      • $begingroup$
        I don't understand why we have to prove that a cross product exists for any given $d > r$ - for any set of vectors with size $r$, any matrix which has a column space defined by the basis of this set of vectors is guaranteed to have a rank of at most $r$, and so a null space of $d-r > 0$. Since this null space is always nontrivial, a vector satisfying the criteria for the cross product can always be found.
        $endgroup$
        – VF1
        Aug 8 '13 at 22:42














      16












      16








      16





      $begingroup$

      The answer to this problem is sadly not very well-known. Suppose an r-ary operation on certain d-dimensional space V. Then, a r-fold d-dimensional "cross product" multilinear operation exists:



      $$ (C_1times C_2times ldotstimes C_r): V^{dr}=underbrace{V^dtimes cdots times V^d}_{r}longrightarrow V^d$$



      such as $$forall i=1,2,...,r$$ we have that



      $$ (C_1times C_2times ldotstimes C_r)cdot C_i=0$$



      $$ (C_1times C_2times ldotstimes C_r)cdot (C_1times C_2times ldotstimes C_r)=det (C_icdot C_j)$$



      Eckmann (1943) and Whitehead (1963) solved this problem in the continuous case over real euclidean spaces, while Brown and Gray (1967) solved
      the multilinear case. Moreover, the solution that I am going to provide is valid in any field with characteristic different of 2 and with $1leq rleq d$. The theorem (due to Eckmann, Whitehead, and Brown-Gray) says that the "generalized cross product" (including the 3d case) exists when:



      A) $d$ is even, $r = 1$. A cross product exists in every even dimension with one single factor. This can be thought some kind of "Wick rotation" if you are aware of this concept in every even dimensions! This cross product with a single factor is a bit non-trivial but easy to understand.



      B) $d$ is arbitrary, $r = d − 1$. A cross product exists in arbitrary dimension d and (d-1) factors. It is also said that an arbitrary (d-1)-fold cross product exists in any dimension. Just take the determinant of those (d-1) vectors with the versors $(e_1,...,e_r)$!



      C) $d = 3, 7, r = 2$. A 2-fold cross vector exists in dimension 3 and 7. Therefore, the "bilinear" cross product can only exists with two factors in 3D and 7D. The 3D cross product is well known, the 7D cross product can be found (both in coordinate and free coordinate versions) in wikipedia.



      D) $d = 8, r = 3$. A 3-fold cross product exists in eight dimensions. There, there is a non-trivial 3-fold cross in 8D, i.e., you can build a non-trivial cross product with 3 vectors in 8 dimensions. I haven't seen a coordinate expression for this but I believe someone did it (I could write a post about it, though, in my blog, in the near future).



      This happens in euclidean signature, I suppose there are some variants in pseudo-euclidean metrics (and perhaps some non-trivial subcases; I have heard about a non-trivial 3-fold cross product in 4D but I can not find a reference). Moreover, you can find a similar conclusion in the book Clifford algebras and Spinors by P. Lounesto. Geometric algebra is very useful when handling with this vector stuff since vectors are just a particular grade of a polyvector/cliffor/blade...






      share|cite|improve this answer











      $endgroup$



      The answer to this problem is sadly not very well-known. Suppose an r-ary operation on certain d-dimensional space V. Then, a r-fold d-dimensional "cross product" multilinear operation exists:



      $$ (C_1times C_2times ldotstimes C_r): V^{dr}=underbrace{V^dtimes cdots times V^d}_{r}longrightarrow V^d$$



      such as $$forall i=1,2,...,r$$ we have that



      $$ (C_1times C_2times ldotstimes C_r)cdot C_i=0$$



      $$ (C_1times C_2times ldotstimes C_r)cdot (C_1times C_2times ldotstimes C_r)=det (C_icdot C_j)$$



      Eckmann (1943) and Whitehead (1963) solved this problem in the continuous case over real euclidean spaces, while Brown and Gray (1967) solved
      the multilinear case. Moreover, the solution that I am going to provide is valid in any field with characteristic different of 2 and with $1leq rleq d$. The theorem (due to Eckmann, Whitehead, and Brown-Gray) says that the "generalized cross product" (including the 3d case) exists when:



      A) $d$ is even, $r = 1$. A cross product exists in every even dimension with one single factor. This can be thought some kind of "Wick rotation" if you are aware of this concept in every even dimensions! This cross product with a single factor is a bit non-trivial but easy to understand.



      B) $d$ is arbitrary, $r = d − 1$. A cross product exists in arbitrary dimension d and (d-1) factors. It is also said that an arbitrary (d-1)-fold cross product exists in any dimension. Just take the determinant of those (d-1) vectors with the versors $(e_1,...,e_r)$!



      C) $d = 3, 7, r = 2$. A 2-fold cross vector exists in dimension 3 and 7. Therefore, the "bilinear" cross product can only exists with two factors in 3D and 7D. The 3D cross product is well known, the 7D cross product can be found (both in coordinate and free coordinate versions) in wikipedia.



      D) $d = 8, r = 3$. A 3-fold cross product exists in eight dimensions. There, there is a non-trivial 3-fold cross in 8D, i.e., you can build a non-trivial cross product with 3 vectors in 8 dimensions. I haven't seen a coordinate expression for this but I believe someone did it (I could write a post about it, though, in my blog, in the near future).



      This happens in euclidean signature, I suppose there are some variants in pseudo-euclidean metrics (and perhaps some non-trivial subcases; I have heard about a non-trivial 3-fold cross product in 4D but I can not find a reference). Moreover, you can find a similar conclusion in the book Clifford algebras and Spinors by P. Lounesto. Geometric algebra is very useful when handling with this vector stuff since vectors are just a particular grade of a polyvector/cliffor/blade...







      share|cite|improve this answer














      share|cite|improve this answer



      share|cite|improve this answer








      edited Mar 10 '14 at 1:03









      William Chang

      1,81111227




      1,81111227










      answered Aug 8 '13 at 15:47









      riemanniumriemannium

      514518




      514518












      • $begingroup$
        I don't understand why we have to prove that a cross product exists for any given $d > r$ - for any set of vectors with size $r$, any matrix which has a column space defined by the basis of this set of vectors is guaranteed to have a rank of at most $r$, and so a null space of $d-r > 0$. Since this null space is always nontrivial, a vector satisfying the criteria for the cross product can always be found.
        $endgroup$
        – VF1
        Aug 8 '13 at 22:42


















      • $begingroup$
        I don't understand why we have to prove that a cross product exists for any given $d > r$ - for any set of vectors with size $r$, any matrix which has a column space defined by the basis of this set of vectors is guaranteed to have a rank of at most $r$, and so a null space of $d-r > 0$. Since this null space is always nontrivial, a vector satisfying the criteria for the cross product can always be found.
        $endgroup$
        – VF1
        Aug 8 '13 at 22:42
















      $begingroup$
      I don't understand why we have to prove that a cross product exists for any given $d > r$ - for any set of vectors with size $r$, any matrix which has a column space defined by the basis of this set of vectors is guaranteed to have a rank of at most $r$, and so a null space of $d-r > 0$. Since this null space is always nontrivial, a vector satisfying the criteria for the cross product can always be found.
      $endgroup$
      – VF1
      Aug 8 '13 at 22:42




      $begingroup$
      I don't understand why we have to prove that a cross product exists for any given $d > r$ - for any set of vectors with size $r$, any matrix which has a column space defined by the basis of this set of vectors is guaranteed to have a rank of at most $r$, and so a null space of $d-r > 0$. Since this null space is always nontrivial, a vector satisfying the criteria for the cross product can always be found.
      $endgroup$
      – VF1
      Aug 8 '13 at 22:42











      11












      $begingroup$

      Well, it depends on what you mean by "the vector cross product." There is a generalization to $n$ dimensions which takes $n-1$ vectors as input and returns what can be thought of as a vector orthogonal to all of them. It generalizes to an operation taking $k$ vectors as input where $k le n$, but then the output is not something like a vector but something more complicated. See wedge product.



      There is a more specific generalization to $7$ dimensions coming from multiplication in the octonions in the same way that the cross product can be thought of as coming from multiplication in the quaternions.






      share|cite|improve this answer









      $endgroup$













      • $begingroup$
        The cross-product in euclidean space is not the same as the cross-product in pseudo-euclidean spaces, but they can also be defined with the aid of split-octornions and quaternions in 4D and 8D, such as we would obtain modified cross products in 3D and 7D. I wonder if we can do that in any spacetime signature (the map above). Wedge product is defined in any spacetime dimension, but it is not the same as cross-product since wedge product is associative...
        $endgroup$
        – riemannium
        Aug 10 '13 at 12:32
















      11












      $begingroup$

      Well, it depends on what you mean by "the vector cross product." There is a generalization to $n$ dimensions which takes $n-1$ vectors as input and returns what can be thought of as a vector orthogonal to all of them. It generalizes to an operation taking $k$ vectors as input where $k le n$, but then the output is not something like a vector but something more complicated. See wedge product.



      There is a more specific generalization to $7$ dimensions coming from multiplication in the octonions in the same way that the cross product can be thought of as coming from multiplication in the quaternions.






      share|cite|improve this answer









      $endgroup$













      • $begingroup$
        The cross-product in euclidean space is not the same as the cross-product in pseudo-euclidean spaces, but they can also be defined with the aid of split-octornions and quaternions in 4D and 8D, such as we would obtain modified cross products in 3D and 7D. I wonder if we can do that in any spacetime signature (the map above). Wedge product is defined in any spacetime dimension, but it is not the same as cross-product since wedge product is associative...
        $endgroup$
        – riemannium
        Aug 10 '13 at 12:32














      11












      11








      11





      $begingroup$

      Well, it depends on what you mean by "the vector cross product." There is a generalization to $n$ dimensions which takes $n-1$ vectors as input and returns what can be thought of as a vector orthogonal to all of them. It generalizes to an operation taking $k$ vectors as input where $k le n$, but then the output is not something like a vector but something more complicated. See wedge product.



      There is a more specific generalization to $7$ dimensions coming from multiplication in the octonions in the same way that the cross product can be thought of as coming from multiplication in the quaternions.






      share|cite|improve this answer









      $endgroup$



      Well, it depends on what you mean by "the vector cross product." There is a generalization to $n$ dimensions which takes $n-1$ vectors as input and returns what can be thought of as a vector orthogonal to all of them. It generalizes to an operation taking $k$ vectors as input where $k le n$, but then the output is not something like a vector but something more complicated. See wedge product.



      There is a more specific generalization to $7$ dimensions coming from multiplication in the octonions in the same way that the cross product can be thought of as coming from multiplication in the quaternions.







      share|cite|improve this answer












      share|cite|improve this answer



      share|cite|improve this answer










      answered Aug 23 '12 at 19:32









      Qiaochu YuanQiaochu Yuan

      282k32596941




      282k32596941












      • $begingroup$
        The cross-product in euclidean space is not the same as the cross-product in pseudo-euclidean spaces, but they can also be defined with the aid of split-octornions and quaternions in 4D and 8D, such as we would obtain modified cross products in 3D and 7D. I wonder if we can do that in any spacetime signature (the map above). Wedge product is defined in any spacetime dimension, but it is not the same as cross-product since wedge product is associative...
        $endgroup$
        – riemannium
        Aug 10 '13 at 12:32


















      • $begingroup$
        The cross-product in euclidean space is not the same as the cross-product in pseudo-euclidean spaces, but they can also be defined with the aid of split-octornions and quaternions in 4D and 8D, such as we would obtain modified cross products in 3D and 7D. I wonder if we can do that in any spacetime signature (the map above). Wedge product is defined in any spacetime dimension, but it is not the same as cross-product since wedge product is associative...
        $endgroup$
        – riemannium
        Aug 10 '13 at 12:32
















      $begingroup$
      The cross-product in euclidean space is not the same as the cross-product in pseudo-euclidean spaces, but they can also be defined with the aid of split-octornions and quaternions in 4D and 8D, such as we would obtain modified cross products in 3D and 7D. I wonder if we can do that in any spacetime signature (the map above). Wedge product is defined in any spacetime dimension, but it is not the same as cross-product since wedge product is associative...
      $endgroup$
      – riemannium
      Aug 10 '13 at 12:32




      $begingroup$
      The cross-product in euclidean space is not the same as the cross-product in pseudo-euclidean spaces, but they can also be defined with the aid of split-octornions and quaternions in 4D and 8D, such as we would obtain modified cross products in 3D and 7D. I wonder if we can do that in any spacetime signature (the map above). Wedge product is defined in any spacetime dimension, but it is not the same as cross-product since wedge product is associative...
      $endgroup$
      – riemannium
      Aug 10 '13 at 12:32











      9












      $begingroup$

      The cross product is very closely related to the concept of quaternions. The cross product "identities" that operate on the unit vectors $rm mathbf{hat{i}}, mathbf{hat{j}}, mathbf{hat{k}}$ are essentially similar to the identities on the quaternion units (basis elements) $i,j,k$.



      Notice that quaternions have four units: $1, i, j, k$, and the 3-D cross product works in vector spaces of dimension 4-1 = 3.



      The seven-dimensional cross product is analogous to the octonions, and has a similar definition which I do not wish to enumerate here.



      These are the only dimensions in which a "cross-product" of such a sort exists. The relation between the vector operation and multiplication of quaternions/octonions is the underlying reason why. Quaternions and Octonions compose what is known as a closed normed division algebra. And real closed division algebras can only have dimensions of 1,2,4,8.



      As @QiaochuYuan mentions, the generalization to other dimensions yields something different than a vector -- such an operation exists and can be used in a similar way, but you do not have the niceness of retrieving a vector in the end.






      share|cite|improve this answer











      $endgroup$













      • $begingroup$
        Thanks. That explains why there is only a 3D and 7D cross product, and any other pattern I saw can be explained with the wedge product and exterior algebra of the system.
        $endgroup$
        – VF1
        Aug 23 '12 at 23:08






      • 1




        $begingroup$
        Why don't you get a vector in the end? Using Mathematica's Cross function is allowed over any number of vectors, so long as there's one more dimension than the number of vectors. Playing around with using matrices to find the cross product and using Cross, I found the result only differed by factors of -1 occasionally.
        $endgroup$
        – VF1
        Aug 24 '12 at 1:37












      • $begingroup$
        Because Mathematica implements the Hodge star, or at least something similar. Only for dimensions 3 and 7 do you have a "natural" cross product that yields a vector.
        $endgroup$
        – Emily
        Aug 24 '12 at 3:39










      • $begingroup$
        Do quaternions scale up beyond 8? Such as 16, 32, 64, 128...?
        $endgroup$
        – CoryG
        Sep 27 '16 at 20:12










      • $begingroup$
        @CoryG: You can create analogous structures with dimensions > 8, but it is shown that they are not closed normed division algebras, which means the "niceness" you get from that structure goes away.
        $endgroup$
        – Emily
        Oct 4 '16 at 14:35
















      9












      $begingroup$

      The cross product is very closely related to the concept of quaternions. The cross product "identities" that operate on the unit vectors $rm mathbf{hat{i}}, mathbf{hat{j}}, mathbf{hat{k}}$ are essentially similar to the identities on the quaternion units (basis elements) $i,j,k$.



      Notice that quaternions have four units: $1, i, j, k$, and the 3-D cross product works in vector spaces of dimension 4-1 = 3.



      The seven-dimensional cross product is analogous to the octonions, and has a similar definition which I do not wish to enumerate here.



      These are the only dimensions in which a "cross-product" of such a sort exists. The relation between the vector operation and multiplication of quaternions/octonions is the underlying reason why. Quaternions and Octonions compose what is known as a closed normed division algebra. And real closed division algebras can only have dimensions of 1,2,4,8.



      As @QiaochuYuan mentions, the generalization to other dimensions yields something different than a vector -- such an operation exists and can be used in a similar way, but you do not have the niceness of retrieving a vector in the end.






      share|cite|improve this answer











      $endgroup$













      • $begingroup$
        Thanks. That explains why there is only a 3D and 7D cross product, and any other pattern I saw can be explained with the wedge product and exterior algebra of the system.
        $endgroup$
        – VF1
        Aug 23 '12 at 23:08






      • 1




        $begingroup$
        Why don't you get a vector in the end? Using Mathematica's Cross function is allowed over any number of vectors, so long as there's one more dimension than the number of vectors. Playing around with using matrices to find the cross product and using Cross, I found the result only differed by factors of -1 occasionally.
        $endgroup$
        – VF1
        Aug 24 '12 at 1:37












      • $begingroup$
        Because Mathematica implements the Hodge star, or at least something similar. Only for dimensions 3 and 7 do you have a "natural" cross product that yields a vector.
        $endgroup$
        – Emily
        Aug 24 '12 at 3:39










      • $begingroup$
        Do quaternions scale up beyond 8? Such as 16, 32, 64, 128...?
        $endgroup$
        – CoryG
        Sep 27 '16 at 20:12










      • $begingroup$
        @CoryG: You can create analogous structures with dimensions > 8, but it is shown that they are not closed normed division algebras, which means the "niceness" you get from that structure goes away.
        $endgroup$
        – Emily
        Oct 4 '16 at 14:35














      9












      9








      9





      $begingroup$

      The cross product is very closely related to the concept of quaternions. The cross product "identities" that operate on the unit vectors $rm mathbf{hat{i}}, mathbf{hat{j}}, mathbf{hat{k}}$ are essentially similar to the identities on the quaternion units (basis elements) $i,j,k$.



      Notice that quaternions have four units: $1, i, j, k$, and the 3-D cross product works in vector spaces of dimension 4-1 = 3.



      The seven-dimensional cross product is analogous to the octonions, and has a similar definition which I do not wish to enumerate here.



      These are the only dimensions in which a "cross-product" of such a sort exists. The relation between the vector operation and multiplication of quaternions/octonions is the underlying reason why. Quaternions and Octonions compose what is known as a closed normed division algebra. And real closed division algebras can only have dimensions of 1,2,4,8.



      As @QiaochuYuan mentions, the generalization to other dimensions yields something different than a vector -- such an operation exists and can be used in a similar way, but you do not have the niceness of retrieving a vector in the end.






      share|cite|improve this answer











      $endgroup$



      The cross product is very closely related to the concept of quaternions. The cross product "identities" that operate on the unit vectors $rm mathbf{hat{i}}, mathbf{hat{j}}, mathbf{hat{k}}$ are essentially similar to the identities on the quaternion units (basis elements) $i,j,k$.



      Notice that quaternions have four units: $1, i, j, k$, and the 3-D cross product works in vector spaces of dimension 4-1 = 3.



      The seven-dimensional cross product is analogous to the octonions, and has a similar definition which I do not wish to enumerate here.



      These are the only dimensions in which a "cross-product" of such a sort exists. The relation between the vector operation and multiplication of quaternions/octonions is the underlying reason why. Quaternions and Octonions compose what is known as a closed normed division algebra. And real closed division algebras can only have dimensions of 1,2,4,8.



      As @QiaochuYuan mentions, the generalization to other dimensions yields something different than a vector -- such an operation exists and can be used in a similar way, but you do not have the niceness of retrieving a vector in the end.







      share|cite|improve this answer














      share|cite|improve this answer



      share|cite|improve this answer








      edited Aug 23 '12 at 19:40

























      answered Aug 23 '12 at 19:34









      EmilyEmily

      29.6k468112




      29.6k468112












      • $begingroup$
        Thanks. That explains why there is only a 3D and 7D cross product, and any other pattern I saw can be explained with the wedge product and exterior algebra of the system.
        $endgroup$
        – VF1
        Aug 23 '12 at 23:08






      • 1




        $begingroup$
        Why don't you get a vector in the end? Using Mathematica's Cross function is allowed over any number of vectors, so long as there's one more dimension than the number of vectors. Playing around with using matrices to find the cross product and using Cross, I found the result only differed by factors of -1 occasionally.
        $endgroup$
        – VF1
        Aug 24 '12 at 1:37












      • $begingroup$
        Because Mathematica implements the Hodge star, or at least something similar. Only for dimensions 3 and 7 do you have a "natural" cross product that yields a vector.
        $endgroup$
        – Emily
        Aug 24 '12 at 3:39










      • $begingroup$
        Do quaternions scale up beyond 8? Such as 16, 32, 64, 128...?
        $endgroup$
        – CoryG
        Sep 27 '16 at 20:12










      • $begingroup$
        @CoryG: You can create analogous structures with dimensions > 8, but it is shown that they are not closed normed division algebras, which means the "niceness" you get from that structure goes away.
        $endgroup$
        – Emily
        Oct 4 '16 at 14:35


















      • $begingroup$
        Thanks. That explains why there is only a 3D and 7D cross product, and any other pattern I saw can be explained with the wedge product and exterior algebra of the system.
        $endgroup$
        – VF1
        Aug 23 '12 at 23:08






      • 1




        $begingroup$
        Why don't you get a vector in the end? Using Mathematica's Cross function is allowed over any number of vectors, so long as there's one more dimension than the number of vectors. Playing around with using matrices to find the cross product and using Cross, I found the result only differed by factors of -1 occasionally.
        $endgroup$
        – VF1
        Aug 24 '12 at 1:37












      • $begingroup$
        Because Mathematica implements the Hodge star, or at least something similar. Only for dimensions 3 and 7 do you have a "natural" cross product that yields a vector.
        $endgroup$
        – Emily
        Aug 24 '12 at 3:39










      • $begingroup$
        Do quaternions scale up beyond 8? Such as 16, 32, 64, 128...?
        $endgroup$
        – CoryG
        Sep 27 '16 at 20:12










      • $begingroup$
        @CoryG: You can create analogous structures with dimensions > 8, but it is shown that they are not closed normed division algebras, which means the "niceness" you get from that structure goes away.
        $endgroup$
        – Emily
        Oct 4 '16 at 14:35
















      $begingroup$
      Thanks. That explains why there is only a 3D and 7D cross product, and any other pattern I saw can be explained with the wedge product and exterior algebra of the system.
      $endgroup$
      – VF1
      Aug 23 '12 at 23:08




      $begingroup$
      Thanks. That explains why there is only a 3D and 7D cross product, and any other pattern I saw can be explained with the wedge product and exterior algebra of the system.
      $endgroup$
      – VF1
      Aug 23 '12 at 23:08




      1




      1




      $begingroup$
      Why don't you get a vector in the end? Using Mathematica's Cross function is allowed over any number of vectors, so long as there's one more dimension than the number of vectors. Playing around with using matrices to find the cross product and using Cross, I found the result only differed by factors of -1 occasionally.
      $endgroup$
      – VF1
      Aug 24 '12 at 1:37






      $begingroup$
      Why don't you get a vector in the end? Using Mathematica's Cross function is allowed over any number of vectors, so long as there's one more dimension than the number of vectors. Playing around with using matrices to find the cross product and using Cross, I found the result only differed by factors of -1 occasionally.
      $endgroup$
      – VF1
      Aug 24 '12 at 1:37














      $begingroup$
      Because Mathematica implements the Hodge star, or at least something similar. Only for dimensions 3 and 7 do you have a "natural" cross product that yields a vector.
      $endgroup$
      – Emily
      Aug 24 '12 at 3:39




      $begingroup$
      Because Mathematica implements the Hodge star, or at least something similar. Only for dimensions 3 and 7 do you have a "natural" cross product that yields a vector.
      $endgroup$
      – Emily
      Aug 24 '12 at 3:39












      $begingroup$
      Do quaternions scale up beyond 8? Such as 16, 32, 64, 128...?
      $endgroup$
      – CoryG
      Sep 27 '16 at 20:12




      $begingroup$
      Do quaternions scale up beyond 8? Such as 16, 32, 64, 128...?
      $endgroup$
      – CoryG
      Sep 27 '16 at 20:12












      $begingroup$
      @CoryG: You can create analogous structures with dimensions > 8, but it is shown that they are not closed normed division algebras, which means the "niceness" you get from that structure goes away.
      $endgroup$
      – Emily
      Oct 4 '16 at 14:35




      $begingroup$
      @CoryG: You can create analogous structures with dimensions > 8, but it is shown that they are not closed normed division algebras, which means the "niceness" you get from that structure goes away.
      $endgroup$
      – Emily
      Oct 4 '16 at 14:35











      3












      $begingroup$

      See my answer here to see an example of a generalization of the cross product to 4 dimensions. Notice, this generalization works in $n$-dimensions and always return a vector orthogonal to all $n-1$ vectors you use. And, you calculate it almost exactly the same way you calculate the normal cross product, nothing complicated. To get the cross product of $n-1$ vectors of dimension $n$, you simply make a matrix which has top row with entries $i_1, i_2, ldots, i_n$, which generalize the normal $i, j, k$ in 3 dimensions. Then, your next $n-1$ rows are the $n-1$ vectors of dimension $n$. Now, take the determinant and you get your $n$-dimensional result.



      Reference: I learned about this when I took a 4th semester of calculus in college, where we used Vector Calculus by Susan Jane Colley. It is introduced in the exercises for Section 1.6. One of the exercises is to prove that the new vector is orthogonal to the previous ones.






      share|cite|improve this answer











      $endgroup$


















        3












        $begingroup$

        See my answer here to see an example of a generalization of the cross product to 4 dimensions. Notice, this generalization works in $n$-dimensions and always return a vector orthogonal to all $n-1$ vectors you use. And, you calculate it almost exactly the same way you calculate the normal cross product, nothing complicated. To get the cross product of $n-1$ vectors of dimension $n$, you simply make a matrix which has top row with entries $i_1, i_2, ldots, i_n$, which generalize the normal $i, j, k$ in 3 dimensions. Then, your next $n-1$ rows are the $n-1$ vectors of dimension $n$. Now, take the determinant and you get your $n$-dimensional result.



        Reference: I learned about this when I took a 4th semester of calculus in college, where we used Vector Calculus by Susan Jane Colley. It is introduced in the exercises for Section 1.6. One of the exercises is to prove that the new vector is orthogonal to the previous ones.






        share|cite|improve this answer











        $endgroup$
















          3












          3








          3





          $begingroup$

          See my answer here to see an example of a generalization of the cross product to 4 dimensions. Notice, this generalization works in $n$-dimensions and always return a vector orthogonal to all $n-1$ vectors you use. And, you calculate it almost exactly the same way you calculate the normal cross product, nothing complicated. To get the cross product of $n-1$ vectors of dimension $n$, you simply make a matrix which has top row with entries $i_1, i_2, ldots, i_n$, which generalize the normal $i, j, k$ in 3 dimensions. Then, your next $n-1$ rows are the $n-1$ vectors of dimension $n$. Now, take the determinant and you get your $n$-dimensional result.



          Reference: I learned about this when I took a 4th semester of calculus in college, where we used Vector Calculus by Susan Jane Colley. It is introduced in the exercises for Section 1.6. One of the exercises is to prove that the new vector is orthogonal to the previous ones.






          share|cite|improve this answer











          $endgroup$



          See my answer here to see an example of a generalization of the cross product to 4 dimensions. Notice, this generalization works in $n$-dimensions and always return a vector orthogonal to all $n-1$ vectors you use. And, you calculate it almost exactly the same way you calculate the normal cross product, nothing complicated. To get the cross product of $n-1$ vectors of dimension $n$, you simply make a matrix which has top row with entries $i_1, i_2, ldots, i_n$, which generalize the normal $i, j, k$ in 3 dimensions. Then, your next $n-1$ rows are the $n-1$ vectors of dimension $n$. Now, take the determinant and you get your $n$-dimensional result.



          Reference: I learned about this when I took a 4th semester of calculus in college, where we used Vector Calculus by Susan Jane Colley. It is introduced in the exercises for Section 1.6. One of the exercises is to prove that the new vector is orthogonal to the previous ones.







          share|cite|improve this answer














          share|cite|improve this answer



          share|cite|improve this answer








          edited Apr 13 '17 at 12:21









          Community

          1




          1










          answered Aug 23 '12 at 20:55









          GraphthGraphth

          9,53623166




          9,53623166























              1












              $begingroup$

              Michael Hardy's conjecture is definitely not rubbish.



              I know of at least two definitions that apply to more than three dimensions. For both definitions, however, the resulting cross product is a vector subspace rather than a vector. (See Notes 1 and 2)



              As Mr Hardy notes, in three dimensions the conventional cross product of vectors a and b is a vector normal to a and b with length (ab)sin(Theta), where Theta is the angle between a and b. It has the property that its inner product (a x b)*c with any vector c is the volume of the parallelepiped having edges a, b and c. The vector c is uniquely defined and complements the {a, b} space(Note 3).



              In more than three dimensions, however, the normal to two vectors is not unique. For dimensions n > 3, the cross product may be defined to be the n-2 dimensional subspace normal to the two vectors. Alternately, the cross product may be defined to be the n-m dimensional subspace normal to m vectors, m>2. This later possibility is pursued here.



              Let the vectors w1, w2, w3, … , wm span an m-dimensional subspace Sm in the n-dimensional vector space V, where m = 2, 3, …, n-1. The cross product of the vectors w1, w2, w3, … , wm is then defined as cm:



                      cm =  w1 x w2 x … x wm  

              = |s1||s2| … |sm| Cn-m,


              where



                     sm  =   wm  -  [Sm-1]*wm     

              Sm = { s1, s2, … , sm}.


              Here Cn-m is the complementary space (Note 4)of Sm in V, defined as all vectors normal to Sm. The vector sm is normal to Sm-1 and [Sm-1]*wm is the projection(5) of wm onto Sm-1. The angle Thetam between wm and Sm-1*wm is given by Sm= |wm||sm|(Thetam), where |sm| and |wm| are the lengths of vectors sm and wm.



              If m = n-1 then Cn-m = C1, a vector normal to the other n-1 vectors. If m = n, the product |s1||s2| … |sm|is the volume of the parallelepiped having edges w1, w2, w3, … , wm. This definition agrees with the conventional one for n = 2, 3 but, unlike the conventional definition, yields a null vector if any of the w1, w2, w3, … , wm are dependent.



              In both definition, the cross product is a subspace rather than a vector. I have not yet explored the first definition or the relation of either to the Hodge star.



              NOTES:
              (1) For reference, the subspace of m (non-parallel) vectors in a larger n-dimensional space is just the collection of points that may be reached by adding any combination of m vectors with multiplicative coefficients. Any m non-parallel vectors "span" an m-dimensional subspace, m<=n.
              (2) In the above, the suffixes m and n are integers, lower case characters are vectors, and upper case characters are subspaces; the notation {x, y} indicates the space spanned by the vectors x and y; [S] indicates a set of orthonormal vectors in the space S; the symbol * indicates inner product.
              (3) in the sense that any point in V may be reached by a linear combination of a, b and c.
              (4) Halmos, Paul R., Finite Dimensional Vector Spaces, Second Edition, 1958, D. Van Nostrand Company, Inc., Princeton, N. J., p29.
              (5) P is a projection if PPx = Px for any vector x. (ibid. p73.) It can be shown that (Px)*(x – Px) = 0, so that x – Px is perpendicular to Px.






              share|cite|improve this answer









              $endgroup$


















                1












                $begingroup$

                Michael Hardy's conjecture is definitely not rubbish.



                I know of at least two definitions that apply to more than three dimensions. For both definitions, however, the resulting cross product is a vector subspace rather than a vector. (See Notes 1 and 2)



                As Mr Hardy notes, in three dimensions the conventional cross product of vectors a and b is a vector normal to a and b with length (ab)sin(Theta), where Theta is the angle between a and b. It has the property that its inner product (a x b)*c with any vector c is the volume of the parallelepiped having edges a, b and c. The vector c is uniquely defined and complements the {a, b} space(Note 3).



                In more than three dimensions, however, the normal to two vectors is not unique. For dimensions n > 3, the cross product may be defined to be the n-2 dimensional subspace normal to the two vectors. Alternately, the cross product may be defined to be the n-m dimensional subspace normal to m vectors, m>2. This later possibility is pursued here.



                Let the vectors w1, w2, w3, … , wm span an m-dimensional subspace Sm in the n-dimensional vector space V, where m = 2, 3, …, n-1. The cross product of the vectors w1, w2, w3, … , wm is then defined as cm:



                        cm =  w1 x w2 x … x wm  

                = |s1||s2| … |sm| Cn-m,


                where



                       sm  =   wm  -  [Sm-1]*wm     

                Sm = { s1, s2, … , sm}.


                Here Cn-m is the complementary space (Note 4)of Sm in V, defined as all vectors normal to Sm. The vector sm is normal to Sm-1 and [Sm-1]*wm is the projection(5) of wm onto Sm-1. The angle Thetam between wm and Sm-1*wm is given by Sm= |wm||sm|(Thetam), where |sm| and |wm| are the lengths of vectors sm and wm.



                If m = n-1 then Cn-m = C1, a vector normal to the other n-1 vectors. If m = n, the product |s1||s2| … |sm|is the volume of the parallelepiped having edges w1, w2, w3, … , wm. This definition agrees with the conventional one for n = 2, 3 but, unlike the conventional definition, yields a null vector if any of the w1, w2, w3, … , wm are dependent.



                In both definition, the cross product is a subspace rather than a vector. I have not yet explored the first definition or the relation of either to the Hodge star.



                NOTES:
                (1) For reference, the subspace of m (non-parallel) vectors in a larger n-dimensional space is just the collection of points that may be reached by adding any combination of m vectors with multiplicative coefficients. Any m non-parallel vectors "span" an m-dimensional subspace, m<=n.
                (2) In the above, the suffixes m and n are integers, lower case characters are vectors, and upper case characters are subspaces; the notation {x, y} indicates the space spanned by the vectors x and y; [S] indicates a set of orthonormal vectors in the space S; the symbol * indicates inner product.
                (3) in the sense that any point in V may be reached by a linear combination of a, b and c.
                (4) Halmos, Paul R., Finite Dimensional Vector Spaces, Second Edition, 1958, D. Van Nostrand Company, Inc., Princeton, N. J., p29.
                (5) P is a projection if PPx = Px for any vector x. (ibid. p73.) It can be shown that (Px)*(x – Px) = 0, so that x – Px is perpendicular to Px.






                share|cite|improve this answer









                $endgroup$
















                  1












                  1








                  1





                  $begingroup$

                  Michael Hardy's conjecture is definitely not rubbish.



                  I know of at least two definitions that apply to more than three dimensions. For both definitions, however, the resulting cross product is a vector subspace rather than a vector. (See Notes 1 and 2)



                  As Mr Hardy notes, in three dimensions the conventional cross product of vectors a and b is a vector normal to a and b with length (ab)sin(Theta), where Theta is the angle between a and b. It has the property that its inner product (a x b)*c with any vector c is the volume of the parallelepiped having edges a, b and c. The vector c is uniquely defined and complements the {a, b} space(Note 3).



                  In more than three dimensions, however, the normal to two vectors is not unique. For dimensions n > 3, the cross product may be defined to be the n-2 dimensional subspace normal to the two vectors. Alternately, the cross product may be defined to be the n-m dimensional subspace normal to m vectors, m>2. This later possibility is pursued here.



                  Let the vectors w1, w2, w3, … , wm span an m-dimensional subspace Sm in the n-dimensional vector space V, where m = 2, 3, …, n-1. The cross product of the vectors w1, w2, w3, … , wm is then defined as cm:



                          cm =  w1 x w2 x … x wm  

                  = |s1||s2| … |sm| Cn-m,


                  where



                         sm  =   wm  -  [Sm-1]*wm     

                  Sm = { s1, s2, … , sm}.


                  Here Cn-m is the complementary space (Note 4)of Sm in V, defined as all vectors normal to Sm. The vector sm is normal to Sm-1 and [Sm-1]*wm is the projection(5) of wm onto Sm-1. The angle Thetam between wm and Sm-1*wm is given by Sm= |wm||sm|(Thetam), where |sm| and |wm| are the lengths of vectors sm and wm.



                  If m = n-1 then Cn-m = C1, a vector normal to the other n-1 vectors. If m = n, the product |s1||s2| … |sm|is the volume of the parallelepiped having edges w1, w2, w3, … , wm. This definition agrees with the conventional one for n = 2, 3 but, unlike the conventional definition, yields a null vector if any of the w1, w2, w3, … , wm are dependent.



                  In both definition, the cross product is a subspace rather than a vector. I have not yet explored the first definition or the relation of either to the Hodge star.



                  NOTES:
                  (1) For reference, the subspace of m (non-parallel) vectors in a larger n-dimensional space is just the collection of points that may be reached by adding any combination of m vectors with multiplicative coefficients. Any m non-parallel vectors "span" an m-dimensional subspace, m<=n.
                  (2) In the above, the suffixes m and n are integers, lower case characters are vectors, and upper case characters are subspaces; the notation {x, y} indicates the space spanned by the vectors x and y; [S] indicates a set of orthonormal vectors in the space S; the symbol * indicates inner product.
                  (3) in the sense that any point in V may be reached by a linear combination of a, b and c.
                  (4) Halmos, Paul R., Finite Dimensional Vector Spaces, Second Edition, 1958, D. Van Nostrand Company, Inc., Princeton, N. J., p29.
                  (5) P is a projection if PPx = Px for any vector x. (ibid. p73.) It can be shown that (Px)*(x – Px) = 0, so that x – Px is perpendicular to Px.






                  share|cite|improve this answer









                  $endgroup$



                  Michael Hardy's conjecture is definitely not rubbish.



                  I know of at least two definitions that apply to more than three dimensions. For both definitions, however, the resulting cross product is a vector subspace rather than a vector. (See Notes 1 and 2)



                  As Mr Hardy notes, in three dimensions the conventional cross product of vectors a and b is a vector normal to a and b with length (ab)sin(Theta), where Theta is the angle between a and b. It has the property that its inner product (a x b)*c with any vector c is the volume of the parallelepiped having edges a, b and c. The vector c is uniquely defined and complements the {a, b} space(Note 3).



                  In more than three dimensions, however, the normal to two vectors is not unique. For dimensions n > 3, the cross product may be defined to be the n-2 dimensional subspace normal to the two vectors. Alternately, the cross product may be defined to be the n-m dimensional subspace normal to m vectors, m>2. This later possibility is pursued here.



                  Let the vectors w1, w2, w3, … , wm span an m-dimensional subspace Sm in the n-dimensional vector space V, where m = 2, 3, …, n-1. The cross product of the vectors w1, w2, w3, … , wm is then defined as cm:



                          cm =  w1 x w2 x … x wm  

                  = |s1||s2| … |sm| Cn-m,


                  where



                         sm  =   wm  -  [Sm-1]*wm     

                  Sm = { s1, s2, … , sm}.


                  Here Cn-m is the complementary space (Note 4)of Sm in V, defined as all vectors normal to Sm. The vector sm is normal to Sm-1 and [Sm-1]*wm is the projection(5) of wm onto Sm-1. The angle Thetam between wm and Sm-1*wm is given by Sm= |wm||sm|(Thetam), where |sm| and |wm| are the lengths of vectors sm and wm.



                  If m = n-1 then Cn-m = C1, a vector normal to the other n-1 vectors. If m = n, the product |s1||s2| … |sm|is the volume of the parallelepiped having edges w1, w2, w3, … , wm. This definition agrees with the conventional one for n = 2, 3 but, unlike the conventional definition, yields a null vector if any of the w1, w2, w3, … , wm are dependent.



                  In both definition, the cross product is a subspace rather than a vector. I have not yet explored the first definition or the relation of either to the Hodge star.



                  NOTES:
                  (1) For reference, the subspace of m (non-parallel) vectors in a larger n-dimensional space is just the collection of points that may be reached by adding any combination of m vectors with multiplicative coefficients. Any m non-parallel vectors "span" an m-dimensional subspace, m<=n.
                  (2) In the above, the suffixes m and n are integers, lower case characters are vectors, and upper case characters are subspaces; the notation {x, y} indicates the space spanned by the vectors x and y; [S] indicates a set of orthonormal vectors in the space S; the symbol * indicates inner product.
                  (3) in the sense that any point in V may be reached by a linear combination of a, b and c.
                  (4) Halmos, Paul R., Finite Dimensional Vector Spaces, Second Edition, 1958, D. Van Nostrand Company, Inc., Princeton, N. J., p29.
                  (5) P is a projection if PPx = Px for any vector x. (ibid. p73.) It can be shown that (Px)*(x – Px) = 0, so that x – Px is perpendicular to Px.







                  share|cite|improve this answer












                  share|cite|improve this answer



                  share|cite|improve this answer










                  answered Jul 1 '13 at 6:11









                  John F BelantoniJohn F Belantoni

                  111




                  111






























                      draft saved

                      draft discarded




















































                      Thanks for contributing an answer to Mathematics Stack Exchange!


                      • Please be sure to answer the question. Provide details and share your research!

                      But avoid



                      • Asking for help, clarification, or responding to other answers.

                      • Making statements based on opinion; back them up with references or personal experience.


                      Use MathJax to format equations. MathJax reference.


                      To learn more, see our tips on writing great answers.




                      draft saved


                      draft discarded














                      StackExchange.ready(
                      function () {
                      StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f185991%2fis-the-vector-cross-product-only-defined-for-3d%23new-answer', 'question_page');
                      }
                      );

                      Post as a guest















                      Required, but never shown





















































                      Required, but never shown














                      Required, but never shown












                      Required, but never shown







                      Required, but never shown

































                      Required, but never shown














                      Required, but never shown












                      Required, but never shown







                      Required, but never shown







                      Popular posts from this blog

                      MongoDB - Not Authorized To Execute Command

                      in spring boot 2.1 many test slices are not allowed anymore due to multiple @BootstrapWith

                      Npm cannot find a required file even through it is in the searched directory