Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Iterated strong-loss and large-modulation asymptotic

Open
QAlgorithms.Papers.Independent.Intakenext100.P72.strongLossLargeModulation

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

prove2quantum

For V≥1V\ge1V≥1 and 0<G≤10<G\le10<G≤1, let CV(G)C_V(G)CV​(G) and EV(G)E_V(G)EV​(G) denote the coherent and EPR signed expressions at pure-loss noise χ=(1−G)/G\chi=(1-G)/Gχ=(1−G)/G, defined in (54) and (56). Their right-hand strong-loss coefficients agree:

lim⁡G↓0CV(G)G=lim⁡G↓0EV(G)G=a(V):=1−1/V2ln⁡2,lim⁡V→∞a(V)=12ln⁡2.\lim_{G\downarrow0}\frac{C_V(G)}G =\lim_{G\downarrow0}\frac{E_V(G)}G =a(V):=\frac{1-1/V}{2\ln2},\qquad \lim_{V\to\infty}a(V)=\frac1{2\ln2}.G↓0lim​GCV​(G)​=G↓0lim​GEV​(G)​=a(V):=2ln21−1/V​,V→∞lim​a(V)=2ln21​.

The normalized quotient is tested only at positive GGG. This pins the source's approximation by first taking the strong-loss coefficient at finite modulation and then taking large modulation. It does not replace the finite-VVV coefficient by a constant or assert capacity optimality.

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.5, IV.B, (59).
The source's approximation is the iterated strong-loss/large-modulation limit.
The G→0 limit is one-sided and excludes G=0 from the normalized quotient.
The finite-V coefficient retains the factor (1-1/V). -/
theorem strongLossLargeModulation :
    (∀ V : ℝ, 1 ≤ V →
      Tendsto (fun G : ℝ => eprExpression G ((1 - G) / G) V / G)
        (nhdsWithin 0 (Set.Ioi 0)) (nhds (strongLossCoefficient V)) ∧
      Tendsto (fun G : ℝ => coherentExpression G ((1 - G) / G) V / G)
        (nhdsWithin 0 (Set.Ioi 0)) (nhds (strongLossCoefficient V))) ∧
    Tendsto strongLossCoefficient atTop (nhds (1 / (2 * Real.log 2))) := 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. 5, IV.B, (59): strong-loss, large-modulation asymptotic
Read-back

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

Define a(V)=(1−1/V)/(2ln⁡2)a(V)=(1-1/V)/(2\ln2)a(V)=(1−1/V)/(2ln2) for every real VVV, using total real division, so that 1/0=01/0=01/0=0. For every real V≥1V\ge1V≥1, both limits below hold as GGG tends to zero through strictly positive real values:

lim⁡G→0+1G[14log⁡2 ⁣(1(G1−GG+GV)2)]=a(V),lim⁡G→0+1G[12log⁡2 ⁣(1(G1−GG+G)(G1−GG+GV))]=a(V).\begin{aligned} \lim_{G\to0^+} \frac1G\left[ \frac14\log_2\!\left( \frac1{\left(G\frac{1-G}{G}+\frac GV\right)^2} \right)\right] &=a(V),\\ \lim_{G\to0^+} \frac1G\left[ \frac12\log_2\!\left( \frac1{\left(G\frac{1-G}{G}+G\right) \left(G\frac{1-G}{G}+\frac GV\right)} \right)\right] &=a(V). \end{aligned}G→0+lim​G1​[41​log2​((GG1−G​+VG​)21​)]G→0+lim​G1​[21​log2​((GG1−G​+G)(GG1−G​+VG​)1​)]​=a(V),=a(V).​

In addition,

lim⁡V→+∞a(V)=12ln⁡2.\lim_{V\to+\infty}a(V)=\frac1{2\ln2}.V→+∞lim​a(V)=2ln21​.

The two limits at G=0G=0G=0 exclude G=0G=0G=0 itself. The case V=1V=1V=1 is included, and then both limiting values a(1)a(1)a(1) are zero.

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