Skip to content

feat: add Lidskii–Last eigenvalue-perturbation eval problem#274

Open
kim-em wants to merge 1 commit into
mainfrom
eval/lidskii
Open

feat: add Lidskii–Last eigenvalue-perturbation eval problem#274
kim-em wants to merge 1 commit into
mainfrom
eval/lidskii

Conversation

@kim-em
Copy link
Copy Markdown
Collaborator

@kim-em kim-em commented May 19, 2026

This PR adds the Lidskii–Last eigenvalue-perturbation theorem as a new lean-eval challenge problem — §99 of Oliver Knill's Some Fundamental Theorems in Mathematics.

For two self-adjoint complex n × n matrices A, B with eigenvalues sorted in the same order, the total eigenvalue displacement is bounded by the entrywise ℓ¹ distance:

∑ⱼ |αⱼ − βⱼ| ≤ ∑ᵢⱼ |Aᵢⱼ − Bᵢⱼ|.

This is Last's theorem (≈1993), a consequence of Lidskii's inequality (1950). The statement uses Matrix.IsHermitian.eigenvalues₀ and needs no auxiliary definitions; mathlib has no Lidskii, Ky Fan, or Hoffman–Wielandt perturbation bounds, and a search found no formalization of the theorem in any other proof assistant.

🤖 Prepared with Claude Code

This PR adds the Lidskii-Last theorem (§99 of Knill's "Some Fundamental
Theorems in Mathematics") as a new eval problem: for self-adjoint
complex matrices A, B with eigenvalues sorted in the same order, the
total eigenvalue displacement is bounded by the entrywise ℓ¹ distance.
Mathlib has no Lidskii, Ky Fan, or Hoffman-Wielandt perturbation bounds.

Co-Authored-By: Claude Opus 4.7 (1M context) <noreply@anthropic.com>
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

1 participant