Properties of the sharp entropy-difference bound
OpenQAlgorithms.Papers.Independent.Support50.P15.theorem2For finite , let be the constrained binary-relative-entropy minimum of Eq. (6), and . The function is nonnegative, continuous in the extended order topology and strictly convex on , and its finite restriction is continuously differentiable in the interior. Its endpoint values are
It is finite on . One has and . For every real and every real , using the empty-feasible-set extension of ,
On the entropy interval one also has . These provide explicit lower bounds without optimizing the scalar pair.
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)
/-- Theorem 2, PDF p.4; empty-feasible-set extension of (11) on p.21.
Continuity is extended-real continuity; differentiability uses only the finite interior. -/
theorem theorem2 (d : ℕ) (hd : 2 ≤ d) :
(∀ delta ∈ Set.Icc (-Real.log d) (Real.log d), 0 ≤ tightBound d delta) ∧
ContinuousOn (tightBound d) (Set.Icc (-Real.log d) (Real.log d)) ∧
(∀ x ∈ Set.Icc (-Real.log d) (Real.log d),
∀ y ∈ Set.Icc (-Real.log d) (Real.log d), x ≠ y →
∀ t ∈ Set.Ioo (0 : ℝ) 1,
tightBound d ((1 - t) * x + t * y) <
((1 - t : ℝ) : EReal) * tightBound d x + (t : EReal) * tightBound d y) ∧
ContDiffOn ℝ 1 (fun x => (tightBound d x).toReal) (Set.Ioo (-Real.log d) (Real.log d)) ∧
tightBound d 0 = 0 ∧ tightBound d (-Real.log d) = (Real.log d : ℝ) ∧
tightBound d (Real.log d) = ⊤ ∧
(∀ delta ∈ Set.Ico (-Real.log d) (Real.log d), tightBound d delta < ⊤) ∧
0 < maxVariance d ∧ maxVariance d < easyVariance d ∧ maxVariance d < (Real.log d) ^ 2 ∧
(∀ n : ℝ, maxVariance d ≤ n → ∀ delta : ℝ,
(exponentialBound n delta : EReal) ≤ tightBound d delta ∧
cubicBound n delta ≤ exponentialBound n delta) ∧
(∀ delta ∈ Set.Icc (-Real.log d) (Real.log d),
(delta ^ 2 / (3 * (Real.log d) ^ 2) : ℝ) ≤ tightBound d delta) := by sorry
end QAlgorithms.Papers.Independent.Support50.P15
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every natural number , define
where , when , when and , and otherwise; the infimum is extended-real and is for an empty feasible set. All logarithms are natural and . Also put
The theorem asserts that is nonnegative and continuous on , with continuity understood in the extended-real topology; for every distinct in that interval and every ,
using extended-real arithmetic. It further asserts that the real-valued function obtained by converting to a real number is continuously differentiable on ; this conversion assigns to either infinity. The specified values and finiteness are
Finally,
for every real and every real , both and hold; and for every ,
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.