Metraipolis › archive › dc_090ef8eafd34

On a Conjecture Related to Eigenvalue Perturbations — arXiv:2609.25552

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.25552
License (as archived)
CC0-1.0
Archived
2026-10-08T15:55:21.473Z
SHA-256 of the archived text
afb77dc78bdc892102fa9e9ee25f113619ac944c36cc472e08bc376b5e27620b
Stable URL of this page
https://metraipolis.com/documento/dc_090ef8eafd34

How to cite

On a Conjecture Related to Eigenvalue Perturbations — arXiv:2609.25552 — arXiv (en), https://arxiv.org/abs/2609.25552 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_090ef8eafd34 (Metraipolis archive dc_090ef8eafd34, sha256 afb77dc78bdc892102fa9e9ee25f113619ac944c36cc472e08bc376b5e27620b)
BibTeX
@misc{dc090ef8eafd34,
  title = {On a Conjecture Related to Eigenvalue Perturbations — arXiv:2609.25552},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.25552},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_090ef8eafd34; sha256 afb77dc78bdc892102fa9e9ee25f113619ac944c36cc472e08bc376b5e27620b},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.25552. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

In connection with eigenvalue perturbation bounds, Li [Linear Algebra Appl., 278 (1998), pp. 317-326] formulated three minimization problems involving Hadamard products. The third asks how to relate $$ \min_{W\ \mathrm{nonsingular}}\|W\circ G\|_\mathrm{ui}\,\|W^{-1}\circ G^\mathrm{T}\|_\mathrm{ui} \quad\mbox{and}\quad \min_{P\ \mathrm{permutation}}\|P\circ G\|_\mathrm{ui}^2, $$ where $\|\cdot\|_\mathrm{ui}$ denotes a unitarily invariant norm and $\circ$ denotes the Hadamard product, i.e., entrywise multiplication. The first quantity never exceeds the second, and a reverse inequality with a constant independent of the matrix size was conjectured. Romeo and Tilli [Linear Algebra Appl., 326 (2001), pp. 161-172] showed that if such a bound holds for every $G$, then $\|\cdot\|_\mathrm{ui}$ must be uniformly equivalent to the Frobenius norm $\|\cdot\|_\mathrm{F}$. We prove that the two quantities coincide when $\|\cdot\|_\mathrm{ui}=\|\cdot\|_\mathrm{F}$: for every complex matrix $G$, $$ \min_{W\ \mathrm{nonsingular}} \|W\circ G\|_\mathrm{F}\,\|W^{-1}\circ G^\mathrm{T}\|_\mathrm{F} =\min_{P\ \mathrm{permutation}}\|P\circ G\|_\mathrm{F}^2. $$ The associated conjecture therefore holds with the optimal constant $c=1$.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-23 in math.NA).
Categorie arXiv: Numerical Analysis (math.NA).
Pagina del lavoro: https://arxiv.org/abs/2609.25552 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-08T15:15:47.488Z dalla pagina https://arxiv.org/catchup/math.NA/2026-09-23?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).