Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Finite-modulation asymmetric variance criteria

Proved
QAlgorithms.Papers.Independent.Intakenext100.P72.finiteModulationVarianceCriteria

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

prove2quantum

Let V≥1V\ge1V≥1, N0>0N_0>0N0​>0, Gx,Gp>0G_x,G_p>0Gx​,Gp​>0, χx,χp≥0\chi_x,\chi_p\ge0χx​,χp​≥0, and 1/V≤s≤V1/V\le s\le V1/V≤s≤V. Write Aq=Gq(χq+s)N0A_q=G_q(\chi_q+s)N_0Aq​=Gq​(χq​+s)N0​ for the explicit Alice variance expression and Ex=N0/[Gp(χp+1/V)]E_x=N_0/[G_p(\chi_p+1/V)]Ex​=N0​/[Gp​(χp​+1/V)], Ep=N0/[Gx(χx+1/V)]E_p=N_0/[G_x(\chi_x+1/V)]Ep​=N0​/[Gx​(χx​+1/V)] for the crossed Eve expressions assumed attained in (38)–(39). Then

Ex>Ax  ⟺  (Gxχx+Gxs)(Gpχp+Gp/V)<1,Ep>Ap  ⟺  (Gpχp+Gps)(Gxχx+Gx/V)<1.\begin{aligned} E_x>A_x&\iff (G_x\chi_x+G_xs)(G_p\chi_p+G_p/V)<1,\\ E_p>A_p&\iff (G_p\chi_p+G_ps)(G_x\chi_x+G_x/V)<1. \end{aligned}Ex​>Ax​Ep​>Ap​​⟺(Gx​χx​+Gx​s)(Gp​χp​+Gp​/V)<1,⟺(Gp​χp​+Gp​s)(Gx​χx​+Gx​/V)<1.​

Consequently the disjunction of variance advantages is equivalent to the disjunction of these product inequalities. Under Gx=Gp=GG_x=G_p=GGx​=Gp​=G and χx=χp=χ\chi_x=\chi_p=\chiχx​=χp​=χ, it reduces to (Gχ+Gs)(Gχ+G/V)<1(G\chi+Gs)(G\chi+G/V)<1(Gχ+Gs)(Gχ+G/V)<1.

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.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P72
Formal statement
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
Source
Reverse reconciliation protocols for quantum cryptography with continuous variables, arXiv:quant-ph/0204127v1, PDF p. 4, III.A, (38)–(44): finite-modulation variance advantage criteria
Read-back

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

For every choice of real numbers V,N0,Gx,Gp,χx,χp,sV,N_0,G_x,G_p,\chi_x,\chi_p,sV,N0​,Gx​,Gp​,χx​,χp​,s satisfying

V≥1,N0>0,Gx>0,Gp>0,χx≥0,χp≥0,1V≤s≤V,V\ge1,\qquad N_0>0,\qquad G_x>0,\qquad G_p>0,\qquad \chi_x\ge0,\qquad\chi_p\ge0,\qquad \frac1V\le s\le V,V≥1,N0​>0,Gx​>0,Gp​>0,χx​≥0,χp​≥0,V1​≤s≤V,

the following four assertions all hold: first,

N0Gp(χp+1/V)>Gx(χx+s)N0⟺(Gxχx+Gxs)(Gpχp+Gp/V)<1;\frac{N_0}{G_p(\chi_p+1/V)} > G_x(\chi_x+s)N_0 \quad\Longleftrightarrow\quad (G_x\chi_x+G_xs)(G_p\chi_p+G_p/V)<1;Gp​(χp​+1/V)N0​​>Gx​(χx​+s)N0​⟺(Gx​χx​+Gx​s)(Gp​χp​+Gp​/V)<1;

second,

N0Gx(χx+1/V)>Gp(χp+s)N0⟺(Gpχp+Gps)(Gxχx+Gx/V)<1;\frac{N_0}{G_x(\chi_x+1/V)} > G_p(\chi_p+s)N_0 \quad\Longleftrightarrow\quad (G_p\chi_p+G_ps)(G_x\chi_x+G_x/V)<1;Gx​(χx​+1/V)N0​​>Gp​(χp​+s)N0​⟺(Gp​χp​+Gp​s)(Gx​χx​+Gx​/V)<1;

third,

(N0Gp(χp+1/V)>Gx(χx+s)N0 ∨ N0Gx(χx+1/V)>Gp(χp+s)N0)⟺((Gxχx+Gxs)(Gpχp+Gp/V)<1 ∨ (Gpχp+Gps)(Gxχx+Gx/V)<1);\begin{aligned} &\left( \frac{N_0}{G_p(\chi_p+1/V)}>G_x(\chi_x+s)N_0 \ \lor\ \frac{N_0}{G_x(\chi_x+1/V)}>G_p(\chi_p+s)N_0 \right) \\ &\quad\Longleftrightarrow \left( (G_x\chi_x+G_xs)(G_p\chi_p+G_p/V)<1 \ \lor\ (G_p\chi_p+G_ps)(G_x\chi_x+G_x/V)<1 \right); \end{aligned}​(Gp​(χp​+1/V)N0​​>Gx​(χx​+s)N0​ ∨ Gx​(χx​+1/V)N0​​>Gp​(χp​+s)N0​)⟺((Gx​χx​+Gx​s)(Gp​χp​+Gp​/V)<1 ∨ (Gp​χp​+Gp​s)(Gx​χx​+Gx​/V)<1);​

and fourth, if additionally Gx=GpG_x=G_pGx​=Gp​ and χx=χp\chi_x=\chi_pχx​=χp​, then

(N0Gp(χp+1/V)>Gx(χx+s)N0 ∨ N0Gx(χx+1/V)>Gp(χp+s)N0)⟺(Gxχx+Gxs)(Gxχx+Gx/V)<1.\begin{aligned} &\left( \frac{N_0}{G_p(\chi_p+1/V)}>G_x(\chi_x+s)N_0 \ \lor\ \frac{N_0}{G_x(\chi_x+1/V)}>G_p(\chi_p+s)N_0 \right) \\ &\quad\Longleftrightarrow (G_x\chi_x+G_xs)(G_x\chi_x+G_x/V)<1. \end{aligned}​(Gp​(χp​+1/V)N0​​>Gx​(χx​+s)N0​ ∨ Gx​(χx​+1/V)N0​​>Gp​(χp​+s)N0​)⟺(Gx​χx​+Gx​s)(Gx​χx​+Gx​/V)<1.​

Each disjunction is inclusive. The hypotheses allow V=1V=1V=1, which forces s=1s=1s=1, allow either noise parameter to be 000, and include both endpoints of the interval for sss. Under these hypotheses, both displayed quotient denominators are strictly positive.

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