Small-rate classical exponent agrees with the compact quantum formula
ProvedQAlgorithms.Papers.Independent.Gap48.P41.classical_local_dualityLet be a nonempty finite alphabet, and let be probability distributions on , allowing zero coordinates. Write for natural-log Kullback–Leibler divergence, with zero mass contributing zero and support failure giving . For real , put
A zero gives zero tilted mass, and inverse powers act only on positive support. The finite rate condition entails . Define
where the infimum ranges over all probability distributions. The second divergence is finite for every feasible law; the first may be infinite.
Suppose and . Then
with the maximum attained at . Equivalently, for diagonal density matrices and , this value equals , the paper's compact Petz expression (15).
This pins the small-rate comparison by an explicit source-derived tilt condition and does not extend it to arbitrary rates.
import Definitions.Def_QAlgorithms_Papers_Independent_Gap48_P41
noncomputable section
namespace QAlgorithms.Papers.Independent.Gap48.P41
open scoped Matrix ComplexOrder BigOperators
open Filter QAlgorithms
open QAlgorithms.Papers.Independent.Information100.P60 (Mat copies)
open QAlgorithms.Papers.Independent.Information100.P71 (supportPower)
open QAlgorithms.Papers.Independent.Information100.P07 (positiveProjection)
open QAlgorithms.Papers.Independent.Dependency50.P28
(tr SupportLE relativeEntropy scalarPower classicalD typeI accept TestSequence
scaled logNonnegativeExtended)
open QAlgorithms.Papers.Independent.Claimed50.P15 (legendre)
open QAlgorithms.Papers.Independent.Information100.P56 (IsLaw)
attribute [local instance] Classical.propDecidable Classical.decEq
variable {I : Type} [Fintype I] [DecidableEq I]
variable {X : Type} [Fintype X]
/-- PDF pp.7--9: the small-rate classical exponent equals the compact [0,1]
formula, with an attained maximum. The source's vague 'sufficiently small' is
pinned by a matching tilt with 0<t<=1; the diagonal quantum comparison is explicit. -/
theorem classical_local_duality [Nonempty X] [DecidableEq X]
(p q : X → ℝ) (hp : IsLaw p) (hq : IsLaw q) (r t : ℝ)
(hr : classicalD (.finite 1 (by norm_num)) p q < (r : EReal)) (ht0 : 0 < t) (ht1 : t ≤ 1)
(hlevel : classicalD (.finite 1 (by norm_num)) (tilt p q t) q = (r : EReal)) :
classicalMinimum p q r = (classicalG p q r t : EReal) ∧
IsGreatest (classicalG p q r '' Set.Icc 0 1) (classicalG p q r t) ∧
classicalMinimum p q r =
(petzExponent (Matrix.diagonal (fun x => (p x : ℂ)))
(Matrix.diagonal (fun x => (q x : ℂ))) r : EReal) := by sorry
end QAlgorithms.Papers.Independent.Gap48.P41
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be a finite, nonempty set with decidable equality, and let be nonnegative functions each summing to . Define when wherever , and otherwise. All logarithms are natural. Set for and for , even for zero or negative exponents, and define , , and . Suppose satisfy , , and . Let be the extended-real infimum of over all nonnegative summing to with . Put and , regarded as complex matrices; for a positive semidefinite matrix , let mean spectral functional calculus with the function equal to for and at . Define
Then , the real number belongs to and is its greatest element, and , with real quantities embedded in the extended reals. Zero entries of and are allowed, but requires wherever ; the exact-level hypothesis need not be satisfiable, and is impossible when .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.