AFTD Auto-Formalizing Theoretical Domains

quadratic_form_le_singularValuesSorted_sq

theoremverifiedformalizationimported Lean

The quadratic form of A† A is bounded by (max singular value)² * ‖v‖².

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 quadratic_form_le_singularValuesSorted_sq {e : Type*} [Fintype e] [DecidableEq e]
    (A : Matrix e e ℂ) (h : 0 < Fintype.card e) (v : e → ℂ) :
  Complex.re (star v ⬝ᵥ (A.conjTranspose * A).mulVec v) ≤
    (singularValuesSorted A ⟨0, h⟩) ^ 2 * Complex.re (star v ⬝ᵥ v)
Formalizes
QuantumInfo, `quadratic_form_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
Used by 1
  • singularValuesSorted_mul_leThe largest singular value of a matrix product is at most the product of the largest singular values: σ₁(M * N) ≤ σ₁(M) * σ₁(N). This is…

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 quadratic form of `A† A` is bounded by (max singular value)² * ‖v‖². -/
lemma quadratic_form_le_singularValuesSorted_sq {e : Type*} [Fintype e] [DecidableEq e]
    (A : Matrix e e ℂ) (h : 0 < Fintype.card e) (v : e → ℂ) :
  Complex.re (star v ⬝ᵥ (A.conjTranspose * A).mulVec v) ≤
    (singularValuesSorted A ⟨0, h⟩) ^ 2 * Complex.re (star v ⬝ᵥ v) := by
  apply le_trans (IsHermitian.inner_le_sup_eigenvalue_mul_inner (Aᴴ * A) (by
    simp [Matrix.IsHermitian]) h v)
  apply_rules [mul_le_mul_of_nonneg_right, Finset.sup'_le]
  · intro i _
    convert! eigenvalue_le_singularValuesSorted_sq A h i using 1
    simp [Matrix.conjTranspose_conjTranspose]
  · simp [dotProduct]
    exact Finset.sum_nonneg fun _ _ => add_nonneg (mul_self_nonneg _) (mul_self_nonneg _)
See it in the graphDiscuss this resultChallenge it