lemma14
OpenQAlgorithms.Papers.Independent.Support50.P15.lemma14prove2quantum
For finite and , let be Eq. (6) and be the maximum of for . Then
The prefactor multiplies the whole parenthesis, and the infinite right endpoint of remains in the domain. This provides the optimal-parameter exponential lower bound used in Theorem 2.
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 14, Eq. (81), PDF p.23. N(d) multiplies the whole parenthesis. -/
theorem lemma14 {d : ℕ} (hd : 2 ≤ d) (delta : ℝ)
(hdelta : delta ∈ Set.Icc (-Real.log d) (Real.log d)) :
(exponentialBound (maxVariance d) delta : EReal) ≤ tightBound d delta := by sorry
end QAlgorithms.Papers.Independent.Support50.P15
end
Source
Tight bound on relative entropy by entropy difference, arXiv:1304.0036v3, PDF p. 23, lemma14
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be a natural number and let , including both endpoints. Using natural logarithms, define
Let , with , put , and define
where when , when , and otherwise; an empty infimum is . Then
where the real expression on the left is embedded into the extended reals.
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.