From Wikipedia, the free encyclopedia
In algebra , the Binet–Cauchy identity, named after Jacques Philippe Marie Binet and Augustin Louis Cauchy , states that
(
∑
i
=
1
n
a
i
c
i
)
(
∑
j
=
1
n
b
j
d
j
)
=
(
∑
i
=
1
n
a
i
d
i
)
(
∑
j
=
1
n
b
j
c
j
)
+
∑
1
≤
i
<
j
≤
n
(
a
i
b
j
−
a
j
b
i
)
(
c
i
d
j
−
c
j
d
i
)
{\displaystyle {\biggl (}\sum _{i=1}^{n}a_{i}c_{i}{\biggr )}{\biggl (}\sum _{j=1}^{n}b_{j}d_{j}{\biggr )}={\biggl (}\sum _{i=1}^{n}a_{i}d_{i}{\biggr )}{\biggl (}\sum _{j=1}^{n}b_{j}c_{j}{\biggr )}+\sum _{1\leq i<j\leq n}(a_{i}b_{j}-a_{j}b_{i})(c_{i}d_{j}-c_{j}d_{i})}
for every choice of real or complex numbers (or more generally, elements of a commutative ring ).
Setting ai = ci and bi = di , it gives the Lagrange's identity , which is a stronger version of the Cauchy-Schwarz inequality for the Euclidean space
R
n
{\displaystyle \scriptstyle \mathbb {R} ^{n}}
.
The Binet–Cauchy identity and exterior algebra
When n = 3 the first and second terms on the right hand side become the squared magnitudes of dot and cross products respectively; in n dimensions these become the magnitudes of the dot and wedge products . We may write it
(
a
⋅
c
)
(
b
⋅
d
)
=
(
a
⋅
d
)
(
b
⋅
c
)
+
(
a
∧
b
)
⋅
(
c
∧
d
)
{\displaystyle (a\cdot c)(b\cdot d)=(a\cdot d)(b\cdot c)+(a\wedge b)\cdot (c\wedge d)\,}
where a , b , c , and d are vectors. It may also be written as a formula giving the dot product of two wedge products, as
(
a
∧
b
)
⋅
(
c
∧
d
)
=
(
a
⋅
c
)
(
b
⋅
d
)
−
(
a
⋅
d
)
(
b
⋅
c
)
.
{\displaystyle (a\wedge b)\cdot (c\wedge d)=(a\cdot c)(b\cdot d)-(a\cdot d)(b\cdot c).\,}
Proof
Expanding the last term,
∑
1
≤
i
<
j
≤
n
(
a
i
b
j
−
a
j
b
i
)
(
c
i
d
j
−
c
j
d
i
)
{\displaystyle \sum _{1\leq i<j\leq n}(a_{i}b_{j}-a_{j}b_{i})(c_{i}d_{j}-c_{j}d_{i})}
=
∑
1
≤
i
<
j
≤
n
(
a
i
c
i
b
j
d
j
+
a
j
c
j
b
i
d
i
)
+
∑
i
=
1
n
a
i
c
i
b
i
d
i
−
∑
1
≤
i
<
j
≤
n
(
a
i
d
i
b
j
c
j
+
a
j
d
j
b
i
c
i
)
−
∑
i
=
1
n
a
i
d
i
b
i
c
i
{\displaystyle =\sum _{1\leq i<j\leq n}(a_{i}c_{i}b_{j}d_{j}+a_{j}c_{j}b_{i}d_{i})+\sum _{i=1}^{n}a_{i}c_{i}b_{i}d_{i}-\sum _{1\leq i<j\leq n}(a_{i}d_{i}b_{j}c_{j}+a_{j}d_{j}b_{i}c_{i})-\sum _{i=1}^{n}a_{i}d_{i}b_{i}c_{i}}
where the second and fourth terms are the same and artificially added to complete the sums as follows:
=
∑
i
=
1
n
∑
j
=
1
n
a
i
c
i
b
j
d
j
−
∑
i
=
1
n
∑
j
=
1
n
a
i
d
i
b
j
c
j
.
{\displaystyle =\sum _{i=1}^{n}\sum _{j=1}^{n}a_{i}c_{i}b_{j}d_{j}-\sum _{i=1}^{n}\sum _{j=1}^{n}a_{i}d_{i}b_{j}c_{j}.}
This completes the proof after factoring out the terms indexed by i . (q. e. d.)