Lemma 3: continuity of conditional entropy and mutual information
ProvedQAlgorithms.Papers.Independent.Gap48.P39.continuity_informationLet be positive trace-one density matrices on the same positive-dimensional finite bipartite system. Let and suppose their full trace-norm distance is at most . Then
Here is binary entropy, is the product dimension, , and , with actual partial traces and base-two von Neumann entropy. Both bounds include and singleton systems. These continuity estimates use the full norm, without a factor of one half.
import Definitions.Def_QAlgorithms_Papers_Independent_Gap48_P39
noncomputable section
open scoped BigOperators Matrix ComplexConjugate
namespace QAlgorithms.Papers.Independent.Gap48.P39
open QAlgorithms.Papers.Independent.Information100.P21 (Op)
open QAlgorithms.Papers.Independent.Information100.P03 (PureEnsemble)
open QAlgorithms.Papers.Independent.Claimed50.P08 (cqBlocks holevoInfo)
open QAlgorithms.Papers.Independent.Dependency50.P19 (both epr mutualInformation marginalRA marginalRB)
open QAlgorithms.Papers.Independent.Information100.P58 (Distribution)
open QAlgorithms.Papers.Independent.Information100.P67 (squaredFidelity conditionalEntropy groupedChannelPower)
attribute [local instance] Classical.propDecidable Classical.decEq
variable {A B C X T E : Type}
variable [Fintype A] [DecidableEq A] [Fintype B] [DecidableEq B]
variable [Fintype C] [DecidableEq C] [Fintype X] [DecidableEq X]
variable [Fintype T] [DecidableEq T] [Fintype E] [DecidableEq E]
/-- Lemma 3, PDF p.10: absolute differences; full trace norm and base-two logs. -/
theorem continuity_information [Nonempty A] [Nonempty B]
(rho sigma : Op (A × B)) (hr : IsDensityMatrix rho) (hs : IsDensityMatrix sigma)
(delta : ℝ) (h0 : 0 ≤ delta) (h1 : delta ≤ 1 / Real.exp 1)
(hclose : traceNorm (rho - sigma) ≤ delta) :
|conditionalEntropy rho - conditionalEntropy sigma| ≤
2 * binEntropy2 delta + 4 * delta * Real.logb 2 (Fintype.card (A × B)) ∧
|mutualInformation rho - mutualInformation sigma| ≤
3 * binEntropy2 delta + 6 * delta * Real.logb 2 (Fintype.card (A × B)) := by sorry
end QAlgorithms.Papers.Independent.Gap48.P39
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For nonempty finite types with decidable equality, let be positive semidefinite complex matrices on , each with trace . Define , with applied by continuous functional calculus, , , and . For every real satisfying and , both inequalities hold:
where , with . The trace-norm hypothesis has no factor of , and the endpoint is included.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.