§6: global weak and constrained additivity are equivalent
OpenQAlgorithms.Papers.Independent.Gap48.P46.global_weak_iff_constrainedAll quantum systems are nonzero finite-dimensional complex Hilbert spaces. States are positive semidefinite trace-one matrices, and channels are CPTP maps on the full matrix algebra. All entropies and logarithms are in bits. An ensemble is a finite probability distribution of states, with zero weights permitted. For a channel , write for the maximum ensemble Holevo information at mean , for the minimum average output entropy at that mean, and for the maximum of over a nonempty closed mean constraint .
Global weak additivity means that the attained allocation identity (33) holds for every finite-dimensional channel pair, every pair of positive observables and every feasible nonnegative total budget. Global constrained additivity means capacity additivity for every finite-dimensional channel pair and every nonempty closed marginal constraint pair. Then
Both sides quantify over all channel pairs; a weak identity for a single pair is not sufficient as a premise. This states the final finite-dimensional equivalence of §6.
import Definitions.Def_QAlgorithms_Papers_Independent_Gap48_P46
noncomputable section
namespace QAlgorithms.Papers.Independent.Gap48.P46
open scoped Matrix ComplexConjugate ENNReal ComplexOrder
open Filter
attribute [local instance] Classical.propDecidable
attribute [local instance] Classical.decEq
open QAlgorithms.Papers.Independent.Information100.P62 (tensorChannel)
open QAlgorithms.Papers.Independent.Information100.P54 (relativeEntropyBits)
open QAlgorithms.Papers.Independent.Dependency50.P23 (IsEB)
open QAlgorithms.Papers.Independent.Information100.P08
(Ensemble ensembleAverage outputHolevo mixedRoof)
variable {I O J K : Type} [Fintype I] [Fintype O] [Fintype J] [Fintype K]
variable [DecidableEq I] [DecidableEq O] [DecidableEq J] [DecidableEq K]
/-- PDF p.16, §6: global weak and constrained conjectures are equivalent. A weak
identity for only one fixed pair is not the premise. -/
theorem global_weak_iff_constrained : GlobalWeak ↔ GlobalConstrained := by sorry
end QAlgorithms.Papers.Independent.Gap48.P46
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let denote positive semidefinite complex matrices of trace on a finite index set . For a channel , define as the supremum of over finite density-matrix ensembles with nonnegative weights summing to and average , where , and put . Channels mean finite Kraus maps with , and their tensor products act factorwise on elementary tensors and extend linearly. The following global properties are equivalent. The first says that, for every four finite nonempty index types with decidable equality, every channels , , every positive semidefinite on and on , and every nonnegative for which some density matrix has expectation of at most ,
and this supremum is attained, where , , and likewise for . The second says that, for every such choice of types and channels and every nonempty closed , ,
No convexity assumption is imposed on or .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.