# Cramer's rule

(Redirected from Cramer's Rule)

In linear algebraCramer's rule is an explicit formula for the solution of a system of linear equations with as many equations as unknowns, valid whenever the system has a unique solution. It expresses the solution in terms of the determinants of the (square) coefficient matrix and of matrices obtained from it by replacing one column by the column vector of right-hand-sides of the equations. It is named after Gabriel Cramer (1704–1752), who published the rule for an arbitrary number of unknowns in 1750,[1][2] although Colin Maclaurinalso published special cases of the rule in 1748[3] (and possibly knew of it as early as 1729).[4][5][6]

Cramer's rule implemented in a naïve way is computationally inefficient for systems of more than two or three equations.[7] In the case of n equations in n unknowns, it requires computation of n + 1 determinants, while Gaussian elimination produces the result with the same computational complexity as the computation of a single determinant.[8][9][verification needed] Cramer's rule can also be numerically unstable even for 2×2 systems.[10] However, it has recently been shown that Cramer's rule can be implemented in O(n3) time,[11] which is comparable to more common methods of solving systems of linear equations, such as Gaussian elimination (consistently requiring 2.5 times as many arithmetic operations for all matrix sizes), while exhibiting comparable numeric stability in most cases.

## General case

Consider a system of n linear equations for n unknowns, represented in matrix multiplication form as follows:

${displaystyle Ax=b}$

where the n × n matrix A has a nonzero determinant, and the vector ${displaystyle x=(x_{1},ldots ,x_{n})^{mathrm {T} }}$ 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:

${displaystyle x_{i}={frac {det(A_{i})}{det(A)}}qquad i=1,ldots ,n}$

where ${displaystyle A_{i}}$ is the matrix formed by replacing the i-th column of A by the column vector b.

A more general version of Cramer's rule[12] considers the matrix equation

${displaystyle AX=B}$

where the n × n matrix A has a nonzero determinant, and XB are n × m matrices. Given sequences ${displaystyle 1leq i_{1} and ${displaystyle 1leq j_{1}, let ${displaystyle X_{I,J}}$be the k × k submatrix of X with rows in ${displaystyle I:=(i_{1},ldots ,i_{k})}$ and columns in ${displaystyle J:=(j_{1},ldots ,j_{k})}$. Let ${displaystyle A_{B}(I,J)}$ be the n × n matrix formed by replacing the ${displaystyle i_{s}}$ column of A by the ${displaystyle j_{s}}$column of B, for all ${displaystyle s=1,ldots ,k}$. Then

${displaystyle det X_{I,J}={frac {det(A_{B}(I,J))}{det(A)}}.}$

In the case ${displaystyle k=1}$, this reduces to the normal Cramer's rule.

The rule holds for systems of equations with coefficients and unknowns in any field, not just in the real numbers.

## Proof

The proof for Cramer's rule 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 (which is implied by the basic property that the sign of the determinant flips if you switch two 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 Rn → R (assuming matrix entries are in R) can be given by a matrix, with one row and n columns, that acts on column j. In fact this is precisely what Laplace expansion does, writing det(A) = C1a1,j + ... + Cnan,j for certain coefficients C1, ..., Cn 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 one-line matrix L(j) = (C1 C2 ... Cn) 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, so the resulting determinant is 0 (the case of two equal columns).

Now consider a system of n linear equations in n unknowns ${displaystyle x_{1},ldots ,x_{n}}$, whose coefficient matrix is A, with det(A) assumed to be nonzero:

${displaystyle {egin{matrix}a_{11}x_{1}+a_{12}x_{2}+cdots +a_{1n}x_{n}&=&b_{1}\a_{21}x_{1}+a_{22}x_{2}+cdots +a_{2n}x_{n}&=&b_{2}\vdots &vdots &vdots \a_{n1}x_{1}+a_{n2}x_{2}+cdots +a_{nn}x_{n}&=&b_{n}.end{matrix}}}$

If one combines these equations by taking C1 times the first equation, plus C2 times the second, and so forth until Cn times the last, then the coefficient of xj will become C1a1, j + ... + Cnan,j = det(A), while the coefficients of all other unknowns become 0; the left hand side becomes simply det(A)xj. The right hand side is C1b1 + ... + Cnbn, which is L(j) applied to the column vector b of the right hand side bi. In fact what has been done here is multiply the matrix equation Ax = b on the left by L(j). Dividing by the nonzero number det(A) one finds the following equation, necessary to satisfy the system:

${displaystyle x_{j}={frac {L_{(j)}cdot mathbf {b} }{det(A)}}.}$

But by construction the numerator is the determinant of the matrix obtained from A by replacing column j by b, so we get the expression of Cramer's rule as a 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, do indeed together form a solution. But if the matrix A is invertible with inverse A−1, then x = A−1b will be a solution, thus showing its existence. To see that A is invertible when det(A) is nonzero, consider the n × n matrix M obtained by stacking the one-line matrices L(j) on top of each other for j = 1, ..., 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 MA = det(A)In. Therefore,

${displaystyle {frac {1}{det(A)}}M=A^{-1},}$

completing the proof.

For other proofs, see below.

## Finding inverse matrix

Let A be an n × n matrix. Then

${displaystyle A,operatorname {adj} A=(operatorname {adj} A),A=operatorname {det} (A)I}$

where adj(A) denotes the adjugate matrix of Adet(A) is the determinant, and I is the identity matrix. If det(A) is invertible in R, then the inverse matrix of A is

${displaystyle A^{-1}={frac {1}{operatorname {det} (A)}}operatorname {adj} (A).}$

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

${displaystyle left{{egin{matrix}a_{1}x+b_{1}y&={color {red}c_{1}}\a_{2}x+b_{2}y&={color {red}c_{2}}end{matrix}} ight.}$

which in matrix format is

${displaystyle {egin{bmatrix}a_{1}&b_{1}\a_{2}&b_{2}end{bmatrix}}{egin{bmatrix}x\yend{bmatrix}}={egin{bmatrix}{color {red}c_{1}}\{color {red}c_{2}}end{bmatrix}}.}$

Assume a1b2 − b1a2 nonzero. Then, with help of determinantsx and y can be found with Cramer's rule as

{displaystyle {egin{aligned}x&={frac {egin{vmatrix}{color {red}{c_{1}}}&b_{1}\{color {red}{c_{2}}}&b_{2}end{vmatrix}}{egin{vmatrix}a_{1}&b_{1}\a_{2}&b_{2}end{vmatrix}}}={{color {red}c_{1}}b_{2}-b_{1}{color {red}c_{2}} over a_{1}b_{2}-b_{1}a_{2}},quad y={frac {egin{vmatrix}a_{1}&{color {red}{c_{1}}}\a_{2}&{color {red}{c_{2}}}end{vmatrix}}{egin{vmatrix}a_{1}&b_{1}\a_{2}&b_{2}end{vmatrix}}}={a_{1}{color {red}c_{2}}-{color {red}c_{1}}a_{2} over a_{1}b_{2}-b_{1}a_{2}}end{aligned}}.}

The rules for 3 × 3 matrices are similar. Given

${displaystyle left{{egin{matrix}a_{1}x+b_{1}y+c_{1}z&={color {red}d_{1}}\a_{2}x+b_{2}y+c_{2}z&={color {red}d_{2}}\a_{3}x+b_{3}y+c_{3}z&={color {red}d_{3}}end{matrix}} ight.}$

which in matrix format is

${displaystyle {egin{bmatrix}a_{1}&b_{1}&c_{1}\a_{2}&b_{2}&c_{2}\a_{3}&b_{3}&c_{3}end{bmatrix}}{egin{bmatrix}x\y\zend{bmatrix}}={egin{bmatrix}{color {red}d_{1}}\{color {red}d_{2}}\{color {red}d_{3}}end{bmatrix}}.}$

Then the values of x, y and z can be found as follows:

${displaystyle x={frac {egin{vmatrix}{color {red}d_{1}}&b_{1}&c_{1}\{color {red}d_{2}}&b_{2}&c_{2}\{color {red}d_{3}}&b_{3}&c_{3}end{vmatrix}}{egin{vmatrix}a_{1}&b_{1}&c_{1}\a_{2}&b_{2}&c_{2}\a_{3}&b_{3}&c_{3}end{vmatrix}}},quad y={frac {egin{vmatrix}a_{1}&{color {red}d_{1}}&c_{1}\a_{2}&{color {red}d_{2}}&c_{2}\a_{3}&{color {red}d_{3}}&c_{3}end{vmatrix}}{egin{vmatrix}a_{1}&b_{1}&c_{1}\a_{2}&b_{2}&c_{2}\a_{3}&b_{3}&c_{3}end{vmatrix}}},{ ext{ and }}z={frac {egin{vmatrix}a_{1}&b_{1}&{color {red}d_{1}}\a_{2}&b_{2}&{color {red}d_{2}}\a_{3}&b_{3}&{color {red}d_{3}}end{vmatrix}}{egin{vmatrix}a_{1}&b_{1}&c_{1}\a_{2}&b_{2}&c_{2}\a_{3}&b_{3}&c_{3}end{vmatrix}}}.}$

### Differential geometry

#### Ricci calculus

Cramer's rule is used in the Ricci calculus in various calculations involving the Christoffel symbols of the first and second kind.[13]

In particular, Cramer's rule can be used to prove that the divergence operator on a Riemannian manifold is invariant with respect to change of coordinates. We give a direct proof, suppressing the role of the Christoffel symbols. Let ${displaystyle (M,g)}$ be a Riemannian manifold equipped with local coordinates ${displaystyle (x^{1},x^{2},dots ,x^{n})}$. Let ${displaystyle A=A^{i}{frac {partial }{partial x^{i}}}}$ be a vector field. We use the summation convention throughout.

Theorem.
The divergence of ${displaystyle A}$,
${displaystyle operatorname {div} A={frac {1}{sqrt {det g}}}{frac {partial }{partial x^{i}}}left(A^{i}{sqrt {det g}} ight),}$
is invariant under change of coordinates.
show
Proof

#### Computing derivatives implicitly

Consider the two equations ${displaystyle F(x,y,u,v)=0}$ and ${displaystyle G(x,y,u,v)=0}$. When u and v are independent variables, we can define ${displaystyle x=X(u,v)}$ and ${displaystyle y=Y(u,v).}$

Finding an equation for ${displaystyle {dfrac {partial x}{partial u}}}$ is a trivial application of Cramer's rule.

show
Calculation of ${displaystyle {dfrac {partial x}{partial u}}}$

### Integer programming

Cramer's rule can be used to prove that an integer programming problem whose constraint matrix is totally unimodular and whose right-hand 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

Geometric interpretation of Cramer's rule. The areas of the second and third shaded parallelograms are the same and the second is ${displaystyle x_{1}}$times the first. From this equality Cramer's rule follows.

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

${displaystyle {egin{matrix}a_{11}x_{1}+a_{12}x_{2}&=b_{1}\a_{21}x_{1}+a_{22}x_{2}&=b_{2}end{matrix}}}$

it can be considered as an equation between vectors

${displaystyle x_{1}{inom {a_{11}}{a_{21}}}+x_{2}{inom {a_{12}}{a_{22}}}={inom {b_{1}}{b_{2}}}.}$

The area of the parallelogram determined by ${displaystyle {inom {a_{11}}{a_{21}}}}$ and ${displaystyle {inom {a_{12}}{a_{22}}}}$ is given by the determinant of the system of equations:

${displaystyle {egin{vmatrix}a_{11}&a_{12}\a_{21}&a_{22}end{vmatrix}}.}$

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 n-th dimensional Euclidean space.

Therefore, the area of the parallelogram determined by ${displaystyle x_{1}{inom {a_{11}}{a_{21}}}}$ and ${displaystyle {inom {a_{12}}{a_{22}}}}$ has to be ${displaystyle 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 ${displaystyle {inom {b_{1}}{b_{2}}}=x_{1}{inom {a_{11}}{a_{21}}}+x_{2}{inom {a_{12}}{a_{22}}}}$ and ${displaystyle {inom {a_{12}}{a_{22}}}.}$

Equating the areas of this last and the second parallelogram gives the equation

${displaystyle {egin{vmatrix}b_{1}&a_{12}\b_{2}&a_{22}end{vmatrix}}={egin{vmatrix}a_{11}x_{1}&a_{12}\a_{21}x_{1}&a_{22}end{vmatrix}}=x_{1}{egin{vmatrix}a_{11}&a_{12}\a_{21}&a_{22}end{vmatrix}}}$

from which Cramer's rule follows.

## Other proofs

### A proof by abstract linear algebra

This is a restatement of the proof above in abstract language.

Consider the map ${displaystyle {vec {x}}=(x_{1},ldots ,x_{n})mapsto {frac {1}{det A}}(det(A_{1}),ldots ,det(A_{n})),}$ where ${displaystyle A_{i}}$ is the matrix ${displaystyle A}$ with ${displaystyle {vec {x}}}$substituted in the ${displaystyle i}$th column, as in Cramer's rule. Because of linearity of determinant in every column, this map is linear. Observe that it sends the ${displaystyle i}$th column of ${displaystyle A}$ to the ${displaystyle i}$th basis vector ${displaystyle {vec {e}}_{i}=(0,ldots ,1,ldots ,0)}$ (with 1 in the ${displaystyle i}$th place), because determinant of a matrix with a repeated column is 0. So we have a linear map which agrees with the inverse of ${displaystyle A}$ on the column space; hence it agrees with ${displaystyle A^{-1}}$ on the span of the column space. Since ${displaystyle A}$ is invertible, the column vectors span all of ${displaystyle mathbb {R} ^{n}}$, so our map really is the inverse of ${displaystyle A}$. Cramer's rule follows.

### A short proof

A short proof of Cramer's rule [14] can be given by noticing that ${displaystyle x_{1}}$ is the determinant of the matrix

${displaystyle X_{1}={egin{bmatrix}x_{1}&0&0&dots &0\x_{2}&1&0&dots &0\x_{3}&0&1&dots &0\vdots &vdots &vdots &ddots &vdots \x_{n}&0&0&dots &1end{bmatrix}}}$

On the other hand, assuming that our original matrix A is invertible, this matrix ${displaystyle X_{1}}$ has columns ${displaystyle A^{-1}b,A^{-1}v_{2},ldots ,A^{-1}v_{n}}$, where ${displaystyle v_{n}}$ is the n-th column of the matrix A. Recall that the matrix ${displaystyle A_{1}}$ has columns ${displaystyle b,v_{2},ldots ,v_{n}}$. Hence we have

${displaystyle x_{1}=det(X_{1})=det(A^{-1})det(A_{1})={frac {det(A_{1})}{det(A)}}.}$

The proof for other ${displaystyle x_{j}}$ is similar.

### Proof using Clifford algebra

Consider the system of three scalar equations in three unknown scalars ${displaystyle x_{1},x_{2},x_{3}}$

{displaystyle {egin{aligned}a_{11}x_{1}+a_{12}x_{2}+a_{13}x_{3}&=c_{1}\a_{21}x_{1}+a_{22}x_{2}+a_{23}x_{3}&=c_{2}\a_{31}x_{1}+a_{32}x_{2}+a_{33}x_{3}&=c_{3}end{aligned}}}

and assign an orthonormal vector basis ${displaystyle mathbf {e} _{1},mathbf {e} _{2},mathbf {e} _{3}}$ for ${displaystyle {mathcal {G}}_{3}}$ as

{displaystyle {egin{aligned}a_{11}mathbf {e} _{1}x_{1}+a_{12}mathbf {e} _{1}x_{2}+a_{13}mathbf {e} _{1}x_{3}&=c_{1}mathbf {e} _{1}\a_{21}mathbf {e} _{2}x_{1}+a_{22}mathbf {e} _{2}x_{2}+a_{23}mathbf {e} _{2}x_{3}&=c_{2}mathbf {e} _{2}\a_{31}mathbf {e} _{3}x_{1}+a_{32}mathbf {e} _{3}x_{2}+a_{33}mathbf {e} _{3}x_{3}&=c_{3}mathbf {e} _{3}end{aligned}}}

Let the vectors

{displaystyle {egin{aligned}mathbf {a} _{1}&=a_{11}mathbf {e} _{1}+a_{21}mathbf {e} _{2}+a_{31}mathbf {e} _{3}\mathbf {a} _{2}&=a_{12}mathbf {e} _{1}+a_{22}mathbf {e} _{2}+a_{32}mathbf {e} _{3}\mathbf {a} _{3}&=a_{13}mathbf {e} _{1}+a_{23}mathbf {e} _{2}+a_{33}mathbf {e} _{3}end{aligned}}}

Adding the system of equations, it is seen that

{displaystyle {egin{aligned}mathbf {c} &=c_{1}mathbf {e} _{1}+c_{2}mathbf {e} _{2}+c_{3}mathbf {e} _{3}\&=x_{1}mathbf {a} _{1}+x_{2}mathbf {a} _{2}+x_{3}mathbf {a} _{3}end{aligned}}}

Using the exterior product, each unknown scalar ${displaystyle x_{k}}$ can be solved as

{displaystyle {egin{aligned}mathbf {c} wedge mathbf {a} _{2}wedge mathbf {a} _{3}&=x_{1}mathbf {a} _{1}wedge mathbf {a} _{2}wedge mathbf {a} _{3}\mathbf {c} wedge mathbf {a} _{1}wedge mathbf {a} _{3}&=x_{2}mathbf {a} _{2}wedge mathbf {a} _{1}wedge mathbf {a} _{3}\mathbf {c} wedge mathbf {a} _{1}wedge mathbf {a} _{2}&=x_{3}mathbf {a} _{3}wedge mathbf {a} _{1}wedge mathbf {a} _{2}\x_{1}&={frac {mathbf {c} wedge mathbf {a} _{2}wedge mathbf {a} _{3}}{mathbf {a} _{1}wedge mathbf {a} _{2}wedge mathbf {a} _{3}}}\x_{2}&={frac {mathbf {c} wedge mathbf {a} _{1}wedge mathbf {a} _{3}}{mathbf {a} _{2}wedge mathbf {a} _{1}wedge mathbf {a} _{3}}}={frac {mathbf {a} _{1}wedge mathbf {c} wedge mathbf {a} _{3}}{mathbf {a} _{1}wedge mathbf {a} _{2}wedge mathbf {a} _{3}}}\x_{3}&={frac {mathbf {c} wedge mathbf {a} _{1}wedge mathbf {a} _{2}}{mathbf {a} _{3}wedge mathbf {a} _{1}wedge mathbf {a} _{2}}}={frac {mathbf {a} _{1}wedge mathbf {a} _{2}wedge mathbf {c} }{mathbf {a} _{1}wedge mathbf {a} _{2}wedge mathbf {a} _{3}}}end{aligned}}}

For n equations in n unknowns, the solution for the k-th unknown ${displaystyle x_{k}}$ generalizes to

{displaystyle {egin{aligned}x_{k}&={frac {mathbf {a} _{1}wedge cdots wedge (mathbf {c} )_{k}wedge cdots wedge mathbf {a} _{n}}{mathbf {a} _{1}wedge cdots wedge mathbf {a} _{k}wedge cdots wedge mathbf {a} _{n}}}\&=(mathbf {a} _{1}wedge cdots wedge (mathbf {c} )_{k}wedge cdots wedge mathbf {a} _{n})(mathbf {a} _{1}wedge cdots wedge mathbf {a} _{k}wedge cdots wedge mathbf {a} _{n})^{-1}\&={frac {(mathbf {a} _{1}wedge cdots wedge (mathbf {c} )_{k}wedge cdots wedge mathbf {a} _{n})(mathbf {a} _{1}wedge cdots wedge mathbf {a} _{k}wedge cdots wedge mathbf {a} _{n})}{(mathbf {a} _{1}wedge cdots wedge mathbf {a} _{k}wedge cdots wedge mathbf {a} _{n})(mathbf {a} _{1}wedge cdots wedge mathbf {a} _{k}wedge cdots wedge mathbf {a} _{n})}}\&={frac {(mathbf {a} _{1}wedge cdots wedge (mathbf {c} )_{k}wedge cdots wedge mathbf {a} _{n})cdot (mathbf {a} _{1}wedge cdots wedge mathbf {a} _{k}wedge cdots wedge mathbf {a} _{n})}{(-1)^{frac {n(n-1)}{2}}(mathbf {a} _{n}wedge cdots wedge mathbf {a} _{k}wedge cdots wedge mathbf {a} _{1})cdot (mathbf {a} _{1}wedge cdots wedge mathbf {a} _{k}wedge cdots wedge mathbf {a} _{n})}}\&={frac {(mathbf {a} _{n}wedge cdots wedge (mathbf {c} )_{k}wedge cdots wedge mathbf {a} _{1})cdot (mathbf {a} _{1}wedge cdots wedge mathbf {a} _{k}wedge cdots wedge mathbf {a} _{n})}{(mathbf {a} _{n}wedge cdots wedge mathbf {a} _{k}wedge cdots wedge mathbf {a} _{1})cdot (mathbf {a} _{1}wedge cdots wedge mathbf {a} _{k}wedge cdots wedge mathbf {a} _{n})}}end{aligned}}}

If ak are linearly independent, then the ${displaystyle x_{k}}$ can be expressed in determinant form identical to Cramer’s Rule as

{displaystyle {egin{aligned}x_{k}&={frac {(mathbf {a} _{n}wedge cdots wedge (mathbf {c} )_{k}wedge cdots wedge mathbf {a} _{1})cdot (mathbf {a} _{1}wedge cdots wedge mathbf {a} _{k}wedge cdots wedge mathbf {a} _{n})}{(mathbf {a} _{n}wedge cdots wedge mathbf {a} _{k}wedge cdots wedge mathbf {a} _{1})cdot (mathbf {a} _{1}wedge cdots wedge mathbf {a} _{k}wedge cdots wedge mathbf {a} _{n})}}\[8pt]&={egin{vmatrix}mathbf {a} _{1}cdot mathbf {a} _{1}&cdots &mathbf {a} _{1}cdot (mathbf {c} )_{k}&cdots &mathbf {a} _{1}cdot mathbf {a} _{n}\vdots &ddots &vdots &ddots &vdots \mathbf {a} _{k}cdot mathbf {a} _{1}&cdots &mathbf {a} _{k}cdot (mathbf {c} )_{k}&cdots &mathbf {a} _{k}cdot mathbf {a} _{n}\vdots &ddots &vdots &ddots &vdots \mathbf {a} _{n}cdot mathbf {a} _{1}&cdots &mathbf {a} _{n}cdot (mathbf {c} )_{k}&cdots &mathbf {a} _{n}cdot mathbf {a} _{n}end{vmatrix}}{egin{vmatrix}mathbf {a} _{1}cdot mathbf {a} _{1}&cdots &mathbf {a} _{1}cdot mathbf {a} _{k}&cdots &mathbf {a} _{1}cdot mathbf {a} _{n}\vdots &ddots &vdots &ddots &vdots \mathbf {a} _{k}cdot mathbf {a} _{1}&cdots &mathbf {a} _{k}cdot mathbf {a} _{k}&cdots &mathbf {a} _{k}cdot mathbf {a} _{n}\vdots &ddots &vdots &ddots &vdots \mathbf {a} _{n}cdot mathbf {a} _{1}&cdots &mathbf {a} _{n}cdot mathbf {a} _{k}&cdots &mathbf {a} _{n}cdot mathbf {a} _{n}end{vmatrix}}^{-1}\[8pt]&={egin{vmatrix}mathbf {a} _{1}\vdots \mathbf {a} _{k}\vdots \mathbf {a} _{n}end{vmatrix}}{egin{vmatrix}mathbf {a} _{1}&cdots &(mathbf {c} )_{k}&cdots &mathbf {a} _{n}end{vmatrix}}{egin{vmatrix}mathbf {a} _{1}\vdots \mathbf {a} _{k}\vdots \mathbf {a} _{n}end{vmatrix}}^{-1}{egin{vmatrix}mathbf {a} _{1}&cdots &mathbf {a} _{k}&cdots &mathbf {a} _{n}end{vmatrix}}^{-1}\[8pt]&={egin{vmatrix}mathbf {a} _{1}&cdots &(mathbf {c} )_{k}&cdots &mathbf {a} _{n}end{vmatrix}}{egin{vmatrix}mathbf {a} _{1}&cdots &mathbf {a} _{k}&cdots &mathbf {a} _{n}end{vmatrix}}^{-1}\[8pt]&={egin{vmatrix}a_{11}&ldots &c_{1}&cdots &a_{1n}\vdots &ddots &vdots &ddots &vdots \a_{k1}&cdots &c_{k}&cdots &a_{kn}\vdots &ddots &vdots &ddots &vdots \a_{n1}&cdots &c_{n}&cdots &a_{nn}end{vmatrix}}{egin{vmatrix}a_{11}&ldots &a_{1k}&cdots &a_{1n}\vdots end{vmatrix}}^{-1}end{aligned}}}

where (c)k denotes the substitution of vector ak with vector c in the k-th numerator position.

## Incompatible and indeterminate cases

A system of equations is said to be incompatible or inconsistent 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 2×2 case, if the coefficient determinant is zero, then the system is incompatible if the numerator determinants are nonzero, or indeterminate if the numerator determinants are zero.

For 3×3 or higher systems, the only thing one can say when the coefficient determinant equals zero is that if any of the numerator determinants are nonzero, then the system must be incompatible. However, having all determinants zero does not imply that the system is indeterminate. A simple example where all determinants vanish (equal zero) but the system is still incompatible is the 3×3 system x+y+z=1, x+y+z=2, x+y+z=3.

## References

1. ^ Cramer, Gabriel (1750). "Introduction à l'Analyse des lignes Courbes algébriques" (in French). Geneva: Europeana. pp. 656–659. Retrieved 2012-05-18.
2. ^ Kosinski, A. A. (2001). "Cramer's Rule is due to Cramer". Mathematics Magazine74: 310–312. doi:10.2307/2691101.
3. ^ MacLaurin, Colin (1748). A Treatise of Algebra, in Three Parts.
4. ^ Boyer, Carl B. (1968). A History of Mathematics (2nd ed.). Wiley. p. 431.
5. ^ Katz, Victor (2004). A History of Mathematics (Brief ed.). Pearson Education. pp. 378–379.
6. ^ Hedman, Bruce A. (1999). "An Earlier Date for "Cramer's Rule"" (PDF)Historia Mathematica26 (4): 365–368. doi:10.1006/hmat.1999.2247.
7. ^ David Poole (2014). Linear Algebra: A Modern Introduction. Cengage Learning. p. 276. ISBN 978-1-285-98283-0.
8. ^ Joe D. Hoffman; Steven Frankel (2001). Numerical Methods for Engineers and Scientists, Second Edition,. CRC Press. p. 30. ISBN 978-0-8247-0443-8.
9. ^ Thomas S. Shores (2007). Applied Linear Algebra and Matrix Analysis. Springer Science & Business Media. p. 132. ISBN 978-0-387-48947-6.
10. ^ Nicholas J. Higham (2002). Accuracy and Stability of Numerical Algorithms: Second Edition. SIAM. p. 13. ISBN 978-0-89871-521-7.
11. ^ Ken Habgood; Itamar Arel (2012). "A condensation-based application of Cramerʼs rule for solving large-scale linear systems" (PDF)Journal of Discrete Algorithms10: 98–109. doi:10.1016/j.jda.2011.06.007.
12. ^ Zhiming Gong; M. Aldeen; L. Elsner (2002). "A note on a generalized Cramer's rule". Linear Algebra and its Applications340: 253–254. doi:10.1016/S0024-3795(01)00469-4.
13. ^ Levi-Civita, Tullio (1926). The Absolute Differential Calculus (Calculus of Tensors). Dover. pp. 111–112. ISBN 9780486634012.
14. ^ Robinson, Stephen M. (1970). "A Short Proof of Cramer's Rule". Mathematics Magazine43: 94–95.

## قسم الرياضيات

### التوقيت والتقويم



_time.start(["thetimenow"]);





### توقيت الصلاة بمدينة حوطة سدير





### محرك بحث جوجل





### للتواصل

1. الهاتف : 0164044771

تحويلة: 4771

(QR Code)

mailto:mm.mousa@mu.edu.sa

### إعلانات

1- الاختبار الفصلى الثانى لمقرر التحليل العددى (يوم الاحد الموافق 3 / 7/ 1440 هـ)

2- الاختبار الفصلى الثانى لمقررحساب المتجهات (يوم الثلاثاء الموافق 5 / 7 / 1440 هـ)

الأثنين: 10 - 12

الثلاثاء: 8 - 10

الأربعاء: 8 - 10

### آلة حاسبة





### إحصائية الموقع

عدد الصفحات: 258

البحوث والمحاضرات: 155

الزيارات: 72520