(2) Consider a square matrix of order n which is presented in the form of an "upper triangular matrix of matrices" (II, § 10, no. 7, Example IV)
X=(Y0TZ)
We show that
detX=(detY)(detZ).
Let n be the order of the matrix X, h that of Y, (ei)1≤i≤n the canonical basis of An and xi (1≤i≤n) the columns of X; the hypothesis implies that the columns x1,…,xh belong to the submodule of An with basis e1,…,eh and then by definition (no. 3, formula (6))
x1∧x2∧⋯∧xn=(detY)e1∧e2∧⋯∧eh.
On the other hand, for every index i>h, we can write xi=yi+zi, where yi is a linear combination of e1,e2,…,eh and zi is a linear combination of eh+1,…,en. By (30), x1∧x2∧⋯∧xn∧yi=0 for all i>h, therefore
x1∧x2∧⋯∧xn=(detY)e1∧e2∧⋯∧eh∧zh+1∧⋯∧zn.
But by definition
zh+1∧zh+2∧⋯∧zn=(detZ)eh+1∧eh+2∧⋯∧en
whence formula (30).
By induction on p, it follows that if X is of the form of an upper triangular matrix of matrices:
X=X110⋯0X12X22⋯0⋯⋯⋯⋯X1pX2p⋯Xpp
(31)
detX=(detX11)(detX22)…(detXpp).
This can be applied in particular to a triangular matrix (where all the Xii are of order 1) and more particularly to a diagonal matrix:
(32)
det(diag(α1,α2,…,αn))=α1α2…αn.
(3) Let M,M′ be two free A-modules of respective dimensions n,n′, u an endomorphism of M and u′ an endomorphism of M′. Then
(33)
det(u⊗u′)=(detu)n′(detu′)n.
For we can write u⊗u′=(u⊗1M′)∘(1M⊗u′) and are then led to the case where one of the two endomorphisms u,u′ is the identity. For example if u′=1M′ and X is the matrix of u with respect to a basis (ei) of M, then the matrix of u⊗1M′ with respect to the tensor product of (ei) and a basis of M′ can be written as a matrix (with n′ rows and n′ columns) of matrices with n rows and n columns
X0…00X…0…………00…X
whence, by virtue of Example 2,
det(u⊗1M′)=(detX)n′=(detu)n′
which immediately gives formula (33).
Bourbaki puts the proof directly after the statement, so what is above is the statement and its proof together.