Equal-noise additive chain comparison identity
ProvedQAlgorithms.Papers.Independent.Intakenext100.P69.equalNoiseChainComparisonLet be an integer and let be a total additive-noise variance such that . Split the line into additive-noise links, each with variance . For a link of variance , use the constructed Gaussian resource and comparison states of (8)–(11) and (28) with and , and write in bits. Define the chain comparison value as in (39), namely the minimum of these link divergences. Then
This is the displayed algebraic specialization for any number of repeaters. It includes , with one link, and makes no claim that the placement optimizes an operational capacity or that a rate is achievable.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P69
noncomputable section
open scoped BigOperators ENNReal
namespace QAlgorithms.Papers.Independent.Intakenext100.P69
open QAlgorithms.Papers.Independent.Claimed50.P19
(Cov DensityKernel GaussianWithCovariance covarianceCharacteristicValue
multimodeWeylTrace standardFormCovariance vacuumKernel)
open QAlgorithms.Papers.Independent.Dependency50.P33
(State IsSeparable)
open QAlgorithms.Papers.Independent.Frontier18.P01 (generalizedRelativeEntropy)
attribute [local instance] Classical.propDecidable Classical.decEq
/-- arXiv:1706.06065v3, PDF p.6, after (39): equal-noise chain specialization.
All N+1 links have noise xi/(N+1); the local resources are exactly those in
(8)--(11), (28)--(29). No optimal-placement or achievability claim is made. -/
theorem equalNoiseChainComparison
(N : ℕ) (xi : ℝ) (hxi : 0 < xi)
(hlink : xi / ((N : ℝ) + 1) ≤ 1) :
additiveChainComparisonBound N (fun _ => xi / ((N : ℝ) + 1)) =
additiveComparisonBound (xi / ((N : ℝ) + 1)) := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P69
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every natural number , including , and every real such that , the theorem asserts
Thus the left-hand side uses the constant function with value on the indices, which always form a nonempty set; for the infimum has one term. Here the common value is defined as follows: put ,
and, in coordinate order , set
Using pair indices to identify functions , is the definition’s chosen kernel satisfying the following conditions if one exists, and otherwise is for and elsewhere: is symmetric; is positive definite and is positive semidefinite, where , ; for with summable; every finite quadratic form is real and nonnegative; the real diagonal is summable with sum ; and is summable. There must further exist such that for every ,
with each inner family over and the resulting family of inner sums over summable, and
Finally,
where are coordinate restrictions, including the empty restriction, , matrix functions use real continuous functional calculus, and is embedded in the extended nonnegative reals. The hypotheses give , including ; the asserted equality is in and does not separately assert finiteness of either side.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.