Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§VII.A, unnumbered leading term in (48)

Proved
QAlgorithms.Papers.Independent.Gap48.P40.qubitLeadingAsymptotic

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

prove2quantum

Fix 0<β≤1/20<\beta\le1/20<β≤1/2 and denote the right-hand side of (46) by B2(β,T)=(T+1−β)log⁡((T+1−β)/(1−β))+(β−T)log⁡(1−T/β)B_2(\beta,T)=(T+1-\beta)\log((T+1-\beta)/(1-\beta))+(\beta-T)\log(1-T/\beta)B2​(β,T)=(T+1−β)log((T+1−β)/(1−β))+(β−T)log(1−T/β). Then

lim⁡T↓0B2(β,T)T2=12β(1−β).\lim_{T\downarrow0}\frac{B_2(\beta,T)}{T^2}=\frac1{2\beta(1-\beta)}.T↓0lim​T2B2​(β,T)​=2β(1−β)1​.

This isolates the correct leading asymptotic from the defective printed series (48); it does not prescribe the leading coefficient of every relative entropy.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Gap48_P40
Formal statement
noncomputable section

open scoped Matrix ComplexConjugate ComplexOrder Topology Matrix.Norms.L2Operator

open Filter MeasureTheory Asymptotics

open QAlgorithms

open QAlgorithms.Papers.Independent.Dependency50.P21 (relativeEntropy)

open QAlgorithms.Papers.Independent.Information100.P50 (IsUINorm)

open QAlgorithms.Papers.Independent.Information100.P56 (entropy)

open QAlgorithms.Papers.Independent.Information100.P60 (copies)

open QAlgorithms.Papers.Independent.Information100.P44 (Mat)

namespace QAlgorithms.Papers.Independent.Gap48.P40

/-- PDF p.10, Eq.(48), correct leading term only. The printed infinite series
is separately deferred; this asymptotic is of the bound (46), not of every entropy. -/
theorem qubitLeadingAsymptotic (beta : ℝ) (hbeta : 0 < beta ∧ beta ≤ 1 / 2) :
    Tendsto (fun T : ℝ => qubitSmallBound beta T / T ^ 2)
      (nhdsWithin 0 (Set.Ioi 0)) (nhds (1 / (2 * beta * (1 - beta)))) := by sorry

end QAlgorithms.Papers.Independent.Gap48.P40

end
Source
Continuity bounds on the quantum relative entropy, arXiv:quant-ph/0503218v3, PDF p. 10, §VII.A, unnumbered leading term in (48)
Read-back

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

For every real β\betaβ satisfying 0<β≤120<\beta\le\tfrac120<β≤21​,

lim⁡T→0+(T+1−β)log⁡ ⁣(T+1−β1−β)+(β−T)log⁡ ⁣(1−Tβ)T2=12β(1−β).\lim_{T\to0^+} \frac{ (T+1-\beta)\log\!\left(\frac{T+1-\beta}{1-\beta}\right) +(\beta-T)\log\!\left(1-\frac{T}{\beta}\right) }{T^2} = \frac{1}{2\beta(1-\beta)}.T→0+lim​T2(T+1−β)log(1−βT+1−β​)+(β−T)log(1−βT​)​=2β(1−β)1​.

The logarithms are natural. The limit is taken through all positive real TTT approaching zero; no value of the quotient at T=0T=0T=0 is asserted, and β=12\beta=\tfrac12β=21​ is included.

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