Pair additivity in the covariant irreducible-output setting
OpenQAlgorithms.Papers.Independent.Support50.P19.covariantPair_additivityLet and let be channels on nonzero finite complex spaces. For each channel assume covariance under continuous unitary input and output representations of a compact Hausdorff topological group, with irreducible output representation. Input irreducibility is not required. If
then
The minimum-output entropies optimize over all mixed density inputs and all logarithms are in bits. The covariance assumptions are the contextual setting of the cited Koenig–Wehner result recovered in this subsection; minimum-output additivity by itself would only give the displayed upper bound for arbitrary channels.
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P19
noncomputable section
open scoped Matrix ComplexOrder ComplexConjugate ENNReal
open Filter Topology
namespace QAlgorithms.Papers.Independent.Support50.P19
attribute [local instance] Classical.propDecidable Classical.decEq
open QAlgorithms.Papers.Independent.Dependency50.P35
(tr Dominates spectralPower elog elogNN rawTrace cq)
open QAlgorithms.Papers.Independent.Dependency50.P09 (sandwichedD petzD relativeD)
open QAlgorithms.Papers.Independent.Information100.P56 (sandwichedTrace)
open QAlgorithms.Papers.Independent.Information100.P27 (average)
open QAlgorithms.Papers.Independent.Information100.P67
(IsIsometry receiverChannel complementaryChannel)
open QAlgorithms.Papers.Independent.Claimed50.P48 (FiniteKrausCP)
open QAlgorithms.Papers.Independent.Dependency50.P23
(UACode uaCodeSuccess ordinaryClassicalCapacity IsEB IsHadamard)
open QAlgorithms.Papers.Independent.Information100.P08 (Ensemble)
open QAlgorithms.Papers.Independent.Information100.P71 (channelPower)
open QAlgorithms.Papers.Independent.Information100.P62 (tensorChannel)
open QAlgorithms.Papers.Independent.Information100.P63 (tensorPower)
open QAlgorithms.Papers.Independent.Claimed50.P26
(CovariantIrreducible minOutput UnassistedExponentialConverse)
variable {I J K L : Type} [Fintype I] [Fintype J] [Fintype K] [Fintype L]
variable [DecidableEq I] [DecidableEq J] [DecidableEq K] [DecidableEq L]
/-- PDF pp.23–24, 8.1: pair additivity in the inherited covariant irreducible-output
setting of [41]. The bare 'Thus' would not justify this for arbitrary channels. -/
theorem covariantPair_additivity [Nonempty I] [Nonempty J] [Nonempty K] [Nonempty L] (a : ℝ) (ha : 1 < a) (ha2 : a ≤ 2)
(N : Superop I J) (hN : IsChannel N) (hcovN : CovariantIrreducible N)
(M : Superop K L) (hM : IsChannel M) (hcovM : CovariantIrreducible M)
(hadd : minOutput a (tensorChannel N M) = minOutput a N + minOutput a M) :
channelInformation true a (tensorChannel N M) =
channelInformation true a N + channelInformation true a M := by sorry
end QAlgorithms.Papers.Independent.Support50.P19
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be finite nonempty index types with decidable equality, let , and let and denote maps on complex matrix spaces, each admitting a finite Kraus representation with . Assume, separately for each of , that there exists a compact Hausdorff topological group with continuous unitary representations on its input and output spaces such that for every group element and every input density matrix , and that the output representation has only the zero and whole space as invariant complex linear subspaces. The two channels may use different groups and representations. Define as the real infimum over input density matrices of , where spectral powers send zero eigenvalues to , and assume
Then
in the extended reals. The tensor channel is the linear map determined by . For any channel , is the extended-real supremum over finite ensembles , with , , of , where all are density matrices, meaning positive semidefinite matrices of trace ; zero probabilities are allowed. Here if , and otherwise
using the same zero-preserving spectral powers and an extended logarithm equal to at zero.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.