Lemma 7, rate of a sum
OpenQAlgorithms.Papers.Independent.Intakenext100.P45.sumRateprove2quantum
Let have existing extended exponential rate limits . Then the rate of their sum exists and
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 be sequences with and for every natural number , including , and let . Define for and otherwise. If
in the extended-real topology as , then
No upper bound on either sequence is assumed, and either prescribed limiting rate may be or .
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.