Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Equality in (1) (pp. 3–4) — equality forces ρ^ij_A′ to depend only on i and ρ^ij_B′ only on j on the support of p

Proved
NoLocalBroadcast.Broadcast.display_1_equality

by mikedeng1 · Oct 24, 2026 · Mathlib 0df444a (Lean v4.33.1)

mutual-informationp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-strengthenedp2o-v1strict-concavityvon-neumann-entropy

In the setting of display (1) — finite sets III, JJJ, a probability distribution {pij}\{p_{ij}\}{pij​} on I×JI\times JI×J, states ρij\rho^{ij}ρij of A′B′A'B'A′B′ and σ~=∑ijpij∣i⟩⟨i∣A⊗∣j⟩⟨j∣B⊗ρA′B′ij\tilde\sigma=\sum_{ij}p_{ij}|i\rangle\langle i|_A\otimes|j\rangle\langle j|_B\otimes\rho^{ij}_{A'B'}σ~=∑ij​pij​∣i⟩⟨i∣A​⊗∣j⟩⟨j∣B​⊗ρA′B′ij​ — suppose that

I(σ~)=I({pij})+∑ijpij I(ρA′B′ij).I(\tilde\sigma)=I(\{p_{ij}\})+\sum_{ij}p_{ij}\,I(\rho^{ij}_{A'B'}).I(σ~)=I({pij​})+ij∑​pij​I(ρA′B′ij​).

Then

  1. ρA′ij=ρA′ij′\rho^{ij}_{A'}=\rho^{ij'}_{A'}ρA′ij​=ρA′ij′​ whenever pij>0p_{ij}>0pij​>0 and pij′>0p_{ij'}>0pij′​>0;
  2. ρB′ij=ρB′i′j\rho^{ij}_{B'}=\rho^{i'j}_{B'}ρB′ij​=ρB′i′j​ whenever pij>0p_{ij}>0pij​>0 and pi′j>0p_{i'j}>0pi′j​>0.

That is, on the support of ppp the reduction ρA′ij\rho^{ij}_{A'}ρA′ij​ depends only on iii and ρB′ij\rho^{ij}_{B'}ρB′ij​ only on jjj, which is the paper's "ρA′ij=ρA′i\rho^{ij}_{A'}=\rho^i_{A'}ρA′ij​=ρA′i​ and ρB′ij=ρB′j\rho^{ij}_{B'}=\rho^j_{B'}ρB′ij​=ρB′j​". It is the step of Theorem 3's proof that shows σ~\tilde\sigmaσ~ to be classical-classical.

Formalization Note The conventions are those of display (1); ρA′ij\rho^{ij}_{A'}ρA′ij​ is traceRight (ρij (i,j)) and ρB′ij\rho^{ij}_{B'}ρB′ij​ is traceLeft (ρij (i,j)).

Differences from the source:

  • generalization: the specific σ̃ of the proof of Theorem 3, with equality I(σ̃) = I_CC(ρ) + Σ p_ij I(ρ^ij) → every σ̃ of the form Σ_ij p_ij |i⟩⟨i| ⊗ |j⟩⟨j| ⊗ ρ^ij, with equality I(σ̃) = I({p_ij}) + Σ p_ij I(ρ^ij); reason: in the proof I({p_ij}) = I_CC(ρ), so the proof's equality is an instance
  • reading: ρ^ij_A′ = ρ^i_A′ and ρ^ij_B′ = ρ^j_B′ (ρ^i_A′, ρ^j_B′ not defined) → on the support of p, ρ^ij_A′ does not depend on j and ρ^ij_B′ does not depend on i; reason: the only meaning of the notation; off the support ρ^ij does not enter σ̃
  • encoding: ρ^ij defined where p_ij > 0 → ρ^ij a state for every (i, j); reason: the conclusion only concerns pairs with p_ij > 0
  • encoding: log of unspecified base in S(ρ) = −Tr ρ log ρ → QAlgorithms.vnEntropy, base 2; reason: every statement here is invariant under the base of the logarithm
  • encoding: σ̃ = Σ_ij p_ij |i_A j_B⟩⟨i_A j_B| ⊗ ρ^ij_{A′B′} on registers A, B with orthonormal states and quantum systems A′, B′, cut AA′ : BB′ → flaggedState p ρij on (ι × a′) × (κ × b′) for finite register types ι, κ and nonempty finite a′, b′, registers the computational bases of ι, κ; ρ^ij_{A′} = traceRight (ρij ij), ρ^ij_{B′} = traceLeft (ρij ij); reason: any orthonormal register gives a unitarily equivalent state with the same entropies; empty ι or κ is excluded by Σ p = 1; same instances
Preamble
import Mathlib
import Definitions.Def_NoLocalBroadcast_Broadcast_Model
Formal statement
namespace NoLocalBroadcast.Broadcast

open Matrix
open scoped Kronecker

/-- Equality in (1), pp. 3–4: if `I(σ̃) = I({p_ij}) + Σ_{ij} p_{ij} I(ρ^{ij})`, then on the support
of `p` the reduction `ρ^{ij}_{A′}` does not depend on `j` and `ρ^{ij}_{B′}` does not depend on `i`. -/
theorem display_1_equality {ι κ a' b' : Type} [Fintype ι] [DecidableEq ι] [Fintype κ]
    [DecidableEq κ] [Fintype a'] [DecidableEq a'] [Nonempty a'] [Fintype b'] [DecidableEq b']
    [Nonempty b']
    (p : ι × κ → ℝ) (hp0 : ∀ ij, 0 ≤ p ij) (hp1 : ∑ ij, p ij = 1)
    (ρij : ι × κ → Matrix (a' × b') (a' × b') ℂ)
    (hρij : ∀ ij, QAlgorithms.IsDensityMatrix (ρij ij))
    (heq : mutualInfo (flaggedState p ρij) =
      mutualInfo (Matrix.diagonal fun ij => (p ij : ℂ)) + ∑ ij, p ij * mutualInfo (ρij ij)) :
    (∀ i j j', 0 < p (i, j) → 0 < p (i, j') →
      QAlgorithms.traceRight (ρij (i, j)) = QAlgorithms.traceRight (ρij (i, j'))) ∧
    (∀ i i' j, 0 < p (i, j) → 0 < p (i', j) →
      QAlgorithms.traceLeft (ρij (i, j)) = QAlgorithms.traceLeft (ρij (i', j))) := by sorry

end NoLocalBroadcast.Broadcast
Source
Piani, Horodecki & Horodecki, No-local-broadcasting theorem for quantum correlations, arXiv:0707.0848v2, pp. 3–4, equality in (1), proof of Theorem 3
Human review
  • Endorsed by Shuze Chen · Oct 24, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · 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