Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§7, equation (19): extension of projector cost equality to minimizing orbit mixtures

Open
QAlgorithms.Papers.Independent.Intakenext100.P60.covariant_cost

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

prove2quantum

Let GGG be a compact topological group with continuous unitary representations VVV on a nonzero finite-dimensional space KKK and UUU on a nonzero finite-dimensional output space BBB, both irreducible. Identify KKK with the range of an isometry W:K⟶A⊗BW:K\longrightarrow A\otimes BW:K⟶A⊗B. Assume, for every g∈Gg\in Gg∈G and every operator XXX on KKK,

Tr⁡A(WVgXVg†W†)=UgTr⁡A(WXW†)Ug†.\operatorname{Tr}_A(WV_gXV_g^\dagger W^\dagger)=U_g\operatorname{Tr}_A(WXW^\dagger)U_g^\dagger.TrA​(WVg​XVg†​W†)=Ug​TrA​(WXW†)Ug†​.

Let T(X)=Tr⁡A(WXW†)T(X)=\operatorname{Tr}_A(WXW^\dagger)T(X)=TrA​(WXW†), P=WW†P=WW^\daggerP=WW†, τ=P/Tr⁡P\tau=P/\operatorname{Tr}Pτ=P/TrP, and m=min⁡∥x∥=1E(Wx)m=\min_{\|x\|=1} E(Wx)m=min∥x∥=1​E(Wx), where EEE is pure-state marginal entropy. An arbitrary ambient environment can be compressed to the finite component span without changing any supported state or entanglement value. The group action need not factor across the two parties.

Assume in addition Ec(τ)=Ef(τ)E_c(\tau)=E_f(\tau)Ec​(τ)=Ef​(τ). Fix a unit vector xxx attaining mmm, and let ρ\rhoρ be any density matrix in the convex hull of {∣WVgx⟩⟨WVgx∣:g∈G}\{|WV_gx\rangle\langle WV_gx|:g\in G\}{∣WVg​x⟩⟨WVg​x∣:g∈G}. Then

Ec(ρ)=Ef(ρ)=m,Ef(ρ⊗n)=nm(n≥1).E_c(\rho)=E_f(\rho)=m,\qquad E_f(\rho^{\otimes n})=nm\quad(n\ge1).Ec​(ρ)=Ef​(ρ)=m,Ef​(ρ⊗n)=nm(n≥1).

This extends the given projector cost equality to mixtures of a minimizing orbit; the projector equality is a hypothesis, not a consequence asserted for every group action.

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.11--12, (19): cost equality and positive-copy formation additivity for
minimizing-orbit mixtures, conditional on cost=formation for the normalized projector.
The undefined rho_0 on p.12 is the preceding minimizing pure projector.
No local implementability of V is assumed. -/
theorem covariant_cost {G : Type*} [Group G] [TopologicalSpace G]
    [IsTopologicalGroup G] [T2Space G] [CompactSpace G] {a b k : ℕ} (D : CovariantData G a b k)
    (hcost : formationCostBits (projectorState D) = formation (projectorState D))
    (v : EuclideanSpace ℂ (Fin k)) (hv : ‖v‖ = 1)
    (hmin : pureEntropyBits (embedded D.W v) = minimumEntanglement D)
    (rho : Op (Fin a × Fin b)) (hrho : IsDensityMatrix rho) (horbit : rho ∈ minimizingProjectorHull D v) :
    formationCostBits rho = minimumEntanglement D ∧ formation rho = minimumEntanglement D ∧
      (∀ n : ℕ, 0 < n → formation (groupedPower rho n) = n * minimumEntanglement D) := 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. 12, §7, equation (19): extension of projector cost equality to minimizing orbit mixtures
Read-back

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

Let GGG be a compact Hausdorff topological group, and let a,b,ka,b,ka,b,k be positive integers. Suppose the data DDD consist of a complex matrix W:Ck→Ca⊗CbW:\mathbb C^k\to\mathbb C^a\otimes\mathbb C^bW:Ck→Ca⊗Cb with W†W=IW^\dagger W=IW†W=I, and representations VgV_gVg​ on Ck\mathbb C^kCk and UgU_gUg​ on Cb\mathbb C^bCb satisfying V1=IV_1=IV1​=I, U1=IU_1=IU1​=I, Vgh=VgVhV_{gh}=V_gV_hVgh​=Vg​Vh​, Ugh=UgUhU_{gh}=U_gU_hUgh​=Ug​Uh​, Vg†Vg=IV_g^\dagger V_g=IVg†​Vg​=I, and Ug†Ug=IU_g^\dagger U_g=IUg†​Ug​=I. Every matrix entry of each representation is continuous in ggg; each representation is irreducible, meaning that every complex subspace invariant under all its matrices is either zero or the whole space; and, for every g∈Gg\in Gg∈G and every complex k×kk\times kk×k matrix XXX,

Tr⁡Ca ⁣(WVgXVg†W†)=UgTr⁡Ca(WXW†)Ug†.\operatorname{Tr}_{\mathbb C^a}\!\left(WV_gXV_g^\dagger W^\dagger\right) =U_g\operatorname{Tr}_{\mathbb C^a}(WXW^\dagger)U_g^\dagger.TrCa​(WVg​XVg†​W†)=Ug​TrCa​(WXW†)Ug†​.

For a matrix σ\sigmaσ, put S(σ)=−Re⁡Tr⁡f(σ)S(\sigma)=-\operatorname{Re}\operatorname{Tr}f(\sigma)S(σ)=−ReTrf(σ), where f(x)=xlog⁡2xf(x)=x\log_2xf(x)=xlog2​x is applied by continuous functional calculus, and let F(X)F(X)F(X) be the real infimum of

∑j=0r−1qj S ⁣(Tr⁡Cb∣wj⟩⟨wj∣)\sum_{j=0}^{r-1}q_j\,S\!\left(\operatorname{Tr}_{\mathbb C^b}|w_j\rangle\langle w_j|\right)j=0∑r−1​qj​S(TrCb​∣wj​⟩⟨wj​∣)

over every finite ensemble with qj≥0q_j\ge0qj​≥0, ∑jqj=1\sum_jq_j=1∑j​qj​=1, ∥wj∥=1\|w_j\|=1∥wj​∥=1, and X=∑jqj∣wj⟩⟨wj∣X=\sum_jq_j|w_j\rangle\langle w_j|X=∑j​qj​∣wj​⟩⟨wj​∣. Let C(X)C(X)C(X) be the following formation cost: relabel its local bases by the fixed equivalences to initial segments of natural numbers, and take the real infimum of all real EEE such that every ε,δ>0\varepsilon,\delta>0ε,δ>0 admits integers m≥0,n>0m\ge0,n>0m≥0,n>0 and a finite local protocol LLL satisfying

∣E−m/n∣≤δ,12∥L(Sm)−X[n]∥1≤ε.|E-m/n|\le\delta,\qquad \tfrac12\|L(S_m)-X^{[n]}\|_1\le\varepsilon.∣E−m/n∣≤δ,21​∥L(Sm​)−X[n]∥1​≤ε.

Here ∥Y∥1=Re⁡Tr⁡Y†Y\|Y\|_1=\operatorname{Re}\operatorname{Tr}\sqrt{Y^\dagger Y}∥Y∥1​=ReTrY†Y​, X[n]X^{[n]}X[n] is the grouped tensor power relabelled to local dimensions an,bna^n,b^nan,bn, SmS_mSm​ is the similarly grouped tensor power of mmm projectors onto (∣0,1⟩−∣1,0⟩)/2(|0,1\rangle-|1,0\rangle)/\sqrt2(∣0,1⟩−∣1,0⟩)/2​, and S0=1S_0=1S0​=1. The finite protocols are recursively generated from identities by local Kraus operations with ∑jKj†Kj=I\sum_jK_j^\dagger K_j=I∑j​Kj†​Kj​=I, outcome-dependent finite continuations, and summation over branches; EEE has no explicit nonnegativity restriction. Set

PD=1kWW†,hmin⁡=inf⁡∥w∥=1S ⁣(Tr⁡Cb∣Ww⟩⟨Ww∣),P_D=\frac1kWW^\dagger,\qquad h_{\min}=\inf_{\|w\|=1} S\!\left(\operatorname{Tr}_{\mathbb C^b}|Ww\rangle\langle Ww|\right),PD​=k1​WW†,hmin​=∥w∥=1inf​S(TrCb​∣Ww⟩⟨Ww∣),

and assume C(PD)=F(PD)C(P_D)=F(P_D)C(PD​)=F(PD​). Let v∈Ckv\in\mathbb C^kv∈Ck satisfy ∥v∥=1\|v\|=1∥v∥=1 and S(Tr⁡Cb∣Wv⟩⟨Wv∣)=hmin⁡S(\operatorname{Tr}_{\mathbb C^b}|Wv\rangle\langle Wv|)=h_{\min}S(TrCb​∣Wv⟩⟨Wv∣)=hmin​. For every positive semidefinite, trace-one matrix ρ\rhoρ on Ca⊗Cb\mathbb C^a\otimes\mathbb C^bCa⊗Cb belonging to the real convex hull

conv⁡R{∣WVgv⟩⟨WVgv∣:g∈G},\operatorname{conv}_{\mathbb R}\bigl\{|WV_gv\rangle\langle WV_gv|:g\in G\bigr\},convR​{∣WVg​v⟩⟨WVg​v∣:g∈G},

the declaration asserts

C(ρ)=hmin⁡,F(ρ)=hmin⁡,F(ρgrouped⊗n)=n hmin⁡for every integer n>0,C(\rho)=h_{\min},\qquad F(\rho)=h_{\min},\qquad F(\rho^{\otimes n}_{\mathrm{grouped}})=n\,h_{\min}\quad\text{for every integer }n>0,C(ρ)=hmin​,F(ρ)=hmin​,F(ρgrouped⊗n​)=nhmin​for every integer n>0,

where the grouped tensor power has entries ∏i=0n−1ρ(xi,yi),(xi′,yi′)\prod_{i=0}^{n-1}\rho_{(x_i,y_i),(x'_i,y'_i)}∏i=0n−1​ρ(xi​,yi​),(xi′​,yi′​)​. The orbit condition uses the convex hull itself, without taking its closure, and the last assertion excludes n=0n=0n=0.

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