Theorem 5 (Wall 2013): eigenvalue majorization under positive unital trace-preserving maps
ProvedWallGSL.unital_positive_map_eigenvalue_majorizationTheorem 5 (appendix). Let be an density matrix (positive semidefinite, trace ) and let be a linear map on complex matrices that is positive (maps positive semidefinite matrices to positive semidefinite matrices), trace preserving and identity preserving (). Then for every , the sum of the largest eigenvalues of is at most the sum of the largest eigenvalues of :
In the paper's notation, , where and project onto the eigenspaces of the largest eigenvalues of and of .
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 largest eigenvalues" is expressed without sorting: every sum of eigenvalues of (indexed by a set of size ) is bounded by some sum of eigenvalues of .
import Mathlib open Matrix open scoped ComplexOrder
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
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 ; a -linear map from complex matrices to complex matrices; an complex matrix ; a natural number ; and a set .
Hypotheses.
- is positive semidefinite whenever is positive semidefinite (Hermitian with for all );
- for every matrix ;
- ;
- is positive semidefinite and ;
- .
Conclusion. Writing for the eigenvalues of the Hermitian matrix and for those of (each listed with multiplicity, in the order chosen by Mathlib's spectral theorem), there is a set with and
If there is no such and the statement is vacuous; for it reads . Complete positivity of is not assumed.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.