eq48 51
OpenQAlgorithms.Papers.Independent.Support50.P15.eq48to51Let be a nonempty finite family of normalized dimensional states, set , , , and . The redundancy satisfies
Every displayed minimum, including the redundancy minimum, is attained in its stated domain. If Conjecture 12 holds in dimension , then also . This includes the quantum version explicitly asserted on p.15, while keeping that stronger bound conditional.
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P15
noncomputable section
attribute [local instance] Classical.propDecidable
open scoped Matrix ComplexConjugate ENNReal Matrix.Norms.L2Operator
open Filter MeasureTheory
namespace QAlgorithms.Papers.Independent.Support50.P15
open QAlgorithms.Papers.Independent.Information100.P56 (entropy)
/-- Eqs. (48)--(51), PDF pp.14--15: all minima are attained, and the stronger bound is conditional. -/
theorem eq48to51 {d m : ℕ} (hd : 2 ≤ d) (hm : 0 < m) (a : Fin m → EntropyState d) :
let lo := minEntropy a
let hi := sourceEntropyMaximum a
let q := fun s : ℝ => max (tightBound d (hi - s)) (tightBound d (lo - s))
let p := fun s : ℝ => (max (cubicBound (easyVariance d) (hi - s))
(cubicBound (easyVariance d) (lo - s)) : EReal)
let v := extendedDomainInfimum (Set.Icc lo hi) q
let u := extendedDomainInfimum (Set.Icc lo hi) p
(∃ b : EntropyState d, (⨆ j, stateRelativeNats (a j) b) = minimaxRedundancy a) ∧
attainsMinimum (Set.univ : Set (EntropyState d)) (fun b => entropyRadius a (entropy b.val)) ∧
attainsMinimum (Set.Icc (0 : ℝ) (Real.log d)) (entropyRadius a) ∧
attainsMinimum (Set.Icc lo hi) q ∧ attainsMinimum (Set.Icc lo hi) p ∧
extendedDomainInfimum (Set.univ : Set (EntropyState d)) (fun b => entropyRadius a (entropy b.val)) ≤ minimaxRedundancy a ∧
extendedDomainInfimum (Set.univ : Set (EntropyState d)) (fun b => entropyRadius a (entropy b.val)) =
extendedDomainInfimum (Set.Icc (0 : ℝ) (Real.log d)) (entropyRadius a) ∧
extendedDomainInfimum (Set.Icc (0 : ℝ) (Real.log d)) (entropyRadius a) = v ∧
u ≤ v ∧ (redundancyBound d (hi - lo) : EReal) ≤ u ∧
(asymmetryConjecture d → tightBound d (-(hi - lo) / 2) ≤ minimaxRedundancy a) := by sorry
end QAlgorithms.Papers.Independent.Support50.P15
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be natural numbers with and , and let , , be complex density matrices. Let denote all positive semidefinite matrices of trace , put , with , and write if , and otherwise , using spectral functional calculus with . Define , , and
where , and is when , when , and otherwise. Put
Real-valued expressions in these infima and comparisons are embedded into the extended reals, and empty extended-real infima equal . The assertion is that some satisfies ; the function attains its infimum over ; attains its infimum over ; and both and attain their infima over . Furthermore,
Finally, if for every , then . The family is nonempty because , and its states need not have full rank.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.