Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Limited-entanglement classical deficit and allocation

Proved
QAlgorithms.Papers.Independent.Gap48.P44.classical_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 0≤η<10\le\eta<10≤η<1, NS≥0N_S\ge0NS​≥0, λ∈[0,1]\lambda\in[0,1]λ∈[0,1], and λ(1−η)NS≥2\lambda(1-\eta)N_S\ge2λ(1−η)NS​≥2. Put cλ=gn(λNS)+gn(ηNS)−gn((1−η)λNS)c_\lambda=g_n(\lambda N_S)+g_n(\eta N_S)-g_n((1-\eta)\lambda N_S)cλ​=gn​(λNS​)+gn​(ηNS​)−gn​((1−η)λNS​) and dλ=c1−cλd_\lambda=c_1-c_\lambdadλ​=c1​−cλ​. Then

dλ≤56λNS(1−η).d_\lambda\le\frac5{6\lambda N_S(1-\eta)}.dλ​≤6λNS​(1−η)5​.

For ϵ>0\epsilon>0ϵ>0, the feasible allocation λϵ=5/[6ϵNS(1−η)ln⁡2]\lambda_\epsilon=5/[6\epsilon N_S(1-\eta)\ln2]λϵ​=5/[6ϵNS​(1−η)ln2] gives ∣dλϵ∣/ln⁡2≤ϵ|d_{\lambda_\epsilon}|/\ln2\le\epsilon∣dλϵ​​∣/ln2≤ϵ, provided λϵ∈[0,1]\lambda_\epsilon\in[0,1]λϵ​∈[0,1] and λϵ(1−η)NS≥2\lambda_\epsilon(1-\eta)N_S\ge2λϵ​(1−η)NS​≥2.

The first display is in nats; the allocation gives an error in bits. The difference on the left is the one explicitly computed in the source proof.

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.9-10, Proposition 6: the proof supplies the missing printed LHS.
The first bound is in nats; the allocation conclusion is in bits.
Printed: only 5/(6 lambda N_S (1-eta)); changed: attach the difference explicitly
computed at the beginning of the proof. Why: the bound otherwise has no subject.
Independent moderation of this source-domain interpretation remains pending. -/
theorem classical_deficit_and_allocation (eta share budget : ℝ)
    (heta0 : 0 ≤ eta) (heta1 : eta < 1) (hshare : share ∈ Set.Icc (0 : ℝ) 1)
    (hbudget : 0 ≤ budget) (hthreshold : 2 ≤ share * (1 - eta) * budget) :
    (g budget + g (eta * budget) - g ((1 - eta) * budget) -
      (g (share * budget) + g (eta * budget) - g ((1 - eta) * share * budget)) ≤
        5 / (6 * share * budget * (1 - eta))) ∧
    (∀ epsilon : ℝ, 0 < epsilon →
      let allocation := 5 / (6 * epsilon * budget * (1 - eta) * Real.log 2)
      allocation ∈ Set.Icc (0 : ℝ) 1 → 2 ≤ allocation * (1 - eta) * budget →
      |thermalEntropy budget + thermalEntropy (eta * budget) -
        thermalEntropy ((1 - eta) * budget) -
        (thermalEntropy (allocation * budget) + thermalEntropy (eta * budget) -
          thermalEntropy ((1 - eta) * allocation * budget))| ≤ epsilon) := by sorry

end QAlgorithms.Papers.Independent.Gap48.P44

end
Source
Quantum trade-off coding for bosonic communication, arXiv:1105.0119v4, PDF p. 9, Proposition 6: limited-entanglement classical deficit and allocation rule
Read-back

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

For real η,s,B\eta,s,Bη,s,B satisfying 0≤η<10\le\eta<10≤η<1, 0≤s≤10\le s\le10≤s≤1, B≥0B\ge0B≥0, and 2≤s(1−η)B2\le s(1-\eta)B2≤s(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

g(B)+g(ηB)−g((1−η)B)−(g(sB)+g(ηB)−g((1−η)sB))≤56sB(1−η).g(B)+g(\eta B)-g((1-\eta)B) -\bigl(g(sB)+g(\eta B)-g((1-\eta)sB)\bigr) \le\frac{5}{6sB(1-\eta)}.g(B)+g(ηB)−g((1−η)B)−(g(sB)+g(ηB)−g((1−η)sB))≤6sB(1−η)5​.

Also, for every real ε>0\varepsilon>0ε>0, set a=5/(6εB(1−η)ln⁡2)a=5/(6\varepsilon B(1-\eta)\ln2)a=5/(6εB(1−η)ln2); if 0≤a≤10\le a\le10≤a≤1 and 2≤a(1−η)B2\le a(1-\eta)B2≤a(1−η)B, then

∣h(B)+h(ηB)−h((1−η)B)−(h(aB)+h(ηB)−h((1−η)aB))∣≤ε.\left| h(B)+h(\eta B)-h((1-\eta)B) -\bigl(h(aB)+h(\eta B)-h((1-\eta)aB)\bigr) \right|\le\varepsilon.​h(B)+h(ηB)−h((1−η)B)−(h(aB)+h(ηB)−h((1−η)aB))​≤ε.

All the original hypotheses, including those concerning sss, apply to both conclusions; they force s>0s>0s>0 and B>0B>0B>0, while allowing η=0\eta=0η=0. The first conclusion is a one-sided bound without an absolute value, and the second applies only when its stated allocation conditions hold.

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