Matrix.PosSemidef.le_smul_one_of_eigenvalues_iff
theoremverifiedformalizationimported Lean
Matrix.PosSemidef.le_smul_one_of_eigenvalues_iff
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open Matrix Matrix.PosSemidef in open BigOperators in variable {n π : Type*} in variable [RCLike π] [DecidableEq n] in open scoped ComplexOrder MatrixOrder in open scoped ComplexOrder in open scoped MatrixOrder in variable {n m π : Type*} in variable [Fintype n] [Fintype m] [RCLike π] [DecidableEq m] in variable {A : Matrix n n π} {B : Matrix n n π} in variable (hA : A.IsHermitian) (hB : B.IsHermitian) in variable [DecidableEq n] in theorem Matrix.PosSemidef.le_smul_one_of_eigenvalues_iff (hA : A.IsHermitian) (c : β) : (β i, hA.eigenvalues i β€ c) β A β€ c β’ (1 : Matrix n n π)
- Formalizes
- QuantumInfo, `Matrix.PosSemidef.le_smul_one_of_eigenvalues_iff`
- Lean proof
- By Alex Meiburg, from github.com/leanprover-community/physlib at
e411c6e89692(Copyright (c) 2025 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.Matrix.PosSemidef.le_smul_one_of_eigenvalues_iff← Matrix.PosSemidef.le_smul_one_of_eigenvalues_iff (QuantumInfo/ForMathlib/Matrix.lean:420): verbatim
- Verified
- 17 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 4
- Matrix.PosSemidef.diagonal_monoMatrix.PosSemidef.diagonal_mono
- Matrix.PosSemidef.mul_mul_conjTranspose_monoMatrix.PosSemidef.mul_mul_conjTranspose_mono
- Matrix.PosSemidef.conjTranspose_mul_mul_monoMatrix.PosSemidef.conjTranspose_mul_mul_mono
- Matrix.PosSemidef.diagonal_le_iffMatrix.PosSemidef.diagonal_le_iff
- Used by 1
- HermitianMat.le_trace_smul_oneHermitianMat.le_trace_smul_one
Lean source view module on GitHub
set_option autoImplicit true in set_option relaxedAutoImplicit true in open Matrix Matrix.PosSemidef in open BigOperators in variable {n π : Type*} in variable [RCLike π] [DecidableEq n] in open scoped ComplexOrder MatrixOrder in open scoped ComplexOrder in open scoped MatrixOrder in variable {n m π : Type*} in variable [Fintype n] [Fintype m] [RCLike π] [DecidableEq m] in variable {A : Matrix n n π} {B : Matrix n n π} in variable (hA : A.IsHermitian) (hB : B.IsHermitian) in variable [DecidableEq n] in theorem Matrix.PosSemidef.le_smul_one_of_eigenvalues_iff (hA : A.IsHermitian) (c : β) : (β i, hA.eigenvalues i β€ c) β A β€ c β’ (1 : Matrix n n π) := by let U : Matrix n n π := βhA.eigenvectorUnitary have hU : U.conjTranspose = star U := by simp only [star] have hU' : U * star U = 1 := by simp only [SetLike.coe_mem, Unitary.mul_star_self_of_mem, U] have hc : c β’ (1 : Matrix n n π) = U * (c β’ 1) * U.conjTranspose := by simp only [Algebra.mul_smul_comm, mul_one, hU, Algebra.smul_mul_assoc, hU'] have hc' : c β’ (1 : Matrix n n π) = diagonal (RCLike.ofReal β fun _ : n β¦ c) := by ext i j simp only [smul_apply, one_apply, smul_ite, RCLike.real_smul_eq_coe_mul, mul_one, smul_zero, diagonal, Function.comp_apply, of_apply] have hAST : A = U * diagonal (RCLike.ofReal β hA.eigenvalues) * U.conjTranspose := by rw [hU] exact IsHermitian.spectral_theorem hA constructor Β· intro h rw [hc, hc', hAST] apply mul_mul_conjTranspose_mono apply diagonal_mono intro i simp only [Function.comp_apply, algebraMap_le_algebraMap, h i] intro hAc i replace hAc := conjTranspose_mul_mul_mono U hAc have hU'CT : star U * U = 1 := by simp only [SetLike.coe_mem, Unitary.star_mul_self_of_mem, U] have hcCT : U.conjTranspose * (c β’ 1) * U = c β’ (1 : Matrix n n π) := by simp only [Algebra.mul_smul_comm, mul_one, hU, Algebra.smul_mul_assoc, hU'CT] have hASTCT : U.conjTranspose * A * U = diagonal (RCLike.ofReal β hA.eigenvalues) := by rw [hU] convert IsHermitian.conjStarAlgAut_star_eigenvectorUnitary hA using 1 simp +zetaDelta rw [hcCT, hc', hASTCT, βdiagonal_le_iff] at hAc specialize hAc i simp only [Function.comp_apply, algebraMap_le_algebraMap] at hAc exact hAc