Rank-One Perturbation Theory

• Rank-One Perturbation Theory is the study of how adding a single rank update alters a matrix or operator's spectrum via characteristic polynomials and Jordan block nuances.
• The analysis uses necessary and sufficient conditions based on matching algebraic multiplicities with the size of the largest Jordan block, ensuring precise spectral assignments.
• Its practical implications extend to control theory, random matrix theory, and signal processing, facilitating stability analysis under minimal perturbations.

Rank-one perturbation theory concerns the spectral and structural changes induced on matrices and operators by adding a perturbation of rank one. The classical and modern developments of this theory highlight the interplay between algebraic invariants (characteristic polynomials, Jordan block sizes, cyclicity), operator-theoretic resolvent identities, and connections to key areas such as random matrix theory, control, and mathematical physics. The spectral consequences are sharpest when the ambient field is algebraically closed and full Jordan decomposition is available.

1. Structural Framework: Notation, Definitions, and Spectral Data

Let $A \in F^{n \times n}$ be a matrix over an algebraically closed field $F$. The canonical spectral invariant is the characteristic polynomial $p_A(t) = \det(tI - A)$, monic of degree $n$. For any monic $q(t) \in F[t]$ of degree $n$, fundamental questions arise: which $q(t)$ can appear as the characteristic polynomial of a rank one perturbation $A+B$, i.e., $B = uv^T$ for $u,v \in F^n$?

Key quantities for each eigenvalue $F$0:

• Algebraic multiplicity: $F$1 in $F$2.
• Jordan block size: $F$3 size of largest Jordan block for $F$4.

Simultaneously, the class of rank-one matrices forms the set $F$5, and the rank-one perturbation problem is nontrivial due to its effect on the geometric and algebraic multiplicities of eigenvalues.

2. Main Theorem and Necessary-Sufficient Condition for Spectral Assignability

Merzel–Mináč–Muller–Pasini–Nguyen's principal result provides a complete criterion for the existence of $F$6 such that $F$7 (Merzel et al., 2021): Main Theorem: There exists $F$8 of rank one with $F$9 if and only if, for all $p_A(t) = \det(tI - A)$0,

$p_A(t) = \det(tI - A)$1

This logarithmic-type inequality is both necessary and sufficient: it quantifies exactly how many roots at $p_A(t) = \det(tI - A)$2 must persist in $p_A(t) = \det(tI - A)$3, depending on the initial multiplicities and largest Jordan block.

The sufficiency leverages explicit construction in Jordan canonical coordinates, exploiting the block structure.

3. Proof Strategy, Weinstein–Aronszajn Identity, and Construction Principles

The analysis proceeds by:

• Necessity: Via rank estimates, for any rank-one $p_A(t) = \det(tI - A)$4 and Jordan block $p_A(t) = \det(tI - A)$5, the algebraic multiplicity at $p_A(t) = \det(tI - A)$6 cannot decrease by more than the size of the largest block: $p_A(t) = \det(tI - A)$7.
• Sufficiency: For the Jordan decomposition $p_A(t) = \det(tI - A)$8, a rank-one perturbation is constructed as follows:
  1. For a single block $p_A(t) = \det(tI - A)$9, any monic polynomial is attainable, since $n$0 and the constraint vacuously holds. With the expansion

  $n$1

  one can tune $n$2 so that $n$3 matches the desired rational function. 2. For direct sums of distinct blocks: the Chinese remainder theorem in $n$4 allows decomposition into summands supported on each block; rank-one updates are patched accordingly. 3. For repeated eigenvalues: a hybrid of steps 1 and 2 treats blocks of maximal size separately.

The pivotal formula for a rank-one update is the Weinstein–Aronszajn identity: $n$5 Thus,

$n$6

The entire spectral assignment reduces to engineering $n$7 so that $n$8 adjusts $n$9 to $q(t) \in F[t]$0, subject to the necessary constraints.

4. Algebraic and Jordan-theoretic Consequences

Table: Critical invariants governing spectral assignability

Parameter	Meaning	Role in Theorem
$q(t) \in F[t]$1	Algebraic multiplicity at $q(t) \in F[t]$2	Baseline count of roots at $q(t) \in F[t]$3
$q(t) \in F[t]$4	Largest Jordan block at $q(t) \in F[t]$5	Controls maximal loss of roots
$q(t) \in F[t]$6	Multiplicity of $q(t) \in F[t]$7 in $q(t) \in F[t]$8	Target count of roots in $q(t) \in F[t]$9

Implications:

• Diagonalizable $n$0: $n$1 for all $n$2; hence $n$3. One can add or remove at most one root per eigenvalue.
• Single Jordan block: For $n$4, any $n$5 is realizable; the full spectrum can be arbitrarily assigned.
• Generic case: Repeated eigenvalues with variable block sizes require careful partitioning and the possibility of spectral ‘loss’ limited by the block structure.

5. Illustrative Examples and Special Cases

• Zero-matrix case: For $n$6, both $n$7 and $n$8, so any quadratic monic $n$9 is obtainable (no constraint); explicit construction given in the paper.
• Complex field $q(t)$0: The result recovers classical theorems (Lidskiĭ, Kato) on eigenvalue shifts for small rank-one perturbations; isolated eigenvalues can be targeted within the constraint.
• Direct computation for diagonal $q(t)$1: For $q(t)$2,

$q(t)$3

Choosing all but one $q(t)$4 zero gives a rank-one update.

6. Connections, Generalizations, and Implications

This theorem provides:

• A sharp improvement over earlier sufficient conditions (e.g., Cheung–Ng, Krupnik), by producing an explicit necessary-and-sufficient inequality involving both algebraic and geometric multiplicities.
• A unification of various spectral assignment problems, reducing even complicated spectral rearrangement to a single rank-one perturbation provided the Jordan structure is favorable.
• A foundational framework for understanding stability under low-rank updates in control, signal processing, and random matrix theory, where perturbations naturally arise as data or feedback are introduced.

The structure of permissible characteristic polynomials under rank-one perturbation is fully governed by the interaction between the algebraic multiplicities and the sizes of Jordan blocks, providing both an explicit algorithm for construction and a transparent obstruction theory for spectral assignment.

7. Further Technical Lemmas and Computational Identities

Key Lemmas:

• Weinstein–Aronszajn formula for block matrices: If $q(t)$5 and $q(t)$6 are $q(t)$7 and $q(t)$8 matrices,

$q(t)$9

Used repeatedly to pass between perturbation representations.

• Rank estimates: For arbitrary $A+B$0 of size $A+B$1, and $A+B$2,

$A+B$3

For $A+B$4 of rank one, this controls multiplicities after perturbation.

These technical results illuminate why the main spectral assignment theorem is not only sharp but constructively optimal for rank-one updates.

---

The theory as crystallized by Merzel–Mináč–Muller–Pasini–Nguyen (Merzel et al., 2021) thus closes the spectral perturbation problem for rank-one matrices, yielding a necessary and sufficient criterion for attainable characteristic polynomials under a minimal rank update and tightly linking the algebraic, geometric, and analytic invariants of the underlying operator.