Bourbaki

Theorem 3

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

Algebra, chapter II, § 7. Vector spaces

Two bases of the same vector space EE over a field KK are equipotent.

We note first that if EE admits an infinite basis BB, it follows from § 1, no. 12, Corollary 2 to Proposition 23 that every other basis of EE is equipotent to BB. We may therefore confine our attention to the case where EE has a finite basis of nn elements. We note that every monogenous vector space over KK, not reduced to 0, is a simple KK-module (I, § 4, no. 4, Definition 7), for it is generated by each of its elements ≠0\neq 0, by virtue of the relation μa=(μλ)(λ−1a)\mu a = (\mu \lambda)(\lambda^{-1}a) for μ∈K\mu \in K, λ∈K\lambda \in K and λ≠0\lambda \neq 0. Hence if (ai)1≤i≤n(a_i)_{1 \leq i \leq n} is a basis of EE, then E=⨁i=1nKaiE = \bigoplus_{i=1}^n Ka_i up to isomorphism and the subspaces Ek=⨁i=1κKaiE_k = \bigoplus_{i=1}^\kappa Ka_i for 0≤k≤n0 \leq k \leq n form a Jordan-Hölder series of EE, Ek/Ek−1E_k/E_{k-1} being isomorphic to KakKa_k. Theorem 3 then follows in this case from the Jordan-Hölder Theorem (I, § 4, no. 7, Theorem 6).

A proof can be given independent of the Jordan-Hölder Theorem, by showing by induction on nn that, if EE admits a basis of nn elements, every other basis B′B' has at most nn elements. The proposition is obvious for n=0n = 0. If n≥1n \geq 1, B′B' is non-empty; then let a∈B′a \in B'. By Theorem 2 (no. 1) there exists a subset CC of BB such that {a}∪C\{a\} \cup C is a basis of EE and a∉Ca \notin C, since {a}∪B\{a\} \cup B is obviously a generating system of EE. As BB is a basis of EE, C=BC = B is impossible (no. 1, Corollary to Theorem 2) and hence CC has at most n−1n - 1 elements. Let VV be the subspace generated by CC and V′V' the subspace generated by B′−{a}B' - \{a\}; VV and V′V' are both supplementary to the subspace KaKa of EE and hence are isomorphic (§ 1, no. 10, Proposition 13). As VV admits a basis with at most n−1n - 1 elements, B′−{a}B' - \{a\} has at most n−1n - 1 elements by the induction hypothesis and hence B′B' has at most nn elements.

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.