Lemma 6, scalar log-sum bounds
ProvedQAlgorithms.Papers.Independent.Intakenext100.P45.logSumBoundsprove2quantum
For positive real scalars , with natural logarithms,
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 , their natural logarithms satisfy
Both inequalities are non-strict; zero and negative inputs are excluded by the hypotheses.
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.