Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Maximum over disclosed outcomes

Open
QAlgorithms.Papers.Independent.Intakenext100.P77.classical_disclosure_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.

Maximizing over coordinates and positive-probability outcomes of the other coordinates gives

I(A1,…,Am;E)≤mmax⁡i, a:Pr⁡[A≠i=a]>0I(Ai;E∣A≠i=a).I(A_1,\ldots,A_m;E)\le m\max_{i,\,a:\Pr[A_{\ne i}=a]>0}I(A_i;E\mid A_{\ne i}=a).I(A1​,…,Am​;E)≤mi,a:Pr[A=i​=a]>0max​I(Ai​;E∣A=i​=a).

The finite maximum is nonempty under normalization. Null outcomes do not define conditional experiments. This permits a pointwise bound after all other key bits are disclosed.

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

/-- Lemma H.2, PDF p.24: maximize additionally over positive-probability
outcomes of the other coordinates. Null outcomes are not experiments. -/
theorem classical_disclosure_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 * disclosureMaximum 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, Lemma H.2: maximum over disclosed outcomes
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 ∑wp(w)=1\sum_wp(w)=1∑w​p(w)=1, and let Ki:Ω→AiK_i:\Omega\to A_iKi​:Ω→Ai​ and Z:Ω→EZ:\Omega\to EZ:Ω→E. Assume joint independence: for every tuple a∈∏i<mAia\in\prod_{i<m}A_ia∈∏i<m​Ai​,

∑w: ∀i, Ki(w)=aip(w)=∏i<m∑w: Ki(w)=aip(w).\sum_{w:\,\forall i,\ K_i(w)=a_i}p(w) =\prod_{i<m}\sum_{w:\,K_i(w)=a_i}p(w).w:∀i, Ki​(w)=ai​∑​p(w)=i<m∏​w:Ki​(w)=ai​∑​p(w).

For a finite-valued function FFF, write 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); define Iq(F;G)=H(qF)+H(qG)−H(q(F,G))I_q(F;G)=H(q_F)+H(q_G)-H(q_{(F,G)})Iq​(F;G)=H(qF​)+H(qG​)−H(q(F,G)​), where H(r)=−∑rlog⁡2rH(r)=-\sum r\log_2rH(r)=−∑rlog2​r and 0log⁡20=00\log_2 0=00log2​0=0. For K−i=(Kj)j≠iK_{-i}=(K_j)_{j\ne i}K−i​=(Kj​)j=i​ and any value aaa, define pK−i=a(w)p^{K_{-i}=a}(w)pK−i​=a(w) to equal p(w)/pK−i(a)p(w)/p_{K_{-i}}(a)p(w)/pK−i​​(a) on that fibre and zero elsewhere, with division by zero equal to zero. Then

Ip((Ki)i<m;Z)≤mmax⁡i<m, a∈∏j≠iAjpK−i(a)>0IpK−i=a(Ki;Z).I_p((K_i)_{i<m};Z) \le m\max_{\substack{i<m,\ a\in\prod_{j\ne i}A_j\\p_{K_{-i}}(a)>0}} I_{p^{K_{-i}=a}}(K_i;Z).Ip​((Ki​)i<m​;Z)≤mi<m, a∈∏j=i​Aj​pK−i​​(a)>0​max​IpK−i​=a​(Ki​;Z).

The maximum excludes disclosure values of zero weight; its defining convention is zero for an empty collection, although the stated probability and m≥1m\ge1m≥1 ensure that this collection is 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