Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 2: strict linear constraints suffice

Open
QAlgorithms.Papers.Independent.Gap48.P46.strict_constraints_suffice

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

prove2quantum

All quantum systems are nonzero finite-dimensional complex Hilbert spaces. States are positive semidefinite trace-one matrices, and channels are CPTP maps on the full matrix algebra. All entropies and logarithms are in bits. An ensemble is a finite probability distribution of states, with zero weights permitted. For a channel Φ\PhiΦ, write χΦ(ρ)\chi_\Phi(\rho)χΦ​(ρ) for the maximum ensemble Holevo information at mean ρ\rhoρ, H^Φ(ρ)\widehat H_\Phi(\rho)HΦ​(ρ) for the minimum average output entropy at that mean, and C‾(Φ;A)\overline C(\Phi;\mathcal A)C(Φ;A) for the maximum of χΦ\chi_\PhiχΦ​ over a nonempty closed mean constraint A\mathcal AA. The constraint A⊗B\mathcal A\otimes\mathcal BA⊗B includes every joint density with first marginal in A\mathcal AA and second marginal in B\mathcal BB, including correlated and entangled states.

Fix channels Φ,Ψ\Phi,\PsiΦ,Ψ and a nonempty closed constraint B\mathcal BB for Ψ\PsiΨ. Suppose that for every positive semidefinite AAA and every α≥0\alpha\ge0α≥0 admitting a state ρ′\rho'ρ′ with Tr⁡(Aρ′)<α\operatorname{Tr}(A\rho')<\alphaTr(Aρ′)<α, additivity holds for Al={ρ:Tr⁡(Aρ)≤α}\mathcal A_l=\{\rho:\operatorname{Tr}(A\rho)\le\alpha\}Al​={ρ:Tr(Aρ)≤α} and B\mathcal BB. Then

C‾(Φ⊗Ψ;A⊗B)=C‾(Φ;A)+C‾(Ψ;B)\overline C(\Phi\otimes\Psi;\mathcal A\otimes\mathcal B)=\overline C(\Phi;\mathcal A)+\overline C(\Psi;\mathcal B)C(Φ⊗Ψ;A⊗B)=C(Φ;A)+C(Ψ;B)

for every nonempty closed A\mathcal AA. Strict feasibility is local to each constraint quantified in the premise. This reduces arbitrary closed constraints to strictly feasible linear ones.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Gap48_P46
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Gap48.P46

open scoped Matrix ComplexConjugate ENNReal ComplexOrder

open Filter

attribute [local instance] Classical.propDecidable

attribute [local instance] Classical.decEq

open QAlgorithms.Papers.Independent.Information100.P62 (tensorChannel)

open QAlgorithms.Papers.Independent.Information100.P54 (relativeEntropyBits)

open QAlgorithms.Papers.Independent.Dependency50.P23 (IsEB)

open QAlgorithms.Papers.Independent.Information100.P08
  (Ensemble ensembleAverage outputHolevo mixedRoof)

variable {I O J K : Type} [Fintype I] [Fintype O] [Fintype J] [Fintype K]

variable [DecidableEq I] [DecidableEq O] [DecidableEq J] [DecidableEq K]

/-- PDF p.7, Lemma 2: strict feasibility is inside the universal premise. -/
theorem strict_constraints_suffice [Nonempty I] [Nonempty O] [Nonempty J] [Nonempty K]
    (Phi : Superop I O) (Psi : Superop J K) (hPhi : IsChannel Phi) (hPsi : IsChannel Psi)
    (B : Set (Matrix J J ℂ)) (hB : Constraint B)
    (hlinear : ∀ A : Matrix I I ℂ, A.PosSemidef → ∀ alpha : ℝ, 0 ≤ alpha →
      (∃ rho ∈ states I, effectProb A rho < alpha) →
      ConstrainedAdditive Phi Psi (linearConstraint A alpha) B) :
    ∀ A, Constraint A → ConstrainedAdditive Phi Psi A B := by sorry

end QAlgorithms.Papers.Independent.Gap48.P46

end
Source
On Shor's channel extension and constrained channels, arXiv:quant-ph/0306196v2, PDF p. 7, Lemma 2: strict linear constraints suffice
Read-back

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

Let I,O,J,KI,O,J,KI,O,J,K be finite nonempty types with decidable equality, and let Φ,Ψ\Phi,\PsiΦ,Ψ be channels from matrices on I,JI,JI,J to matrices on O,KO,KO,K, respectively; each has a finite representation X↦∑jLjXLj†X\mapsto\sum_jL_jXL_j^\daggerX↦∑j​Lj​XLj†​ with ∑jLj†Lj=1\sum_jL_j^\dagger L_j=1∑j​Lj†​Lj​=1. Let DV\mathcal D_VDV​ denote positive semidefinite trace-one matrices on VVV, and let B⊆DJ\mathcal B\subseteq\mathcal D_JB⊆DJ​ be nonempty and closed. For a channel Λ\LambdaΛ, define χΛ(ρ)\chi_\Lambda(\rho)χΛ​(ρ) as the supremum of H(Λρ)−∑ipiH(Λρi)H(\Lambda\rho)-\sum_i p_iH(\Lambda\rho_i)H(Λρ)−∑i​pi​H(Λρi​) over finite ensembles of density matrices with pi≥0p_i\ge0pi​≥0, ∑ipi=1\sum_i p_i=1∑i​pi​=1, and ∑ipiρi=ρ\sum_i p_i\rho_i=\rho∑i​pi​ρi​=ρ, where H(X)=−∑jλjlog⁡2λjH(X)=-\sum_j\lambda_j\log_2\lambda_jH(X)=−∑j​λj​log2​λj​, with zero terms equal to 000; put CΛ(A)=sup⁡ρ∈AχΛ(ρ)C_\Lambda(\mathcal A)=\sup_{\rho\in\mathcal A}\chi_\Lambda(\rho)CΛ​(A)=supρ∈A​χΛ​(ρ). Set Θ=Φ⊗Ψ\Theta=\Phi\otimes\PsiΘ=Φ⊗Ψ, defined linearly on matrix units by Θ(Eii′⊗Ejj′)=Φ(Eii′)⊗Ψ(Ejj′)\Theta(E_{ii'}\otimes E_{jj'})=\Phi(E_{ii'})\otimes\Psi(E_{jj'})Θ(Eii′​⊗Ejj′​)=Φ(Eii′​)⊗Ψ(Ejj′​), and M(A,B)={σ∈DI×J:Tr⁡Jσ∈A,Tr⁡Iσ∈B}\mathcal M(\mathcal A,\mathcal B)=\{\sigma\in\mathcal D_{I\times J}:\operatorname{Tr}_J\sigma\in\mathcal A,\operatorname{Tr}_I\sigma\in\mathcal B\}M(A,B)={σ∈DI×J​:TrJ​σ∈A,TrI​σ∈B}. Suppose that for every positive semidefinite matrix AAA on III and every α≥0\alpha\ge0α≥0, whenever some ρ∈DI\rho\in\mathcal D_Iρ∈DI​ satisfies Re⁡tr⁡(Aρ)<α\operatorname{Re}\operatorname{tr}(A\rho)<\alphaRetr(Aρ)<α, the set AA,α={ρ∈DI:Re⁡tr⁡(Aρ)≤α}\mathcal A_{A,\alpha}=\{\rho\in\mathcal D_I:\operatorname{Re}\operatorname{tr}(A\rho)\le\alpha\}AA,α​={ρ∈DI​:Retr(Aρ)≤α} satisfies

CΘ(M(AA,α,B))=CΦ(AA,α)+CΨ(B).C_\Theta(\mathcal M(\mathcal A_{A,\alpha},\mathcal B)) =C_\Phi(\mathcal A_{A,\alpha})+C_\Psi(\mathcal B).CΘ​(M(AA,α​,B))=CΦ​(AA,α​)+CΨ​(B).

Then this equality holds with AA,α\mathcal A_{A,\alpha}AA,α​ replaced by every nonempty closed subset A⊆DI\mathcal A\subseteq\mathcal D_IA⊆DI​, including sets that are not convex. The assumed implication imposes no condition for a budget having no strictly feasible density matrix.

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