singularValues_mem_sorted
theoremverifiedformalizationimported Lean
Each singular value appears in the sorted list.
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 singularValues_mem_sorted {e : Type*} [Fintype e] [DecidableEq e] (A : Matrix e e ℂ) (i : e) : ∃ j : Fin (Fintype.card e), singularValues A i = singularValuesSorted A j
- Formalizes
- QuantumInfo, `singularValues_mem_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.singularValues_mem_sorted← singularValues_mem_sorted (QuantumInfo/ForMathlib/Majorization.lean:407): 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 /-- Each singular value appears in the sorted list. -/ lemma singularValues_mem_sorted {e : Type*} [Fintype e] [DecidableEq e] (A : Matrix e e ℂ) (i : e) : ∃ j : Fin (Fintype.card e), singularValues A i = singularValuesSorted A j := by have h_mem : singularValues A i ∈ Multiset.sort (Finset.univ.val.map (singularValues A)) (· ≥ ·) := by simp [Multiset.mem_sort] obtain ⟨j, hj⟩ := List.mem_iff_get.mp h_mem exact ⟨⟨j, by simpa using j.2⟩, hj.symm⟩