lemma15
ProvedQAlgorithms.Papers.Independent.Support50.P15.lemma15prove2quantum
For each integer , let and . Then
All inequalities are strict, including at where but . These provide computable upper and lower estimates for the optimal variance and relative-entropy constants.
Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P15
Formal statement
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)
/-- Lemma 15, Eqs. (85)--(86), PDF pp.23--24, with strict bounds also at d=2. -/
theorem lemma15 {d : ℕ} (hd : 2 ≤ d) :
(Real.log ((d : ℝ) - 1)) ^ 2 / 4 < maxVariance d ∧
maxVariance d < easyVariance d ∧ maxVariance d < (Real.log d) ^ 2 := by sorry
end QAlgorithms.Papers.Independent.Support50.P15
end
Source
Tight bound on relative entropy by entropy difference, arXiv:1304.0036v3, PDF p. 23, lemma15
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every natural number , using natural logarithms, define
Then all three strict inequalities hold:
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.