Lemma 5, (28): extreme visible encoders
OpenQAlgorithms.Papers.Independent.Intakenext100.P20.visible_encoder_extreme_pointsLet be a nonzero finite-dimensional complex Hilbert space and any label set, possibly empty or infinite. Let be the set of all maps , where consists of positive semidefinite trace-one operators. With real convexity,
Pure means for a unit vector . The convex hull uses finite convex combinations. This describes arbitrary visible state maps without requiring a channel extension.
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 5, PDF p.5, (28): extreme visible encoders are exactly pointwise
pure maps, and their real convex hull is the entire visible-encoder set. -/
theorem visible_encoder_extreme_points (L : Type*) (m : ℕ) (hm : 0 < m) :
extremeEncoders L m = {F | F ∈ visibleEncoders L m ∧ ∀ i, IsPure (F i)} ∧
convexHull ℝ (extremeEncoders L m) = visibleEncoders L m := 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 type and any positive natural number , let
The extreme points of , considered as a convex set over , are exactly the families in for which every has the form for some vector of Euclidean norm . Moreover,
The convex hull here consists of finite convex combinations, with no closure operation. The assertion permits to be empty or infinite.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.