Lemma 2: strict linear constraints suffice
OpenQAlgorithms.Papers.Independent.Gap48.P46.strict_constraints_sufficeAll 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 . The constraint includes every joint density with first marginal in and second marginal in , including correlated and entangled states.
Fix channels and a nonempty closed constraint for . Suppose that for every positive semidefinite and every admitting a state with , additivity holds for and . Then
for every nonempty closed . Strict feasibility is local to each constraint quantified in the premise. This reduces arbitrary closed constraints to strictly feasible linear ones.
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.7, Lemma 2: strict feasibility is inside the universal premise. -/
theorem strict_constraints_suffice [Nonempty I] [Nonempty O] [Nonempty J] [Nonempty K]
(Phi : Superop I O) (Psi : Superop J K) (hPhi : IsChannel Phi) (hPsi : IsChannel Psi)
(B : Set (Matrix J J ℂ)) (hB : Constraint B)
(hlinear : ∀ A : Matrix I I ℂ, A.PosSemidef → ∀ alpha : ℝ, 0 ≤ alpha →
(∃ rho ∈ states I, effectProb A rho < alpha) →
ConstrainedAdditive Phi Psi (linearConstraint A alpha) B) :
∀ A, Constraint A → ConstrainedAdditive Phi Psi A B := 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 be finite nonempty types with decidable equality, and let be channels from matrices on to matrices on , respectively; each has a finite representation with . Let denote positive semidefinite trace-one matrices on , and let be nonempty and closed. For a channel , define as the supremum of over finite ensembles of density matrices with , , and , where , with zero terms equal to ; put . Set , defined linearly on matrix units by , and . Suppose that for every positive semidefinite matrix on and every , whenever some satisfies , the set satisfies
Then this equality holds with replaced by every nonempty closed subset , including sets that are not convex. The assumed implication imposes no condition for a budget having no strictly feasible density matrix.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.