Lemma 6, (29): decoder convex decomposition
OpenQAlgorithms.Papers.Independent.Intakenext100.P20.decoder_convex_decompositionLet and be nonzero finite-dimensional complex Hilbert spaces. Let be the set of CPTP decoders from to , represented by their complex-linear actions on all matrices. Let consist of the decoders for which a finite nonzero ancilla and a vector isometry satisfy for every input state. Then
The ancilla and isometry are fixed before the input state. This is a convex-hull statement, without an assertion that these decoders are precisely the extreme points.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P20
noncomputable section
open scoped Matrix ENNReal ComplexOrder Topology
namespace QAlgorithms.Papers.Independent.Intakenext100.P20
open QAlgorithms.Papers.Independent.Information100.P08 (IsPure)
open QAlgorithms.Papers.Independent.Information100.P47 (IsProbability)
open QAlgorithms.Papers.Independent.Information100.P53 (SpectralData)
open QAlgorithms.Papers.Independent.Gap48.P19 (shannonNats)
open QAlgorithms.Papers.Independent.Dependency50.P28 (classicalD)
attribute [local instance] Classical.propDecidable
/-- Lemma 6, PDF p.5, (29): the decoder set is the real convex hull of
isometric-dilation decoders. No characterization of extreme decoders is asserted. -/
theorem decoder_convex_decomposition (m d : ℕ) (hm : 0 < m) (hd : 0 < d) :
decoders m d = convexHull ℝ (dilatedDecoders m d) := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P20
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For any positive natural numbers , the set of all maps admitting a finite Kraus representation
is the real convex hull of those maps in this same set for which there also exist a positive natural number and a matrix satisfying
Thus the asserted equality uses finite convex combinations and does not take a topological closure.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.