Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Quantum-rate deficit and feasible allocation

Proved
QAlgorithms.Papers.Independent.Gap48.P44.quantum_deficit_and_allocation

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. Let 1/2≤η<11/2\le\eta<11/2≤η<1, NS≥0N_S\ge0NS​≥0, and (1−η)NS≥2(1-\eta)N_S\ge2(1−η)NS​≥2. Then

gn(ηNS)−gn((1−η)NS)≥ln⁡η−ln⁡(1−η)−1η(1−η)NS.g_n(\eta N_S)-g_n((1-\eta)N_S)\ge\ln\eta-\ln(1-\eta)-\frac1{\eta(1-\eta)N_S}.gn​(ηNS​)−gn​((1−η)NS​)≥lnη−ln(1−η)−η(1−η)NS​1​.

For any ϵ>0\epsilon>0ϵ>0, set λ=[η(1−η)ϵNSln⁡2]−1\lambda=[\eta(1-\eta)\epsilon N_S\ln2]^{-1}λ=[η(1−η)ϵNS​ln2]−1. If λ∈[0,1]\lambda\in[0,1]λ∈[0,1] and λ(1−η)NS≥2\lambda(1-\eta)N_S\ge2λ(1−η)NS​≥2, the displayed quantum coding rate qλ=gb(ηλNS)−gb((1−η)λNS)q_\lambda=g_b(\eta\lambda N_S)-g_b((1-\eta)\lambda N_S)qλ​=gb​(ηλNS​)−gb​((1−η)λNS​) obeys

∣ln⁡η−ln⁡(1−η)ln⁡2−qλ∣≤ϵ.\left|\frac{\ln\eta-\ln(1-\eta)}{\ln2}-q_\lambda\right|\le\epsilon.​ln2lnη−ln(1−η)​−qλ​​≤ϵ.

The benchmark is the limiting quantum rate, and the allocation preserves its required feasibility conditions.

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.7,9, Proposition 5: both the nats bound and the feasible photon
allocation giving an epsilon-bit deficit from the LIMITING quantum benchmark.
This does not identify a finite-budget operational capacity with that limit. -/
theorem quantum_deficit_and_allocation (eta budget : ℝ)
    (heta : 1 - eta ≤ eta) (heta1 : eta < 1)
    (hbudget : 0 ≤ budget) (hthreshold : 2 ≤ (1 - eta) * budget) :
    (Real.log eta - Real.log (1 - eta) - 1 / (eta * (1 - eta) * budget) ≤
      g (eta * budget) - g ((1 - eta) * budget)) ∧
    (∀ epsilon : ℝ, 0 < epsilon →
      let share := 1 / (eta * (1 - eta) * epsilon * budget * Real.log 2)
      share ∈ Set.Icc (0 : ℝ) 1 → 2 ≤ share * (1 - eta) * budget →
      |(Real.log eta - Real.log (1 - eta)) / Real.log 2 -
        (thermalEntropy (eta * share * budget) -
          thermalEntropy ((1 - eta) * share * budget))| ≤ epsilon) := by sorry

end QAlgorithms.Papers.Independent.Gap48.P44

end
Source
Quantum trade-off coding for bosonic communication, arXiv:1105.0119v4, PDF p. 7, Proposition 5: quantum rate deficit and allocation rule
Read-back

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

For real η,B\eta,Bη,B satisfying 1−η≤η1-\eta\le\eta1−η≤η, η<1\eta<1η<1, B≥0B\ge0B≥0, and 2≤(1−η)B2\le(1-\eta)B2≤(1−η)B, define g(x)=(x+1)ln⁡(x+1)−xln⁡xg(x)=(x+1)\ln(x+1)-x\ln xg(x)=(x+1)ln(x+1)−xlnx and h(x)=g(x)/ln⁡2h(x)=g(x)/\ln2h(x)=g(x)/ln2, with ln⁡0=0\ln0=0ln0=0. Then

ln⁡η−ln⁡(1−η)−1η(1−η)B≤g(ηB)−g((1−η)B).\ln\eta-\ln(1-\eta)-\frac{1}{\eta(1-\eta)B} \le g(\eta B)-g((1-\eta)B).lnη−ln(1−η)−η(1−η)B1​≤g(ηB)−g((1−η)B).

Furthermore, for every real ε>0\varepsilon>0ε>0, set s=1/(η(1−η)εBln⁡2)s=1/(\eta(1-\eta)\varepsilon B\ln2)s=1/(η(1−η)εBln2); if 0≤s≤10\le s\le10≤s≤1 and 2≤s(1−η)B2\le s(1-\eta)B2≤s(1−η)B, then

∣ln⁡η−ln⁡(1−η)ln⁡2−(h(ηsB)−h((1−η)sB))∣≤ε.\left| \frac{\ln\eta-\ln(1-\eta)}{\ln2} -\bigl(h(\eta sB)-h((1-\eta)sB)\bigr) \right|\le\varepsilon.​ln2lnη−ln(1−η)​−(h(ηsB)−h((1−η)sB))​≤ε.

The initial hypotheses force 1/2≤η<11/2\le\eta<11/2≤η<1 and B>0B>0B>0. The allocation conclusion is conditional on both displayed requirements on sss; it does not assert that they hold for every positive ε\varepsilonε.

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