Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 5 (Wall 2013): eigenvalue majorization under positive unital trace-preserving maps

Proved
WallGSL.unital_positive_map_eigenvalue_majorization

by Lucas · Oct 4, 2026 · Mathlib 0df444a (Lean v4.33.1)

majorizationmatrix-analysisquantum-information

Theorem 5 (appendix). Let ρ\rhoρ be an n×nn\times nn×n density matrix (positive semidefinite, trace 111) and let TTT be a linear map on n×nn\times nn×n complex matrices that is positive (maps positive semidefinite matrices to positive semidefinite matrices), trace preserving and identity preserving (T(I)=IT(I)=IT(I)=I). Then for every iii, the sum of the iii largest eigenvalues of T(ρ)T(\rho)T(ρ) is at most the sum of the iii largest eigenvalues of ρ\rhoρ:

∑j=1iλj↓(T(ρ)) ≤ ∑j=1iλj↓(ρ).\sum_{j=1}^{i}\lambda^{\downarrow}_j\big(T(\rho)\big)\ \le\ \sum_{j=1}^{i}\lambda^{\downarrow}_j(\rho).j=1∑i​λj↓​(T(ρ)) ≤ j=1∑i​λj↓​(ρ).

In the paper's notation, tr⁡(Q T(ρ) Q)≤tr⁡(PρP)\operatorname{tr}(Q\,T(\rho)\,Q)\le\operatorname{tr}(P\rho P)tr(QT(ρ)Q)≤tr(PρP), where PPP and QQQ project onto the eigenspaces of the iii largest eigenvalues of ρ\rhoρ and of T(ρ)T(\rho)T(ρ).

This is the statement that probability eigenvalues can only evolve towards equalization, which underlies the coarse-grained second law discussed in §2.1.

Formalization Note "The sum of the iii largest eigenvalues" is expressed without sorting: every sum of iii eigenvalues of T(ρ)T(\rho)T(ρ) (indexed by a set sss of size iii) is bounded by some sum of iii eigenvalues of ρ\rhoρ.

Preamble
import Mathlib

open Matrix
open scoped ComplexOrder
Formal statement
namespace WallGSL

/-- Theorem 5 (appendix) of Wall (2013): a trace-preserving, identity-preserving, positive
linear map `T` on `n × n` complex matrices can only equalize the eigenvalues of a density
matrix `ρ`: for every `i`, the sum of any `i` eigenvalues of `T ρ` is at most the sum of
the `i` largest eigenvalues of `ρ`. -/
theorem unital_positive_map_eigenvalue_majorization
    {n : ℕ} (T : Matrix (Fin n) (Fin n) ℂ →ₗ[ℂ] Matrix (Fin n) (Fin n) ℂ)
    (hT_pos : ∀ A : Matrix (Fin n) (Fin n) ℂ, A.PosSemidef → (T A).PosSemidef)
    (hT_trace : ∀ A : Matrix (Fin n) (Fin n) ℂ, (T A).trace = A.trace)
    (hT_one : T 1 = 1)
    (ρ : Matrix (Fin n) (Fin n) ℂ) (hρ : ρ.PosSemidef) (hρ_tr : ρ.trace = 1)
    (i : ℕ) (s : Finset (Fin n)) (hs : s.card = i) :
    ∃ t : Finset (Fin n), t.card = i ∧
      ∑ j ∈ s, (hT_pos ρ hρ).isHermitian.eigenvalues j ≤ ∑ j ∈ t, hρ.isHermitian.eigenvalues j := by sorry

end WallGSL
Source
A. C. Wall, The generalized second law implies a quantum singularity theorem, Class. Quantum Grav. 30 (2013) 165003, https://doi.org/10.1088/0264-9381/30/16/165003, Appendix, Theorem 5 eq. (A.3), p. 31
Read-back

What the Lean code literally says, in plain math · Aristotle (Harmonic) - same agent as the drafter; non-blind

Provenance note — this read-back is NOT blind. It was written by the same agent (Aristotle, by Harmonic) that drafted the Lean statements, with full knowledge of the source paper and of the intended meaning. It is therefore not independent testimony and must not be mistaken for a blind audit; reviewers should treat it as the drafter's own literal reading of the code and compare it against the source themselves.

Data. A natural number nnn; a C\mathbb CC-linear map TTT from n×nn\times nn×n complex matrices to n×nn\times nn×n complex matrices; an n×nn\times nn×n complex matrix ρ\rhoρ; a natural number iii; and a set s⊆{1,…,n}s\subseteq\{1,\dots,n\}s⊆{1,…,n}.

Hypotheses.

  1. T(A)T(A)T(A) is positive semidefinite whenever AAA is positive semidefinite (Hermitian with x∗Ax≥0x^*Ax\ge0x∗Ax≥0 for all xxx);
  2. tr⁡T(A)=tr⁡A\operatorname{tr}T(A)=\operatorname{tr}AtrT(A)=trA for every matrix AAA;
  3. T(I)=IT(I)=IT(I)=I;
  4. ρ\rhoρ is positive semidefinite and tr⁡ρ=1\operatorname{tr}\rho=1trρ=1;
  5. ∣s∣=i|s|=i∣s∣=i.

Conclusion. Writing μ1,…,μn\mu_1,\dots,\mu_nμ1​,…,μn​ for the eigenvalues of the Hermitian matrix T(ρ)T(\rho)T(ρ) and λ1,…,λn\lambda_1,\dots,\lambda_nλ1​,…,λn​ for those of ρ\rhoρ (each listed with multiplicity, in the order chosen by Mathlib's spectral theorem), there is a set t⊆{1,…,n}t\subseteq\{1,\dots,n\}t⊆{1,…,n} with ∣t∣=i|t|=i∣t∣=i and

∑j∈sμj ≤ ∑j∈tλj.\sum_{j\in s}\mu_j\ \le\ \sum_{j\in t}\lambda_j.j∈s∑​μj​ ≤ j∈t∑​λj​.

If i>ni>ni>n there is no such sss and the statement is vacuous; for i=0i=0i=0 it reads 0≤00\le 00≤0. Complete positivity of TTT is not assumed.

Human review
  • Endorsed by Shuze Chen · Oct 8, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Lucas · Oct 8, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me