§4: uniqueness of the average output of an optimal ensemble
OpenQAlgorithms.Papers.Independent.Intakenext100.P60.optimal_output_uniqueLet be a trace-preserving completely positive channel from an arbitrary Hilbert input space to a finite output space. Let and be finite pure input ensembles: all vectors are unit vectors, all weights are nonnegative, and each family of weights sums to one. Suppose each attains the supremum of the Holevo information . Then
This identifies the average output independently of which attaining ensemble is chosen; it makes no assertion that an optimizer exists for every arbitrary input channel.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P60
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 pp.5--6: attaining ensembles have a unique average output. Input Hilbert
spaces are arbitrary; output dimension alone is finite. No attainment is postulated. -/
theorem optimal_output_unique {H : Type*} [NormedAddCommGroup H]
[InnerProductSpace ℂ H] [CompleteSpace H] {d : ℕ} (hd : 0 < d)
(T : FiniteOutputDualChannel H d) (e f : SignalEnsemble H)
(he : signalHolevo (pureOutput T) e = signalCapacity (pureOutput T))
(hf : signalHolevo (pureOutput T) f = signalCapacity (pureOutput T)) :
signalBarycenter (pureOutput T) e = signalBarycenter (pureOutput T) f := by sorry
end
end QAlgorithms.Papers.Independent.Intakenext100.P60
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be a complete complex inner product space with its normed additive group structure, let be a natural number, and let be complex linear and unital, with the property that for every natural number , every positive semidefinite block matrix with blocks in , and every family , one has . Define , where is the matrix unit. A signal ensemble is a finite indexed family of unit vectors and real weights with ; zero weights are allowed, but an empty ensemble cannot satisfy this sum condition. For any matrix , write , where is applied by continuous functional calculus. For an ensemble , put and , and let be the real supremum of over all such finite ensembles. For every two signal ensembles satisfying and , the theorem asserts . There is no separate assumption that has a unit vector; if it has none, the ensemble hypotheses cannot be satisfied.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.