Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma-14

Proved
QAlgorithms.Papers.Independent.Gap20.P04.lemma14

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

prove2quantum

Let N\mathcal NN be a generalized-dephasing channel with isometry U∣i⟩=∣i⟩∣vi⟩U|i\rangle=|i\rangle|v_i\rangleU∣i⟩=∣i⟩∣vi​⟩, where each environment vector has norm one and the vectors need not be orthogonal. Let eee be any physical finite ensemble of pure reference-input states. Form another such ensemble ttt with the same probabilities and conditional input marginals Δ(ρxA′)\Delta(\rho_x^{A'})Δ(ρxA′​), choosing fresh pure purifications on any finite reference. Both ensembles pass through the same UUU.

For every 0≤λ≤10\le\lambda\le10≤λ≤1,

j(e)−λa(e)≤j(t)−λa(t),j(e)-\lambda a(e)\le j(t)-\lambda a(t),j(e)−λa(e)≤j(t)−λa(t),

where j=I(AX;B)j=I(AX;B)j=I(AX;B) and a=H(A∣X)a=H(A|X)a=H(A∣X) in bits. This permits restricting CE optimization to diagonal input marginals, including both weight endpoints.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Gap20_P04
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Gap20.P04

open QAlgorithms

open QAlgorithms.Papers.Independent.Claimed50.P24
  (Dilation PhysicalDilation ChannelEB Hadamard EqualMax AdditiveMax
   dephasingDilation dephasingGamma cloningDilation)

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

open QAlgorithms.Papers.Independent.Information100.P32 (diagonal)

open QAlgorithms.Papers.Independent.Dependency50.P24 (ensembleHolevoBits)

open QAlgorithms.Papers.Independent.Gap48.P44 (cqTimeSharing ceTimeSharing)

open scoped BigOperators Matrix ComplexConjugate

attribute [local instance] Classical.propDecidable Classical.decEq

variable {I B E J D F : Type}

variable [Fintype I] [Fintype B] [Fintype E]

variable [Fintype J] [Fintype D] [Fintype F]

variable [DecidableEq I] [DecidableEq B] [DecidableEq E]

variable [DecidableEq J] [DecidableEq D] [DecidableEq F]

variable [Nonempty I] [Nonempty B] [Nonempty E]

variable [Nonempty J] [Nonempty D] [Nonempty F]

/-- PDF p.23, Lemma 14: dephase marginals and repurify; both CE weight endpoints included. -/
theorem lemma14 (v : I → EuclideanSpace ℂ E) (hv : ∀ i, ‖v i‖ = 1)
    (e t : PurifiedInputFamily I) (he : e.Valid) (ht : t.Valid)
    (hreplace : DephasedReplacement e t) (lam : ℝ) (h0 : 0 ≤ lam) (h1 : lam ≤ 1) :
    ceScore (gdDilation v) lam e ≤ ceScore (gdDilation v) lam t := by sorry

end QAlgorithms.Papers.Independent.Gap20.P04

end
Source
Trade-off capacities of the quantum Hadamard channels, arXiv:1001.1732v2, PDF p. 23, Lemma-14
Read-back

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

Let I,EI,EI,E be finite nonempty index types with decidable equality, and let vi∈CEv_i\in\mathbb C^Evi​∈CE be unit vectors. Define G(j,a),i=1j=ivi(a)G_{(j,a),i}=\mathbf1_{j=i}v_i(a)G(j,a),i​=1j=i​vi​(a), with receiver and environment maps

B(ρ)ij=ρij∑avi(a)vj(a)‾,E(ρ)=∑iρii∣vi⟩⟨vi∣.\mathcal B(\rho)_{ij}=\rho_{ij}\sum_av_i(a)\overline{v_j(a)},\qquad \mathcal E(\rho)=\sum_i\rho_{ii}|v_i\rangle\langle v_i|.B(ρ)ij​=ρij​a∑​vi​(a)vj​(a)​,E(ρ)=i∑​ρii​∣vi​⟩⟨vi​∣.

Let e,te,te,t each have positive finite label and reference dimensions, nonnegative probabilities summing to 111, and unit purifications on reference ⊗I\otimes I⊗I. Write ρx\rho_xρx​ for their reduced input matrices. Assume a bijection fff of label sets satisfies pf(x)t=pxep^t_{f(x)}=p^e_xpf(x)t​=pxe​ and ρf(x)t=Δ(ρxe)\rho^t_{f(x)}=\Delta(\rho^e_x)ρf(x)t​=Δ(ρxe​), where Δ\DeltaΔ retains the diagonal entries and sets every off-diagonal entry to zero. Define H(X)=−Re⁡Tr⁡[x↦xlog⁡2x](X)H(X)=-\operatorname{Re}\operatorname{Tr}[x\mapsto x\log_2x](X)H(X)=−ReTr[x↦xlog2​x](X) by continuous functional calculus and

Fλ(e)=(1−λ)∑xpxH(ρx)+H ⁣(B ⁣(∑xpxρx))−∑xpxH(E(ρx)).F_\lambda(e)=(1-\lambda)\sum_xp_xH(\rho_x) +H\!\left(\mathcal B\!\left(\sum_xp_x\rho_x\right)\right) -\sum_xp_xH(\mathcal E(\rho_x)).Fλ​(e)=(1−λ)x∑​px​H(ρx​)+H(B(x∑​px​ρx​))−x∑​px​H(E(ρx​)).

For every real 0≤λ≤10\le\lambda\le10≤λ≤1, Fλ(e)≤Fλ(t)F_\lambda(e)\le F_\lambda(t)Fλ​(e)≤Fλ​(t). Both endpoints for λ\lambdaλ are included; the reference dimensions need not agree, and the replacement condition applies even at zero-probability labels.

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