The Wedge product is the multiplication operation in exterior algebra . The wedge product is always antisymmetric , associative , and anti-commutative . The result of the wedge product is known as a bivector ; in
R
3
{\displaystyle \mathbb R^{3}}
(that is, three dimensions ) it is a 2-form . For two vectors u and v in
R
3
{\displaystyle \mathbb R^{3}}
, the wedge product is defined as
u
∧
v
=
u
⊗
v
−
v
⊗
u
=
[
0
u
1
v
2
−
u
2
v
1
u
1
v
3
−
u
3
v
1
u
2
v
1
−
u
1
v
2
0
u
2
v
3
−
u
3
v
2
u
3
v
1
−
u
1
v
3
u
3
v
2
−
u
2
v
3
0
]
{\displaystyle \mathbf {u} \land \mathbf {v} =\mathbf {u} \otimes \mathbf {v} -\mathbf {v} \otimes \mathbf {u} ={\begin{bmatrix}0&u_{1}v_{2}-u_{2}v_{1}&u_{1}v_{3}-u_{3}v_{1}\\u_{2}v_{1}-u_{1}v_{2}&0&u_{2}v_{3}-u_{3}v_{2}\\u_{3}v_{1}-u_{1}v_{3}&u_{3}v_{2}-u_{2}v_{3}&0\end{bmatrix}}}
where ⊗ denotes the outer product . Note that the bivector has only three indepedent elements; as such, it can be associated with another vector in
R
3
{\displaystyle \mathbb R^{3}}
. If the associated vector is defined as
n
=
[
(
u
∧
v
)
23
−
(
u
∧
v
)
13
(
u
∧
v
)
32
]
=
u
×
v
{\displaystyle \mathbf {n} ={\begin{bmatrix}(\mathbf {u} \land \mathbf {v} )_{23}\\-(\mathbf {u} \land \mathbf {v} )_{13}\\(\mathbf {u} \land \mathbf {v} )_{32}\end{bmatrix}}=\mathbf {u} \times \mathbf {v} }
it is the same as the cross product of u and v . In this sense, the cross product is a special case of the exterior product which is in turn a special case of the commutator product (See below).
Cross product and wedge product when written as determinants are calculated in the same way:
a
×
b
=
|
e
1
e
2
e
3
a
1
a
2
a
3
b
1
b
2
b
3
|
,
a
∧
b
=
|
e
23
e
31
e
12
a
1
a
2
a
3
b
1
b
2
b
3
|
{\displaystyle \mathbf {a} \times \mathbf {b} ={\begin{vmatrix}\mathbf {e} _{1}&\mathbf {e} _{2}&\mathbf {e} _{3}\\a_{1}&a_{2}&a_{3}\\b_{1}&b_{2}&b_{3}\end{vmatrix}}\ ,\quad \mathbf {a} \land \mathbf {b} ={\begin{vmatrix}\mathbf {e} _{23}&\mathbf {e} _{31}&\mathbf {e} _{12}\\a_{1}&a_{2}&a_{3}\\b_{1}&b_{2}&b_{3}\end{vmatrix}}}
so are related by the Hodge dual :
∗
(
a
∧
b
)
=
a
×
b
,
∗
(
a
×
b
)
=
a
∧
b
{\displaystyle *(\mathbf {a} \land \mathbf {b} )=\mathbf {a\times b} \ ,\quad *(\mathbf {a\times b} )=\mathbf {a} \land \mathbf {b} }
A unit vector and a unit bivector are shown in red
Bivectors are skew-symmetric matrices which are the type of matrices used to calculate the cross product. Bivectors are not rotation matrices but an infinitesimal bivector (plus the identity matrix) can be used to perform an infinitesimal rotation .
n
{\displaystyle \mathbf{n}}
would therefore be the axis of rotation. See Rotation matrix#Determining the axis .
Properties [ ]
(
a
∧
b
)
∧
c
=
a
∧
(
b
∧
c
)
(
a
+
b
)
∧
(
c
+
d
)
=
(
a
∧
c
)
+
(
a
∧
d
)
+
(
b
∧
c
)
+
(
b
∧
d
)
u
∧
v
=
−
v
∧
u
u
∧
u
=
0
{\displaystyle {\begin{aligned}&(\mathbf {a} \land \mathbf {b} )\land \mathbf {c} =\mathbf {a} \land (\mathbf {b} \land \mathbf {c} )\\&(\mathbf {a} +\mathbf {b} )\land (\mathbf {c} +\mathbf {d} )=(\mathbf {a} \land \mathbf {c} )+(\mathbf {a} \land \mathbf {d} )+(\mathbf {b} \land \mathbf {c} )+(\mathbf {b} \land \mathbf {d} )\\&\mathbf {u} \land \mathbf {v} =-\mathbf {v} \land \mathbf {u} \\&\mathbf {u} \land \mathbf {u} =0\end{aligned}}}
Wedge product is distributive [ ]
The formula for the wedge product is:
u
∧
v
=
(
u
1
e
1
+
u
2
e
2
+
u
3
e
3
)
∧
(
v
1
e
1
+
v
2
e
2
+
v
3
e
3
)
{\displaystyle \mathbf {u} \land \mathbf {v} =(u_{1}\mathbf {e_{1}} +u_{2}\mathbf {e_{2}} +u_{3}\mathbf {e_{3}} )\land (v_{1}\mathbf {e_{1}} +v_{2}\mathbf {e_{2}} +v_{3}\mathbf {e_{3}} )}
Using the distributive property this can be written out in full as:
u
∧
v
=
u
1
e
1
∧
v
1
e
1
+
u
1
e
1
∧
v
2
e
2
+
u
1
e
1
∧
v
3
e
3
+
u
2
e
2
∧
v
1
e
1
+
u
2
e
2
∧
v
2
e
2
+
u
2
e
2
∧
v
3
e
3
+
u
3
e
3
∧
v
1
e
1
+
u
3
e
3
∧
v
2
e
2
+
u
3
e
3
∧
v
3
e
3
u
1
e
1
∧
v
2
e
2
=
[
0
u
1
v
2
0
−
u
1
v
2
0
0
0
0
0
]
u
1
e
1
∧
v
3
e
3
=
[
0
0
u
1
v
3
0
0
0
−
u
1
v
3
0
0
]
u
2
e
2
∧
v
3
e
3
=
[
0
0
0
0
0
u
2
v
3
0
−
u
2
v
3
0
]
{\displaystyle {\begin{aligned}\mathbf {u} \land \mathbf {v} &\ =\ u_{1}\mathbf {e_{1}} \land v_{1}\mathbf {e_{1}} \ +\ u_{1}\mathbf {e_{1}} \land v_{2}\mathbf {e_{2}} \ +\ u_{1}\mathbf {e_{1}} \land v_{3}\mathbf {e_{3}} \\&\ +\ u_{2}\mathbf {e_{2}} \land v_{1}\mathbf {e_{1}} \ +\ u_{2}\mathbf {e_{2}} \land v_{2}\mathbf {e_{2}} \ +\ u_{2}\mathbf {e_{2}} \land v_{3}\mathbf {e_{3}} \\&\ +\ u_{3}\mathbf {e_{3}} \land v_{1}\mathbf {e_{1}} \ +\ u_{3}\mathbf {e_{3}} \land v_{2}\mathbf {e_{2}} \ +\ u_{3}\mathbf {e_{3}} \land v_{3}\mathbf {e_{3}} \\\\u_{1}\mathbf {e_{1}} \land v_{2}\mathbf {e_{2}} &={\begin{bmatrix}0&u_{1}v_{2}&0\\-u_{1}v_{2}&0&0\\0&0&0\end{bmatrix}}\\u_{1}\mathbf {e_{1}} \land v_{3}\mathbf {e_{3}} &={\begin{bmatrix}0&0&u_{1}v_{3}\\0&0&0\\-u_{1}v_{3}&0&0\end{bmatrix}}\\u_{2}\mathbf {e_{2}} \land v_{3}\mathbf {e_{3}} &={\begin{bmatrix}0&0&0\\0&0&u_{2}v_{3}\\0&-u_{2}v_{3}&0\end{bmatrix}}\end{aligned}}}
Rotating from v to u is the negative of rotating from u to v:
u
2
e
2
∧
v
1
e
1
=
−
(
v
1
e
1
∧
u
2
e
2
)
=
[
0
−
v
1
u
2
0
v
1
u
2
0
0
0
0
0
]
u
3
e
3
∧
v
1
e
1
=
−
(
v
1
e
1
∧
u
3
e
3
)
=
[
0
0
−
v
1
u
3
0
0
0
v
1
u
3
0
0
]
u
3
e
3
∧
v
2
e
2
=
−
(
v
2
e
2
∧
u
3
e
3
)
=
[
0
0
0
0
0
−
v
2
u
3
0
v
2
u
3
0
]
{\displaystyle {\begin{aligned}u_{2}\mathbf {e_{2}} \land v_{1}\mathbf {e_{1}} &=-(v_{1}\mathbf {e_{1}} \land u_{2}\mathbf {e_{2}} )={\begin{bmatrix}0&-v_{1}u_{2}&0\\v_{1}u_{2}&0&0\\0&0&0\end{bmatrix}}\\u_{3}\mathbf {e_{3}} \land v_{1}\mathbf {e_{1}} &=-(v_{1}\mathbf {e_{1}} \land u_{3}\mathbf {e_{3}} )={\begin{bmatrix}0&0&-v_{1}u_{3}\\0&0&0\\v_{1}u_{3}&0&0\end{bmatrix}}\\u_{3}\mathbf {e_{3}} \land v_{2}\mathbf {e_{2}} &=-(v_{2}\mathbf {e_{2}} \land u_{3}\mathbf {e_{3}} )={\begin{bmatrix}0&0&0\\0&0&-v_{2}u_{3}\\0&v_{2}u_{3}&0\end{bmatrix}}\end{aligned}}}
Each of these is equivalent to two tensor multiplications:
u
1
e
1
∧
v
2
e
2
=
u
1
e
1
⊗
v
2
e
2
−
v
2
e
2
⊗
u
1
e
1
=
[
0
u
1
v
2
0
0
0
0
0
0
0
]
−
[
0
0
0
v
2
u
1
0
0
0
0
0
]
{\displaystyle {\begin{aligned}u_{1}\mathbf {e_{1}} \land v_{2}\mathbf {e_{2}} &=u_{1}\mathbf {e_{1}} \otimes v_{2}\mathbf {e_{2}} -v_{2}\mathbf {e_{2}} \otimes u_{1}\mathbf {e_{1}} \\\\&={\begin{bmatrix}0&u_{1}v_{2}&0\\0&0&0\\0&0&0\end{bmatrix}}-{\begin{bmatrix}0&0&0\\v_{2}u_{1}&0&0\\0&0&0\end{bmatrix}}\end{aligned}}}
Cross product [ ]
The vector cross product also can be expressed as the product of a skew-symmetric matrix and a vector:[1]
a
×
b
=
a
¯
b
{\displaystyle \mathbf {a} \times \mathbf {b} ={\bar {\mathbf {a} }}\mathbf {b} }
where
a
¯
{\displaystyle {\bar {\mathbf {a} }}}
is the dual of
a
{\displaystyle \mathbf{a}}
:
a
¯
=
d
e
f
[
0
−
a
3
a
2
a
3
0
−
a
1
−
a
2
a
1
0
]
{\displaystyle {\bar {\mathbf {a} }}{\stackrel {\rm {def}}{=}}{\begin{bmatrix}0&-a_{3}&a_{2}\\a_{3}&0&-a_{1}\\-a_{2}&a_{1}&0\end{bmatrix}}}
One actually has
a
×
b
¯
=
a
¯
b
¯
−
b
¯
a
¯
=
[
a
¯
,
b
¯
]
{\displaystyle {\overline {\mathbf {a\times b} }}={\bar {\mathbf {a} }}{\bar {\mathbf {b} }}-{\bar {\mathbf {b} }}{\bar {\mathbf {a} }}=[{\bar {\mathbf {a} }},{\bar {\mathbf {b} }}]}
i.e., the commutator of skew-symmetric three-by-three matrices can be identified with the cross-product of three-vectors.
[
a
¯
,
b
¯
]
=
a
¯
b
¯
−
b
¯
a
¯
=
[
0
a
2
b
1
−
b
2
a
1
a
3
b
1
−
b
3
a
1
a
1
b
2
−
b
1
a
2
0
a
3
b
2
−
b
3
a
2
a
1
b
3
−
b
1
a
3
a
2
b
3
−
b
2
a
3
0
]
=
b
∧
a
{\displaystyle [{\bar {\mathbf {a} }},{\bar {\mathbf {b} }}]={\bar {\mathbf {a} }}{\bar {\mathbf {b} }}-{\bar {\mathbf {b} }}{\bar {\mathbf {a} }}={\begin{bmatrix}0&a_{2}b_{1}-b_{2}a_{1}&a_{3}b_{1}-b_{3}a_{1}\\a_{1}b_{2}-b_{1}a_{2}&0&a_{3}b_{2}-b_{3}a_{2}\\a_{1}b_{3}-b_{1}a_{3}&a_{2}b_{3}-b_{2}a_{3}&0\end{bmatrix}}=\mathbf {b} \land \mathbf {a} }
This result can be generalized to higher dimensions using geometric algebra . In particular in any dimension bivectors can be identified with skew-symmetric matrices, so the product between a skew-symmetric matrix and vector is equivalent to the grade-1 part of the product of a bivector and vector.[2] In three dimensions bivectors are dual to vectors so the product is equivalent to the cross product. In higher dimensions the product can still be calculated but bivectors have more degrees of freedom and are not equivalent to vectors.[2]
e
1
¯
=
e
3
∧
e
2
=
[
0
0
0
0
0
−
1
0
1
0
]
e
2
¯
=
e
1
∧
e
3
=
[
0
0
1
0
0
0
−
1
0
0
]
e
3
¯
=
e
2
∧
e
1
=
[
0
−
1
0
1
0
0
0
0
0
]
{\displaystyle {\begin{aligned}&{\overline {\mathbf {e_{1}} }}=\mathbf {e_{3}} \land \mathbf {e_{2}} ={\begin{bmatrix}0&0&0\\0&0&-1\\0&1&0\end{bmatrix}}\\&{\overline {\mathbf {e_{2}} }}=\mathbf {e_{1}} \land \mathbf {e_{3}} ={\begin{bmatrix}0&0&1\\0&0&0\\-1&0&0\end{bmatrix}}\\&{\overline {\mathbf {e_{3}} }}=\mathbf {e_{2}} \land \mathbf {e_{1}} ={\begin{bmatrix}0&-1&0\\1&0&0\\0&0&0\end{bmatrix}}\end{aligned}}}
References [ ]
See also [ ]