Corollary A.18: For arbitrary joint classical P(x1,…,xn) and conditional product outputs tensor_k W_k(xk), I(X1…Xn:Y1…Yn)≤sum_k I(Xk:Yk).
OpenQAlgorithms.Papers.Independent.Renew46.P43.correlatedInputInformationLet finite classical alphabets carry an arbitrary JOINT probability law . Conditional on the tuple, output on finite intrinsic systems . Every is normalized; independence of the classical coordinates is not required. Information is evaluated in this actual cq state.
This is the source result with its stated operational or information-theoretic domain.
import Definitions.Def_QAlgorithms_Papers_Independent_Renew46_P43
noncomputable section
namespace QAlgorithms.Papers.Independent.Renew46.P43
open scoped BigOperators Matrix ComplexConjugate ComplexOrder ENNReal Matrix.Norms.L2Operator
open Filter MeasureTheory
open QAlgorithms.Papers.Independent.Information100.P08 (IsPure)
open QAlgorithms.Papers.Independent.Information100.P06 (Below)
open QAlgorithms.Papers.Independent.Information100.P60 (copies relativeBits)
open QAlgorithms.Papers.Independent.Dependency50.P19 (count both)
open QAlgorithms.Papers.Independent.Information100.P22 (coherentInformation)
attribute [local instance] Classical.propDecidable Classical.decEq
open QAlgorithms.Papers.Independent.Claimed50.P40 (InBlocks)
attribute [local instance] QAlgorithms.Papers.Independent.Renew46.P43.matrixMeasurableSpace
/-- Corollary A.18, PDF p.74. Arbitrary correlated classical P is allowed; only
outputs conditioned on the whole input tuple factor over k. The entropy differences
are the mutual informations of the explicitly given cq channel state. -/
theorem correlatedInputInformation {n : ℕ} (a : Fin n → ℕ) (ha : ∀ i, 0 < a i)
(Y : Fin n → IntrinsicSystem) (P : PMF (∀ i, Fin (a i)))
(W : ∀ i, Fin (a i) → Matrix (Fin (Y i).dim) (Fin (Y i).dim) ℂ)
(hW : ∀ i x, (Y i).IsState (W i x)) :
vnEntropy (∑ x, ((P x).toReal : ℂ) • wordTensor (fun i => W i (x i))) -
(∑ x, (P x).toReal * vnEntropy (wordTensor (fun i => W i (x i)))) ≤
∑ i, (vnEntropy (∑ x, ((P x).toReal : ℂ) • W i (x i)) -
∑ x, (P x).toReal * vnEntropy (W i (x i))) := by sorry
end QAlgorithms.Papers.Independent.Renew46.P43
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every , positive natural numbers for , systems with positive finite dimensions and natural-number block labels, and probability mass function on the tuples , let be positive semidefinite matrices of trace on , with entries zero between different -block labels. Set , interpreted as a real number, and define the matrix , indexed by tuples of basis indices, by
Writing , where is applied by continuous functional calculus, the assertion is
The joint law is arbitrary; its coordinates need not be independent. When , there is one empty input tuple, each empty tensor product is the scalar matrix , and both sides are zero.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.