Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Full-string classical information

Open
QAlgorithms.Papers.Independent.Intakenext100.P77.classical_whole_string_bound

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

prove2quantum

Let m≥1m\ge1m≥1 and let A1,…,AmA_1,\ldots,A_mA1​,…,Am​ be jointly independent random variables with finite alphabets on a normalized finite probability space. Let EEE be any finite-valued random variable on the same space; it may depend arbitrarily on the family. Information is Shannon mutual information in bits. Write A<iA_{<i}A<i​ for preceding coordinates and A≠iA_{\ne i}A=i​ for all other coordinates.

The full-string information satisfies

I(A1,…,Am;E)≤mmax⁡1≤i≤mI(Ai;E∣A≠i).I(A_1,\ldots,A_m;E)\le m\max_{1\le i\le m}I(A_i;E\mid A_{\ne i}).I(A1​,…,Am​;E)≤m1≤i≤mmax​I(Ai​;E∣A=i​).

The maximum is over a nonempty finite index set. This provides the factor mmm in the whole-key bound.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P77
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Intakenext100.P77

open scoped BigOperators ComplexConjugate ComplexOrder

open QAlgorithms

-- The repair instruction authorizes imports of pinned accepted definitions.
-- These are definitions only; no imported paper theorem is used here.

open QAlgorithms.Papers.Independent.Dependency50.P47 (Law)

open QAlgorithms.Papers.Independent.Information100.P04 (Measurement)

open QAlgorithms.Papers.Independent.Information100.P27 (shannon)

open QAlgorithms.Papers.Independent.Information100.P39 (pushLaw)

open QAlgorithms.Papers.Independent.Support50.P16 (trivialMeasurement)

attribute [local instance] Classical.propDecidable Classical.decEq

/-- Theorem H.1, PDF p.24: full independent-string information is bounded by
m times the maximum coordinate information with all other coordinates disclosed. -/
theorem classical_whole_string_bound {Omega E : Type}
    [Fintype Omega] [Fintype E] {m : ℕ} (hm : 1 ≤ m)
    {A : Fin m → Type} [∀ i, Fintype (A i)] (p : Law Omega)
    (key : (i : Fin m) → Omega → A i) (eve : Omega → E)
    (hind : JointIndependent p.prob key) :
    classicalMutualInfo p.prob (fun w i => key i w) eve ≤
      m * coordinateMaximum p.prob key eve := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P77

end
Source
A Proof of the Security of Quantum Key Distribution, arXiv:quant-ph/9912053v1, PDF p. 24, Theorem H.1: full-string classical information
Read-back

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

Let Ω,E\Omega,EΩ,E be finite types, let m≥1m\ge1m≥1, let each AiA_iAi​, i<mi<mi<m, be finite, let p:Ω→Rp:\Omega\to\mathbb Rp:Ω→R be nonnegative with total mass one, and let Ki:Ω→AiK_i:\Omega\to A_iKi​:Ω→Ai​ and Z:Ω→EZ:\Omega\to EZ:Ω→E. Assume that for every a∈∏i<mAia\in\prod_{i<m}A_ia∈∏i<m​Ai​, the weight of {w:∀i, Ki(w)=ai}\{w:\forall i,\ K_i(w)=a_i\}{w:∀i, Ki​(w)=ai​} equals the product of the weights of the individual events {w:Ki(w)=ai}\{w:K_i(w)=a_i\}{w:Ki​(w)=ai​}. For any finite-valued FFF, define pF(f)=∑w:F(w)=fp(w)p_F(f)=\sum_{w:F(w)=f}p(w)pF​(f)=∑w:F(w)=f​p(w), H(q)=−∑qlog⁡2qH(q)=-\sum q\log_2qH(q)=−∑qlog2​q with 0log⁡20=00\log_2 0=00log2​0=0, and Ip(F;G)=H(pF)+H(pG)−H(p(F,G))I_p(F;G)=H(p_F)+H(p_G)-H(p_{(F,G)})Ip​(F;G)=H(pF​)+H(pG​)−H(p(F,G)​). If DDD is another finite-valued function, define pD=a(w)=p(w)/pD(a)p^{D=a}(w)=p(w)/p_D(a)pD=a(w)=p(w)/pD​(a) on the fibre D(w)=aD(w)=aD(w)=a, zero elsewhere, with division by zero equal to zero, and put Ip(F;G∣D)=∑apD(a)IpD=a(F;G)I_p(F;G\mid D)=\sum_ap_D(a)I_{p^{D=a}}(F;G)Ip​(F;G∣D)=∑a​pD​(a)IpD=a​(F;G). Writing K−i=(Kj)j≠iK_{-i}=(K_j)_{j\ne i}K−i​=(Kj​)j=i​, one has

Ip((Ki)i<m;Z)≤mmax⁡i<mIp(Ki;Z∣K−i).I_p((K_i)_{i<m};Z) \le m\max_{i<m} I_p(K_i;Z\mid K_{-i}).Ip​((Ki​)i<m​;Z)≤mi<mmax​Ip​(Ki​;Z∣K−i​).

The maximum is over the averaged conditional informations, including zero contributions from null disclosure outcomes, and m≥1m\ge1m≥1 makes its index set nonempty.

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