Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 8: variational formula over the noisy-conjugate pure image

Open
QAlgorithms.Papers.Independent.Gap48.P36.noisy_image_variational

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

prove2quantum

All Hilbert spaces have positive finite dimension. Channels are completely positive and trace preserving; conjugates use the same normalized pure-environment dilation. Let T=(Tm)T=(T_m)T=(Tm​) be a basis of d2d^2d2 unitaries on Cd\mathbb C^dCd, including III, with Tr⁡(Tm†Tn)=dδmn\operatorname{Tr}(T_m^\dagger T_n)=d\delta_{mn}Tr(Tm†​Tn​)=dδmn​. Let am≥0a_m\ge0am​≥0, ∑mam=1\sum_m a_m=1∑m​am​=1, and Φ(ρ)=∑mamTmρTm†\Phi(\rho)=\sum_m a_mT_m\rho T_m^\daggerΦ(ρ)=∑m​am​Tm​ρTm†​. Write NC,TN^{C,T}NC,T for the canonical conjugate using Kraus matrices Tm/dT_m/dTm​/d, and NT={NC,T(∣ψ⟩⟨ψ∣):∥ψ∥=1}\mathcal N^T=\{N^{C,T}(|\psi\rangle\langle\psi|):\|\psi\|=1\}NT={NC,T(∣ψ⟩⟨ψ∣):∥ψ∥=1}. Write νp(Φ)=sup⁡ρ∥Φ(ρ)∥p\nu_p(\Phi)=\sup_\rho\|\Phi(\rho)\|_pνp​(Φ)=supρ​∥Φ(ρ)∥p​ and Smin⁡(Φ)=inf⁡ρS(Φ(ρ))S_{\min}(\Phi)=\inf_\rho S(\Phi(\rho))Smin​(Φ)=infρ​S(Φ(ρ)), with density inputs, Schatten norm, and von Neumann entropy. Put A=diag⁡(am)A=\operatorname{diag}(a_m)A=diag(am​). For real p≥1p\ge1p≥1,

νp(Φ)=d2sup⁡γ∈NT∥AγA∥p=d3sup⁡γ∈NT∥γAγ∥p.\nu_p(\Phi)=d^2\sup_{\gamma\in\mathcal N^T}\|\sqrt A\gamma\sqrt A\|_p=d^3\sup_{\gamma\in\mathcal N^T}\|\gamma A\gamma\|_p.νp​(Φ)=d2γ∈NTsup​∥A​γA​∥p​=d3γ∈NTsup​∥γAγ∥p​.

This is the variational formulation over the fixed noisy-conjugate pure image.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Gap48_P36
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Gap48.P36

open scoped BigOperators Matrix Kronecker ComplexConjugate ComplexOrder ENNReal

open QAlgorithms.Papers.Independent.Claimed50.P48

open QAlgorithms.Papers.Independent.Information100.P67 (receiverChannel complementaryChannel)

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

open QAlgorithms.Papers.Independent.Information100.P50 (schattenNorm)

open QAlgorithms.Papers.Independent.Information100.P03 (convexRoof)

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

attribute [local instance] Classical.propDecidable Classical.decEq

variable {A B C D E K L A2 B2 C2 : Type*}

variable [Fintype A] [DecidableEq A] [Fintype B] [DecidableEq B]

variable [Fintype C] [DecidableEq C] [Fintype D] [DecidableEq D]

variable [Fintype E] [DecidableEq E] [Fintype K] [DecidableEq K]

variable [Fintype L] [DecidableEq L] [Fintype A2] [DecidableEq A2]

variable [Fintype B2] [DecidableEq B2] [Fintype C2] [DecidableEq C2]

/-- Theorem 8, PDF p.14, (34): the second factor is d^3, not d^2. -/
theorem noisy_image_variational [Nonempty A] [Nonempty K]
    (T : UnitaryBasis A K) (a : K → ℝ) (ha : ProbabilityWeights a) (p : ℝ) (hp : 1 ≤ p) :
    nu (ENNReal.ofReal p) (randomUnitary T.matrix a) =
      (Fintype.card A : ℝ)^2 * sSup {x | ∃ gamma ∈ pureNoisyImage T.matrix,
        x = schattenNorm (ENNReal.ofReal p) (weightRoot a * gamma * weightRoot a)} ∧
    nu (ENNReal.ofReal p) (randomUnitary T.matrix a) =
      (Fintype.card A : ℝ)^3 * sSup {x | ∃ gamma ∈ pureNoisyImage T.matrix,
        x = schattenNorm (ENNReal.ofReal p) (gamma * weightMatrix a * gamma)} := by sorry

end QAlgorithms.Papers.Independent.Gap48.P36

end
Source
Properties of Conjugate Channels with Applications to Additivity and Multiplicativity, arXiv:quant-ph/0509126v3, PDF p. 14, Theorem 8: variational formula over the noisy-conjugate pure image
Read-back

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

Let A,KA,KA,K be finite nonempty types with decidable equality, put d=∣A∣d=|A|d=∣A∣, and let TkT_kTk​ be complex matrices on AAA with a specified identity label k0k_0k0​, satisfying ∣K∣=d2|K|=d^2∣K∣=d2, Tk0=IT_{k_0}=ITk0​​=I, Tk†Tk=IT_k^\dagger T_k=ITk†​Tk​=I, and tr⁡(Tj†Tk)=d\operatorname{tr}(T_j^\dagger T_k)=dtr(Tj†​Tk​)=d if j=kj=kj=k and 000 otherwise. Let ak≥0a_k\ge0ak​≥0 with ∑kak=1\sum_ka_k=1∑k​ak​=1, and let p≥1p\ge1p≥1 be real. Define

F(ρ)=∑kakTkρTk†,N(ρ)jk=1d2tr⁡(TjρTk†),G={N(ψψ†):ψ∈CA, ∥ψ∥=1},F(\rho)=\sum_ka_kT_k\rho T_k^\dagger,\qquad N(\rho)_{jk}=\frac1{d^2}\operatorname{tr}(T_j\rho T_k^\dagger),\qquad \mathcal G=\{N(\psi\psi^\dagger):\psi\in\mathbb C^A,\ \|\psi\|=1\},F(ρ)=k∑​ak​Tk​ρTk†​,N(ρ)jk​=d21​tr(Tj​ρTk†​),G={N(ψψ†):ψ∈CA, ∥ψ∥=1},

and let Da=diag⁡(ak)D_a=\operatorname{diag}(a_k)Da​=diag(ak​) and Ra=diag⁡(ak)R_a=\operatorname{diag}(\sqrt{a_k})Ra​=diag(ak​​). Then both identities hold:

νp(F)=d2sup⁡γ∈G∥RaγRa∥p,νp(F)=d3sup⁡γ∈G∥γDaγ∥p.\nu_p(F)=d^2\sup_{\gamma\in\mathcal G}\|R_a\gamma R_a\|_p, \qquad \nu_p(F)=d^3\sup_{\gamma\in\mathcal G}\|\gamma D_a\gamma\|_p.νp​(F)=d2γ∈Gsup​∥Ra​γRa​∥p​,νp​(F)=d3γ∈Gsup​∥γDa​γ∥p​.

Here νp(F)=sup⁡ρ≥0,tr⁡ρ=1∥F(ρ)∥p\nu_p(F)=\sup_{\rho\ge0,\operatorname{tr}\rho=1}\|F(\rho)\|_pνp​(F)=supρ≥0,trρ=1​∥F(ρ)∥p​ and ∥Y∥p=(Re⁡tr⁡((Y†Y)p/2))1/p\|Y\|_p=(\operatorname{Re}\operatorname{tr}((Y^\dagger Y)^{p/2}))^{1/p}∥Y∥p​=(Retr((Y†Y)p/2))1/p, with matrix powers defined by continuous functional calculus. Zero weights, d=1d=1d=1, and p=1p=1p=1 are included; closure of the basis under multiplication up to phase is not assumed.

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