 Cramer's rule

In linear algebra, Cramer's rule is a theorem, which gives an expression for the solution of a system of linear equations with as many equations as unknowns, valid in those cases where there is a unique solution. The solution is expressed in terms of the determinants of the (square) coefficient matrix and of matrices obtained from it by replacing one column by the vector of right hand sides of the equations. It is named after Gabriel Cramer (1704–1752), who published the rule in his 1750 Introduction à l'analyse des lignes courbes algébriques (Introduction to the analysis of algebraic curves), although Colin Maclaurin also published the method in his 1748 Treatise of Algebra (and probably knew of the method as early as 1729).^{[1]}^{[2]}
Contents
General case
Consider a system of n linear equations for n unknowns, represented in matrix multiplication form as follows:
where the n by n matrix A is has a nonzero determinant, and the vector is the column vector of the variables.
Then the theorem states that in this case the system has a unique solution, whose individual values for the unknowns are given by:
where A_{i} is the matrix formed by replacing the ith column of A by the column vector b.
The rule holds for systems of equations with coefficients and unknowns in any field, not just in the real numbers. It has recently been shown that Cramer's rule can be implemented in O(n^{3}) time,^{[3]} which is comparable to more common methods of solving systems of linear equations, such as Gaussian elimination.
Proof
The proof for Cramer's rule is very simple; in fact, it uses just two properties of determinants: linearity with respect to any given column (taking for that column a linear combination of column vectors produces as determinant the corresponding linear combination of their determinants), and the fact that the determinant is zero whenever two columns are equal (the determinant is alternating in the columns).
Fix the index j of a column. Linearity means that if we consider only column j as variable (fixing the others arbitrarily), the resulting function R^{n} → R (assuming matrix entries are in R) can be given by a matrix, with one row and n columns. In fact this is precisely what Laplace expansion does, writing det(A) = C_{1}a_{1,j} + … + C_{n}a_{n,j} for certain coefficients C_{1},…,C_{n} that depend on the columns of A other than column j (the precise expression for these cofactors is not important here). The value det(A) is then the result of applying the oneline matrix L_{(j)} = (C_{1} C_{2} … C_{n}) to column j of A. If L_{(j)} is applied to any other column k of A, then the result is the determinant of the matrix obtained from A by replacing column j by a copy of column k, which is 0 (the case of two equal columns).
Now consider a system of n linear equations in n unknowns , whose coefficient matrix is A, with det(A) assumed to be nonzero:
If one combines these equations by taking C_{1} times the first equation, plus C_{2} times the second, and so forth until C_{n} times the last, then the coefficient of x_{j} will become C_{1}a_{1,j} + … + C_{n}a_{n,j} = det(A), while the coefficients of all other unknowns become 0; the left hand side becomes simply det(A)x_{j}. The right hand side is C_{1}b_{1} + … + C_{n}b_{n}, which is L_{(j)} applied to the column vector b of the right hand sides b_{i}. In fact what has been done here is multiply the matrix equation A ⋅ x = b on the left by L_{(j)}. Dividing by the nonzero number det(A) one finds the following equation, necessary to satisfy the system:
But by construction the numerator is determinant of the matrix obtained from A by replacing column j by b, so we get the expression of Cramers rule as necessary condition for a solution. The same procedure can be repeated for other values of j to find values for the other unknowns.
The only point that remains to prove is that these values for the unknowns, the only possible ones, to indeed together form a solution. But if the matrix A is invertible with inverse A^{−1}, then x = A^{−1} ⋅ b will be a solution, thus showing its existence. To see that A is invertible when det(A) is nonzero, consider the n by n matrix M obtained by stacking the oneline matrices L_{(j)} on top of each other for j = 1, 2, …, n (this gives the adjugate matrix for A). It was shown that L_{(j)} ⋅ A = (0 … 0 det(A) 0 … 0) where det(A) appears at the position j; from this it follows that M ⋅ A = det(A)I_{n}. Therefore
completing the proof.
Finding inverse matrix
Main article: Invertible matrix#Methods of matrix inversionLet A be an n×n matrix. Then
where Adj(A) denotes the adjugate matrix of A, det(A) is the determinant, and I is the identity matrix. If det(A) is invertible in R, then the inverse matrix of A is
If R is a field (such as the field of real numbers), then this gives a formula for the inverse of A, provided det(A) ≠ 0. In fact, this formula will work whenever R is a commutative ring, provided that det(A) is a unit. If det(A) is not a unit, then A is not invertible.
Applications
Explicit formulas for small systems
Consider the linear system which in matrix format is Then, x and y can be found with Cramer's rule as
 and
The rules for 3×3 are similar. Given which in matrix format is
 the values of x, y and z can be found as follows:
Differential geometry
Cramer's rule is also extremely useful for solving problems in differential geometry. Consider the two equations and . When u and v are independent variables, we can define and
Finding an equation for is a trivial application of Cramer's rule.
First, calculate the first derivatives of F, G, x, and y:
Substituting dx, dy into dF and dG, we have:
Since u, v are both independent, the coefficients of du, dv must be zero. So we can write out equations for the coefficients:
Now, by Cramer's rule, we see that:
This is now a formula in terms of two Jacobians:
Similar formulae can be derived for , ,
Integer programming
Cramer's rule can be used to prove that an integer programming problem whose constraint matrix is totally unimodular and whose righthand side is integer, has integer basic solutions. This makes the integer program substantially easier to solve.
Ordinary differential equations
Cramer's rule is used to derive the general solution to an inhomogeneous linear differential equation by the method of variation of parameters.
Geometric interpretation
Cramer's rule has a geometric interpretation that can be considered also a proof or simply giving insight about its geometric nature. These geometric arguments work in general and not only in the case of two equations with two unknowns presented here.
Given the system of equations
it can be considered as an equation between vectors
The area of the parallelogram determined by and is given by the determinant of the system of equations:
In general, when there are more variables and equations, the determinant of n vectors of length n will give the volume of the parallelepiped determined by those vectors in the nth dimensional Euclidean space.
Therefore the area of the parallelogram determined by and has to be x_{1} times the area of the first one since one of the sides has been multiplied by this factor. Now, this last parallelogram, by Cavalieri's principle, has the same area as the parallelogram determined by and .
Equating the areas of this last and the second parallelogram gives the equation
from which Cramer's rule follows.
Incompatible and indeterminate cases
A system of equations is said to be incompatible when there are no solutions and it is called indeterminate when there is more than one solution. For linear equations, an indeterminate system will have infinitely many solutions (if it is over an infinite field), since the solutions can be expressed in terms of one or more parameters that can take arbitrary values.
Cramer's rule applies to the case where the coefficient determinant is nonzero. In the contrary case the system is either incompatible or indeterminate, based on the values of the determinants only for 2x2 systems.
For 3x3 or higher systems, the only thing one can say when the coefficient determinant equals zero is: if any of the "numerator" determinants are nonzero, then the system must be incompatible. However, the converse is false: having all determinants zero does not imply that the system is indeterminate. A simple example where all determinants vanish but the system is still incompatible is the 3x3 system x+y+z=1, x+y+z=2, x+y+z=3.
See also
Notes
 ^ Carl B. Boyer, A History of Mathematics, 2nd edition (Wiley, 1968), p. 431.
 ^ Victor Katz, A History of Mathematics, Brief edition (Pearson Education, 2004), pp. 378–379.
 ^ Ken Habgood, Itamar Arel, A condensationbased application of Cramerʼs rule for solving largescale linear systems, Journal of Discrete Algorithms, ISSN 15708667, 10.1016/j.jda.2011.06.007.
External links
Categories: Linear algebra
 Theorems in algebra
 Determinants
Wikimedia Foundation. 2010.