Laplace Expansion - Proof

Proof

Suppose is an n × n matrix and For clarity we also label the entries of that compose its minor matrix as

for

Consider the terms in the expansion of that have as a factor. Each has the form

\sgn \tau\,b_{1,\tau(1)} \cdots b_{i,j} \cdots b_{n,\tau(n)} = \sgn \tau\,b_{ij} a_{1,\sigma(1)} \cdots a_{n-1,\sigma(n-1)}

for some permutation τ ∈ Sn with, and a unique and evidently related permutation which selects the same minor entries as Similarly each choice of determines a corresponding i.e. the correspondence is a bijection between and The permutation can be derived from as follows.

Define by for and . Then and

Since the two cycles can be written respectively as and transpositions,

And since the map is bijective,

= \sum_{\sigma \in S_{n-1}} (-1)^{i+j}\sgn\sigma\, b_{ij} a_{1,\sigma(1)} \cdots a_{n-1,\sigma(n-1)}

from which the result follows.

Read more about this topic:  Laplace Expansion

Famous quotes containing the word proof:

    “Right and proof are two crutches for everything bent and crooked that limps along.”
    —Franz Grillparzer (1791–1872)

    “When children feel good about themselves, it’s like a snowball rolling downhill. They are continually able to recognize and integrate new proof of their value as they grow and mature.”
    —Stephanie Martson (20th century)

    “There are some persons in this world, who, unable to give better proof of being wise, take a strange delight in showing what they think they have sagaciously read in mankind by uncharitable suspicions of them.”
    —Herman Melville (1819–1891)