Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Data processing on the conditioning system

Proved
QAlgorithms.Papers.Independent.Support50.P23.alphaDataProcessing

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

prove2quantum

Let ρAB\rho_{AB}ρAB​ and σB\sigma_BσB​ be normalized finite-dimensional states and E:B→C\mathcal E:B\to CE:B→C a trace-preserving completely positive map. Put τAC=(idA⊗E)(ρAB)\tau_{AC}=(\mathrm{id}_A\otimes\mathcal E)(\rho_{AB})τAC​=(idA​⊗E)(ρAB​) and ωC=E(σB)\omega_C=\mathcal E(\sigma_B)ωC​=E(σB​). For every α∈[0,2]\alpha\in[0,2]α∈[0,2],

Hα(A∣B)ρ∣σ≤Hα(A∣C)τ∣ω.H_\alpha(A|B)_{\rho|\sigma}\le H_\alpha(A|C)_{\tau|\omega}.Hα​(A∣B)ρ∣σ​≤Hα​(A∣C)τ∣ω​.

The channel acts on arbitrary entangled inputs through its blockwise identity extension. Thus processing the side information cannot decrease this conditional entropy.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P23
Formal statement
noncomputable section

open Filter

open scoped ENNReal ComplexConjugate ComplexOrder

namespace QAlgorithms.Papers.Independent.Support50.P23

attribute [local instance] Classical.propDecidable

-- Exact accepted bodies. Other similarly named catalogue entries use different
-- smoothing, conditioning order, logarithm base, or channel-level objects.

open QAlgorithms.Papers.Independent.Gap20.P03 (fixedMin)

open QAlgorithms.Papers.Independent.Dependency50.P36 (relativeEntropy)

open QAlgorithms.Papers.Independent.Information100.P67 (IsSubnormalized)

open QAlgorithms.Papers.Independent.Information100.P69 (matrixPower)

variable {A B C D I : Type*}

variable [Fintype A] [Fintype B] [Fintype C] [Fintype D] [Fintype I]

variable [DecidableEq A] [DecidableEq B] [DecidableEq C] [DecidableEq D] [DecidableEq I]

/-- Lemma 5, PDF p.4, (20): processing B cannot decrease entropy; includes 0,1,2. -/
theorem alphaDataProcessing [Nonempty A] [Nonempty B] [Nonempty C]
    (rho : Matrix (A × B) (A × B) ℂ) (sigma : Matrix B B ℂ)
    (hrho : IsDensityMatrix rho) (hsigma : IsDensityMatrix sigma)
    (E : Superop B C) (hE : IsChannel E) (alpha : ℝ≥0∞) (halpha : alpha ≤ 2) :
    alphaEntropy rho sigma alpha ≤
      alphaEntropy (idTensorSuperop (R := A) E rho) (E sigma) alpha := by sorry

end QAlgorithms.Papers.Independent.Support50.P23

end
Source
A Fully Quantum Asymptotic Equipartition Property, arXiv:0811.1221v3, PDF p. 4, Lemma 5: data processing on conditioning system
Read-back

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

Let A,B,CA,B,CA,B,C be finite, nonempty index types with decidable equality, and let ρ\rhoρ on A×BA\times BA×B and σ\sigmaσ on BBB be positive semidefinite complex matrices of trace one. Let E\mathcal EE be a map from complex matrices on BBB to those on CCC having a finite Kraus representation E(X)=∑jKjXKj†\mathcal E(X)=\sum_jK_jXK_j^\daggerE(X)=∑j​Kj​XKj†​ for every matrix XXX, with ∑jKj†Kj=IB\sum_jK_j^\dagger K_j=I_B∑j​Kj†​Kj​=IB​. For any bipartite matrix ω\omegaω and reference η\etaη, put Q=I⊗ηQ=I\otimes\etaQ=I⊗η; define H1(ω,η)=Re⁡tr⁡[ωlog⁡2Q]+S(ω)H_1(\omega,\eta)=\operatorname{Re}\operatorname{tr}[\omega\log_2Q]+S(\omega)H1​(ω,η)=Retr[ωlog2​Q]+S(ω) when ker⁡Q⊆ker⁡ω\ker Q\subseteq\ker\omegakerQ⊆kerω, and −∞-\infty−∞ otherwise, where 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). For positive real t≠1t\ne1t=1, set Ht=−∞H_t=-\inftyHt​=−∞ if t>1t>1t>1 and that support condition fails, and otherwise set Ht=(1−t)−1L(Re⁡tr⁡[ωtgt(Q)])H_t=(1-t)^{-1}L(\operatorname{Re}\operatorname{tr}[\omega^t g_t(Q)])Ht​=(1−t)−1L(Retr[ωtgt​(Q)]), with gt(0)=0g_t(0)=0gt​(0)=0, gt(x)=x1−tg_t(x)=x^{1-t}gt​(x)=x1−t otherwise, L(0)=−∞L(0)=-\inftyL(0)=−∞, and L(x)=log⁡2xL(x)=\log_2xL(x)=log2​x otherwise; matrix functions use continuous functional calculus. Set H0=sup⁡t>0HtH_0=\sup_{t>0}H_tH0​=supt>0​Ht​ and H∞=inf⁡t>0HtH_\infty=\inf_{t>0}H_tH∞​=inft>0​Ht​. For every α∈[0,+∞]\alpha\in[0,+\infty]α∈[0,+∞] satisfying α≤2\alpha\le2α≤2,

Hα(ρ,σ)≤Hα ⁣((id⁡A⊗E)(ρ), E(σ)),H_\alpha(\rho,\sigma)\le H_\alpha\!\left((\operatorname{id}_A\otimes\mathcal E)(\rho),\,\mathcal E(\sigma)\right),Hα​(ρ,σ)≤Hα​((idA​⊗E)(ρ),E(σ)),

where the extended map applies E\mathcal EE separately to each BBB-matrix block indexed by a pair of AAA-indices. The range of orders includes zero and two and excludes +∞+\infty+∞.

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

    Confirmed by the moderator at approval.

  • Endorsed by Goku · Oct 24, 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