"Special case of a general theorem of Lagrange" doesn't sound well to me: Wikipedia writes that "Lagrange (1773) treated determinants of the second and third order. Lagrange was the first to apply determinants to questions of elimination theory; he proved many special cases of general identities.", so I think your original question is already more general than anything Lagrange has done.
Here are two simple generalizations of your original question:
(1) If
left(begin{array}{cccc}A_{1,1}&A_{1,2}&dots &A_{1,n} \ A_{2,1}&A_{2,2}&dots &A_{2,n}\ vdots &vdots &ddots &vdots \ A_{n,1}&A_{n,2}&dots &A_{n,n}end{array}right)left(begin{array}{cccc}A_{1,1}&A_{1,2}&dots &A_{1,n} \ A_{2,1}&A_{2,2}&dots &A_{2,n}\ vdots &vdots &ddots &vdots \ A_{n,1}&A_{n,2}&dots &A_{n,n}end{array}right)
is a block matrix with
Ai,j=0 for every i<j, and
Ai,i being a square matrix for every i,
then its determinant is detA1,1cdotdetA2,2cdotdotscdotdetAn,n.
The easiest proof (imho) uses the Leibniz formula for determinants, which reduces it to the following combinatorial fact: If a finite set S is the union of some pairwise disjoint sets S1, S2, ..., Sn, and pi is a permutation of the set S, then either pileft(Siright)=Si for every i, or there exist i<j such that pi maps at least one element of Sj into Si. This is an exercise in induction.
(2) Another generalization: If left(Uiright)iinmathbbZ is an exact chain complex of finite-dimensional vector spaces, bounded from below and from above (i. e., the vector space Ui is zero for all sufficiently large i and for all sufficiently small i), and left(firight)iinmathbbZ is a chain homomorphism from left(Uiright)iinmathbbZ to left(Uiright)iinmathbbZ, then
prodlimitsiinmathbbZ;itextisevendetfi=prodlimitsiinmathbbZ;itextisodddetfi.
No comments:
Post a Comment