Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 7, rate of a sum

Open
QAlgorithms.Papers.Independent.Intakenext100.P45.sumRate

by Gohan · Oct 31, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let xn,yn>0x_n,y_n>0xn​,yn​>0 have existing extended exponential rate limits xR,yRx_R,y_RxR​,yR​. Then the rate of their sum exists and

lim⁡n→∞−1nlog⁡(xn+yn)=min⁡(xR,yR).\lim_{n\to\infty}-\frac1n\log(x_n+y_n)=\min(x_R,y_R).n→∞lim​−n1​log(xn​+yn​)=min(xR​,yR​).

The sequences need not be probabilities, so negative rates and either sign of infinity are allowed.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P45
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Intakenext100.P45

open QAlgorithms Filter

open scoped Matrix ComplexConjugate ComplexOrder ENNReal BigOperators Topology

open QAlgorithms.Papers.Independent.Information100.P07
  (support positivePart positiveProjection IsProjection)

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

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

open QAlgorithms.Papers.Independent.Dependency50.P28 (logNonnegativeExtended relativeEntropy)

open QAlgorithms.Papers.Independent.Claimed50.P15 (positiveMatrixRpow)

attribute [local instance] Classical.propDecidable Classical.decEq

variable {I J : Type} [Fintype I] [DecidableEq I] [Fintype J] [DecidableEq J]

/-- arXiv:0708.4282v1, PDF p.28: Lemma 7, rate of a sum. -/
theorem sumRate (x y : ℕ → ℝ) (hx : ∀ k, 0 < x k) (hy : ∀ k, 0 < y k)
    (xr yr : EReal) (hrx : HasRate x xr) (hry : HasRate y yr) :
    HasRate (fun k => x k+y k) (min xr yr) := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P45

end
Source
Asymptotic Error Rates in Quantum Hypothesis Testing, arXiv:0708.4282v1, PDF p. 28, Lemma 7, rate of a sum
Read-back

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

Let x,y:N→Rx,y:\mathbb N\to\mathbb Rx,y:N→R be sequences with xk>0x_k>0xk​>0 and yk>0y_k>0yk​>0 for every natural number kkk, including k=0k=0k=0, and let xr,yr∈[−∞,+∞]x_r,y_r\in[-\infty,+\infty]xr​,yr​∈[−∞,+∞]. Define L(z)=log⁡zL(z)=\log zL(z)=logz for z>0z>0z>0 and L(z)=−∞L(z)=-\inftyL(z)=−∞ otherwise. If

−L(xk)k+1⟶xr,−L(yk)k+1⟶yr,\frac{-L(x_k)}{k+1}\longrightarrow x_r, \qquad \frac{-L(y_k)}{k+1}\longrightarrow y_r,k+1−L(xk​)​⟶xr​,k+1−L(yk​)​⟶yr​,

in the extended-real topology as k→∞k\to\inftyk→∞, then

−L(xk+yk)k+1⟶min⁡{xr,yr}.\frac{-L(x_k+y_k)}{k+1}\longrightarrow\min\{x_r,y_r\}.k+1−L(xk​+yk​)​⟶min{xr​,yr​}.

No upper bound on either sequence is assumed, and either prescribed limiting rate may be +∞+\infty+∞ or −∞-\infty−∞.

Human review
  • Endorsed by Shuze Chen · Oct 31, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Oct 31, 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