remark7
OpenQAlgorithms.Papers.Independent.Support50.P15.remark7For every fixed real entropy difference , sufficiently large finite dimensions admit the explicit states and with . There are a positive constant and an integer threshold , chosen before , such that for all these are normalized states and
Thus . Any real lower bound valid across all finite dimensions at this fixed difference is at most zero, and zero relative entropy is unattainable at a nonzero difference. Moreover, for and ,
strictly if . The cited infinite-dimensional Klein identity is background; this paper supplies finite-rank witnesses precluding a positive dimension-independent bound.
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)
/-- Remark 7, PDF pp.6--7: explicit witnesses, dimension limit and strict dimension monotonicity.
The infinite-Hilbert-space Klein identity cited there is background, not a new assertion here. -/
theorem remark7 :
(∀ delta : ℝ, ∃ c > 0, ∃ d0 : ℕ, 3 ≤ d0 ∧ ∀ d ≥ d0,
let t := delta / Real.log ((d : ℝ) - 1)
∃ ha : IsDensityMatrix (family d ((1 + t) / 2)),
∃ hb : IsDensityMatrix (family d ((1 - t) / 2)),
difference (family d ((1 + t) / 2)) (family d ((1 - t) / 2)) = delta ∧
stateRelativeNats ⟨family d ((1 + t) / 2), ha⟩ ⟨family d ((1 - t) / 2), hb⟩ ≤
(c * (2 * delta ^ 2 / (Real.log ((d : ℝ) - 1)) ^ 2) : ℝ)) ∧
(∀ delta : ℝ, Tendsto (fun d : ℕ => tightBound d delta) atTop (nhds 0)) ∧
(∀ d : ℕ, 2 ≤ d → ∀ a b : EntropyState d, difference a.val b.val ≠ 0 → 0 < stateRelativeNats a b) ∧
(∀ delta b : ℝ, (∀ d : ℕ, 2 ≤ d → ∀ a r : EntropyState d,
difference a.val r.val = delta → (b : EReal) ≤ stateRelativeNats a r) → b ≤ 0) ∧
(∀ d d' : ℕ, 2 ≤ d → d < d' → ∀ delta ∈ Set.Icc (-Real.log d) (Real.log d),
tightBound d' delta ≤ tightBound d delta ∧
(delta ≠ 0 → tightBound d' delta < 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
Use natural logarithms and , and define by spectral functional calculus. A density matrix is positive semidefinite with trace ; for such matrices define when , and otherwise . Let be diagonal with entry at index and entry elsewhere. Define , , and
where is if , if , and otherwise; the infimum is extended-real, with empty infimum . For every real , including , there exist a real and a natural number such that for every natural , on setting , both and are density matrices, their entropy difference in that order equals , and
For every fixed real , in the extended reals as natural . For every and every pair of -dimensional density matrices , implies . For every pair of reals , if for every and all -dimensional density matrices satisfying , then . Finally, for all natural with and every , , with strict inequality whenever . Definitions at initial dimensions use total real division and logarithms, including division by zero equal to and .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.