Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Unnumbered result: tightness for absent sender/receiver side information

Open
QAlgorithms.Papers.Independent.Intakethird100.P42.degenerateRedistributionTightness

by Gohan · Nov 1, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let ∣ψ⟩RA^B^B|\psi\rangle^{R\widehat A\widehat B B}∣ψ⟩RABB be a normalized pure state on finite nonzero registers, with initial ownership A^B^\widehat A\widehat BAB at Alice and BBB at Bob. Suppose dim⁡A^=1\dim\widehat A=1dimA=1 or dim⁡B=1\dim B=1dimB=1. Null registers have dimension one.

For the same one-way qubit and signed Bell-resource redistribution task, a pair (Q,E)(Q,E)(Q,E) is achievable if and only if

Q≥12I(B^;R∣A^)ψ,Q+E≥H(B^∣B)ψ.Q\ge\tfrac12 I(\widehat B;R\mid\widehat A)_\psi,\qquad Q+E\ge H(\widehat B\mid B)_\psi.Q≥21​I(B;R∣A)ψ​,Q+E≥H(B∣B)ψ​.

Achievability uses arbitrary local CPTP maps, separate Bell input/output counts, every positive error and rate slack, all sufficiently large positive IID blocks, and full joint source/reference and final Bell-pair trace-norm error. All entropies are in bits.

For absent sender side information the FQSW corner achieves the outer bound; for absent receiver side information the FQRS corner does so. Allowed resource trades extend the corner to the whole displayed region.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P42
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Intakethird100.P42

open scoped BigOperators ComplexConjugate ENNReal

open Filter

open QAlgorithms.Papers.Independent.Dependency50.P07

open QAlgorithms.Papers.Independent.Gap48.P20

open QAlgorithms.Papers.Independent.Information100.P27 (IsProbability shannon)

attribute [local instance] Classical.decEq Classical.propDecidable

/-- PDF p.18: the outer region is achieved if Ahat or B is null. Null means
one-dimensional, never empty; arbitrary extra qubits can be traded for Bell pairs. -/
theorem degenerateRedistributionTightness {A C B R : Type}
    [Fintype A] [Fintype C] [Fintype B] [Fintype R]
    [Nonempty A] [Nonempty C] [Nonempty B] [Nonempty R]
    (psi : EuclideanSpace ℂ (RedistributionSource A C B R)) (hpsi : IsState psi)
    (hnull : Fintype.card A = 1 ∨ Fintype.card B = 1) (Q E : ℝ) :
    RedistributionAchievable psi Q E ↔
      printedQuantumCost psi ≤ Q ∧ conditionalCost psi ≤ Q + E := by sorry

end QAlgorithms.Papers.Independent.Intakethird100.P42

end
Source
Channel simulation with quantum side information, arXiv:quant-ph/0611008v1, PDF p. 18, Unnumbered result: tightness for absent sender/receiver side information
Read-back

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

Let A,C,B,RA,C,B,RA,C,B,R be nonempty finite types, let ψ∈CR×(A×(C×B))\psi\in\mathbb C^{R\times(A\times(C\times B))}ψ∈CR×(A×(C×B)) satisfy ∥ψ∥=1\|\psi\|=1∥ψ∥=1, and assume ∣A∣=1|A|=1∣A∣=1 or ∣B∣=1|B|=1∣B∣=1, allowing both equalities. Form ρuv=ψuψv‾\rho_{uv}=\psi_u\overline{\psi_v}ρuv​=ψu​ψv​​, obtain ρU\rho_UρU​ for any register collection UUU by summing over equal complementary labels, and write S(U)=−Re⁡tr⁡(f(ρU))S(U)=-\operatorname{Re}\operatorname{tr}(f(\rho_U))S(U)=−Retr(f(ρU​)), where f(t)=tlog⁡2tf(t)=t\log_2tf(t)=tlog2​t is applied by continuous functional calculus and 0log⁡20=00\log_20=00log2​0=0. For every Q,E∈RQ,E\in\mathbb RQ,E∈R, the two inequalities

S(AC)+S(RA)−S(A)−S(RAC)2≤Q,S(CB)−S(B)≤Q+E\frac{S(AC)+S(RA)-S(A)-S(RAC)}2\le Q, \qquad S(CB)-S(B)\le Q+E2S(AC)+S(RA)−S(A)−S(RAC)​≤Q,S(CB)−S(B)≤Q+E

hold if and only if Q≥0Q\ge0Q≥0 and the following operational condition holds: for every ε,δ>0\varepsilon,\delta>0ε,δ>0, some natural NNN works for every n≥Nn\ge Nn≥N with n≥1n\ge1n≥1, giving natural numbers q,k,lq,k,lq,k,l, an encoder channel from AnCnA^nC^nAnCn and kkk qubits to AnA^nAn, lll qubits, and a qqq-qubit message, and a decoder channel from that message, BnB^nBn, and kkk qubits to CnBnC^nB^nCnBn and lll qubits, such that q≤n(Q+δ)q\le n(Q+\delta)q≤n(Q+δ), k−l≤n(E+δ)k-l\le n(E+\delta)k−l≤n(E+δ), and their output on ψ⊗n⊗Φk\psi^{\otimes n}\otimes\Phi_kψ⊗n⊗Φk​, leaving RnR^nRn unchanged, differs from the projector onto ψ⊗n⊗Φl\psi^{\otimes n}\otimes\Phi_lψ⊗n⊗Φl​ by trace norm at most ε\varepsilonε. Here Φh=2−h/2∑z∈{0,1}h∣z,z⟩\Phi_h=2^{-h/2}\sum_{z\in\{0,1\}^h}|z,z\rangleΦh​=2−h/2∑z∈{0,1}h​∣z,z⟩, the target places AnA^nAn at the encoder and CnBnC^nB^nCnBn at the decoder, each channel has a finite Kraus representation with ∑jKj†Kj=I\sum_jK_j^\dagger K_j=I∑j​Kj†​Kj​=I, and ∥M∥1=Re⁡tr⁡M†M\|M\|_1=\operatorname{Re}\operatorname{tr}\sqrt{M^\dagger M}∥M∥1​=RetrM†M​. Zero values of q,k,lq,k,lq,k,l and arbitrary real EEE are included.

Human review
  • Endorsed by Shuze Chen · Nov 1, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Nov 1, 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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me