Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Remark II.6: average monotonicity under public local instruments

Open
QAlgorithms.Papers.Independent.Intakenext100.P47.publicInstruments_average_monotonicity

by Gohan · Oct 31, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let ρAB\rho_{AB}ρAB​ be a density matrix on arbitrary finite nonzero complex spaces. Consider any finite adaptive protocol in which, at each node, either Alice or Bob applies a finite rectangular quantum instrument and publicly announces its outcome. Arbitrary finite local dimensions, private Kraus multiplicities, and choices depending on earlier messages are allowed. Write ptp_tpt​ for the probability of a full transcript ttt and ρt\rho_tρt​ for its normalized final state when pt>0p_t>0pt​>0. Then

∑t:pt>0ptI(At:Bt)ρt≤I(A:B)ρ.\sum_{t:p_t>0}p_t I(A_t:B_t)_{\rho_t}\le I(A:B)_\rho.t:pt​>0∑​pt​I(At​:Bt​)ρt​​≤I(A:B)ρ​.

For one instrument this is ∑i:pi>0piI(A′:B)ρi≤I(A:B)ρ\sum_{i:p_i>0}p_iI(A':B)_{\rho_i}\le I(A:B)_\rho∑i:pi​>0​pi​I(A′:B)ρi​​≤I(A:B)ρ​, with the analogous statement when Bob acts. Zero branches contribute zero without normalization. Thus the theorem retains both the one-step inequality and its finite iteration, counting correlations conditional on the public transcript.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P47
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Intakenext100.P47

open QAlgorithms Filter

open QAlgorithms.Papers.Independent.Gap48.P20 (Copies localProduct)

open QAlgorithms.Papers.Independent.Dependency50.P19 (mutualInformation first)

open QAlgorithms.Papers.Independent.Dependency50.P45 (entropyExchange)

open QAlgorithms.Papers.Independent.Information100.P27 (shannon Config)

open QAlgorithms.Papers.Independent.Information100.P71 (channelPower)

open QAlgorithms.Papers.Independent.Advance50.P05 (RectangularInstrument)

open scoped Matrix ComplexConjugate

attribute [local instance] Classical.propDecidable Classical.decEq

/-- PDF pp.5--6, Remark II.6: public local instruments decrease total correlation on
average, including every finite iteration. A one-node tree is the inequality (13). -/
theorem publicInstruments_average_monotonicity (a b : ℕ) (ha : 0 < a) (hb : 0 < b)
    (rho : Matrix (Fin a × Fin b) (Fin a × Fin b) ℂ) (hrho : IsDensityMatrix rho)
    (P : PublicProtocol a b) : P.average rho ≤ mutualInformation rho := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P47

end
Source
On the quantum, classical and total amount of correlations in a quantum state, arXiv:quant-ph/0410091v2, PDF p. 5, Remark II.6: average monotonicity under public local instruments
Read-back

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

For all positive natural dimensions a,ba,ba,b, every positive semidefinite trace-one complex matrix ρ\rhoρ on {0,…,a−1}×{0,…,b−1}\{0,\ldots,a-1\}\times\{0,\ldots,b-1\}{0,…,a−1}×{0,…,b−1}, and every finite protocol tree PPP built from stop nodes and local rectangular instruments with outcome-dependent continuations, the recursively defined value P.average(ρ)P.\mathrm{average}(\rho)P.average(ρ) is at most

I(ρ)=S(Tr⁡Bρ)+S(Tr⁡Aρ)−S(ρ).\mathcal I(\rho)=S(\operatorname{Tr}_B\rho)+S(\operatorname{Tr}_A\rho)-S(\rho).I(ρ)=S(TrB​ρ)+S(TrA​ρ)−S(ρ).

Here S(X)=−Re⁡tr⁡[(x↦xlog⁡2x)(X)]S(X)=-\operatorname{Re}\operatorname{tr}[(x\mapsto x\log_2x)(X)]S(X)=−Retr[(x↦xlog2​x)(X)], using continuous functional calculus. At each instrument node, its finitely many Kraus matrices KxjK_{xj}Kxj​ have a common positive local output dimension and satisfy ∑x,jKxj†Kxj=I\sum_{x,j}K_{xj}^\dagger K_{xj}=I∑x,j​Kxj†​Kxj​=I; the branch matrix is ωx=∑j(Kxj⊗I)ρ(Kxj⊗I)†\omega_x=\sum_j(K_{xj}\otimes I)\rho(K_{xj}\otimes I)^\daggerωx​=∑j​(Kxj​⊗I)ρ(Kxj​⊗I)† for Alice, or the analogous expression with I⊗KxjI\otimes K_{xj}I⊗Kxj​ for Bob. The recursive value sums pxPx.average(ωx/px)p_x P_x.\mathrm{average}(\omega_x/p_x)px​Px​.average(ωx​/px​) over branches with px=Re⁡tr⁡ωx>0p_x=\operatorname{Re}\operatorname{tr}\omega_x>0px​=Retrωx​>0, assigns zero to the other branches, and uses I\mathcal II at every stop node. The assertion includes the protocol that stops immediately and places no upper bound on the tree depth or number of outcomes.

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

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Oct 31, 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