Bourbaki

Remark

Tag 05LN, permanent. Cite it as [Bourbaki, Tag 05LN].

Algebra, chapter II, § 1. Modules

(5) Let (ai)1≤i≤n(a_i)_{1 \leq i \leq n} be a basis of an A-module E and let (bi)1≤i≤n(b_i)_{1 \leq i \leq n} be a family of elements of E given by the relations

bi=λ1ia1+⋯+λiiai(1≤i≤n) b_i = \lambda_{1i} a_1 + \cdots + \lambda_{ii} a_i \quad (1 \leq i \leq n)

where λii\lambda_{ii} is invertible in A; then (bi)1≤i≤n(b_i)_{1 \leq i \leq n} is a basis of E. It suffices to argue by induction on nn, the proposition being obvious for n=1n = 1. If E' is the submodule of E generated by the family (ai)1≤i≤n−1(a_i)_{1 \leq i \leq n-1}, it follows from the induction hypothesis that (bi)1≤i≤n−1(b_i)_{1 \leq i \leq n-1} is a basis of E'; on the other hand, it follows from (46) that if μbn∈E′\mu b_n \in E' with μ∈A\mu \in A, then also μλnnan∈E′\mu \lambda_{nn} a_n \in E', whence μ=0\mu = 0 since λnn\lambda_{nn} is invertible. The family (bi)1≤i≤n(b_i)_{1 \leq i \leq n} is thus free and, as

an=−λnn−1λ1na1−⋯−λnn−1λn−1,nan−1+λnn−1bn a_n = -\lambda_{nn}^{-1}\lambda_{1n}a_1 - \cdots - \lambda_{nn}^{-1}\lambda_{n-1,n}a_{n-1} + \lambda_{nn}^{-1}b_n
it is seen that (bi)1≤i≤n(b_i)_{1 \leq i \leq n} is a generating system of E, which completes the proof. This result is easily generalized to a family (ai)i∈I(a_i)_{i \in I} whose indexing set I is well ordered.

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

Cited by

Nothing.

Cites

Nothing.

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