Kippenhahn’s conjecture
Kippenhahn’s conjecture
For Hermitian matrices , define . Kippenhahn's conjecture asserts that if there is a nonconstant polynomial such that , then and are simultaneously reducible; that is, there exists a subspace with such that and . The conjecture is false in this generality; the cited 2026 preprint claims a complete characterization of the remaining reducibility problem.
Progress summary
The original conjecture is known to fail in general, but an August 2026 preprint claims to give a complete characterization that resolves the remaining question.
Kippenhahn proposed the conjecture in 1951, linking repeated factors in characteristic polynomials of Hermitian matrix tuples to simultaneous reducibility. Its broad original form is false, but the precise reducibility problem remains the subject of current work.
Known results
- Kippenhahn verified special cases where the relevant minimal polynomial has degree or .
- Laffey gave a counterexample in the 1980s; later work reports versions in orders and higher.
- Li, Spitkovsky, and Shukla (1998) disproved a more general form for .
- A 2017 paper constructed a one-parameter family of counterexamples for Hermitian matrices of order .
August 2026 claimed resolution
Stessin and Yang claim that spectral index, spectral stability, and characteristic graphs yield necessary and sufficient conditions and “completely settle” Kippenhahn’s conjecture, including the Hermitian-pair criterion involving . This is an unrefereed preprint claim with no supplied independent verification.
Current status (as of August 2026): The broad conjecture is disproved by counterexamples, while a new preprint claims to settle the refined general problem; that claimed resolution remains unverified.
Sources
Sources & referencesView supporting material
Primary source
Additional references
- Reducibility of linear representations, free ideals, and Kippenhahn's conjecture — arXiv — Michael Stessin, Rongwei Yang
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.