First is finite: by Cauchy-Schwarz, . It is nonnegative and absolutely homogeneous. If , every , so every column is zero and ; the converse is immediate. The triangle inequality for the Euclidean norm gives after taking suprema. Thus is a norm.
For any vector , rescaling gives . Applying this twice gives
Furthermore , proving the requested strict entry bound when .
For a polynomial in matrix entries, expand each monomial at . The terms involving exactly one entry of give a linear map , with coefficients polynomial in the entries of . Every remaining term has at least two entries of and is for , because . This proves differentiability. Its derivative is continuous as an operator-valued function: each coefficient is continuous, and for every is bounded by one, so the operator-norm difference is bounded by the sum of the coefficient differences. Coordinate continuity follows from the same entry bound. Hence every such polynomial function is continuously differentiable.
In the Leibniz expansion of , the identity permutation supplies plus terms of degree at least two. Any nonidentity permutation moves at least two indices, so each of its terms has at least two entries. Consequently
If is invertible, multiplicativity of the determinant and the preceding expansion give
The adjugate identity gives . Thus for invertible .
For singular , take invertible , using the permitted density result. Both and the adjugate entries are continuous polynomial expressions, so taking limits for every fixed proves the derivative of the determinant formula on all matrices:
Here the standard adjugate is the transpose of the cofactor array, as required by . In components this derivative is , also valid at singular matrices.

Articles by others on the same topic (0)

There are currently no matching articles.