Scribd
Upload
9 views6 pages

Understanding Cramer's Rule in Linear Algebra

Cramer’s Rule provides a method for solving systems of linear equations using determinants. It states that if the determinant of the coefficient matrix is non-zero, the system has a unique solution, which can be calculated using specific formulas. Additionally, a system of homogeneous equations has a non-trivial solution if and only if the determinant is zero.

Uploaded by

bekirliaysu2008
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
9 views6 pages

Understanding Cramer's Rule in Linear Algebra

Cramer’s Rule provides a method for solving systems of linear equations using determinants. It states that if the determinant of the coefficient matrix is non-zero, the system has a unique solution, which can be calculated using specific formulas. Additionally, a system of homogeneous equations has a non-trivial solution if and only if the determinant is zero.

Uploaded by

bekirliaysu2008
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

Cramer’s rule

The system of equations with coefficients from the


field 𝑃 , consisting of an unknown number of
equations, is in the form:
𝑎11 𝑥1 + 𝑎12 𝑥2 + … + 𝑎1𝑛𝑛 𝑥𝑛 = 𝑏1
𝑎21 𝑥1 + 𝑎22 𝑥2 + … + 𝑎2𝑛𝑛 𝑥𝑛 = 𝑏2
− − − − − − − − − − − − − − −
𝑎𝑛1 𝑥1 + 𝑎𝑛2 𝑥2 + … + 𝑎𝑛𝑛 𝑥𝑛 = 𝑏𝑛
(1)

Here, if we accept the signs


𝑥1
𝑎11 𝑎12 𝑎13 … … 𝑎1𝑛𝑛 𝑥2
𝑎21 𝑎22 𝑎23 … … .𝑎 𝑎2𝑛𝑛 .
𝐴= ;𝑋
𝑋= ,𝐵
𝐵
… … … … … … … … …. .
𝑎𝑛1 𝑎𝑛2 𝑎𝑛3 … .𝑎
𝑎 𝑛𝑛 .
𝑥𝑛
𝑏1
𝑏2
.
=
.
.
𝑏𝑛
We can replace the system (1) with the matrix
equation

𝐴𝑋 = 𝐵 (2)

Proposition: If the system (1) is a consistent system,


then the system (1) and the matrix equation (2) are
equivalent.
Let us assume that the matrix A in equation (2) is
non-singular, that is, 𝐴 ≠ 0 . Then it is known that
𝐴 − 1 exists. Multiplying each side of (2) by 𝐴 − 1 on
the left, we get:

𝐴 − 1 (𝐴𝑋) = 𝐴 − 1 𝐵

Or

𝑋 = 𝐴 − 1𝐵

Therefore, to solve equation (2), it is enough to find


𝐴 − 1.
We know:
𝐴−1 = 𝐴 − 1𝐴 ∗

So we get:
𝑂=(𝐴 − 1𝐴 ∗ )∙𝐴
𝑏1
𝐴11 𝐴21 … … … 𝐴𝑛1 𝑏 2
1 .
= 𝐴12 𝐴22 … … … 𝐴𝑛2
𝐴 .
𝐴1𝑛𝑛 𝐴2𝑛𝑛 … … … 𝐴𝑛𝑛
.
𝑏𝑛
𝑏1 𝐴11 + 𝑏2 𝐴21 + … + 𝑏𝑛 𝐴𝑛1
1
= 𝑏1 𝐴12 + 𝑏2 𝐴22 + … + 𝑏𝑛 𝐴𝑛2
𝐴
𝑏1 𝐴1𝑛𝑛 + 𝑏2 𝐴2𝑛𝑛 + … + 𝑏𝑛 𝐴𝑛𝑛
This means that,
𝑥1
𝑥2
.
.
.
𝑥𝑛
1
(𝑏
𝑏1 𝐴11 + 𝑏2 𝐴21 + … + 𝑏𝑛 𝐴𝑛1 )
𝐴
1
= 𝑏1 𝐴12 + 𝑏2 𝐴22 + … + 𝑏𝑛 𝐴𝑛2
𝐴
1
(𝑏
𝑏1 𝐴1𝑛𝑛 + 𝑏2 𝐴2𝑛𝑛 + … + 𝑏𝑛 𝐴𝑛𝑛 )
𝐴

Here, from the equality of matrices, we obtain:

1
𝑥1 = 𝐴
(𝑏
𝑏1 𝐴11 + 𝑏2 𝐴21 + … + 𝑏𝑛 𝐴𝑛1 ),
1
𝑥2 = 𝐴
𝑏1 𝐴12 + 𝑏2 𝐴22 + … + 𝑏𝑛 𝐴𝑛2 ,
..………………………………………. (3)
1
𝑥𝑛 = (𝑏
𝑏1 𝐴1𝑛𝑛 + 𝑏2 𝐴2𝑛𝑛 + … + 𝑏𝑛 𝐴𝑛𝑛 )
𝐴

𝑏1 𝐴1𝑖𝑖 + 𝑏2 𝐴2𝑖𝑖 + … + 𝑏𝑛 𝐴𝑛𝑖 = △ 𝑖 = 𝐴(𝑖𝑖)


we can write equation (3) as:
△1
𝑥1 =
𝐴
△2
𝑥2 =
𝐴
-------------- (4)
△𝑛
𝑥𝑛 =
𝐴

Or

𝐴(1)
𝑥1 =
𝐴
𝐴(2)
𝑥2 =
𝐴
--------------
𝐴(𝑛 𝑛)
𝑥𝑛 =
𝐴

Here, 𝐴(𝑖𝑖) denotes the determinant of the matrix


obtained by replacing the 𝑖 − 𝑡ℎ column of matrix 𝐴
with the column of free terms. Thus, we have:
Theorem (Cramer’s Rule) 1: If the determinant of the
coefficient matrix formed from an 𝑛 -equation 𝑛 -unkn
own linear system is non-zero, then the system has a
unique solution, and that solution can be found using
formulas (3) or formulas (4).

It should be noted that formulas (3) or columns (4)


are referred to as Cramer’s formulas. Therefore, the
theorem can also be stated as follows:

Theorem (Cramer’s Rule) 2: If the coefficient matrix


formed from an 𝑛 -equation 𝑛 -unknown linear system
is non-singular, the system has a unique solution, and
that solution can be found using Cramer’s formulas.

Theorem: A system of n linear homogeneous


equations in n unknowns has a non-zero (nontrivial)
solution if and only if the determinant of the system’s
matrix is equal to zero.

You might also like