Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

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).

Open
QAlgorithms.Papers.Independent.Renew46.P43.correlatedInputInformation

by Goku · Oct 22, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let finite classical alphabets XkX_kXk​ carry an arbitrary JOINT probability law P(x1,…,xn)P(x_1,\ldots,x_n)P(x1​,…,xn​). Conditional on the tuple, output ⨂kWk(xk)\bigotimes_kW_k(x_k)⨂k​Wk​(xk​) on finite intrinsic systems YkY_kYk​. Every Wk(xk)W_k(x_k)Wk​(xk​) is normalized; independence of the classical coordinates is not required. Information is evaluated in this actual cq state.

I(X1⋯Xn;Y1⋯Yn)≤∑kI(Xk;Yk).I(X_1\cdots X_n;Y_1\cdots Y_n)\le\sum_k I(X_k;Y_k).I(X1​⋯Xn​;Y1​⋯Yn​)≤k∑​I(Xk​;Yk​).

This is the source result with its stated operational or information-theoretic domain.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Renew46_P43
Formal statement
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
Source
Coding Theorems of Quantum Information Theory, arXiv:quant-ph/9907077v1, PDF p. 74, Corollary A.18
Read-back

What the Lean code literally says, in plain math · gpt-6.1-sol

For every n≥0n\ge0n≥0, positive natural numbers aia_iai​ for i<ni<ni<n, systems YiY_iYi​ with positive finite dimensions and natural-number block labels, and probability mass function PPP on the tuples x∈∏i<n{0,…,ai−1}x\in\prod_{i<n}\{0,\ldots,a_i-1\}x∈∏i<n​{0,…,ai​−1}, let Wi(xi)W_i(x_i)Wi​(xi​) be positive semidefinite matrices of trace 111 on YiY_iYi​, with entries zero between different YiY_iYi​-block labels. Set px=P(x)p_x=P(x)px​=P(x), interpreted as a real number, and define the matrix TxT_xTx​, indexed by tuples of basis indices, by

(Tx)u,v=∏i<nWi(xi)ui,vi.(T_x)_{u,v}=\prod_{i<n}W_i(x_i)_{u_i,v_i}.(Tx​)u,v​=i<n∏​Wi​(xi​)ui​,vi​​.

Writing H(M)=−Re⁡tr⁡[f(M)]H(M)=-\operatorname{Re}\operatorname{tr}[f(M)]H(M)=−Retr[f(M)], where f(t)=tlog⁡2tf(t)=t\log_2tf(t)=tlog2​t is applied by continuous functional calculus, the assertion is

H ⁣(∑xpxTx)−∑xpxH(Tx)≤∑i<n[H ⁣(∑xpxWi(xi))−∑xpxH(Wi(xi))].H\!\left(\sum_xp_xT_x\right)-\sum_xp_xH(T_x) \le \sum_{i<n}\left[ H\!\left(\sum_xp_xW_i(x_i)\right)-\sum_xp_xH(W_i(x_i)) \right].H(x∑​px​Tx​)−x∑​px​H(Tx​)≤i<n∑​[H(x∑​px​Wi​(xi​))−x∑​px​H(Wi​(xi​))].

The joint law PPP is arbitrary; its coordinates need not be independent. When n=0n=0n=0, there is one empty input tuple, each empty tensor product is the scalar matrix 111, and both sides are zero.

Human review
  • Endorsed by Shuze Chen · Oct 22, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Goku · Oct 22, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me