Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 2: weak additivity after output complex conjugation

Open
QAlgorithms.Papers.Independent.Intakenext100.P49.conjugation_weakAdditivity

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

prove2quantum

Let NNN be a CPTP channel between positive finite-dimensional Hilbert spaces. Assume its Holevo capacity is weakly additive, meaning χ(N⊗n)=nχ(N)\chi(N^{\otimes n})=n\chi(N)χ(N⊗n)=nχ(N) for every positive integer nnn; a strongly additive channel also meets this premise. In a fixed output basis let MMM be the linear map M(X)=N(X)TM(X)=N(X)^TM(X)=N(X)T, and assume explicitly that MMM is CPTP. Then

χ(M⊗n)=nχ(M)(n≥1).\chi(M^{\otimes n})=n\chi(M)\qquad(n\ge1).χ(M⊗n)=nχ(M)(n≥1).

Transpose agrees with entrywise complex conjugation on Hermitian density operators. This gives weak additivity of the conjugated channel when that channel exists in the CP sense required by the source's p.5 remark. It does not assert strong additivity of MMM.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P49
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Intakenext100.P49

open scoped BigOperators Matrix ComplexConjugate ComplexOrder

open Filter

open QAlgorithms.Papers.Independent.Support50.P01
  (unruhSectorDilation unruhWeight unruhBlockDilation unruhBlockWeight
   unruhReceiver unruhReceiverEntropy)

open QAlgorithms.Papers.Independent.Information100.P67
  (receiverChannel complementaryChannel IsDegradable)

open QAlgorithms.Papers.Independent.Dependency50.P41 (EntanglementBreaking)

open QAlgorithms.Papers.Independent.Dependency50.P40 (outputFirstChoi)

open QAlgorithms.Papers.Independent.Dependency50.P45 (holevoCapacity)

open QAlgorithms.Papers.Independent.Information100.P62 (tensorChannel)

open QAlgorithms.QuditFidelity (depolarizingMap)

attribute [local instance] Classical.propDecidable Classical.decEq

/-- PDF pp.4--5, Lemma 2 and its CP remark: weak additivity survives
output conjugation when the transpose extension is itself CPTP.
Weak additivity is the minimal premise and covers a strongly additive N as well. -/
theorem conjugation_weakAdditivity (a b : ℕ) (_ha : 0 < a) (_hb : 0 < b)
    (N : Superop (Fin a) (Fin b)) (hN : WeakHolevoAdditive N)
    (hM : IsChannel (transposeOutput N)) : WeakHolevoAdditive (transposeOutput N) := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P49

end
Source
An Infinite Sequence of Additive Channels: the Classical Capacity of Cloning Channels, arXiv:0903.1638v7, PDF p. 4, Lemma 2 (continued p.5)
Read-back

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

Let a,ba,ba,b be positive natural numbers, and let N:Mat⁡a(C)→Mat⁡b(C)N:\operatorname{Mat}_a(\mathbb C)\to\operatorname{Mat}_b(\mathbb C)N:Mata​(C)→Matb​(C) be a map. Define χ(N)\chi(N)χ(N) as the supremum, over all finite probability ensembles {qs,ρs}\{q_s,\rho_s\}{qs​,ρs​} of positive semidefinite trace-one input matrices, of

S ⁣(N ⁣(∑sqsρs))−∑sqsS(N(ρs)),S\!\left(N\!\left(\sum_s q_s\rho_s\right)\right)-\sum_s q_sS(N(\rho_s)),S(N(s∑​qs​ρs​))−s∑​qs​S(N(ρs​)),

where S(ρ)=−Re⁡Tr⁡[(x↦xlog⁡2x)(ρ)]S(\rho)=-\operatorname{Re}\operatorname{Tr}[(x\mapsto x\log_2x)(\rho)]S(ρ)=−ReTr[(x↦xlog2​x)(ρ)], using continuous functional calculus. Suppose NNN is a channel and χ(N⊗n)=nχ(N)\chi(N^{\otimes n})=n\chi(N)χ(N⊗n)=nχ(N) for every natural number n≥1n\ge1n≥1. Also suppose the map M(X)=(N(X))TM(X)=(N(X))^{\mathsf T}M(X)=(N(X))T, with ordinary matrix transpose in the given coordinates, is a channel. Here a channel is a map represented on every input matrix as ∑sEsXEs†\sum_sE_sXE_s^\dagger∑s​Es​XEs†​ by a finite family with ∑sEs†Es=I\sum_sE_s^\dagger E_s=I∑s​Es†​Es​=I, and tensor powers act on matrix units by tensoring their images. Then MMM is a channel and χ(M⊗n)=nχ(M)\chi(M^{\otimes n})=n\chi(M)χ(M⊗n)=nχ(M) for every natural number n≥1n\ge1n≥1; there is no assertion about a zero-copy additivity identity.

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