Common-cause classical laws have zero CMI
ProvedQAlgorithms.Papers.Independent.Gap48.P19.commonCause_zeroLet be finite nonempty alphabets. Let be a probability law on , and let and be probability kernels, normalized for every . Define . With Shannon entropy in nats and the nonnegative convention for conditional mutual information,
Zero probabilities and zero mixture weights are allowed. This is the common-cause construction used in the classical comparison.
import Definitions.Def_QAlgorithms_Papers_Independent_Gap48_P19
namespace QAlgorithms.Papers.Independent.Gap48.P19
open scoped ComplexConjugate Matrix
open QAlgorithms.Papers.Independent.Information100.P75 (Mat)
open QAlgorithms.Papers.Independent.Information100.P56 (IsLaw)
noncomputable section
attribute [local instance] Classical.propDecidable Classical.decEq
/-- PDF p.3, (5): normalized common-cause laws have zero CMI.
The corrected CMI sign is documented in the module preamble. -/
theorem commonCause_zero {A B L : Type} [Fintype A] [Fintype B] [Fintype L]
[Nonempty A] [Nonempty B] [Nonempty L]
(w : L → ℝ) (ka : L → A → ℝ) (kb : L → B → ℝ)
(hw : IsLaw w) (ha : IsKernel ka) (hb : IsKernel kb) :
extensionClassicalCMI (commonCause w ka kb) = 0 := by sorry
end
end QAlgorithms.Papers.Independent.Gap48.P19
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For finite nonempty types , let , , and . Assume and , and assume that, for each , the values are nonnegative and sum to one over , and the values are nonnegative and sum to one over . Set , with marginals , , and . Then , where , using natural logarithms and . Zero weights and zero kernel entries are permitted.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.