Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Operational formation and distillation measures

Open
QAlgorithms.Papers.Independent.Support50.P42.mixed_operational_measures

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

prove2quantum

For a normalized density ρ\rhoρ on positive finite local dimensions, let EC(ρ)E_C(\rho)EC​(ρ) be the infimum of nonnegative eventual singlet-consumption rates for preparing ρ⊗n\rho^{\otimes n}ρ⊗n by local protocols with vanishing global error. Let ED(ρ)E_D(\rho)ED​(ρ) be the supremum of eventual singlet-production rates from ρ⊗n\rho^{\otimes n}ρ⊗n with the same global accuracy convention. Formation rates form a nonempty set bounded below, zero distillation is feasible, and distillation rates are bounded above. For pure inputs and local output ensembles,

EC(ψ)=ED(ψ)=S(ρB),∑jpjEC(ρj)≤EC(ρ),∑jpjED(ρj)≤ED(ρ).E_C(\psi)=E_D(\psi)=S(\rho_B),\qquad \sum_jp_jE_C(\rho_j)\le E_C(\rho),\quad \sum_jp_jE_D(\rho_j)\le E_D(\rho).EC​(ψ)=ED​(ψ)=S(ρB​),j∑​pj​EC​(ρj​)≤EC​(ρ),j∑​pj​ED​(ρj​)≤ED​(ρ).

The expectation inequalities hold for finite adaptive local protocols, including mixed output branches. This uses the paper's operational formation measure, not the later single-copy convex roof; no mixed-state reversibility is claimed.

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.17: operational formation and distillation reduce to pure-state
entropy and cannot increase in expectation under local protocols. Feasibility
and boundedness guards are conclusions, never optimizer hypotheses. -/
theorem mixed_operational_measures :
    (∀ s : Shared, {R | FormationRate s R}.Nonempty ∧ BddBelow {R | FormationRate s R} ∧
      SingletDistillationRate s 0 ∧ BddAbove {R | SingletDistillationRate s R} ∧
      (IsPureShared s → formationCost s=ent s ∧ singletDistillable s=ent s)) ∧
    (∀ (s : Shared) (out : List (ℝ × Shared)), LocalTree s out →
      (out.map fun w => w.1*formationCost w.2).sum ≤ formationCost s ∧
      (out.map fun w => w.1*singletDistillable w.2).sum ≤ singletDistillable s) := by sorry

end QAlgorithms.Papers.Independent.Support50.P42

end
Source
Concentrating Partial Entanglement by Local Operations, arXiv:quant-ph/9511030v1, PDF p. 17, §V: operational formation and distillation measures
Read-back

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

For a bipartite state sss with positive finite local dimensions a,ba,ba,b and positive semidefinite trace-one matrix ρs\rho_sρs​, let Es=S(tr⁡Aρs)E_s=S(\operatorname{tr}_A\rho_s)Es​=S(trA​ρs​), where S(X)=−tr⁡(Xlog⁡2X)S(X)=-\operatorname{tr}(X\log_2X)S(X)=−tr(Xlog2​X), with zero eigenvalues contributing zero. Define its formation-rate set to consist of real R≥0R\ge0R≥0 such that, for every ϵ,δ>0\epsilon,\delta>0ϵ,δ>0, all sufficiently large natural nnn admit a natural mmm and a finite recursive LOCC map LLL with

∣R−m/n∣≤δ,12∥L(Sm)−ρs[n]∥1≤ϵ;|R-m/n|\le\delta,\qquad \tfrac12\|L(S_m)-\rho_s^{[n]}\|_1\le\epsilon;∣R−m/n∣≤δ,21​∥L(Sm​)−ρs[n]​∥1​≤ϵ;

define its singlet-distillation-rate set to consist of real R≥0R\ge0R≥0 such that, for every ϵ,δ>0\epsilon,\delta>0ϵ,δ>0, all sufficiently large nnn admit a natural mmm and finite recursive LOCC LLL with

(R−δ)n≤m,12∥L(ρs[n])−Sm∥1≤ϵ.(R-\delta)n\le m,\qquad \tfrac12\|L(\rho_s^{[n]})-S_m\|_1\le\epsilon.(R−δ)n≤m,21​∥L(ρs[n]​)−Sm​∥1​≤ϵ.

Here SmS_mSm​ is the reindexed mmm-fold tensor power of the antisymmetric singlet projector, S0=1S_0=1S0​=1, ρs[n]\rho_s^{[n]}ρs[n]​ is the reindexed tensor power using the fixed local string-to-index equivalences, and ∥X∥1=Re⁡tr⁡X†X\|X\|_1=\operatorname{Re}\operatorname{tr}\sqrt{X^\dagger X}∥X∥1​=RetrX†X​. Write Cf(s)C_f(s)Cf​(s) for the real infimum of the formation-rate set and Ds(s)D_s(s)Ds​(s) for the real supremum of the distillation-rate set. For every sss, the formation-rate set is nonempty and bounded below, zero is a singlet-distillation rate, and the distillation-rate set is bounded above; if ρs=vv†\rho_s=vv^\daggerρs​=vv† for a unit vector vvv, then Cf(s)=Ds(s)=EsC_f(s)=D_s(s)=E_sCf​(s)=Ds​(s)=Es​. Moreover, for every sss and every finite weighted state list out\mathrm{out}out obtainable by the recursive local-instrument rules,

∑(p,r)∈outp Cf(r)≤Cf(s),∑(p,r)∈outp Ds(r)≤Ds(s).\sum_{(p,r)\in\mathrm{out}}p\,C_f(r)\le C_f(s), \qquad \sum_{(p,r)\in\mathrm{out}}p\,D_s(r)\le D_s(s).(p,r)∈out∑​pCf​(r)≤Cf​(s),(p,r)∈out∑​pDs​(r)≤Ds​(s).

In these definitions, finite LOCC maps are generated by identities and complete finite local Kraus measurements with outcome-dependent recursive continuations. The weighted-list rules start with [(1,s)][(1,s)][(1,s)], branch using a local instrument whose nonnegative outcome weights sum to one and whose weighted output states equal its Kraus branches, and allow replacing a list of states with common dimensions by their weighted mixture; subsequent branch weights multiply. No purity assumption is imposed on states in the last two inequalities, and the sums count list entries with their multiplicities.

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