Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Depolarizing products: multiplicativity and explicit purities

Open
QAlgorithms.Papers.Independent.Support50.P31.depolarizingPurities

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

prove2quantum

Let n≥1n\ge1n≥1, let di≥1d_i\ge1di​≥1 be the dimensions of complex Hilbert spaces HiH_iHi​, and let 0<pi<10<p_i<10<pi​<1. Define the depolarizing channels Φi(X)=(1−pi)X+(pi/di)Tr⁡(X)Ii\Phi_i(X)=(1-p_i)X+(p_i/d_i)\operatorname{Tr}(X)I_iΦi​(X)=(1−pi​)X+(pi​/di​)Tr(X)Ii​, and their actual tensor product Φ=⨂i=1nΦi\Phi=\bigotimes_{i=1}^n\Phi_iΦ=⨂i=1n​Φi​. For a channel Ψ\PsiΨ, write νp(Ψ)\nu_p(\Psi)νp​(Ψ) for the maximum output Schatten ppp-norm over all density inputs (operator norm when p=∞p=\inftyp=∞), and ν−∞(Ψ)\nu_{-\infty}(\Psi)ν−∞​(Ψ) for the minimum least output eigenvalue, including zero. Then

ν2(Φ)=∏iν2(Φi)=∏idi−1di(1−pi)2+1di,ν∞(Φ)=∏iν∞(Φi)=∏i(1−pi(di−1)di),ν−∞(Φ)=∏iν−∞(Φi)=∏imi,mi={1di=1,pi/didi>1.\begin{aligned} \nu_2(\Phi)&=\prod_i\nu_2(\Phi_i) =\prod_i\sqrt{\frac{d_i-1}{d_i}(1-p_i)^2+\frac1{d_i}},\\ \nu_\infty(\Phi)&=\prod_i\nu_\infty(\Phi_i) =\prod_i\left(1-\frac{p_i(d_i-1)}{d_i}\right),\\ \nu_{-\infty}(\Phi)&=\prod_i\nu_{-\infty}(\Phi_i) =\prod_i m_i,\qquad m_i=\begin{cases}1&d_i=1,\\p_i/d_i&d_i>1.\end{cases} \end{aligned}ν2​(Φ)ν∞​(Φ)ν−∞​(Φ)​=i∏​ν2​(Φi​)=i∏​di​di​−1​(1−pi​)2+di​1​​,=i∏​ν∞​(Φi​)=i∏​(1−di​pi​(di​−1)​),=i∏​ν−∞​(Φi​)=i∏​mi​,mi​={1pi​/di​​di​=1,di​>1.​​

These are exact identities for arbitrary density inputs on the joint space, including entangled states.

Source correction. The printed last product uses pi/dip_i/d_ipi​/di​ in every dimension. A scalar channel is the identity and has least output eigenvalue 111; the displayed scalar branch corrects that edge without discarding it.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P31
Formal statement
noncomputable section

open Filter Asymptotics

open scoped ComplexConjugate ENNReal

namespace QAlgorithms.Papers.Independent.Support50.P31

attribute [local instance] Classical.propDecidable Classical.decEq

open QAlgorithms.Papers.Independent.Information100.P56 (entropy)

open QAlgorithms.Papers.Independent.Information100.P63 (schatten)

open QAlgorithms.Papers.Independent.Gap48.P03 (holevoQuantity)

open QAlgorithms.Papers.Independent.Claimed50.P38 (tensorSuperop)

open QAlgorithms.Papers.Independent.Dependency50.P44 (tensorChannels)

/-- PDF pp.11–12, final Theorem (i)–(iii), with the p.9 convention.
Printed (iii) is corrected for dimension one: its factor is 1, not p.
All three multiplicativity identities and explicit values are retained. -/
theorem depolarizingPurities {n : ℕ} (hn : 0 < n) (d : Fin n → ℕ) (hd : ∀ i, 0 < d i)
    (p : Fin n → ℝ) (hp : ∀ i, 0 < p i ∧ p i < 1) :
    (nuP 2 (depolarizingProduct d hd p) =
        ∏ i, nuP 2 (QuditFidelity.depolarizingMap (d i) (hd i) (p i)) ∧
      (∏ i, nuP 2 (QuditFidelity.depolarizingMap (d i) (hd i) (p i))) =
        ∏ i, Real.sqrt ((((d i : ℝ) - 1) / (d i : ℝ)) * (1 - p i) ^ 2 + 1 / (d i : ℝ))) ∧
    (nuP ⊤ (depolarizingProduct d hd p) =
        ∏ i, nuP ⊤ (QuditFidelity.depolarizingMap (d i) (hd i) (p i)) ∧
      (∏ i, nuP ⊤ (QuditFidelity.depolarizingMap (d i) (hd i) (p i))) =
        ∏ i, (1 - p i * ((d i : ℝ) - 1) / (d i : ℝ))) ∧
    (nuMinus (depolarizingProduct d hd p) =
        ∏ i, nuMinus (QuditFidelity.depolarizingMap (d i) (hd i) (p i)) ∧
      (∏ i, nuMinus (QuditFidelity.depolarizingMap (d i) (hd i) (p i))) =
        ∏ i, if d i = 1 then 1 else p i / (d i : ℝ)) := by sorry

end QAlgorithms.Papers.Independent.Support50.P31

end
Source
On some additivity problems in quantum information theory, arXiv:math-ph/0003002v2, PDF p. 11, §5, Theorem (i)-(iii): multiplicativity and explicit depolarizing purities
Read-back

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

For every positive natural number nnn, every family of positive natural dimensions did_idi​ indexed by i<ni<ni<n, and every family of real parameters 0<pi<10<p_i<10<pi​<1, define the map on di×did_i\times d_idi​×di​ complex matrices by Di(X)=piditr⁡(X)I+(1−pi)X\mathcal D_i(X)=\frac{p_i}{d_i}\operatorname{tr}(X)I+(1-p_i)XDi​(X)=di​pi​​tr(X)I+(1−pi​)X, and let D\mathcal DD be their tensor map: its matrix entries on an arbitrary input XXX are D(X)y,y′=∑x,x′Xx,x′∏i<nDi(Exi,xi′)yi,yi′\mathcal D(X)_{y,y'}=\sum_{x,x'}X_{x,x'}\prod_{i<n}\mathcal D_i(E_{x_i,x_i'})_{y_i,y_i'}D(X)y,y′​=∑x,x′​Xx,x′​∏i<n​Di​(Exi​,xi′​​)yi​,yi′​​, where x,x′,y,y′x,x',y,y'x,x′,y,y′ range over ∏i<n{0,…,di−1}\prod_{i<n}\{0,\ldots,d_i-1\}∏i<n​{0,…,di​−1} and Ea,bE_{a,b}Ea,b​ is the matrix unit. For a map Φ\PhiΦ on a finite matrix space, let ν2(Φ)\nu_2(\Phi)ν2​(Φ) be the supremum, over positive semidefinite matrices ρ\rhoρ of trace one, of (∑jλj(Φ(ρ))2)1/2\bigl(\sum_j\lambda_j(\Phi(\rho))^2\bigr)^{1/2}(∑j​λj​(Φ(ρ))2)1/2; let ν∞(Φ)\nu_\infty(\Phi)ν∞​(Φ) be the supremum over these inputs of the Euclidean operator norm ∥Φ(ρ)∥op\|\Phi(\rho)\|_{\mathrm{op}}∥Φ(ρ)∥op​; and let ν−(Φ)\nu_-(\Phi)ν−​(Φ) be the infimum over these inputs of the smallest eigenvalue of Φ(ρ)\Phi(\rho)Φ(ρ). The declaration asserts all three identities

ν2(D)=∏i<nν2(Di)=∏i<ndi−1di(1−pi)2+1di,ν∞(D)=∏i<nν∞(Di)=∏i<n(1−pi(di−1)di),ν−(D)=∏i<nν−(Di)=∏i<n{1,di=1,pi/di,di≠1.\begin{aligned} \nu_2(\mathcal D) &=\prod_{i<n}\nu_2(\mathcal D_i) =\prod_{i<n}\sqrt{\frac{d_i-1}{d_i}(1-p_i)^2+\frac1{d_i}},\\ \nu_\infty(\mathcal D) &=\prod_{i<n}\nu_\infty(\mathcal D_i) =\prod_{i<n}\left(1-\frac{p_i(d_i-1)}{d_i}\right),\\ \nu_-(\mathcal D) &=\prod_{i<n}\nu_-(\mathcal D_i) =\prod_{i<n} \begin{cases} 1,&d_i=1,\\ p_i/d_i,&d_i\ne1. \end{cases} \end{aligned}ν2​(D)ν∞​(D)ν−​(D)​=i<n∏​ν2​(Di​)=i<n∏​di​di​−1​(1−pi​)2+di​1​​,=i<n∏​ν∞​(Di​)=i<n∏​(1−di​pi​(di​−1)​),=i<n∏​ν−​(Di​)=i<n∏​{1,pi​/di​,​di​=1,di​=1.​​

Dimensions equal to one are permitted; an empty family of factors is excluded by n>0n>0n>0.

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