Lemma 9 low-rate branch (A9), corrected (A20)–(A21)
OpenQAlgorithms.Papers.Independent.Intakenext100.P20.low_rate_variationalLet be a normalized density matrix on a complex space of dimension , with decreasing eigenvalues . Suppose the top eigenvalue has multiplicity , so . For set and . Write for Shannon or von Neumann entropy in nats and for classical or quantum relative entropy, with value on support violation. Then
Here ranges over all probability vectors of length , and over all normalized density matrices on the same space. Every minimum and the displayed maximum is attained; the final supremum need not be. This gives the low-rate variational formulas without inverse-tilt or full-rank hypotheses.
Source correction. Equation (A20) prints . Its missing minus is fixed by (A9) and the attaining-state calculation on PDF p.9; the correction was independently checked in moderation round 1; a fresh no-edit round is required after this round’s repairs.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P20
noncomputable section
open scoped Matrix ENNReal ComplexOrder Topology
namespace QAlgorithms.Papers.Independent.Intakenext100.P20
open QAlgorithms.Papers.Independent.Information100.P08 (IsPure)
open QAlgorithms.Papers.Independent.Information100.P47 (IsProbability)
open QAlgorithms.Papers.Independent.Information100.P53 (SpectralData)
open QAlgorithms.Papers.Independent.Gap48.P19 (shannonNats)
open QAlgorithms.Papers.Independent.Dependency50.P28 (classicalD)
attribute [local instance] Classical.propDecidable
/-- Lemma 9, PDF pp.8-9, low-rate (A9), (A18)-(A21).
Correction: (A20) prints log a1-R; (A9) and the p.9 attaining-state calculation
uniquely give -log a1-R. No full-rank assumption or inverse tilt is used.
Every minimum is stated as an attained least value; the s>=1 expression is a supremum. -/
theorem low_rate_variational {d : ℕ} (hd : 0 < d)
(rho : {M : Matrix (Fin d) (Fin d) ℂ // IsDensityMatrix M})
(spectral : SpectralData rho.val) (k : ℕ) (hk : 0 < k) (hkd : k < d)
(htop : ∀ i : Fin d, i.val < k → spectral.value i = spectral.value ⟨0, hd⟩)
(hgap : spectral.value ⟨k, hkd⟩ < spectral.value ⟨0, hd⟩)
(R : ℝ) (hR : 0 ≤ R) (hRk : R ≤ Real.log (k : ℝ)) :
let a := spectral.value
let value := ENNReal.ofReal (-Real.log (a ⟨0, hd⟩) - R)
IsLeast (classicalDValues a (fun h => h = R)) value ∧
IsLeast (quantumDValues rho (fun h => h = R)) value ∧
IsLeast (classicalDValues a (fun h => h ≤ R)) value ∧
IsLeast (quantumDValues rho (fun h => h ≤ R)) value ∧
IsLeast (classicalDValues a (fun h => R ≤ h)) 0 ∧
IsLeast (quantumDValues rho (fun h => R ≤ h)) 0 ∧
IsGreatest {v : ℝ | ∃ s : ℝ, 0 < s ∧ s ≤ 1 ∧
v = ((1 - s) * R - logPowerTrace rho.val s) / s} 0 ∧
(⨆ s : {s : ℝ // 1 ≤ s},
ENNReal.ofReal (((1 - s.val) * R - logPowerTrace rho.val s.val) / s.val)) = value := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P20
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be a natural number, let be positive semidefinite with trace , and suppose supplied spectral data consist of real numbers and an orthonormal basis of satisfying . Let be a natural number with , assume whenever and , and let satisfy , using natural logarithms. For a probability vector , meaning and , put , and define
For every density matrix , put , where , and define
with the matrix functions defined by functional calculus and . Let , viewed in . Then is the least element of each of the four sets of divergence values obtained from with , from with , and from the same two divergences with the corresponding entropy condition replaced by entropy at most . The least element is for each of the two sets with entropy at least ; these least-element assertions include attainment. Finally, writing , with powers defined by functional calculus, is the greatest element of
and
The assumptions allow , in which case .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.