eq34 36
OpenQAlgorithms.Papers.Independent.Support50.P15.eq34to36Let , , and let be normalized full-rank states on the fixed support of the thermodynamic section. Set and . Then
The middle step is the comparison with times the value at the average of the individual differences; the sum also equals times its arithmetic mean. Consequently , with , requires . This keeps the relative-entropy argument order and the exact necessary step bound, correcting the direction of the source's informal big-O sentence.
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. (34)--(36), PDF pp.11--12, on the fixed support of the thermodynamic section.
The sign is -DeltaS. The p.12 prose k=O(1/epsilon) has the wrong direction;
the last clause instead states the exact necessary lower bound supplied by (36). -/
theorem eq34to36 {d k : ℕ} (hd : 2 ≤ d) (hk : 0 < k) (a : Fin (k + 1) → EntropyState d)
(ha : ∀ j, fullRank (a j).val) :
let ds := entropy (a (Fin.last k)).val - entropy (a 0).val
let total := ∑ j : Fin k, stateRelativeNats (a j.castSucc) (a j.succ)
let terms := ∑ j : Fin k, tightBound d (difference (a j.castSucc).val (a j.succ).val)
terms ≤ total ∧
terms = (k : EReal) * ∑ j : Fin k,
(((1 / (k : ℝ)) : ℝ) : EReal) * tightBound d (difference (a j.castSucc).val (a j.succ).val) ∧
(k : EReal) * tightBound d (∑ j : Fin k,
difference (a j.castSucc).val (a j.succ).val / k) ≤ terms ∧
(k : EReal) * tightBound d (∑ j : Fin k,
difference (a j.castSucc).val (a j.succ).val / k) =
(k : EReal) * tightBound d (-ds / k) ∧
(ds ^ 2 / ((k : ℝ) * (3 * (Real.log d) ^ 2)) : ℝ) ≤
(k : EReal) * tightBound d (-ds / k) ∧
(∀ e > 0, total ≤ (e : EReal) → ds ^ 2 / (3 * (Real.log d) ^ 2 * e) ≤ (k : ℝ)) := 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 all natural and , let be positive semidefinite complex matrices of trace , each with zero kernel. Write , with spectral functional calculus and . Define if , and otherwise . Set , , and
where if , if , and otherwise; an empty feasible set has extended-real infimum . Put , , , and . Then, with sums and products involving interpreted in the extended reals,
For every real , if , then .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.