Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 6, scalar log-sum bounds

Proved
QAlgorithms.Papers.Independent.Intakenext100.P45.logSumBounds

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

prove2quantum

For positive real scalars x,yx,yx,y, with natural logarithms,

max⁡(log⁡x,log⁡y)≤log⁡(x+y)≤max⁡(log⁡x,log⁡y)+log⁡2.\max(\log x,\log y)\le\log(x+y)\le\max(\log x,\log y)+\log2.max(logx,logy)≤log(x+y)≤max(logx,logy)+log2.

This controls the exponential rate of a sum by the larger summand.

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 pp.27,28: Lemma 6, scalar log-sum bounds. -/
theorem logSumBounds (x y : ℝ) (hx : 0 < x) (hy : 0 < y) :
    max (Real.log x) (Real.log y) ≤ Real.log (x+y) ∧
    Real.log (x+y) ≤ max (Real.log x) (Real.log y)+Real.log 2 := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P45

end
Source
Asymptotic Error Rates in Quantum Hypothesis Testing, arXiv:0708.4282v1, PDF p. 27, Lemma 6, scalar log-sum bounds
Read-back

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

For every pair of strictly positive real numbers x,yx,yx,y, their natural logarithms satisfy

max⁡{log⁡x,log⁡y}≤log⁡(x+y)≤max⁡{log⁡x,log⁡y}+log⁡2.\max\{\log x,\log y\}\le\log(x+y) \le\max\{\log x,\log y\}+\log2.max{logx,logy}≤log(x+y)≤max{logx,logy}+log2.

Both inequalities are non-strict; zero and negative inputs are excluded by the hypotheses.

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