Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Remark III.3: entropy exchange is a reference-preserving noise-compression rate

Open
QAlgorithms.Papers.Independent.Intakenext100.P47.referencePreserving_compression

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

prove2quantum

Fix a density matrix ρAB\rho_{AB}ρAB​ on finite nonzero spaces and a coordinated local product-unitary map TTT. For every ϵ>0\epsilon>0ϵ>0 there exists n0≥1n_0\ge1n0​≥1 such that for every n≥n0n\ge n_0n≥n0​ there is a COLUR ensemble RnR_nRn​ with NnN_nNn​ actual product-unitary terms for which

log⁡2Nn≤n(Se(T,ρ)+ϵ),∥(idZ⊗Rn)(ψ)−(idZ⊗T⊗n)(ψ)∥1≤ϵ.\log_2N_n\le n\bigl(S_e(T,\rho)+\epsilon\bigr),\qquad\bigl\|(\mathrm{id}_Z\otimes R_n)(\psi)-(\mathrm{id}_Z\otimes T^{\otimes n})(\psi)\bigr\|_1\le\epsilon.log2​Nn​≤n(Se​(T,ρ)+ϵ),​(idZ​⊗Rn​)(ψ)−(idZ​⊗T⊗n)(ψ)​1​≤ϵ.

The error test holds for any finite purifying reference ZZZ and any normalized purification ψ\psiψ of the fixed source ρ⊗n\rho^{\otimes n}ρ⊗n; the ensemble is chosen before that purification. The tensor-power channel is evaluated on all matrix units. This gives the reference-preserving noise-compression meaning of entropy exchange for a fixed source.

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 p.7, Remark III.3: compression tested jointly with every finite purifying reference.
The approximating ensemble is chosen before the purification, not uniformly over other inputs. -/
theorem referencePreserving_compression {A B : Type} [Fintype A] [Fintype B]
    [Nonempty A] [Nonempty B] (rho : Matrix (A × B) (A × B) ℂ)
    (hrho : IsDensityMatrix rho) (T : COLUR A B) (eps : ℝ) (heps : 0 < eps) :
    ∃ n0 : ℕ, 0 < n0 ∧ ∀ n ≥ n0,
      ∃ R : COLUR (Copies A n) (Copies B n),
        Real.logb 2 R.count ≤ (n : ℝ) * (entropyExchange T.operation rho + eps) ∧
        ∀ (Z : Type) [Fintype Z] [Nonempty Z]
          (psi : EuclideanSpace ℂ (Z × (Copies A n × Copies B n))), IsState psi →
          traceLeft (pureDensity psi) = sourcePower rho n →
          traceNorm (idTensorSuperop R.operation (pureDensity psi) -
            idTensorSuperop (regroupedChannelPower T.operation n) (pureDensity psi)) ≤ eps := 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. 7, Remark III.3: entropy exchange is a reference-preserving noise-compression rate
Read-back

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

For any finite nonempty types A,BA,BA,B, density matrix ρ\rhoρ on A×BA\times BA×B, finite mixture T(X)=∑iwi(Ui⊗Vi)X(Ui⊗Vi)†\mathcal T(X)=\sum_iw_i(U_i\otimes V_i)X(U_i\otimes V_i)^\daggerT(X)=∑i​wi​(Ui​⊗Vi​)X(Ui​⊗Vi​)† with a positive number of terms, local unitaries, and nonnegative weights summing to 111, and real ε>0\varepsilon>0ε>0, there exists a positive integer n0n_0n0​ such that, for every natural number n≥n0n\ge n_0n≥n0​, there exists another finite mixture R\mathcal RR of paired local unitary conjugations on An×BnA^n\times B^nAn×Bn, with a positive number rrr of terms, satisfying

log⁡2r≤n(H((id⊗T)(∣ρ⟩⟨ρ∣))+ε).\log_2r\le n\left( H((\mathrm{id}\otimes\mathcal T)(|\sqrt\rho\rangle\langle\sqrt\rho|)) +\varepsilon\right).log2​r≤n(H((id⊗T)(∣ρ​⟩⟨ρ​∣))+ε).

For this same R\mathcal RR, every finite nonempty reference type ZZZ and every norm-one vector ψ\psiψ on Z×(An×Bn)Z\times(A^n\times B^n)Z×(An×Bn) whose partial trace over ZZZ equals ρn\rho_nρn​ satisfy

∥(idZ⊗R)(∣ψ⟩⟨ψ∣)−(idZ⊗Tn)(∣ψ⟩⟨ψ∣)∥1≤ε.\left\|(\mathrm{id}_Z\otimes\mathcal R)(|\psi\rangle\langle\psi|) -(\mathrm{id}_Z\otimes\mathcal T_n)(|\psi\rangle\langle\psi|)\right\|_1 \le\varepsilon.∥(idZ​⊗R)(∣ψ⟩⟨ψ∣)−(idZ​⊗Tn​)(∣ψ⟩⟨ψ∣)∥1​≤ε.

Here ρn\rho_nρn​ has entries ∏t<nρ(at,bt),(at′,bt′)\prod_{t<n}\rho_{(a_t,b_t),(a'_t,b'_t)}∏t<n​ρ(at​,bt​),(at′​,bt′​)​; Tn\mathcal T_nTn​ is the tensor power regrouped across AnA^nAn and BnB^nBn, whose matrix-unit coefficients are Tn(E(a,b),(a′,b′))(u,v),(u′,v′)=∏t<nT(E(at,bt),(at′,bt′))(ut,vt),(ut′,vt′)\mathcal T_n(E_{(a,b),(a',b')})_{(u,v),(u',v')}=\prod_{t<n}\mathcal T(E_{(a_t,b_t),(a'_t,b'_t)})_{(u_t,v_t),(u'_t,v'_t)}Tn​(E(a,b),(a′,b′)​)(u,v),(u′,v′)​=∏t<n​T(E(at​,bt​),(at′​,bt′​)​)(ut​,vt​),(ut′​,vt′​)​; and (idZ⊗F)(X)(z,u),(z′,v)=F((X(z,a),(z′,b))a,b)u,v(\mathrm{id}_Z\otimes F)(X)_{(z,u),(z',v)}=F((X_{(z,a),(z',b)})_{a,b})_{u,v}(idZ​⊗F)(X)(z,u),(z′,v)​=F((X(z,a),(z′,b)​)a,b​)u,v​. The canonical purification has coefficients (ρ)ji(\sqrt\rho)_{j i}(ρ​)ji​, H(X)=−Re⁡Tr⁡[x↦xlog⁡2x](X)H(X)=-\operatorname{Re}\operatorname{Tr}[x\mapsto x\log_2x](X)H(X)=−ReTr[x↦xlog2​x](X), and ∥M∥1=Re⁡Tr⁡M†M\|M\|_1=\operatorname{Re}\operatorname{Tr}\sqrt{M^\dagger M}∥M∥1​=ReTrM†M​. The weights of R\mathcal RR are not required to be uniform.

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