Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Vacuum-amplifier families: gain ordering and time-sharing improvement

Proved
QAlgorithms.Papers.Independent.Gap48.P44.amplifier_family_comparison

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

prove2quantum

Write gn(x)=(x+1)ln⁡(x+1)−xln⁡xg_n(x)=(x+1)\ln(x+1)-x\ln xgn​(x)=(x+1)ln(x+1)−xlnx and gb(x)=gn(x)/ln⁡2g_b(x)=g_n(x)/\ln2gb​(x)=gn​(x)/ln2 for x≥0x\ge0x≥0, with 0ln⁡0=00\ln0=00ln0=0. Fix NS=200N_S=200NS​=200 and NB=0N_B=0NB​=0. For each finite gain κ≥1\kappa\ge1κ≥1, put aκ=gb(200κ+κ−1)a_\kappa=g_b(200\kappa+\kappa-1)aκ​=gb​(200κ+κ−1), bκ(λ)=gb(200κλ+κ−1)b_\kappa(\lambda)=g_b(200\kappa\lambda+\kappa-1)bκ​(λ)=gb​(200κλ+κ−1), and eκ(λ)=gb((κ−1)(200λ+1))e_\kappa(\lambda)=g_b((\kappa-1)(200\lambda+1))eκ​(λ)=gb​((κ−1)(200λ+1)). Let ACQ(κ)A_{CQ}(\kappa)ACQ​(κ) be the union of nonnegative (C,Q)(C,Q)(C,Q) with Q≤bκ(λ)−eκ(λ)Q\le b_\kappa(\lambda)-e_\kappa(\lambda)Q≤bκ​(λ)−eκ​(λ) and C+Q≤aκ−eκ(λ)C+Q\le a_\kappa-e_\kappa(\lambda)C+Q≤aκ​−eκ​(λ). Let ACE(κ)A_{CE}(\kappa)ACE​(κ) be the union of nonnegative (C,Ec)(C,E_c)(C,Ec​) with C≤gb(200λ)+aκ−eκ(λ)C\le g_b(200\lambda)+a_\kappa-e_\kappa(\lambda)C≤gb​(200λ)+aκ​−eκ​(λ) and C≤aκ−eκ(λ)+EcC\le a_\kappa-e_\kappa(\lambda)+E_cC≤aκ​−eκ​(λ)+Ec​. Both unions use λ∈[0,1]\lambda\in[0,1]λ∈[0,1]. Then

1≤κ1≤κ2 ⟹ ACQ(κ2)⊆ACQ(κ1),ACE(κ2)⊆ACE(κ1).1\le\kappa_1\le\kappa_2\ \Longrightarrow\ A_{CQ}(\kappa_2)\subseteq A_{CQ}(\kappa_1),\quad A_{CE}(\kappa_2)\subseteq A_{CE}(\kappa_1).1≤κ1​≤κ2​ ⟹ ACQ​(κ2​)⊆ACQ​(κ1​),ACE​(κ2​)⊆ACE​(κ1​).

For every κ>1\kappa>1κ>1, the same-budget endpoint time-sharing families are properly contained in these respective families. Their endpoints are C0=aκ−gb(κ−1)C_0=a_\kappa-g_b(\kappa-1)C0​=aκ​−gb​(κ−1) and Q1=aκ−gb(201(κ−1))Q_1=a_\kappa-g_b(201(\kappa-1))Q1​=aκ​−gb​(201(κ−1)) in CQ; CE uses C0C_0C0​, C1=gb(200)+Q1C_1=g_b(200)+Q_1C1​=gb​(200)+Q1​, and E1=gb(200)E_1=g_b(200)E1​=gb​(200). CQ time sharing allows C≤(1−t)C0C\le(1-t)C_0C≤(1−t)C0​, Q≤tQ1Q\le tQ_1Q≤tQ1​; CE allows C≤(1−t)C0+tC1C\le(1-t)C_0+tC_1C≤(1−t)C0​+tC1​, Ec≥tE1E_c\ge tE_1Ec​≥tE1​, always with t∈[0,1]t\in[0,1]t∈[0,1]. At κ=1\kappa=1κ=1 each time-sharing family equals its corresponding coding family.

This is a comparison of the explicit inner families at the figure’s fixed budget, with consumed entanglement positive; it is not an identification of unrestricted amplifier capacity.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Gap48_P44
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Gap48.P44

open Filter

open scoped ENNReal Topology

open QAlgorithms.Papers.Independent.Claimed50.P39 (g)

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

/-- PDF pp.16-17, Section V and Figure 6: ordered-gain inclusion of the
N_S=200,N_B=0 displayed families, plus proper time-sharing improvement at gain>1.
At identity gain the straight-line families equal endpoint time sharing. -/
theorem amplifier_family_comparison :
    (∀ k1 k2 : ℝ, 1 ≤ k1 → k1 ≤ k2 →
      amplifierCQ k2 ⊆ amplifierCQ k1 ∧ amplifierCE k2 ⊆ amplifierCE k1) ∧
    (∀ gain : ℝ, 1 < gain →
      cqTimeSharing
        (thermalEntropy (gain * 200 + gain - 1) - thermalEntropy (gain - 1))
        (thermalEntropy (gain * 200 + gain - 1) -
          thermalEntropy ((gain - 1) * 201)) ⊂ amplifierCQ gain ∧
      ceTimeSharing
        (thermalEntropy (gain * 200 + gain - 1) - thermalEntropy (gain - 1))
        (thermalEntropy 200 + thermalEntropy (gain * 200 + gain - 1) -
          thermalEntropy ((gain - 1) * 201)) (thermalEntropy 200) ⊂ amplifierCE gain) ∧
    cqTimeSharing (thermalEntropy 200) (thermalEntropy 200) = amplifierCQ 1 ∧
    ceTimeSharing (thermalEntropy 200) (2 * thermalEntropy 200) (thermalEntropy 200) =
      amplifierCE 1 := by sorry

end QAlgorithms.Papers.Independent.Gap48.P44

end
Source
Quantum trade-off coding for bosonic communication, arXiv:1105.0119v4, PDF p. 16, §V / Figure 6: amplification and time-sharing comparison
Read-back

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

Define H(x)=((x+1)ln⁡(x+1)−xln⁡x)/ln⁡2H(x)=((x+1)\ln(x+1)-x\ln x)/\ln2H(x)=((x+1)ln(x+1)−xlnx)/ln2, with ln⁡0=0\ln0=0ln0=0, and, for real ggg, put

Og=H(200g+g−1),Cg(s)=H(200gs+g−1),Eg(s)=H((g−1)(200s+1)).O_g=H(200g+g-1),\qquad C_g(s)=H(200gs+g-1),\qquad E_g(s)=H((g-1)(200s+1)).Og​=H(200g+g−1),Cg​(s)=H(200gs+g−1),Eg​(s)=H((g−1)(200s+1)).

Define four sets of nonnegative real pairs by

Qg={r∈[0,∞)2:∃s∈[0,1], r2≤Cg(s)−Eg(s), r1+r2≤Og−Eg(s)},Ag={r∈[0,∞)2:∃s∈[0,1], r1≤H(200s)+Og−Eg(s), r1≤Og−Eg(s)+r2},TQ(a,b)={r∈[0,∞)2:∃t∈[0,1], r1≤(1−t)a, r2≤tb},TA(a,b,c)={r∈[0,∞)2:∃t∈[0,1], r1≤(1−t)a+tb, tc≤r2}.\begin{aligned} Q_g&=\{r\in[0,\infty)^2: \exists s\in[0,1],\ r_2\le C_g(s)-E_g(s),\ r_1+r_2\le O_g-E_g(s)\},\\ A_g&=\{r\in[0,\infty)^2: \exists s\in[0,1],\ r_1\le H(200s)+O_g-E_g(s),\ r_1\le O_g-E_g(s)+r_2\},\\ T_Q(a,b)&=\{r\in[0,\infty)^2: \exists t\in[0,1],\ r_1\le(1-t)a,\ r_2\le tb\},\\ T_A(a,b,c)&=\{r\in[0,\infty)^2: \exists t\in[0,1],\ r_1\le(1-t)a+tb,\ tc\le r_2\}. \end{aligned}Qg​Ag​TQ​(a,b)TA​(a,b,c)​={r∈[0,∞)2:∃s∈[0,1], r2​≤Cg​(s)−Eg​(s), r1​+r2​≤Og​−Eg​(s)},={r∈[0,∞)2:∃s∈[0,1], r1​≤H(200s)+Og​−Eg​(s), r1​≤Og​−Eg​(s)+r2​},={r∈[0,∞)2:∃t∈[0,1], r1​≤(1−t)a, r2​≤tb},={r∈[0,∞)2:∃t∈[0,1], r1​≤(1−t)a+tb, tc≤r2​}.​

The declaration asserts all of the following together: for every pair of real numbers k1,k2k_1,k_2k1​,k2​ with 1≤k1≤k21\le k_1\le k_21≤k1​≤k2​, one has Qk2⊆Qk1Q_{k_2}\subseteq Q_{k_1}Qk2​​⊆Qk1​​ and Ak2⊆Ak1A_{k_2}\subseteq A_{k_1}Ak2​​⊆Ak1​​; for every real g>1g>1g>1, both inclusions

TQ ⁣(Og−H(g−1), Og−H(201(g−1)))⊊Qg,TA ⁣(Og−H(g−1), H(200)+Og−H(201(g−1)), H(200))⊊Ag\begin{aligned} T_Q\!\left(O_g-H(g-1),\ O_g-H(201(g-1))\right)&\subsetneq Q_g,\\ T_A\!\left(O_g-H(g-1),\ H(200)+O_g-H(201(g-1)),\ H(200)\right)&\subsetneq A_g \end{aligned}TQ​(Og​−H(g−1), Og​−H(201(g−1)))TA​(Og​−H(g−1), H(200)+Og​−H(201(g−1)), H(200))​⊊Qg​,⊊Ag​​

are proper, meaning inclusion holds and each right-hand set contains a point outside the corresponding left-hand set; and at g=1g=1g=1 the exact equalities

TQ(H(200),H(200))=Q1,TA(H(200),2H(200),H(200))=A1T_Q(H(200),H(200))=Q_1,\qquad T_A(H(200),2H(200),H(200))=A_1TQ​(H(200),H(200))=Q1​,TA​(H(200),2H(200),H(200))=A1​

hold. All existential parameters s,ts,ts,t include 000 and 111, and the monotonicity assertion includes equal gains and the endpoint k1=1k_1=1k1​=1.

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