Binet–Cauchy identity

From testwiki
Jump to navigation Jump to search

Template:Short description In algebra, the Binet–Cauchy identity, named after Jacques Philippe Marie Binet and Augustin-Louis Cauchy, states that[1] (∑i=1naici)(∑j=1nbjdj)=(∑i=1naidi)(∑j=1nbjcj)+∑1≤i<j≤n(aibj−ajbi)(cidj−cjdi) for every choice of real or complex numbers (or more generally, elements of a commutative ring). Setting Template:Math and Template:Math, it gives Lagrange's identity, which is a stronger version of the Cauchy–Schwarz inequality for the Euclidean space ℝn. The Binet-Cauchy identity is a special case of the Cauchy–Binet formula for matrix determinants.

The Binet–Cauchy identity and exterior algebra

When Template:Math, the first and second terms on the right hand side become the squared magnitudes of dot and cross products respectively; in Template:Math 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) where Template:Math, Template:Math, Template:Math, and Template:Math 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), which can be written as (a×b)⋅(c×d)=(a⋅c)(b⋅d)−(a⋅d)(b⋅c) in the Template:Math case.

In the special case Template:Math and Template:Math, the formula yields |a∧b|2=|a|2|b|2−|a⋅b|2.

When both Template:Math and Template:Math are unit vectors, we obtain the usual relation sin2ϕ=1−cos2ϕ where Template:Math is the angle between the vectors.

This is a special case of the Inner product on the exterior algebra of a vector space, which is defined on wedge-decomposable elements as the Gram determinant of their components.

Einstein notation

A relationship between the Levi–Cevita symbols and the generalized Kronecker delta is 1k!ελ1⋯λkμk+1⋯μnελ1⋯λkνk+1⋯νn=δνk+1⋯νnμk+1⋯μn.

The (a∧b)⋅(c∧d)=(a⋅c)(b⋅d)−(a⋅d)(b⋅c) form of the Binet–Cauchy identity can be written as 1(n−2)!(εμ1⋯μn−2αβaαbβ)(εμ1⋯μn−2γδcγdδ)=δγδαβaαbβcγdδ.

Proof

Expanding the last term, ∑1≤i<j≤n(aibj−ajbi)(cidj−cjdi)=∑1≤i<j≤n(aicibjdj+ajcjbidi)+∑i=1naicibidi−∑1≤i<j≤n(aidibjcj+ajdjbici)−∑i=1naidibici where the second and fourth terms are the same and artificially added to complete the sums as follows: =∑i=1n∑j=1naicibjdj−∑i=1n∑j=1naidibjcj.

This completes the proof after factoring out the terms indexed by i.

Generalization

A general form, also known as the Cauchy–Binet formula, states the following: Suppose A is an m×n matrix and B is an n×m matrix. If S is a subset of {1, ..., n} with m elements, we write AS for the m×m matrix whose columns are those columns of A that have indices from S. Similarly, we write BS for the m×m matrix whose rows are those rows of B that have indices from S. Then the determinant of the matrix product of A and B satisfies the identity det⁡(AB)=∑S⊂{1,…,n}|S|=mdet⁡(AS)det⁡(BS), where the sum extends over all possible subsets S of {1, ..., n} with m elements.

We get the original identity as special case by setting A=(a1…anb1…bn),B=(c1d1⋮⋮cndn).

Notes

References