How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Newton sign iteration converges off the imaginary axis and is locally quadratic
Statement
Let , , have no eigenvalues on , let , and define the exact Newton sequence Then every iterate is defined, , and for every submultiplicative matrix norm, Thus the exact iteration is locally quadratically convergent. No error bound for rounded iterates of Finite-budget Newton iteration for the matrix sign is asserted.
Facts & Assumptions
Given: A finite complex matrix with spectrum disjoint from the imaginary axis and the exact Newton sequence.
The scalar sign is on the open right half-plane and on the open left half-plane, and is its analytic primary matrix function (Primary matrix sign for spectra off the imaginary axis).
Analytic primary functions are given blockwise by their Taylor jets and respect similarity (Jordan, contour, similarity, and normal-functional-calculus formulas agree).
The given exact sequence in the Statement is defined by whenever is invertible. This is a defining recurrence, independent of the rounded algorithm.
Every finite-dimensional complex normed space is complete (Every finite-dimensional normed space is Banach).
Proof
In a Jordan representation of , [F1]–[F2] give on every right-half-plane block and on every left-half-plane block. Hence and . Conjugate the exact iterates into this basis. Initially they are block diagonal with upper-triangular Jordan blocks. If has this form, its inverse, when defined, has the same block structure and its diagonal entries are the reciprocals of those of . Thus each diagonal entry follows the scalar update . Whenever , so its nonzero real-part sign is unchanged. By induction all diagonal entries remain nonzero and off , each is invertible, and the next update is defined.
Since the Jordan-block diagonal values remain in the same half-planes, [F2] gives for every . Also commutes with : this holds for , and if it holds for , then its inverse also commutes with , so the update [F3] preserves commutation. The eigenvalues of are on the corresponding blocks, with because has sign . Thus is invertible. Define .
Using and commutation with , expansion gives Hence . The eigenvalues of are ; their moduli are less than one because .
In a Jordan basis of , is block upper triangular; on a block at its diagonal is and its strictly upper triangular part is nilpotent, say . Its th power is . Each term tends to zero as because and exponential decay dominates the polynomial factor ; if , the nilpotent block power is eventually zero. Thus . The eigenvalues of have modulus less than one, so is invertible. Rearranging the definition of gives , so .
Direct expansion, using and , gives . Taking any submultiplicative norm proves the stated quadratic inequality. To bound the inverse near the limit, write with . Since , eventually . The geometric series is Cauchy in the chosen norm because its tail is bounded by the scalar geometric tail; the matrix space is complete by [F4]. Multiplication of its partial sums by shows its sum is , whose norm is at most . Thus eventually, so the displayed inequality has a fixed quadratic constant near the limit.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
30 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Nicholas J. Higham, Functions of Matrices: Theory and Computation, Chapter 5: Matrix Sign Function (standard reference, not scraped)
- Jan Zur, Matrix Functions, TU Berlin full lecture notes (standard reference, not scraped)