AFTD Auto-Formalizing Theoretical Domains

singularValues

defimported Lean

The singular values of a square complex matrix A, defined as the square roots of the eigenvalues of A†A. These are indexed by d without a particular ordering. Note: We use A.conjTranspose as the argument to isHermitian_mul_conjTranspose_self so that the underlying Hermitian matrix is A† * A (matching the convention in schattenNorm).

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Finset BigOperators Matrix in
variable {d : Type*} [Fintype d] [DecidableEq d] in
noncomputable def singularValues (A : Matrix d d ℂ) : d → ℝ
Defined in
QuantumInfo, `singularValues`
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
none listed
Used by 13

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 singular values of a square complex matrix `A`, defined as the square roots of the eigenvalues of `A†A`. These are indexed by `d` without a particular ordering. Note: We use `A.conjTranspose` as the argument to `isHermitian_mul_conjTranspose_self` so that the underlying Hermitian matrix is `A† * A` (matching the convention in `schattenNorm`). -/
noncomputable def singularValues (A : Matrix d d ℂ) : d → ℝ :=
  fun i => Real.sqrt ((isHermitian_mul_conjTranspose_self A.conjTranspose).eigenvalues i)
See it in the graphDiscuss this resultChallenge it