Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§III unnumbered: three-qutrit counterexample to cost monogamy

Open
QAlgorithms.Papers.Independent.Gap48.P35.qutrit_cost_counterexample

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

prove2quantum

All systems are finite nonzero-dimensional complex quantum systems. Density states are positive semidefinite with trace one, and SSS is von Neumann entropy in bits. Write EfE_fEf​ for formation, I←I^{\leftarrow}I← for maximal Holevo correlation measured on the second party, ECE_CEC​ for asymptotic singlet preparation cost, EDE_DED​ for EPR distillation rate, CDC_DCD​ for net common randomness, and KKK for secret-key rate. A left arrow means communication from the second legitimate party to the first. Key secrecy includes all public transcripts. Asymptotic tasks use independent copies, vanishing error and no extra initially shared resource.

On three qutrits set ∣ψ⟩=(∣123⟩−∣132⟩+∣231⟩−∣213⟩+∣312⟩−∣321⟩)/6|\psi\rangle=(|123\rangle-|132\rangle+|231\rangle-|213\rangle+|312\rangle-|321\rangle)/\sqrt6∣ψ⟩=(∣123⟩−∣132⟩+∣231⟩−∣213⟩+∣312⟩−∣321⟩)/6​ and ρ=∣ψ⟩⟨ψ∣\rho=|\psi\rangle\langle\psi|ρ=∣ψ⟩⟨ψ∣. The vector has norm one, ρA=I3/3\rho_A=I_3/3ρA​=I3​/3, and each of the ABABAB and ACACAC marginal costs is one ebit.

EC(ρA:BC)=S(ρA)=log⁡23<2=EC(ρAB)+EC(ρAC).E_C(\rho_{A:BC})=S(\rho_A)=\log_2 3<2=E_C(\rho_{AB})+E_C(\rho_{AC}).EC​(ρA:BC​)=S(ρA​)=log2​3<2=EC​(ρAB​)+EC​(ρAC​).

This is a fixed-state counterexample to entanglement-cost monogamy. The one-ebit marginal fact is credited in the source to Yura [17].

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Gap48_P35
Formal statement
namespace QAlgorithms.Papers.Independent.Gap48.P35

open scoped Matrix ComplexConjugate ComplexOrder

open Filter Topology

open Information100.P21 (Op)

open Information100.P08 (IsPure formation measuredCorrelation)

open Dependency50.P19 (marginalRA marginalRB)

noncomputable section

/-- PDF p.4, §III: the fixed signed three-qutrit counterexample, including its normalization, maximally mixed A marginal, log2(3) joint cost and one-ebit pair costs (credited there to Yura [17]). -/
theorem qutrit_cost_counterexample
     :
    let rho := pureDensity threeQutritAlternatingVector
    ‖threeQutritAlternatingVector‖ = 1 ∧
      traceRight rho = (1 / 3 : ℂ) • (1 : Op (Fin 3)) ∧
      finiteSystemPreparationCost rho = vnEntropy (traceRight rho) ∧
      vnEntropy (traceRight rho) = Real.logb 2 3 ∧
      Real.logb 2 3 < (1 : ℝ) + 1 ∧
      finiteSystemPreparationCost (marginalRA rho) = 1 ∧ finiteSystemPreparationCost (marginalRB rho) = 1 ∧
      finiteSystemPreparationCost rho < finiteSystemPreparationCost (marginalRA rho) + finiteSystemPreparationCost (marginalRB rho) := by sorry

end

end QAlgorithms.Papers.Independent.Gap48.P35
Source
Monogamy of entanglement and other correlations, arXiv:quant-ph/0310037v1, PDF p. 4, §III unnumbered: three-qutrit counterexample to cost monogamy
Read-back

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

On three copies A,B,CA,B,CA,B,C of {0,1,2}\{0,1,2\}{0,1,2}, define

∣v⟩=∣012⟩+∣120⟩+∣201⟩−∣021⟩−∣102⟩−∣210⟩6,ρ=∣v⟩⟨v∣.|v\rangle=\frac{|012\rangle+|120\rangle+|201\rangle-|021\rangle-|102\rangle-|210\rangle}{\sqrt6}, \qquad \rho=|v\rangle\langle v|.∣v⟩=6​∣012⟩+∣120⟩+∣201⟩−∣021⟩−∣102⟩−∣210⟩​,ρ=∣v⟩⟨v∣.

The declaration asserts all of the following:

∥v∥=1,ρA=Tr⁡BCρ=13I3,Eprep(ρA:BC)=S(ρA)=log⁡23<1+1,\|v\|=1,\qquad \rho_A=\operatorname{Tr}_{BC}\rho=\tfrac13I_3,\qquad E_{\mathrm{prep}}(\rho_{A:BC})=S(\rho_A)=\log_2 3<1+1,∥v∥=1,ρA​=TrBC​ρ=31​I3​,Eprep​(ρA:BC​)=S(ρA​)=log2​3<1+1, Eprep(ρAB)=1,Eprep(ρAC)=1,Eprep(ρA:BC)<Eprep(ρAB)+Eprep(ρAC),E_{\mathrm{prep}}(\rho_{AB})=1,\qquad E_{\mathrm{prep}}(\rho_{AC})=1,\qquad E_{\mathrm{prep}}(\rho_{A:BC}) < E_{\mathrm{prep}}(\rho_{AB})+E_{\mathrm{prep}}(\rho_{AC}),Eprep​(ρAB​)=1,Eprep​(ρAC​)=1,Eprep​(ρA:BC​)<Eprep​(ρAB​)+Eprep​(ρAC​),

where ρAB=Tr⁡Cρ\rho_{AB}=\operatorname{Tr}_C\rhoρAB​=TrC​ρ, ρAC=Tr⁡Bρ\rho_{AC}=\operatorname{Tr}_B\rhoρAC​=TrB​ρ, and S(X)=−Re⁡Tr⁡f(X)S(X)=-\operatorname{Re}\operatorname{Tr}f(X)S(X)=−ReTrf(X) for the spectrally applied function f(x)=xlog⁡2xf(x)=x\log_2xf(x)=xlog2​x. For any bipartite matrix σXY\sigma_{XY}σXY​, the quantity Eprep(σ)E_{\mathrm{prep}}(\sigma)Eprep​(σ) means the infimum over real eee such that, for every ϵ,δ>0\epsilon,\delta>0ϵ,δ>0, there exist natural numbers m,nm,nm,n, with n>0n>0n>0, and a finite local-operations-and-classical-communication map Λ\LambdaΛ from two systems of dimension 2m2^m2m to systems of dimensions ∣X∣n,∣Y∣n|X|^n,|Y|^n∣X∣n,∣Y∣n, with ∣e−m/n∣≤δ|e-m/n|\le\delta∣e−m/n∣≤δ and 12∥Λ(s⊗m)−σ⊗n∥1≤ϵ\frac12\|\Lambda(s^{\otimes m})-\sigma^{\otimes n}\|_1\le\epsilon21​∥Λ(s⊗m)−σ⊗n∥1​≤ϵ. Here sss is the projector onto (∣01⟩−∣10⟩)/2(|01\rangle-|10\rangle)/\sqrt2(∣01⟩−∣10⟩)/2​, ∥Z∥1=Re⁡Tr⁡Z†Z\|Z\|_1=\operatorname{Re}\operatorname{Tr}\sqrt{Z^\dagger Z}∥Z∥1​=ReTrZ†Z​, and all finite systems and tensor powers are reindexed by the fixed bijections used in the definitions. A finite local map is built recursively from identities by finite local Kraus measurements satisfying ∑iKi†Ki=I\sum_iK_i^\dagger K_i=I∑i​Ki†​Ki​=I, followed by outcome-dependent finite local maps, with the branches summed. The definition permits m=0m=0m=0, requires only one positive block length for each pair of tolerances, and takes its infimum over real rates without separately assuming that they are nonnegative.

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

    Confirmed by the moderator at approval.

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