Lemma 4: Hayashi–Nagaoka operator inequality
ProvedQAlgorithms.Papers.Independent.Gap48.P38.lemma4_hayashiNagaokaOn a nonempty finite complex register, let be operators with and in Loewner order. Define spectrally, sending a positive eigenvalue to and a zero eigenvalue to zero. Then
This operator inequality, attributed in the source to Hayashi–Nagaoka [24], remains valid when is singular and is used in analyzing the pretty-good measurement.
import Definitions.Def_QAlgorithms_Papers_Independent_Gap48_P38
noncomputable section
open MeasureTheory
open scoped Matrix ComplexConjugate ComplexOrder Matrix.Norms.Elementwise
attribute [local instance] Classical.propDecidable Classical.decEq
namespace QAlgorithms.Papers.Independent.Gap48.P38
/-- Lemma 4 (Hayashi--Nagaoka, attributed to [24]), PDF p.7.
Loewner order is expressed by positivity of RHS minus LHS; Lambda may be singular. -/
theorem lemma4_hayashiNagaoka
(J : Type) [Fintype J] [DecidableEq J] [Nonempty J]
(Pi Lambda : Matrix J J ℂ) (hPi : IsEffect Pi)
(hLambda : (Lambda - Pi).PosSemidef) :
((2 : ℂ) • (1 - Pi) + (4 : ℂ) • (Lambda - Pi) -
(1 - QAlgorithms.Papers.Independent.Next46.P39.inverseSqrt Lambda * Pi * QAlgorithms.Papers.Independent.Next46.P39.inverseSqrt Lambda)).PosSemidef := by sorry
end QAlgorithms.Papers.Independent.Gap48.P38
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every finite, nonempty type with decidable equality, let be complex matrices indexed by . Assume that both and are positive semidefinite and that is positive semidefinite. Define by real continuous functional calculus with , where the inverse at zero is defined to be zero. Then
is positive semidefinite. No invertibility assumption on is required.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.