Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

No positive-probability entangled pure output from a product input

Proved
QAlgorithms.Papers.Independent.Support50.P42.zero_entanglement

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

prove2quantum

Let the shared input be a normalized pure state with entropy of entanglement zero. Consider any finite adaptive local protocol, allowing classical messages, local ancillas, disposal and postselection. Every pure final leaf of positive probability satisfies

pj>0⟹E(ψj)=0.p_j>0\quad\Longrightarrow\quad E(\psi_j)=0.pj​>0⟹E(ψj​)=0.

Consequently an entangled pure target cannot be prepared with any positive success probability. This retains the source's exact postselection obstruction, rather than only a zero asymptotic rate; formal zero-probability leaves do not count as successful preparations.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P42
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Support50.P42

open scoped BigOperators Matrix ComplexConjugate

open MeasureTheory ProbabilityTheory

attribute [local instance] Classical.propDecidable Classical.decEq

-- Reuse the exact accepted objects, without introducing same-name aliases.

open Information100.P21 (Op Vec FiniteLOCC)

open Dependency50.P42 (dimensionedPower singlets)

open Dependency50.P48 (pureFidelity)

open Gap48.P32 (pairOfState)

open Next46.P39 (rectAct)

/-- PDF p.16: exact postselection obstruction; every positive-probability pure
leaf from a product input has zero entanglement. Zero-downCount leaves do not
witness successful preparation. -/
theorem zero_entanglement (s : Shared) (hs : IsPureShared s) (hzero : ent s=0)
    (out : List (ℝ × Shared)) (hlocal : LocalTree s out) :
    ∀ w∈out, 0<w.1 → IsPureShared w.2 → ent w.2=0 := by sorry

end QAlgorithms.Papers.Independent.Support50.P42

end
Source
Concentrating Partial Entanglement by Local Operations, arXiv:quant-ph/9511030v1, PDF p. 16, §V: no positive-probability creation from a product input
Read-back

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

Let sss be a bipartite state with positive finite local dimensions and positive semidefinite trace-one matrix ρs\rho_sρs​. Suppose ρs=vv†\rho_s=vv^\daggerρs​=vv† for a unit vector vvv, and S(tr⁡Aρs)=0S(\operatorname{tr}_A\rho_s)=0S(trA​ρs​)=0, where S(X)=−tr⁡(Xlog⁡2X)S(X)=-\operatorname{tr}(X\log_2X)S(X)=−tr(Xlog2​X), with zero eigenvalues contributing zero. Let out\mathrm{out}out be any finite list of pairs consisting of a real weight and another such bipartite state, obtainable from sss by the following recursive rules: stopping produces [(1,s)][(1,s)][(1,s)]; a local instrument chooses one party, uses finitely many outcome groups of Kraus matrices whose lifted completeness sum is III, leaves the other party’s dimension unchanged, and produces states rjr_jrj​ and nonnegative weights pjp_jpj​ summing to one with pjρrjp_j\rho_{r_j}pj​ρrj​​ equal to the corresponding Kraus output, after which recursive branch lists are concatenated with their weights multiplied by pjp_jpj​; or an obtainable list may be replaced by [(1,t)][(1,t)][(1,t)] when all its state dimensions equal those of ttt and their weighted matrix sum is ρt\rho_tρt​. Then every pair (p,r)(p,r)(p,r) occurring in out\mathrm{out}out satisfies

p>0 and ρr=uu† for some unit u⟹S(tr⁡Aρr)=0.p>0\ \text{and}\ \rho_r=uu^\dagger\ \text{for some unit }u \quad\Longrightarrow\quad S(\operatorname{tr}_A\rho_r)=0.p>0 and ρr​=uu† for some unit u⟹S(trA​ρr​)=0.

The conclusion applies only to strictly positive-weight entries whose output states are pure; it imposes no entropy conclusion on other entries.

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