Li’s Hadamard-product eigenvalue-perturbation conjecture

For every unitarily invariant matrix norm ∥⋅∥ui\|\cdot\|_{\mathrm{ui}}, does there exist a constant c>0c>0, independent of nn and of G∈Cn×nG\in\mathbb{C}^{n\times n}, such that

min⁡P∈Pn∥P∘G∥ui2≤c min⁡W∈GLn(C)∥W∘G∥ui ∥W−1∘GT∥ui?\min_{P\in\mathcal{P}_n}\|P\circ G\|_{\mathrm{ui}}^2\leq c\,\min_{W\in\mathrm{GL}_n(\mathbb{C})}\|W\circ G\|_{\mathrm{ui}}\,\|W^{-1}\circ G^{\mathsf{T}}\|_{\mathrm{ui}}?

Here Pn\mathcal{P}_n is the set of n×nn\times n permutation matrices and ∘\circ denotes the Hadamard product. The reverse inequality is known in the opposite direction without a constant: the second minimum is at most the first. In the Frobenius-norm case, equality holds for every GG, so the optimal constant is c=1c=1.

References

Primary source

arXiv

Additional references

Progress summary

Refreshed
Claimed progress

A new paper settles the conjecture for the Frobenius norm, but the broader question covering all unitarily invariant norms remains open.

Li’s conjecture asks whether two eigenvalue-perturbation minimization quantities coincide for every complex matrix and every unitarily invariant norm. A recent paper by Lei-Hong Zhang and Ren-Cang Li establishes equality in the Frobenius-norm case and determines the optimal constant there.

Known results

  • The proposed inequality holds for every Q-norm, including the Schatten pp-norms for 2≤p≤∞2\le p\le\infty.
  • It holds for every unitarily invariant norm when rank⁡(E)≤1\operatorname{rank}(E)\le 1.
  • A 2×22\times2 example attains equality, showing sharpness of the bound.

Recent Frobenius-norm result

Zhang and Li claim the two minimization quantities coincide for every complex matrix under the Frobenius norm, with the optimal constant identified. Their result does not settle the conjecture for arbitrary unitarily invariant norms.

Current status (as of September 2026): The Frobenius-norm case and several restricted norm classes are claimed settled, while the universal unitarily invariant norm case remains open.

Sources

Solutions 0

No solutions have been posted yet.