Bourbaki

Proposition 13

Tag 064Q, permanent. Cite it as [Bourbaki, Tag 064Q].

Algebra, chapter III, § 8. Determinants

For a system of nn linear equations in nn unknowns over a commutative ring to admit at least one solution regardless of the right hand sides, it is necessary and sufficient that the determinant of the matrix of the system be invertible; in this case the system admits a single solution.

If det⁡L\det L is not a divisor of zero in A\mathbf{A}, equation (34) is equivalent to the equation

(det⁡L)L.x=(det⁡L)y. (\det L)L.x = (\det L)y.
If MM is the cofactor matrix of LL, we derive from (34) and formula (26) of no. 6 the relation (36)
(det⁡L)x=tM.y (\det L)x = {}^tM.y
which may also be written (37)
(det⁡L)ξi=∑j=1n(−1)i+j(det⁡Lij)ηj=det⁡Li(1≤i≤n) (\det L)\xi_i = \sum_{j=1}^n (-1)^{i+j}(\det L^{ij})\eta_j = \det L_i \quad (1 \leq i \leq n)
where LiL_i denotes the matrix obtained by replacing the column of LL of index ii by yy. Formulae (37) are called Cramer's formulae for system (34); every solution of (34) is also a solution of (37). Conversely, we derive from (36), taking account of formula (28) of no. 6, (38)
(det⁡L)(L.x−y)=0 (\det L)(L.x - y) = 0
and hence, if det⁡L\det L is not a divisor of zero in A\mathbf{A}, systems (34) and (37) are equivalent; if det⁡L\det L is invertible, the unique solution of (34) is given by (39)
ξi=(det⁡L)−1(det⁡Li)(1≤i≤n). \xi_i = (\det L)^{-1}(\det L_i) \quad (1 \leq i \leq n).
A system (34) such that det⁡L\det L is invertible is also called a Cramer system.

In particular let y=0y = 0; it then follows from Proposition 3 of no. 2 that:

Bourbaki puts the proof directly after the statement, so what is above is the statement and its proof together.

Cited by

Cites

Transcribed from the printed edition, 1998, Springer. Not translated.