A Hermitian matrix dominates its smallest eigenvalue times the identity
ProvedQAlgorithms.Papers.Independent.Support50.P17.sub_minEigenvalue_smul_one_posSemidefprove2quantum
Let be a Hermitian matrix on a finite index set and let be its smallest eigenvalue. Then
This is the Rayleigh-quotient characterisation of the smallest eigenvalue, used to convert the hypothesis into the operator inequality .
Formalization Note is the frozen minEigenvalue (the first entry of the ascending eigenvalue list); on the empty index type the statement is trivial.
Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P17 noncomputable section open MeasureTheory open scoped Matrix ComplexOrder Matrix.Norms.L2Operator open QAlgorithms.Papers.Independent.Dependency50.P21 (IsSupported relativeEntropy)
Formal statement
namespace QAlgorithms.Papers.Independent.Support50.P17
attribute [local instance] Classical.propDecidable Classical.decEq
theorem sub_minEigenvalue_smul_one_posSemidef {I : Type*} [Fintype I] [DecidableEq I]
(A : Matrix I I ℂ) (hA : A.IsHermitian) :
(A - ((minEigenvalue A : ℝ) : ℂ) • (1 : Matrix I I ℂ)).PosSemidef := by sorry
end QAlgorithms.Papers.Independent.Support50.P17
end
Source
Horn--Johnson, Matrix Analysis (2nd ed.), Theorem 4.2.2 (Rayleigh--Ritz); used in Audenaert--Eisert, Continuity bounds on the quantum relative entropy - II, arXiv:1105.2656v3, proof of Corollary 1 (PDF p. 9), via sigma >= beta I