By the rank-nullity theorem, . Thus a first dependent column prefix exists. Minimality of makes the first columns independent, so . Adding one column cannot reduce this rank, while nonzero nullity of implies rank at most . HenceFor the earlier prefix is the zero-dimensional empty matrix, and the same argument applies.
Choose any nonzero vector in the one-dimensional kernel of . It gives for every row. Because no column is zero, must have at least two nonzero entries: a relation supported at a single index would make that column zero.
Suppose, contrary to the claim, that . Its kernel is spanned by , so there is a scalar with for every . At the two nonzero entries this gives two equal weights , contradicting their distinctness. Thus the weighted sum is nonzero in at least one row. This proves that distinct diagonal weights break a first column dependence. Some entries of may be zero; only two nonzero entries are needed.
Assume for contradiction that . Apply part b to the matrix of the given relation coefficients, whose columns are nonzero. For its first dependent prefix choose withMultiply the th given vector relation by and sum. Interchanging the finite sums givesThe are a basis, so all must be zero, contradicting part b. Therefore .
Choose a fixed reference basis and let have columns . Both matrices are invertible. The vectors are dependent exactly when . This is a polynomial in of degree , whose leading coefficient is . A nonzero degree- polynomial has at most distinct real roots. Thus there are at most exceptional parameters. This is the determinant argument for the matrix pencil .
Articles by others on the same topic
There are currently no matching articles.