Finite-modulation asymmetric variance criteria
ProvedQAlgorithms.Papers.Independent.Intakenext100.P72.finiteModulationVarianceCriteriaLet , , , , and . Write for the explicit Alice variance expression and , for the crossed Eve expressions assumed attained in (38)–(39). Then
Consequently the disjunction of variance advantages is equivalent to the disjunction of these product inequalities. Under and , it reduces to .
This result is the exact algebraic comparison of the source's explicit variance expressions. The interpretation as uniform operational security is deferred under the paper seed.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P72
noncomputable section
open Filter
open scoped Topology
namespace QAlgorithms.Papers.Independent.Intakenext100.P72
/-- Grosshans--Grangier, PDF p.4, III.A, (38)--(44).
These are the exact algebraic variance comparisons, retaining the asymmetric
OR and the crossed quadrature indices. The source's operational interpretation
is deferred under the original paper seed. -/
theorem finiteModulationVarianceCriteria
(V N0 Gx Gp chix chip s : ℝ)
(hV : 1 ≤ V) (hN0 : 0 < N0) (hGx : 0 < Gx) (hGp : 0 < Gp)
(hchix : 0 ≤ chix) (hchip : 0 ≤ chip)
(hslo : 1 / V ≤ s) (hshi : s ≤ V) :
(eveVarianceExpression Gp chip V N0 > aliceVarianceExpression Gx chix s N0 ↔
(Gx * chix + Gx * s) * (Gp * chip + Gp / V) < 1) ∧
(eveVarianceExpression Gx chix V N0 > aliceVarianceExpression Gp chip s N0 ↔
(Gp * chip + Gp * s) * (Gx * chix + Gx / V) < 1) ∧
((eveVarianceExpression Gp chip V N0 > aliceVarianceExpression Gx chix s N0 ∨
eveVarianceExpression Gx chix V N0 > aliceVarianceExpression Gp chip s N0) ↔
((Gx * chix + Gx * s) * (Gp * chip + Gp / V) < 1 ∨
(Gp * chip + Gp * s) * (Gx * chix + Gx / V) < 1)) ∧
(Gx = Gp → chix = chip →
((eveVarianceExpression Gp chip V N0 > aliceVarianceExpression Gx chix s N0 ∨
eveVarianceExpression Gx chix V N0 > aliceVarianceExpression Gp chip s N0) ↔
varianceProduct Gx chix V s < 1)) := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P72
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every choice of real numbers satisfying
the following four assertions all hold: first,
second,
third,
and fourth, if additionally and , then
Each disjunction is inclusive. The hypotheses allow , which forces , allow either noise parameter to be , and include both endpoints of the interval for . Under these hypotheses, both displayed quotient denominators are strictly positive.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.