AFTD Auto-Formalizing Theoretical Domains

eigenvalue_le_singularValuesSorted_sq

theoremverifiedformalizationimported Lean

eigenvalue_le_singularValuesSorted_sq

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 eigenvalue_le_singularValuesSorted_sq {e : Type*} [Fintype e] [DecidableEq e]
    (A : Matrix e e ℂ) (h : 0 < Fintype.card e) (i : e) :
  (isHermitian_mul_conjTranspose_self A.conjTranspose).eigenvalues i ≤
    (singularValuesSorted A ⟨0, h⟩) ^ 2
Formalizes
QuantumInfo, `eigenvalue_le_singularValuesSorted_sq`
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.
Verified
17 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 3
  • singularValuesThe singular values of a square complex matrix A, defined as the square roots of the eigenvalues of A†A. These are indexed by d…
  • singularValuesSortedThe sorted singular values of a square complex matrix, in decreasing order, indexed by Fin (Fintype.card d). We define them by sorting…
  • singularValuesSorted_zero_eq_supThe 0th sorted singular value is the maximum of the singular values.
Used by 1

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
lemma eigenvalue_le_singularValuesSorted_sq {e : Type*} [Fintype e] [DecidableEq e]
    (A : Matrix e e ℂ) (h : 0 < Fintype.card e) (i : e) :
  (isHermitian_mul_conjTranspose_self A.conjTranspose).eigenvalues i ≤
    (singularValuesSorted A ⟨0, h⟩) ^ 2 := by
  -- By definition of singular values, we know that $\sigma_i(A)^2 = \lambda_i(A^*A)$.
  have h_singular_value_squared : ∀ i, (singularValues A i) ^ 2 = (isHermitian_mul_conjTranspose_self A.conjTranspose).eigenvalues i := by
    intro i
    simp [singularValues]
    rw [Real.sq_sqrt (_)]
    convert Matrix.eigenvalues_conjTranspose_mul_self_nonneg A i using 1
  rw [← h_singular_value_squared i]
  gcongr
  · exact Real.sqrt_nonneg _
  · convert singularValuesSorted_zero_eq_sup A h |> fun h => h.ge.trans' _
    exact Finset.le_sup' (fun i => singularValues A i) (Finset.mem_univ i)
See it in the graphDiscuss this resultChallenge it