sum_singularValues_rpow_eq_sum_sorted
theoremverifiedformalizationimported Lean
The sum ∑ singularValues A i ^ p equals the sum over sorted singular values.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open Finset BigOperators Matrix in variable {d : Type*} [Fintype d] [DecidableEq d] in lemma sum_singularValues_rpow_eq_sum_sorted (A : Matrix d d ℂ) (p : ℝ) : ∑ i : d, singularValues A i ^ p = ∑ i : Fin (Fintype.card d), singularValuesSorted A i ^ p
- Formalizes
- QuantumInfo, `sum_singularValues_rpow_eq_sum_sorted`
- Lean proof
- By Alex Meiburg, from github.com/leanprover-community/physlib at
e411c6e89692(Copyright (c) 2026 Alex Meiburg. All rights reserved, Apache-2.0). Compiled here against leanprover/lean4:v4.33.1, Mathlib v4.33.1; written for leanprover/lean4:v4.34.1.sum_singularValues_rpow_eq_sum_sorted← sum_singularValues_rpow_eq_sum_sorted (QuantumInfo/ForMathlib/Majorization.lean:76): verbatim
- Verified
- 17 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 2
- singularValuesThe singular values of a square complex matrix
A, defined as the square roots of the eigenvalues ofA†A. These are indexed byd… - singularValuesSortedThe sorted singular values of a square complex matrix, in decreasing order, indexed by
Fin (Fintype.card d). We define them by sorting…
- singularValuesThe singular values of a square complex matrix
Lean source view module on GitHub
set_option autoImplicit true in set_option relaxedAutoImplicit true in open Finset BigOperators Matrix in variable {d : Type*} [Fintype d] [DecidableEq d] in /-- The sum `∑ singularValues A i ^ p` equals the sum over sorted singular values. -/ lemma sum_singularValues_rpow_eq_sum_sorted (A : Matrix d d ℂ) (p : ℝ) : ∑ i : d, singularValues A i ^ p = ∑ i : Fin (Fintype.card d), singularValuesSorted A i ^ p := by have h_perm : Multiset.map (fun i => singularValues A i) Finset.univ.val = Multiset.map (fun i => singularValuesSorted A i) Finset.univ.val := by have h_multiset : Multiset.map (fun i => singularValues A i) Finset.univ.val = Multiset.sort (Multiset.map (fun i => singularValues A i) Finset.univ.val) (· ≥ ·) := by aesop convert h_multiset using 1 refine' congr_arg _ (List.ext_get _ _) <;> simp [singularValuesSorted] have h_sum_eq : Multiset.sum (Multiset.map (fun x => x ^ p) (Multiset.map (fun i => singularValues A i) Finset.univ.val)) = Multiset.sum (Multiset.map (fun x => x ^ p) (Multiset.map (fun i => singularValuesSorted A i) Finset.univ.val)) := by rw [h_perm] convert h_sum_eq using 1 · erw [Multiset.map_map, Finset.sum_eq_multiset_sum] rfl · simp [Finset.sum] rfl