Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

All eight optimal complementary-slackness relations

Proved
QAlgorithms.Papers.Independent.Support50.P04.optimal_complementary_slackness

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

prove2quantum

Let N:A→B\mathcal N:A\to BN:A→B be a CPTP channel on finite positive-dimensional complex Hilbert spaces with fixed orthonormal bases. Write R^(n;ε)\widehat R(n;\varepsilon)R(n;ε) and R^cpp(n;ε)\widehat R^{\mathrm{cpp}}(n;\varepsilon)Rcpp(n;ε) for the maximum unassisted and classical-post-processing assisted entanglement-transmission rates. A code has a positive integer message dimension MMM, rate log⁡2M/n\log_2 M/nlog2​M/n, and squared fidelity to the normalized maximally entangled target at least 1−ε1-\varepsilon1−ε. A cpp encoder may retain sender memory; its decoder is LOCC across that memory and the receiver outputs, with its final quantum output at the receiver and no preshared entanglement. Let 0<ε<10<\varepsilon<10<ε<1. Let JN=(id⊗N)(∣A∣ΦA)J_{\mathcal N}=(\mathrm{id}\otimes\mathcal N)(|A|\Phi_A)JN​=(id⊗N)(∣A∣ΦA​) be the unnormalized Choi matrix. Define Γ(ρ)={Λ⪰0:Λ⪯ρT⊗IB, tr⁡ΛJN≥1−ε}\Gamma(\rho)=\{\Lambda\succeq0:\Lambda\preceq\rho^T\otimes I_B,\ \operatorname{tr}\Lambda J_{\mathcal N}\ge1-\varepsilon\}Γ(ρ)={Λ⪰0:Λ⪯ρT⊗IB​, trΛJN​≥1−ε}. Set f(N,ε)=inf⁡ρ∈S(A)inf⁡Λ∈Γ(ρ)sup⁡Jtr⁡(ΛJ)f(\mathcal N,\varepsilon)=\inf_{\rho\in\mathcal S(A)}\inf_{\Lambda\in\Gamma(\rho)}\sup_J\operatorname{tr}(\Lambda J)f(N,ε)=infρ∈S(A)​infΛ∈Γ(ρ)​supJ​tr(ΛJ), where the comparison Choi operators satisfy J⪰0J\succeq0J⪰0, JTA⪰0J^{T_A}\succeq0JTA​⪰0, and tr⁡BJ=IA\operatorname{tr}_B J=I_AtrB​J=IA​. In the minimization program, ρ\rhoρ is a density matrix, Λ∈Γ(ρ)\Lambda\in\Gamma(\rho)Λ∈Γ(ρ), ξ⪰0\xi\succeq0ξ⪰0, Θ⪰0\Theta\succeq0Θ⪰0, and ξ⊗IB⪰Λ+ΘTA\xi\otimes I_B\succeq\Lambda+\Theta^{T_A}ξ⊗IB​⪰Λ+ΘTA​. In the maximization program, μ,ν≥0\mu,\nu\ge0μ,ν≥0, J,R⪰0J,R\succeq0J,R⪰0, JTA⪰0J^{T_A}\succeq0JTA​⪰0, tr⁡BJ⪯IA\operatorname{tr}_B J\preceq I_AtrB​J⪯IA​, μJN⪯J+R\mu J_{\mathcal N}\preceq J+RμJN​⪯J+R, and tr⁡BR⪯νIA\operatorname{tr}_B R\preceq\nu I_AtrB​R⪯νIA​. Assume the displayed feasible minimization and maximization variables are optimal: tr⁡ξ=f=μ(1−ε)−ν\operatorname{tr}\xi=f=\mu(1-\varepsilon)-\nutrξ=f=μ(1−ε)−ν. Then all eight relations hold:

tr⁡ρ=1,tr⁡(ΛJN)=1−ε,(ρT⊗IB)R=ΛR,(ξ⊗IB)J=(Λ+ΘTA)J,νρ=tr⁡B(RTA)ρ,JTAΘ=0,(tr⁡BJ)ξ=ξ,μJNΛ=(J+R)Λ.\begin{gathered}\operatorname{tr}\rho=1,\quad\operatorname{tr}(\Lambda J_{\mathcal N})=1-\varepsilon,\quad(\rho^T\otimes I_B)R=\Lambda R,\\(\xi\otimes I_B)J=(\Lambda+\Theta^{T_A})J,\quad\nu\rho=\operatorname{tr}_B(R^{T_A})\rho,\quad J^{T_A}\Theta=0,\\(\operatorname{tr}_B J)\xi=\xi,\quad\mu J_{\mathcal N}\Lambda=(J+R)\Lambda.\end{gathered}trρ=1,tr(ΛJN​)=1−ε,(ρT⊗IB​)R=ΛR,(ξ⊗IB​)J=(Λ+ΘTA​)J,νρ=trB​(RTA​)ρ,JTA​Θ=0,(trB​J)ξ=ξ,μJN​Λ=(J+R)Λ.​

These characterize relations between actual optimal solutions, not arbitrary feasible variables.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P04
Formal statement
noncomputable section

open scoped Matrix ComplexConjugate ComplexOrder

open QAlgorithms

namespace QAlgorithms.Papers.Independent.Support50.P04

variable {A B E : Type} [Fintype A] [DecidableEq A]

variable [Fintype B] [DecidableEq B] [Fintype E] [DecidableEq E]

/-- arXiv:1504.04617v2, PDF p.22, Eqs.(A9)–(A16): ALL eight relations for
optimal feasible solutions. The T_A in (A13) is visible in the PDF but lost by
extraction; implicit identity tensor factors are explicit below. -/
theorem optimal_complementary_slackness [Nonempty A] [Nonempty B]
    (N : Superop A B) (hN : IsChannel N) (epsilon : ℝ)
    (he0 : 0 < epsilon) (he1 : epsilon < 1)
    (rho xi : Matrix A A ℂ) (Lambda Theta J R : Matrix (A × B) (A × B) ℂ)
    (mu nu : ℝ) (hmin : SdpMinFeasible N epsilon rho xi Lambda Theta)
    (hmax : SdpMaxFeasible N mu nu J R)
    (hminopt : xi.trace.re = metaValue N epsilon)
    (hmaxopt : mu * (1-epsilon) - nu = metaValue N epsilon) :
    rho.trace = 1 ∧
    (Lambda * QAlgorithms.Papers.Independent.Information100.P34.choi N).trace.re = 1-epsilon ∧
    Matrix.kronecker rho.transpose (1 : Matrix B B ℂ) * R = Lambda * R ∧
    Matrix.kronecker xi (1 : Matrix B B ℂ) * J = (Lambda + QAlgorithms.Entanglement.partialTransposeFirst Theta) * J ∧
    (nu : ℂ) • rho = traceRight (QAlgorithms.Entanglement.partialTransposeFirst R) * rho ∧
    QAlgorithms.Entanglement.partialTransposeFirst J * Theta = 0 ∧
    traceRight J * xi = xi ∧
    (mu : ℂ) • (QAlgorithms.Papers.Independent.Information100.P34.choi N * Lambda) = (J + R) * Lambda := by sorry

end QAlgorithms.Papers.Independent.Support50.P04

end
Source
Quantum Coding with Finite Resources, arXiv:1504.04617v2, PDF p. 22, Eqs. (A9)–(A16)
Read-back

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

Let A,BA,BA,B be nonempty finite index types with decidable equality, and let NNN be a map from complex A×AA\times AA×A matrices to complex B×BB\times BB×B matrices that is a channel: there exist a natural number sss and matrices Ei∈CB×AE_i\in\mathbb C^{B\times A}Ei​∈CB×A, 0≤i<s0\le i<s0≤i<s, such that ∑iEi†Ei=IA\sum_iE_i^\dagger E_i=I_A∑i​Ei†​Ei​=IA​ and N(X)=∑iEiXEi†N(X)=\sum_iE_iXE_i^\daggerN(X)=∑i​Ei​XEi†​ for every XXX. Write CNC_NCN​ for the matrix with entries CN((a,b),(a′,b′))=N(Eaa′)(b,b′)C_N((a,b),(a',b'))=N(E_{aa'})(b,b')CN​((a,b),(a′,b′))=N(Eaa′​)(b,b′), where Eaa′E_{aa'}Eaa′​ is the matrix unit; write T(X)((a,b),(a′,b′))=X((a′,b),(a,b′))\mathcal T(X)((a,b),(a',b'))=X((a',b),(a,b'))T(X)((a,b),(a′,b′))=X((a′,b),(a,b′)) for partial transpose on AAA, and (Tr⁡BX)(a,a′)=∑bX((a,b),(a′,b))(\operatorname{Tr}_B X)(a,a')=\sum_bX((a,b),(a',b))(TrB​X)(a,a′)=∑b​X((a,b),(a′,b)). Let 0<ϵ<10<\epsilon<10<ϵ<1, let ρ,ξ∈CA×A\rho,\xi\in\mathbb C^{A\times A}ρ,ξ∈CA×A, let Λ,Θ,J,R∈C(A×B)×(A×B)\Lambda,\Theta,J,R\in\mathbb C^{(A\times B)\times(A\times B)}Λ,Θ,J,R∈C(A×B)×(A×B), and let μ,ν∈R\mu,\nu\in\mathbb Rμ,ν∈R. Assume that

ρ⪰0,tr⁡ρ=1,Λ⪰0,ρT⊗IB−Λ⪰0,1−ϵ≤Re⁡tr⁡(ΛCN),ξ⪰0,Θ⪰0,ξ⊗IB−Λ−T(Θ)⪰0,\rho\succeq0,\quad \operatorname{tr}\rho=1,\quad \Lambda\succeq0,\quad \rho^{\mathsf T}\otimes I_B-\Lambda\succeq0,\quad 1-\epsilon\le\operatorname{Re}\operatorname{tr}(\Lambda C_N),\quad \xi\succeq0,\quad\Theta\succeq0,\quad \xi\otimes I_B-\Lambda-\mathcal T(\Theta)\succeq0,ρ⪰0,trρ=1,Λ⪰0,ρT⊗IB​−Λ⪰0,1−ϵ≤Retr(ΛCN​),ξ⪰0,Θ⪰0,ξ⊗IB​−Λ−T(Θ)⪰0,

and that

μ,ν≥0,J⪰0,T(J)⪰0,IA−Tr⁡BJ⪰0,R⪰0,J+R−μCN⪰0,νIA−Tr⁡BR⪰0.\mu,\nu\ge0,\quad J\succeq0,\quad\mathcal T(J)\succeq0,\quad I_A-\operatorname{Tr}_B J\succeq0,\quad R\succeq0,\quad J+R-\mu C_N\succeq0,\quad \nu I_A-\operatorname{Tr}_B R\succeq0.μ,ν≥0,J⪰0,T(J)⪰0,IA​−TrB​J⪰0,R⪰0,J+R−μCN​⪰0,νIA​−TrB​R⪰0.

Define the real number

v∗=inf⁡ω⪰0, tr⁡ω=1L⪰0, ωT⊗IB−L⪰01−ϵ≤Re⁡tr⁡(LCN) sup⁡H⪰0, T(H)⪰0Tr⁡BH=IARe⁡tr⁡(LH),v_*= \inf_{\substack{\omega\succeq0,\ \operatorname{tr}\omega=1\\ L\succeq0,\ \omega^{\mathsf T}\otimes I_B-L\succeq0\\ 1-\epsilon\le\operatorname{Re}\operatorname{tr}(LC_N)}} \ \sup_{\substack{H\succeq0,\ \mathcal T(H)\succeq0\\ \operatorname{Tr}_B H=I_A}} \operatorname{Re}\operatorname{tr}(LH),v∗​=ω⪰0, trω=1L⪰0, ωT⊗IB​−L⪰01−ϵ≤Retr(LCN​)​inf​ H⪰0, T(H)⪰0TrB​H=IA​​sup​Retr(LH),

where ω\omegaω is indexed by AAA and L,HL,HL,H by A×BA\times BA×B. Assume also that Re⁡tr⁡ξ=v∗\operatorname{Re}\operatorname{tr}\xi=v_*Retrξ=v∗​ and μ(1−ϵ)−ν=v∗\mu(1-\epsilon)-\nu=v_*μ(1−ϵ)−ν=v∗​. Then all of the following equalities hold:

tr⁡ρ=1,Re⁡tr⁡(ΛCN)=1−ϵ,(ρT⊗IB)R=ΛR,(ξ⊗IB)J=(Λ+T(Θ))J,νρ=(Tr⁡BT(R))ρ,T(J)Θ=0,(Tr⁡BJ)ξ=ξ,μ(CNΛ)=(J+R)Λ.\begin{gathered} \operatorname{tr}\rho=1,\qquad \operatorname{Re}\operatorname{tr}(\Lambda C_N)=1-\epsilon,\\ (\rho^{\mathsf T}\otimes I_B)R=\Lambda R,\qquad (\xi\otimes I_B)J=(\Lambda+\mathcal T(\Theta))J,\\ \nu\rho=\bigl(\operatorname{Tr}_B\mathcal T(R)\bigr)\rho,\qquad \mathcal T(J)\Theta=0,\qquad (\operatorname{Tr}_B J)\xi=\xi,\qquad \mu(C_N\Lambda)=(J+R)\Lambda. \end{gathered}trρ=1,Retr(ΛCN​)=1−ϵ,(ρT⊗IB​)R=ΛR,(ξ⊗IB​)J=(Λ+T(Θ))J,νρ=(TrB​T(R))ρ,T(J)Θ=0,(TrB​J)ξ=ξ,μ(CN​Λ)=(J+R)Λ.​

The assumptions allow μ=0\mu=0μ=0 or ν=0\nu=0ν=0, singular feasible matrices, and one-element index types; they do not impose strict positivity on these quantities.

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