Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§7: transitivity extends the conditional cost formula to every supported state

Open
QAlgorithms.Papers.Independent.Intakenext100.P60.transitive_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 Ec(τ)=Ef(τ)E_c(\tau)=E_f(\tau)Ec​(τ)=Ef​(τ) and that GGG acts transitively on pure projectors on KKK: for any unit vectors x,yx,yx,y there is ggg with ∣Vgx⟩⟨Vgx∣=∣y⟩⟨y∣|V_gx\rangle\langle V_gx|=|y\rangle\langle y|∣Vg​x⟩⟨Vg​x∣=∣y⟩⟨y∣. For every density matrix ρ\rhoρ supported on WKWKWK,

Ec(ρ)=Ef(ρ)=m.E_c(\rho)=E_f(\rho)=m.Ec​(ρ)=Ef​(ρ)=m.

The transitivity condition concerns pure states up to global phase and leaves the zero vector outside its domain. It promotes the preceding orbit-mixture conclusion to all supported states.

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 p.12: transitivity extends (19) to every supported density matrix. The
projector cost premise is inherited from the preceding paragraph and retained. -/
theorem transitive_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)) (htrans : PureTransitive D)
    (rho : Op (Fin a × Fin b)) (hrho : IsDensityMatrix rho)
    (hsupport : HasRangeIn (dilationSpace D.W) rho) :
    formationCostBits rho = minimumEntanglement D ∧ formation rho = 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: transitivity extends the conditional cost formula to every supported state
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 DDD comprise positive natural dimensions a,b,ka,b,ka,b,k, an isometry W:Ck→Ca⊗CbW:\mathbb C^k\to\mathbb C^a\otimes\mathbb C^bW:Ck→Ca⊗Cb, and entrywise continuous irreducible unitary representations V,UV,UV,U on Ck,Cb\mathbb C^k,\mathbb C^bCk,Cb, respectively, satisfying Tr⁡Ca(WVgXVg†W†)=UgTr⁡Ca(WXW†)Ug†\operatorname{Tr}_{\mathbb C^a}(WV_gXV_g^\dagger W^\dagger)=U_g\operatorname{Tr}_{\mathbb C^a}(WXW^\dagger)U_g^\daggerTrCa​(WVg​XVg†​W†)=Ug​TrCa​(WXW†)Ug†​ for every g,Xg,Xg,X; irreducibility means that only zero and full complex subspaces are invariant. Define S(X)=−Re⁡tr⁡f(X)S(X)=-\operatorname{Re}\operatorname{tr}f(X)S(X)=−Retrf(X), with f(x)=xlog⁡2xf(x)=x\log_2xf(x)=xlog2​x applied by continuous functional calculus, and let F(τ)F(\tau)F(τ) be the real infimum of ∑jpjS(Tr⁡Cb(zjzj†))\sum_jp_jS(\operatorname{Tr}_{\mathbb C^b}(z_jz_j^\dagger))∑j​pj​S(TrCb​(zj​zj†​)) over finite decompositions τ=∑jpjzjzj†\tau=\sum_jp_jz_jz_j^\daggerτ=∑j​pj​zj​zj†​ with pj≥0p_j\ge0pj​≥0, ∑jpj=1\sum_jp_j=1∑j​pj​=1, and ∥zj∥=1\|z_j\|=1∥zj​∥=1. Let C(τ)C(\tau)C(τ) be the real infimum of all real EEE such that for every ϵ,δ>0\epsilon,\delta>0ϵ,δ>0 there exist natural numbers m≥0,n>0m\ge0,n>0m≥0,n>0 and a finite local protocol Λ\LambdaΛ satisfying ∣E−m/n∣≤δ|E-m/n|\le\delta∣E−m/n∣≤δ and 12∥Λ(σ−[m])−τ[n]∥1≤ϵ\frac12\|\Lambda(\sigma_-^{[m]})-\tau^{[n]}\|_1\le\epsilon21​∥Λ(σ−[m]​)−τ[n]∥1​≤ϵ, where σ−\sigma_-σ−​ projects onto (∣01⟩−∣10⟩)/2(|01\rangle-|10\rangle)/\sqrt2(∣01⟩−∣10⟩)/2​, tensor powers are grouped by party using the fixed finite-basis relabelings in the definitions, zero copies give the scalar identity, and ∥X∥1=Re⁡tr⁡X†X\|X\|_1=\operatorname{Re}\operatorname{tr}\sqrt{X^\dagger X}∥X∥1​=RetrX†X​. These finite local protocols are generated from identities by finite local Kraus families (Ei)(E_i)(Ei​) satisfying ∑iEi†Ei=I\sum_iE_i^\dagger E_i=I∑i​Ei†​Ei​=I, with branch-dependent finite continuations and summation over outcomes. Assume C(WW†/k)=F(WW†/k)C(WW^\dagger/k)=F(WW^\dagger/k)C(WW†/k)=F(WW†/k), and assume that for every unit v,w∈Ckv,w\in\mathbb C^kv,w∈Ck some g∈Gg\in Gg∈G satisfies (Vgv)(Vgv)†=ww†(V_gv)(V_gv)^\dagger=ww^\dagger(Vg​v)(Vg​v)†=ww†. For every positive semidefinite trace-one matrix ρ\rhoρ on Ca⊗Cb\mathbb C^a\otimes\mathbb C^bCa⊗Cb whose every column belongs to the complex linear span of the columns of WWW, the theorem asserts

C(ρ)=inf⁡v∈Ck∥v∥=1S ⁣(Tr⁡Cb((Wv)(Wv)†))=F(ρ).C(\rho)= \inf_{\substack{v\in\mathbb C^k\\\|v\|=1}} S\!\left(\operatorname{Tr}_{\mathbb C^b}((Wv)(Wv)^\dagger)\right) =F(\rho).C(ρ)=v∈Ck∥v∥=1​inf​S(TrCb​((Wv)(Wv)†))=F(ρ).
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