Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Remark after Definition 6 (p. 3) — every classical-classical state is locally broadcastable

Proved
NoLocalBroadcast.Broadcast.cc_locally_broadcastable

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

classical-correlationslocal-broadcastingp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let ρ\rhoρ be a classical-classical state of a finite-dimensional bipartite system A⊗BA\otimes BA⊗B: ρ=∑ijpij∣i⟩⟨i∣⊗∣j⟩⟨j∣\rho=\sum_{ij}p_{ij}|i\rangle\langle i|\otimes|j\rangle\langle j|ρ=∑ij​pij​∣i⟩⟨i∣⊗∣j⟩⟨j∣ for orthonormal families {∣i⟩}\{|i\rangle\}{∣i⟩} of AAA, {∣j⟩}\{|j\rangle\}{∣j⟩} of BBB and a joint distribution pijp_{ij}pij​. Then ρ\rhoρ is locally broadcastable: there are channels ΘA:A→AA′\Theta_A:A\to AA'ΘA​:A→AA′ and ΘB:B→BB′\Theta_B:B\to BB'ΘB​:B→BB′ such that

Tr⁡A′B′[(ΘA⊗ΘB)[ρ]]=Tr⁡AB[(ΘA⊗ΘB)[ρ]]=ρ.\operatorname{Tr}_{A'B'}\big[(\Theta_A\otimes\Theta_B)[\rho]\big]=\operatorname{Tr}_{AB}\big[(\Theta_A\otimes\Theta_B)[\rho]\big]=\rho .TrA′B′​[(ΘA​⊗ΘB​)[ρ]]=TrAB​[(ΘA​⊗ΘB​)[ρ]]=ρ.

This is the converse of Theorem 3; together they characterize the locally broadcastable states.

Formalization Note No separate density-matrix hypothesis is needed: a classical-classical matrix is a state.

Differences from the source:

  • encoding: finite-dimensional systems A, B and quantum states → nonempty finite index types a, b; states are positive semidefinite trace-one matrices (QAlgorithms.IsDensityMatrix), A the first factor of a × b; reason: the paper works in finite dimension throughout; same instances
  • encoding: local maps / channels (trace-preserving completely positive, footnote [21]) → finite normalized Kraus families K : Fin m → Matrix a₁ a ℂ, L : Fin n → Matrix b₁ b ℂ; the local channel Λ_A ⊗ Γ_B has the Kraus operators K k ⊗ₖ L l (localApply); reason: in finite dimension these are exactly the CPTP maps and their tensor products; same instances
  • encoding: the two-copy system (AA′)(BB′) with copies X = AB, Y = A′B′ → matrices indexed by ((x, x′), (y, y′)) ∈ (a × a) × (b × b); A′, B′ have the types of A, B; the cut AA′ : BB′ is the outer product; σ_X = traceCopies σ, σ_Y = traceOriginals σ; reason: Lean carrier convention; same operators
  • encoding: classical-classical: two orthonormal sets {|i⟩}, {|j⟩} and a joint distribution p_ij with ρ = Σ_ij p_ij |i⟩⟨i| ⊗ |j⟩⟨j| → IsClassicalClassical: Orthonormal families e : Fin k → EuclideanSpace ℂ a, f : Fin l → EuclideanSpace ℂ b, p ≥ 0 with Σ p = 1, ρ = Σ_ij p_ij pureDensity (e i) ⊗ₖ pureDensity (f j); reason: an orthonormal set of a finite-dimensional space is a finite family; p may vanish, so families and sets give the same states
Preamble
import Mathlib
import Definitions.Def_NoLocalBroadcast_Broadcast_Model
Formal statement
namespace NoLocalBroadcast.Broadcast

open Matrix
open scoped Kronecker

/-- Remark after Definition 6, p. 3: every classical-classical state is locally broadcastable. -/
theorem cc_locally_broadcastable {a b : Type} [Fintype a] [DecidableEq a] [Nonempty a]
    [Fintype b] [DecidableEq b] [Nonempty b]
    (ρ : Matrix (a × b) (a × b) ℂ) (hcc : IsClassicalClassical ρ) :
    IsLocallyBroadcastable ρ := by sorry

end NoLocalBroadcast.Broadcast
Source
Piani, Horodecki & Horodecki, No-local-broadcasting theorem for quantum correlations, arXiv:0707.0848v2, p. 3, remark after Definition 6
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