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.
A resolvent contour bound transfers scalar rational error to matrices
Statement
Let with , let be holomorphic on an open containing , and let be rational with no pole on . Let be an admissible Cauchy cycle for contained in . Write its finite chain representation as with integer coefficients and define its coefficient-weighted length by . The integral and this length use the same signed-chain representation. Suppose Then The resolvent hypothesis may be supplied by the diskwise certificate of Diskwise Neumann certificates bound a complex matrix resolvent. A scalar disk error alone does not give this matrix bound for a nonnormal matrix.
Facts & Assumptions
Given: as in the statement.
Analytic primary matrix functions have the Cauchy-cycle representation (Jordan, contour, similarity, and normal-functional-calculus formulas agree).
The complex infinity matrix norm is the maximum absolute row sum (The complex induced infinity matrix norm) and is submultiplicative (The complex infinity matrix norm is compatible and submultiplicative).
The resolvent certificate gives the stated uniform bound on the supplied contour when its disk inequalities hold (Diskwise Neumann certificates bound a complex matrix resolvent).
Proof
Since and are holomorphic on , [F1] applied to each gives The cycle is disjoint from , so every resolvent in the integrand exists.
Write the finite chain integral as . Parametrize each rectifiable contour piece by arc length. Multiplying its estimate by and applying the triangle inequality to the finite chain sum gives the coefficient-weighted total , including zero or negative coefficients. For every row, the absolute value of the integral is at most the integral of the absolute value; summing the row bounds and using [F2] gives For , the hypotheses give , with the resolvent bound certified by [F3].
Taking norms in step 1.1, applying step 1.2, and using proves the claimed estimate.
Depends on
- Analytic primary matrix functions by Jordan blocks
- Jordan, contour, similarity, and normal-functional-calculus formulas agree
- Diskwise Neumann certificates bound a complex matrix resolvent
- The complex induced infinity matrix norm
- The complex infinity matrix norm is compatible and submultiplicative
- Rectifiable complex contours, reversal, concatenation, closedness, and orientation
Used by
Dependency tree · two levels
28 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
- Jan Zur, Matrix Functions, TU Berlin full lecture notes (standard reference, not scraped)
- Nicholas J. Higham, Functions of Matrices, Handbook of Linear Algebra, Chapter 17 (standard reference, not scraped)