Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 7: purified-state one-way secret-key monogamy

Open
QAlgorithms.Papers.Independent.Gap48.P35.pure_key_monogamy

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

prove2quantum

All systems are finite nonzero-dimensional complex quantum systems. Density states are positive semidefinite with trace one, and SSS is von Neumann entropy in bits. Write EfE_fEf​ for formation, I←I^{\leftarrow}I← for maximal Holevo correlation measured on the second party, ECE_CEC​ for asymptotic singlet preparation cost, EDE_DED​ for EPR distillation rate, CDC_DCD​ for net common randomness, and KKK for secret-key rate. A left arrow means communication from the second legitimate party to the first. Key secrecy includes all public transcripts. Asymptotic tasks use independent copies, vanishing error and no extra initially shared resource.

Let ρABCE\rho_{ABCE}ρABCE​ be a normalized pure state. In each term the systems after the vertical bar belong to Eve; all four systems are retained and merely regrouped.

K←(A:B∣CE)ρ+K←(A:C∣BE)ρ≤K←(A:BC∣E)ρ.K^{\leftarrow}(A:B\mid CE)_\rho+K^{\leftarrow}(A:C\mid BE)_\rho\le K^{\leftarrow}(A:BC\mid E)_\rho.K←(A:B∣CE)ρ​+K←(A:C∣BE)ρ​≤K←(A:BC∣E)ρ​.

This is pure-state secret-key monogamy. The first term gives both CCC and EEE to Eve.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Gap48_P35
Formal statement
namespace QAlgorithms.Papers.Independent.Gap48.P35

open scoped Matrix ComplexConjugate ComplexOrder

open Filter Topology

open Information100.P21 (Op)

open Information100.P08 (IsPure formation measuredCorrelation)

open Dependency50.P19 (marginalRA marginalRB)

noncomputable section

/-- PDF p.5, Theorem 7: globally pure ABCE; Eve holds CE in the first term, BE in the second, and E in the grouped term. -/
theorem pure_key_monogamy {A : Type} {B : Type} {C : Type} {E : Type}
    [Fintype A] [DecidableEq A] [Nonempty A] [Fintype B] [DecidableEq B] [Nonempty B] [Fintype C] [DecidableEq C] [Nonempty C] [Fintype E] [DecidableEq E] [Nonempty E]
    (rho : Op (A × (B × (C × E)))) (hrho : IsDensityMatrix rho) (hpure : IsPure rho) :
    keyLeft rho + keyLeft (groupACBE rho) ≤ keyLeft (groupABCE rho) := by sorry

end

end QAlgorithms.Papers.Independent.Gap48.P35
Source
Monogamy of entanglement and other correlations, arXiv:quant-ph/0310037v1, PDF p. 5, Theorem 7: purified-state one-way secret-key monogamy
Read-back

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

For finite, nonempty sets A,B,C,EA,B,C,EA,B,C,E, each with decidable equality, let ρ\rhoρ be a positive semidefinite trace-one matrix on A⊗B⊗C⊗EA\otimes B\otimes C\otimes EA⊗B⊗C⊗E, and additionally suppose ρ=∣v⟩⟨v∣\rho=|v\rangle\langle v|ρ=∣v⟩⟨v∣ for some ∥v∥=1\|v\|=1∥v∥=1. Then

KB→A ∣ CE(ρ)+KC→A ∣ BE(ρ)≤KBC→A ∣ E(ρ).K_{B\to A\,|\,CE}(\rho)+K_{C\to A\,|\,BE}(\rho) \le K_{BC\to A\,|\,E}(\rho).KB→A∣CE​(ρ)+KC→A∣BE​(ρ)≤KBC→A∣E​(ρ).

The three terms use, respectively, the orderings B:A:(CE)B:A:(C E)B:A:(CE), C:A:(BE)C:A:(B E)C:A:(BE), and (BC):A:E(B C):A:E(BC):A:E of the same matrix; regrouping changes no entries beyond this coordinate permutation. For a state ω\omegaω ordered as sender SSS, receiver RRR, and environment ZZZ, the quantity KS→R ∣ Z(ω)K_{S\to R\,|\,Z}(\omega)KS→R∣Z​(ω) is the supremum over real rates rrr with the following property. For every natural nnn, there are positive integers ln,mnl_n,m_nln​,mn​, a sender POVM {Qtk}t<ln,k<mn\{Q_{tk}\}_{t<l_n,k<m_n}{Qtk​}t<ln​,k<mn​​ on S⊗nS^{\otimes n}S⊗n, and, for each ttt, a receiver POVM {Dtj}j<mn\{D_{tj}\}_{j<m_n}{Dtj​}j<mn​​ on R⊗nR^{\otimes n}R⊗n; every POVM consists of positive semidefinite matrices summing to the identity. Define

τtk=Tr⁡Sn ⁣[ω⊗n(Qtk⊗I)],Jkj=∑tRe⁡Tr⁡ ⁣[DtjTr⁡Znτtk],sk=∑t∣t⟩⟨t∣⊗Tr⁡Rnτtk.\tau_{tk}=\operatorname{Tr}_{S^n}\!\left[\omega^{\otimes n}(Q_{tk}\otimes I)\right], \quad J_{kj}=\sum_t\operatorname{Re}\operatorname{Tr}\!\left[D_{tj}\operatorname{Tr}_{Z^n}\tau_{tk}\right], \quad s_k=\sum_t|t\rangle\langle t|\otimes\operatorname{Tr}_{R^n}\tau_{tk}.τtk​=TrSn​[ω⊗n(Qtk​⊗I)],Jkj​=t∑​ReTr[Dtj​TrZn​τtk​],sk​=t∑​∣t⟩⟨t∣⊗TrRn​τtk​.

There must exist ϵn≥0\epsilon_n\ge0ϵn​≥0 tending to zero and a real F≥0F\ge0F≥0, independent of nnn, such that ln≤2nFl_n\le2^{nF}ln​≤2nF, ∑k≠jJkj≤ϵn\sum_{k\ne j}J_{kj}\le\epsilon_n∑k=j​Jkj​≤ϵn​, and ∑k∣Re⁡Tr⁡sk−1/mn∣≤ϵn\sum_k|\operatorname{Re}\operatorname{Tr}s_k-1/m_n|\le\epsilon_n∑k​∣ReTrsk​−1/mn​∣≤ϵn​. For each nnn, there must also exist density matrices ηk\eta_kηk​ and a common density matrix σn\sigma_nσn​ on Cln⊗Z⊗n\mathbb C^{l_n}\otimes Z^{\otimes n}Cln​⊗Z⊗n such that (Re⁡Tr⁡sk)ηk=sk(\operatorname{Re}\operatorname{Tr}s_k)\eta_k=s_k(ReTrsk​)ηk​=sk​ and ∥ηk−σn∥1≤ϵn\|\eta_k-\sigma_n\|_1\le\epsilon_n∥ηk​−σn​∥1​≤ϵn​ for every key kkk, where ∥X∥1=Re⁡Tr⁡X†X\|X\|_1=\operatorname{Re}\operatorname{Tr}\sqrt{X^\dagger X}∥X∥1​=ReTrX†X​; finally log⁡2mn/n→r\log_2m_n/n\to rlog2​mn​/n→r. These requirements include n=0n=0n=0, with its rate quotient defined as zero, and include keys of zero mass, for which the stated existence and distance conditions on ηk\eta_kηk​ still apply.

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

    Confirmed by the moderator at approval.

  • Endorsed by Goku · Oct 22, 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