Lemma I.10: Under the printed positive contraction and sandwich hypotheses: (1−lambda)/mu2≤Tr Lambda≤1/mu1; eta-shadow trace≥(eta−sqrt(8lambda
ProvedQAlgorithms.Papers.Independent.Renew46.P43.shadowBoundLet be a normalized state, , and . Assume and . Let have .
This is the source result with its stated operational or information-theoretic domain.
import Definitions.Def_QAlgorithms_Papers_Independent_Renew46_P43
noncomputable section
namespace QAlgorithms.Papers.Independent.Renew46.P43
open scoped BigOperators Matrix ComplexConjugate ComplexOrder ENNReal Matrix.Norms.L2Operator
open Filter MeasureTheory
open QAlgorithms.Papers.Independent.Information100.P08 (IsPure)
open QAlgorithms.Papers.Independent.Information100.P06 (Below)
open QAlgorithms.Papers.Independent.Information100.P60 (copies relativeBits)
open QAlgorithms.Papers.Independent.Dependency50.P19 (count both)
open QAlgorithms.Papers.Independent.Information100.P22 (coherentInformation)
attribute [local instance] Classical.propDecidable Classical.decEq
/-- Lemma I.10, PDF p.13: the lower trace bound divides by mu2, upper by mu1.
The last clause applies when rho and Lambda commute. -/
theorem shadowBound {I : Type} [Fintype I] [DecidableEq I]
(rho L : Matrix I I ℂ) (hrho : IsDensityMatrix rho) (hL : IsEffect L)
(lambda mu1 mu2 : ℝ) (hlambda : 0 < lambda) (hmu1 : 0 < mu1) (hmu2 : 0 < mu2)
(hweight : effectProb rho L ≥ 1 - lambda)
(hlower : Below ((mu1 : ℂ) • L) (cfc Real.sqrt L * rho * cfc Real.sqrt L))
(hupper : Below (cfc Real.sqrt L * rho * cfc Real.sqrt L) ((mu2 : ℂ) • L)) :
(1 - lambda) / mu2 ≤ L.trace.re ∧ L.trace.re ≤ 1 / mu1 ∧
∀ (B : Matrix I I ℂ) (eta : ℝ), IsShadow rho B eta →
B.trace.re ≥ (eta - Real.sqrt (8 * lambda)) / mu2 ∧
(rho * L = L * rho → B.trace.re ≥ (eta - lambda) / mu2) := by sorry
end QAlgorithms.Papers.Independent.Renew46.P43
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be any finite set with decidable equality, let be complex matrices indexed by , assume that is positive semidefinite with , and assume that and are positive semidefinite. Let be strictly positive real numbers satisfying
where is obtained by continuous functional calculus and means is positive semidefinite. Then
Furthermore, for every complex matrix indexed by and every real , if and are positive semidefinite and , then
and, if additionally , then also
No upper bound on or restriction on is assumed. Although an empty is quantified over, its trace-one hypothesis cannot be satisfied.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.