Bourbaki

Proposition 14

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

Algebra, chapter II, § 10. Matrices

Let XX be a matrix of type (m,n)(m, n) over a field KK. If XX is of rank rr, there exist two invertible square matrices P∈Mm(K)P \in \mathbf{M}_m(K), Q∈Mn(K)Q \in M_n(K) such that PP (resp. QQ) is a product of matrices of order mm (resp. nn) of the form Bij(λ)B_{ij}(\lambda) and

PXQ=(10⋯00⋯001⋯00⋯0⋯⋯⋯⋯⋯⋯⋯00⋯δr0⋯000⋯00⋯0⋯⋯⋯⋯⋯⋯⋯00⋯00⋯0) PXQ = \begin{pmatrix} 1 & 0 & \cdots & 0 & 0 & \cdots & 0 \\ 0 & 1 & \cdots & 0 & 0 & \cdots & 0 \\ \cdots & \cdots & \cdots & \cdots & \cdots & \cdots & \cdots \\ 0 & 0 & \cdots & \delta_r & 0 & \cdots & 0 \\ 0 & 0 & \cdots & 0 & 0 & \cdots & 0 \\ \cdots & \cdots & \cdots & \cdots & \cdots & \cdots & \cdots \\ 0 & 0 & \cdots & 0 & 0 & \cdots & 0 \end{pmatrix}

(a matrix (ηij)(\eta_{ij}) all of whose terms are zero except the ηli\eta_{li} for 1≤i≤r1 \leq i \leq r, with ηli=1\eta_{li} = 1 for 1≤i≤r−11 \leq i \leq r - 1, ηrr=δr≠0\eta_{rr} = \delta_r \neq 0). *If r≠mr \neq m or r≠nr \neq n, it may also be assumed that δr=1\delta_r = 1.

The proposition is obvious if X=0X = 0; suppose therefore X≠0X \neq 0. If m=n=1m = n = 1 the proposition is obvious (with P=ImP = I_m, Q=InQ = I_n, δ1≠0\delta_1 \neq 0 arbitrary). If n=1n = 1, m≥2m \geq 2, we can apply Lemma 1 (since X≠0X \neq 0), which gives the desired form (58) with r=1r = 1, δr=1\delta_r = 1. We argue by induction on n>1n > 1; there exists an element ξij≠0\xi_{ij} \neq 0 in XX; if j=1j = 1, Lemma 1 can be applied and reduces the problem to the case where XX has the form (57). The induction hypothesis then applies to YY and there are therefore invertible matrices

P′∈Mm−1(K),Q′∈Mn−1(K) P' \in \mathbf{M}_{m-1}(\mathbf{K}), \quad Q' \in \mathbf{M}_{n-1}(\mathbf{K})

which are products of matrices of the form Bij(λ)B_{ij}(\lambda) of order m−1m - 1 (resp. n−1n - 1), such that P′YQ′P'YQ' is of the form (58). But, if Bij(λ)B_{ij}(\lambda) belongs for example to Mm−1(K)\mathbf{M}_{m-1}(\mathbf{K}), then

(100Bij(λ))=Bi+1, j+1(λ); \begin{pmatrix} 1 & 0 \\ 0 & B_{ij}(\lambda) \end{pmatrix} = B_{i+1,\ j+1}(\lambda);

formula (58) then follows from the formula for block products writing

P=(100P′) and Q=(100Q′). P = \begin{pmatrix} 1 & 0 \\ 0 & P' \end{pmatrix} \text{ and } Q = \begin{pmatrix} 1 & 0 \\ 0 & Q' \end{pmatrix}.

If finally j≠1j \neq 1, it would be sufficient to consider the matrix XBj1(1)XB_{j1}(1) to reduce it to the above case.

Proposition 14 recovers Proposition 13 immediately.

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.