Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 1: supporting linear constraint

Open
QAlgorithms.Papers.Independent.Gap48.P46.supporting_constraint

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.

Let Φ\PhiΦ be a channel and ρ0\rho_0ρ0​ a full-rank state. There is an effect AAA, meaning 0≤A≤I0\le A\le I0≤A≤I, such that, on putting α=Tr⁡(Aρ0)\alpha=\operatorname{Tr}(A\rho_0)α=Tr(Aρ0​),

Tr⁡(Aρ)≤α⟹χΦ(ρ)≤χΦ(ρ0)\operatorname{Tr}(A\rho)\le\alpha\quad\Longrightarrow\quad\chi_\Phi(\rho)\le\chi_\Phi(\rho_0)Tr(Aρ)≤α⟹χΦ​(ρ)≤χΦ​(ρ0​)

for every state ρ\rhoρ. Thus any full-rank state supports a linear constraint under which it maximizes chi. No strict-feasibility conclusion is asserted.

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.3, Lemma 1 (proof pp.16–17): a full-rank density supports an effect
constraint. Strict feasibility and nonscalar effects are not hypotheses. -/
theorem supporting_constraint [Nonempty I] [Nonempty O]
    (Phi : Superop I O) (hPhi : IsChannel Phi) (rho : Matrix I I ℂ)
    (hrho : IsDensityMatrix rho) (hfull : IsUnit rho.det) :
    ∃ A : Matrix I I ℂ, IsEffect A ∧ ∀ omega ∈ states I,
      effectProb A omega ≤ effectProb A rho → fixedMeanChi Phi omega ≤ fixedMeanChi Phi rho := by sorry

end QAlgorithms.Papers.Independent.Gap48.P46

end
Source
On Shor's channel extension and constrained channels, arXiv:quant-ph/0306196v2, PDF p. 3, Lemma 1: supporting linear constraint
Read-back

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

Let I,OI,OI,O be finite nonempty types with decidable equality, and let Φ\PhiΦ be a channel from matrices on III to matrices on OOO: for some finite Kraus family, Φ(X)=∑jKjXKj†\Phi(X)=\sum_jK_jXK_j^\daggerΦ(X)=∑j​Kj​XKj†​ for every XXX, with ∑jKj†Kj=1\sum_jK_j^\dagger K_j=1∑j​Kj†​Kj​=1. Let ρ\rhoρ be a positive semidefinite trace-one matrix with det⁡ρ≠0\det\rho\ne0detρ=0. For each density matrix ω\omegaω, define χΦ(ω)\chi_\Phi(\omega)χΦ​(ω) as the supremum, over all finite ensembles (pi,ωi)(p_i,\omega_i)(pi​,ωi​) 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\omega_i=\omega∑i​pi​ωi​=ω, of

H(Φ(ω))−∑ipiH(Φ(ωi)),H(\Phi(\omega))-\sum_i p_iH(\Phi(\omega_i)),H(Φ(ω))−i∑​pi​H(Φ(ωi​)),

where H(X)=−∑jλjlog⁡2λjH(X)=-\sum_j\lambda_j\log_2\lambda_jH(X)=−∑j​λj​log2​λj​, with 0log⁡20=00\log_2 0=00log2​0=0. There exists a matrix AAA on III such that both AAA and 1−A1-A1−A are positive semidefinite and, for every density matrix ω\omegaω,

Re⁡tr⁡(Aω)≤Re⁡tr⁡(Aρ)⟹χΦ(ω)≤χΦ(ρ).\operatorname{Re}\operatorname{tr}(A\omega)\le \operatorname{Re}\operatorname{tr}(A\rho) \quad\Longrightarrow\quad \chi_\Phi(\omega)\le\chi_\Phi(\rho).Retr(Aω)≤Retr(Aρ)⟹χΦ​(ω)≤χΦ​(ρ).
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