Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Appendix B.2.b: direct pair-link rate, Eq.(B1)

Proved
QAlgorithms.Papers.Independent.Gap48.P25.directLink

by Goku · Oct 21, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

In Appendix B's perfect-pair, noiseless-channel toy model, let νS>0\nu_S>0νS​>0 be the source clock, t∈[0,1]t\in[0,1]t∈[0,1] total pair propagation transmission and 0<η≤10<\eta\le10<η≤1 each endpoint detector's efficiency. Dark counts, dead times and other nuisances are absent. The independent propagation and two detection factors define a nonnegative normalized round law. Its coincidence rate, equal to the toy model's noiseless secret-key rate, is

K1=R1=νStη2.K_1=R_1=\nu_St\eta^2.K1​=R1​=νS​tη2.

The channel factor is the total path transmission ttt, whereas the two endpoint detections contribute η2\eta^2η2. In particular zero propagation transmission gives zero rate.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Gap48_P25
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Gap48.P25

open scoped BigOperators ComplexConjugate

open Filter

open QAlgorithms.Papers.Independent.Claimed50.P08 (classicalEntropy)

/-- Eq.(B1), PDF p.46: direct-link coincidence rate, with eta^2 and total loss t. -/
theorem directLink (nu t eta : ℝ) (hnu : 0 < nu) (ht : t ∈ Set.Icc (0 : ℝ) 1)
    (heta : 0 < eta ∧ eta ≤ 1) :
    (∀ b, 0 ≤ directLaw t eta b) ∧ (∑ b : Fin 3 → Bool, directLaw t eta b) = 1 ∧
    directRate nu t eta = nu*t*eta^2 := by sorry

end QAlgorithms.Papers.Independent.Gap48.P25

end
Source
The Security of Practical Quantum Key Distribution, arXiv:0802.4155v3, PDF p. 46, Appendix B.2.b: direct pair-link rate, Eq.(B1)
Read-back

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

For every real ν>0\nu>0ν>0, t∈[0,1]t\in[0,1]t∈[0,1], and 0<η≤10<\eta\le10<η≤1, define, for each Boolean triple b=(b0,b1,b2)b=(b_0,b_1,b_2)b=(b0​,b1​,b2​),

P(b)={tb0=true1−tb0=false∏i=12{ηbi=true1−ηbi=false.P(b)= \begin{cases}t&b_0=\mathrm{true}\\1-t&b_0=\mathrm{false}\end{cases} \prod_{i=1}^{2} \begin{cases}\eta&b_i=\mathrm{true}\\1-\eta&b_i=\mathrm{false}.\end{cases}P(b)={t1−t​b0​=trueb0​=false​i=1∏2​{η1−η​bi​=truebi​=false.​

Then P(b)≥0P(b)\ge0P(b)≥0 for every triple, the sum of P(b)P(b)P(b) over all eight triples is 111, and the quantity ν∑b: ∀i, bi=trueP(b)\nu\sum_{b:\,\forall i,\ b_i=\mathrm{true}}P(b)ν∑b:∀i, bi​=true​P(b) equals νtη2\nu t\eta^2νtη2. The cases t=0t=0t=0, t=1t=1t=1, and η=1\eta=1η=1 are included.

Human review
  • Endorsed by Shuze Chen · Oct 21, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Goku · Oct 21, 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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me