Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma III.6 (No co-occurrence)

Proved
QAlgorithms.Papers.Independent.Support50.P09.noCooccurrence

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

prove2quantum

Let m≥1m\ge1m≥1 and let ∣ϕ⟩A1⋯AmR|\phi\rangle^{A_1\cdots A_mR}∣ϕ⟩A1​⋯Am​R be a normalized pure state on finite nonzero Hilbert spaces. All entropies are von Neumann entropies in bits of marginals of this same state. For K⊆[m]K\subseteq[m]K⊆[m], write AK=⨂i∈KAiA_K=\bigotimes_{i\in K}A_iAK​=⨂i∈K​Ai​ and

Cϕ(K)=12(∑i∈KH(Ai)+H(R)−H(AKR)).C_\phi(K)=\frac12\left(\sum_{i\in K}H(A_i)+H(R)-H(A_KR)\right).Cϕ​(K)=21​(i∈K∑​H(Ai​)+H(R)−H(AK​R)).

Let Rϕ\mathcal R_\phiRϕ​ be the closure of achievable nonnegative rate tuples: for every ϵ>0\epsilon>0ϵ>0, every sufficiently large positive blocklength admits independent local CPTP encoders and a joint receiver CPTP decoder, with log⁡2dim⁡Ci≤nQi\log_2\dim C_i\le nQ_ilog2​dimCi​≤nQi​ and squared fidelity at least 1−ϵ1-\epsilon1−ϵ with the entire original pure state on AnRnA^nR^nAnRn. The reference is untouched; no auxiliary communication or supplied shared entanglement is allowed.

Let L1,…,Lm⊆[m]L_1,\ldots,L_m\subseteq[m]L1​,…,Lm​⊆[m]. Suppose the real linear system ∑k∈LiQk=Cϕ(Li)\sum_{k\in L_i}Q_k=C_\phi(L_i)∑k∈Li​​Qk​=Cϕ​(Li​) for i=1,…,mi=1,\ldots,mi=1,…,m has exactly one solution, including existence. Then

∄j≠k∀i∈[m],(j∈Li ⟺ k∈Li).\nexists j\ne k\quad\forall i\in[m],\quad(j\in L_i\ \Longleftrightarrow\ k\in L_i).∄j=k∀i∈[m],(j∈Li​ ⟺ k∈Li​).

No feasibility condition on that solution is required.

This is the incidence-column obstruction used in the vertex analysis. The source’s word “pair” is read as two distinct elements, following its proof.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P09
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Support50.P09

open QAlgorithms.Papers.Independent.Claimed50.P33

open scoped Matrix ComplexConjugate ComplexOrder

attribute [local instance] Classical.propDecidable Classical.decEq

section Compression

variable {m : ℕ} {D : Fin m → Type} [∀ i, Fintype (D i)] [hD : ∀ i, Nonempty (D i)]

variable {R : Type} [Fintype R] [hR : Nonempty R]

variable (phi : EuclideanSpace ℂ (RegisterBasis D × R)) (hphi : ‖phi‖ = 1)

include hphi hD hR

/-- Lemma III.6, PDF p.11: "pair" means DISTINCT elements, as its
column-dependence proof requires. Unique solvability includes existence. -/
theorem noCooccurrence (hm : 0 < m) (L : Fin m → Finset (Fin m))
    (hunique : ∃! Q : Fin m → ℝ,
      ∀ j, (∑ i ∈ L j, Q i) = entropyThreshold (pureDensity phi) (L j)) :
    ¬ ∃ j k : Fin m, j ≠ k ∧ ∀ i, (j ∈ L i ↔ k ∈ L i) := by sorry

end Compression

end QAlgorithms.Papers.Independent.Support50.P09

end
Source
Distributed Compression and Multiparty Squashed Entanglement, arXiv:0707.2792v2, PDF p. 11, Lemma III.6 (No co-occurrence)
Read-back

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

For m>0m>0m>0, the ambient finite bases Di,RD_i,RDi​,R, and ambient vector ϕ\phiϕ, put ρxy=ϕxϕy‾\rho_{xy}=\phi_x\overline{\phi_y}ρxy​=ϕx​ϕy​​. For a subset AAA of the register indices, let ρAR\rho_{AR}ρAR​ retain AAA and RRR, let ρi\rho_iρi​ retain register iii alone, and put F(A)=(∑i∈AS(ρi)+S(ρR)−S(ρAR))/2F(A)=(\sum_{i\in A}S(\rho_i)+S(\rho_R)-S(\rho_{AR}))/2F(A)=(∑i∈A​S(ρi​)+S(ρR​)−S(ρAR​))/2, where S(X)=−Re⁡Tr⁡[f(X)]S(X)=-\operatorname{Re}\operatorname{Tr}[f(X)]S(X)=−ReTr[f(X)], f(x)=xlog⁡2xf(x)=x\log_2xf(x)=xlog2​x, f(0)=0f(0)=0f(0)=0, is defined by continuous functional calculus. Let L0,…,Lm−1L_0,\ldots,L_{m-1}L0​,…,Lm−1​ be arbitrary subsets of {0,…,m−1}\{0,\ldots,m-1\}{0,…,m−1}. If there exists exactly one real vector Q∈RmQ\in\mathbb R^mQ∈Rm satisfying ∑i∈LjQi=F(Lj)\sum_{i\in L_j}Q_i=F(L_j)∑i∈Lj​​Qi​=F(Lj​) for every j<mj<mj<m, then

¬∃j≠k∀i<m,(j∈Li  ⟺  k∈Li).\neg\exists j\ne k\quad\forall i<m,\quad \bigl(j\in L_i\iff k\in L_i\bigr).¬∃j=k∀i<m,(j∈Li​⟺k∈Li​).

Thus no two distinct register indices have identical membership in every LiL_iLi​. The uniqueness hypothesis ranges over all real vectors, without requiring any additional subset inequalities or nonnegative coordinates; when m=1m=1m=1, the conclusion already holds because there are no distinct indices. No normalization condition on ϕ\phiϕ appears in the displayed declaration.

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

    Confirmed by the moderator at approval.

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