In linear algebra, the Laplace expansion, named after Pierre-Simon Laplace, also called cofactor expansion, is an expression of the determinant of an matrix as a weighted sum of minors, which are the determinants of some submatrices of . Specifically, for every , where is the entry of the th row and th column of , and is the determinant of the submatrix obtained by removing the th row and the th column of . The term is called the cofactor of in . The Laplace expansion is often useful in proofs, as in, for example, allowing recursion on the size of matrices. It is also of didactic interest for its simplicity and as one of several ways to view and compute the determinant. For large matrices, it quickly becomes inefficient to compute when compared to Gaussian elimination. Examples Consider the matrix The determinant of this matrix can be computed by using the Laplace expansion along any one of its rows or columns. For instance, an expansion along the first row yields: Laplace expansion along the second column yields the same result: It is easy to verify that the result is correct: the matrix is singular because the sum of its first and third column is twice the second column, and hence its determinant is zero. 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 for some permutation 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 Using Cauchy's two-line notation, the explicit relation between and can be written as where is a temporary shorthand notation for a cycle . This operation decrements all indices larger than j so that every index fits in the set {1,2,...,n-1} The permutation can be derived from as follows. Define by for and . Then is expressed as Now, the operation which apply first and then apply is (Notice applying A before B is equivalent to applying inverse of A to the upper row of B in two-line notation) where is temporary shorthand notation for . the operation which applies first and then applies is above two are equal thus, where