Bourbaki

Example

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

Algebra, chapter III, § 8. Determinants

(1) Vandermonde determinant. Given a sequence (ζi)1≤i≤n(\zeta_i)_{1 \leq i \leq n} of nn elements of A\mathbf{A}, the Vandermonde determinant of this sequence is the determinant

V(ζ1,ζ2,…,ζn)=∣11…1ζ1ζ2…ζnζ12ζ22…ζn2⋮⋮⋱⋮ζ1n−1ζ2n−1…ζnn−1∣ V(\zeta_1, \zeta_2, \ldots, \zeta_n) = \begin{vmatrix} 1 & 1 & \ldots & 1 \\ \zeta_1 & \zeta_2 & \ldots & \zeta_n \\ \zeta_1^2 & \zeta_2^2 & \ldots & \zeta_n^2 \\ \vdots & \vdots & \ddots & \vdots \\ \zeta_1^{n-1} & \zeta_2^{n-1} & \ldots & \zeta_n^{n-1} \end{vmatrix}

We shall show that

(29)(29)
V(ζ1,ζ2,…,ζn)=∏i<j(ζj−ζi). V(\zeta_1, \zeta_2, \ldots, \zeta_n) = \prod_{i < j} (\zeta_j - \zeta_i).

Since the proposition is immediate for n=1n = 1, we argue by induction on nn.

For each index k≥2k \geq 2, we subtract from the row of index kk the row of index k−1k - 1 multiplied by ζ1\zeta_1; the value of the determinant is unaltered and hence

V(ζ1,ζ2,…,ζn)=∣11⋯10ζ2−ζ1⋯ζn−ζ10ζ2(ζ2−ζ1)⋯ζn(ζn−ζ1)⋯⋯⋯⋯0ζ2n−2(ζ2−ζ1)⋯ζnn−2(ζn−ζ1)∣ V(\zeta_1, \zeta_2, \ldots, \zeta_n) = \begin{vmatrix} 1 & 1 & \cdots & 1 \\ 0 & \zeta_2 - \zeta_1 & \cdots & \zeta_n - \zeta_1 \\ 0 & \zeta_2(\zeta_2 - \zeta_1) & \cdots & \zeta_n(\zeta_n - \zeta_1) \\ \cdots & \cdots & \cdots & \cdots \\ 0 & \zeta_2^{n-2}(\zeta_2 - \zeta_1) & \cdots & \zeta_n^{n-2}(\zeta_n - \zeta_1) \end{vmatrix}

whence, expanding by the first column and then taking out the factor ζk−ζ1\zeta_k - \zeta_1 from the column of index k−1k - 1 from the minor thus obtained (2≤k≤n2 \leq k \leq n)

V(ζ1,…,ζn)=(ζ2−ζ1)(ζ3−ζ1)⋯(ζn−ζ1)V(ζ2,…,ζn) V(\zeta_1, \ldots, \zeta_n) = (\zeta_2 - \zeta_1)(\zeta_3 - \zeta_1) \cdots (\zeta_n - \zeta_1) V(\zeta_2, \ldots, \zeta_n)

which establishes (29) by induction.

(2) Consider a square matrix of order nn which is presented in the form of an "upper triangular matrix of matrices" (II, § 10, no. 7, Example IV)

X=(YT0Z) X = \begin{pmatrix} Y & T \\ 0 & Z \end{pmatrix}

We show that

det⁡X=(det⁡Y)(det⁡Z). \det X = (\det Y)(\det Z).

Let nn be the order of the matrix XX, hh that of YY, (ei)1≤i≤n(e_i)_{1 \leq i \leq n} the canonical basis of An\mathbf{A}^n and xix_i (1≤i≤n1 \leq i \leq n) the columns of XX; the hypothesis implies that the columns x1,…,xhx_1, \ldots, x_h belong to the submodule of An\mathbf{A}^n with basis e1,…,ehe_1, \ldots, e_h and then by definition (no. 3, formula (6))

x1∧x2∧⋯∧xn=(det⁡Y)e1∧e2∧⋯∧eh. x_1 \wedge x_2 \wedge \cdots \wedge x_n = (\det Y)e_1 \wedge e_2 \wedge \cdots \wedge e_h.

On the other hand, for every index i>hi > h, we can write xi=yi+zix_i = y_i + z_i, where yiy_i is a linear combination of e1,e2,…,ehe_1, e_2, \ldots, e_h and ziz_i is a linear combination of eh+1,…,ene_{h+1}, \ldots, e_n. By (30), x1∧x2∧⋯∧xn∧yi=0x_1 \wedge x_2 \wedge \cdots \wedge x_n \wedge y_i = 0 for all i>hi > h, therefore

x1∧x2∧⋯∧xn=(det⁡Y)e1∧e2∧⋯∧eh∧zh+1∧⋯∧zn. x_1 \wedge x_2 \wedge \cdots \wedge x_n = (\det Y)e_1 \wedge e_2 \wedge \cdots \wedge e_h \wedge z_{h+1} \wedge \cdots \wedge z_n.

But by definition

zh+1∧zh+2∧⋯∧zn=(det⁡Z)eh+1∧eh+2∧⋯∧en z_{h+1} \wedge z_{h+2} \wedge \cdots \wedge z_n = (\det Z)e_{h+1} \wedge e_{h+2} \wedge \cdots \wedge e_n

whence formula (30).

By induction on pp, it follows that if XX is of the form of an upper triangular matrix of matrices:

X=(X11X12⋯X1p0X22⋯X2p⋯⋯⋯⋯00⋯Xpp) X = \begin{pmatrix} X_{11} & X_{12} & \cdots & X_{1p} \\ 0 & X_{22} & \cdots & X_{2p} \\ \cdots & \cdots & \cdots & \cdots \\ 0 & 0 & \cdots & X_{pp} \end{pmatrix}

(31)

det⁡X=(det⁡X11)(det⁡X22)…(det⁡Xpp). \det X = (\det X_{11})(\det X_{22}) \ldots (\det X_{pp}).

This can be applied in particular to a triangular matrix (where all the XiiX_{ii} are of order 1) and more particularly to a diagonal matrix:

(32)

det⁡(diag⁡(α1,α2,…,αn))=α1α2…αn. \det(\operatorname{diag}(\alpha_1, \alpha_2, \ldots, \alpha_n)) = \alpha_1 \alpha_2 \ldots \alpha_n.

(3) Let M,M′M, M' be two free AA-modules of respective dimensions n,n′n, n', uu an endomorphism of MM and u′u' an endomorphism of M′M'. Then

(33)

det⁡(u⊗u′)=(det⁡u)n′(det⁡u′)n. \det(u \otimes u') = (\det u)^{n'} (\det u')^n.

For we can write u⊗u′=(u⊗1M′)∘(1M⊗u′)u \otimes u' = (u \otimes 1_{M'}) \circ (1_M \otimes u') and are then led to the case where one of the two endomorphisms u,u′u, u' is the identity. For example if u′=1M′u' = 1_{M'} and XX is the matrix of uu with respect to a basis (ei)(e_i) of MM, then the matrix of u⊗1M′u \otimes 1_{M'} with respect to the tensor product of (ei)(e_i) and a basis of M′M' can be written as a matrix (with n′n' rows and n′n' columns) of matrices with nn rows and nn columns

(X0…00X…0…………00…X) \begin{pmatrix} X & 0 & \ldots & 0 \\ 0 & X & \ldots & 0 \\ \ldots & \ldots & \ldots & \ldots \\ 0 & 0 & \ldots & X \end{pmatrix}

whence, by virtue of Example 2,

det⁡(u⊗1M′)=(det⁡X)n′=(det⁡u)n′ \det(u \otimes 1_{M'}) = (\det X)^{n'} = (\det u)^{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.

Cited by

Nothing.

Cites

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