A norm on a real or complex vector space is a function with exactly when , , and the triangle inequality . These are positivity, absolute homogeneity and the triangle inequality.
For a linear map , define the operator norm byIt is finite. To see this without assuming continuity of , write : the triangle inequality bounds by . Every norm in finite dimensions is equivalent to the Euclidean norm. One proof first uses this same coordinate bound to establish continuity of the norm on the Euclidean unit sphere; compactness then gives a strictly positive minimum there. Thus the coordinate bound above is at most a fixed multiple of .
Absolute homogeneity and the triangle inequality for this operator norm follow from those for and taking suprema. If , then for every , hence , and the converse is immediate. For any , the defining bound givesThis is submultiplicativity of the operator norm.
The function is a polynomial in the matrix entries, hence continuous. Consequently is the inverse image of the open set and is an open set.
If and , then implies . This forces . The square matrix is therefore injective, hence an invertible matrix, soThe argument works with any of the induced operator norms in part (b).
Put . By submultiplicativity of the operator norm, , so the Neumann series converges absolutely in the complete finite-dimensional matrix space. Its partial sums satisfyTaking limits gives the inverse and a quantitative remainder bound:To establish two actual Frechet derivatives, use the resolvent identityFor fixed and sufficiently small , factor and apply the Neumann series to the second factor. This proves that , that is locally bounded, and that . Subtracting in the identity leaves . Thus is the Frechet derivative.
Near zero, , uniformly in the operator norm. Hence, as a linear operator in ,This proves differentiability of at zero, givingThe order of multiplication matters: the second Frechet derivative is the symmetric bilinear map , not .
Articles by others on the same topic
There are currently no matching articles.