Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Example 7: the displayed C3⊗C6 subspace has formation and cost 3/2

Open
QAlgorithms.Papers.Independent.Intakenext100.P60.example_seven

by Gohan · Oct 31, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

In C3⊗C6\mathbb C^3\otimes\mathbb C^6C3⊗C6 let KKK be the span of the three unit vectors

∣j⟩s=12(∣j+1 mod 3⟩∣j+2 mod 3⟩+∣j+2 mod 3⟩∣j+1 mod 3⟩+2 ∣j⟩∣j+3⟩),j=0,1,2.|j\rangle_s=\tfrac12\bigl(|j+1\bmod3\rangle|j+2\bmod3\rangle+|j+2\bmod3\rangle|j+1\bmod3\rangle+\sqrt2\,|j\rangle|j+3\rangle\bigr),\quad j=0,1,2.∣j⟩s​=21​(∣j+1mod3⟩∣j+2mod3⟩+∣j+2mod3⟩∣j+1mod3⟩+2​∣j⟩∣j+3⟩),j=0,1,2.

The last environment indices are the ordinary integers 3,4,53,4,53,4,5.

Every density matrix ρ\rhoρ supported on KKK obeys

Ec(ρ)=Ef(ρ)=32.E_c(\rho)=E_f(\rho)=\tfrac32.Ec​(ρ)=Ef​(ρ)=23​.

This worked deduction uses the Vidal--Dür--Cirac subspace [33] and Shor's entanglement-breaking channel additivity theorem [29].

Here EfE_fEf​ is the infimum of average pure-state marginal entropy over normalized finite decompositions of the stated density matrix. EcE_cEc​ is the asymptotic EPR preparation rate under deterministic two-way LOCC, and EDE_DED​ is the corresponding asymptotic distillation rate, in bits per copy. All entropies and logarithms are in bits.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P60
Formal statement
namespace QAlgorithms.Papers.Independent.Intakenext100.P60

open scoped Matrix ComplexConjugate ComplexOrder TensorProduct

noncomputable section

attribute [local instance] Classical.propDecidable Classical.decEq

-- Exact accepted matrix, normalized ensemble, convex roof, grouped copies and LOCC.

open QAlgorithms.Papers.Independent.Information100.P21 (Op FiniteLOCC)

open QAlgorithms.Papers.Independent.Information100.P08 (PureEnsemble pureAverage formation)

open QAlgorithms.Papers.Independent.Information100.P80 (groupedPower)

open QAlgorithms.Papers.Independent.Gap48.P32 (twoWayDistillable)

/-- PDF pp.12--13, Example 7: every supported state has cost=formation=3/2 bits.
The subspace is credited to Vidal--Dur--Cirac [33], the capacity input to Shor [29]. -/
theorem example_seven (rho : Op (Fin 3 × Fin 6)) (hrho : IsDensityMatrix rho)
    (hsupport : HasRangeIn (dilationSpace exampleSevenDilation) rho) :
    formationCostBits rho = 3 / 2 ∧ formation rho = 3 / 2 := by sorry

end

end QAlgorithms.Papers.Independent.Intakenext100.P60
Source
Remarks on additivity of the Holevo channel capacity and of the entanglement of formation, arXiv:quant-ph/0206148v4, PDF p. 13, Example 7: the displayed C3⊗C6 subspace has formation and cost 3/2
Read-back

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

For every complex matrix ρ\rhoρ on C3⊗C6\mathbb C^3\otimes\mathbb C^6C3⊗C6 that is positive semidefinite with trace 111, suppose every column of ρ\rhoρ belongs to the complex linear span of the three vectors

wj=22∣j,j+3⟩+12∣(j+1) mod 3,(j+2) mod 3⟩+12∣(j+2) mod 3,(j+1) mod 3⟩,j=0,1,2,w_j=\frac{\sqrt2}{2}|j,j+3\rangle+ \frac12|(j+1)\bmod3,(j+2)\bmod3\rangle+ \frac12|(j+2)\bmod3,(j+1)\bmod3\rangle,\qquad j=0,1,2,wj​=22​​∣j,j+3⟩+21​∣(j+1)mod3,(j+2)mod3⟩+21​∣(j+2)mod3,(j+1)mod3⟩,j=0,1,2,

where each ket is a coordinate unit vector. Then both the formation cost in bits and the formation quantity equal 3/23/23/2. Here the formation quantity is the infimum of ∑ipiH(Tr⁡B∣vi⟩⟨vi∣)\sum_i p_i H(\operatorname{Tr}_B|v_i\rangle\langle v_i|)∑i​pi​H(TrB​∣vi​⟩⟨vi​∣) over all finite ensembles with pi≥0p_i\ge0pi​≥0, ∑ipi=1\sum_i p_i=1∑i​pi​=1, ∥vi∥=1\|v_i\|=1∥vi​∥=1, and ρ=∑ipi∣vi⟩⟨vi∣\rho=\sum_i p_i|v_i\rangle\langle v_i|ρ=∑i​pi​∣vi​⟩⟨vi​∣, where H(σ)=−∑λλlog⁡2λH(\sigma)=-\sum_\lambda\lambda\log_2\lambdaH(σ)=−∑λ​λlog2​λ, counting eigenvalues with multiplicity and taking 0log⁡20=00\log_2 0=00log2​0=0. The formation cost in bits is 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-operation-and-classical-communication map L\mathcal LL satisfying

∣E−mn∣≤δ,12Re⁡Tr⁡(L(Ψ−⊗m)−ρ⊗n)†(L(Ψ−⊗m)−ρ⊗n)≤ϵ,\left|E-\frac mn\right|\le\delta,\qquad \frac12\operatorname{Re}\operatorname{Tr} \sqrt{(\mathcal L(\Psi_-^{\otimes m})-\rho^{\otimes n})^\dagger (\mathcal L(\Psi_-^{\otimes m})-\rho^{\otimes n})}\le\epsilon,​E−nm​​≤δ,21​ReTr(L(Ψ−⊗m​)−ρ⊗n)†(L(Ψ−⊗m​)−ρ⊗n)​≤ϵ,

where Ψ−=∣ψ−⟩⟨ψ−∣\Psi_-=|\psi_-\rangle\langle\psi_-|Ψ−​=∣ψ−​⟩⟨ψ−​∣ and ∣ψ−⟩=(∣0,1⟩−∣1,0⟩)/2|\psi_-\rangle=(|0,1\rangle-|1,0\rangle)/\sqrt2∣ψ−​⟩=(∣0,1⟩−∣1,0⟩)/2​; tensor copies are grouped by subsystem and relabelled by the fixed finite-index bijections in the definitions. Such finite maps are generated from identity maps by finite local Kraus families satisfying ∑iKi†Ki=I\sum_i K_i^\dagger K_i=I∑i​Ki†​Ki​=I, followed by outcome-dependent maps of the same kind, with the resulting branches summed. The definition permits m=0m=0m=0, meaning no singlets, and requires only one suitable positive block length nnn for each pair (ϵ,δ)(\epsilon,\delta)(ϵ,δ). No rank condition on ρ\rhoρ is imposed beyond the stated column-span condition.

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

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Oct 31, 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