eq55 56 no new constraint
ProvedQAlgorithms.Papers.Independent.Support50.P15.eq55to56NoNewConstraintLet and . The sharp bound satisfies
with equality exactly at and , and strict inequality throughout the interior. This is the new numerical observation explaining why the bound adds no constraint to the standard mutual-information identities . Those identities are background. The repeated in the source prose is corrected by the displayed Eq. (55).
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)
/-- Numerical observation after (55)--(56), PDF p.16. The prose MI typo is not redefined:
the correct identity uses S(A)+S(B)-S(AB), as the displayed equations require. -/
theorem eq55to56NoNewConstraint {d : ℕ} (hd : 2 ≤ d) (delta : ℝ)
(hdelta : delta ∈ Set.Icc (-Real.log d) 0) :
tightBound d delta ≤ (-delta : ℝ) ∧
(tightBound d delta = (-delta : ℝ) ↔ delta = -Real.log d ∨ delta = 0) ∧
(delta ∈ Set.Ioo (-Real.log d) 0 → tightBound d delta < (-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
Let be a natural number and let the real number satisfy . Using natural logarithms and , put , , and define the extended real number
where if , if , and otherwise; the infimum of an empty set is . Then , equality holds if and only if or , and whenever , the strict inequality holds. The real number is embedded into the extended reals in these comparisons.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.