source-region-extreme-points: Every extreme point of R(J)≥H(X(J)|Y X(Jc)) is a permutation tuple R_pi(i)=H(X_pi(i)|Y X_pi(1)…X_pi(i−1)); every such tuple is fea
OpenQAlgorithms.Papers.Independent.Renew46.P43.sourceExtremePointsFor a finite correlated classical/hybrid source, consider the upward unbounded region defined by all lower subset constraints . Extremality is ordinary convex extremality, with no upper-maximality condition.
This is the source result with its stated operational or information-theoretic domain.
import Definitions.Def_QAlgorithms_Papers_Independent_Renew46_P43
noncomputable section
namespace QAlgorithms.Papers.Independent.Renew46.P43
open scoped BigOperators Matrix ComplexConjugate ComplexOrder ENNReal Matrix.Norms.L2Operator
open Filter MeasureTheory
open QAlgorithms.Papers.Independent.Information100.P08 (IsPure)
open QAlgorithms.Papers.Independent.Information100.P06 (Below)
open QAlgorithms.Papers.Independent.Information100.P60 (copies relativeBits)
open QAlgorithms.Papers.Independent.Dependency50.P19 (count both)
open QAlgorithms.Papers.Independent.Information100.P22 (coherentInformation)
attribute [local instance] Classical.propDecidable Classical.decEq
open QAlgorithms.Papers.Independent.Claimed50.P40 (InBlocks)
attribute [local instance] QAlgorithms.Papers.Independent.Renew46.P43.matrixMeasurableSpace
/-- Unnumbered source-region extreme-point assertion, PDF pp.57-58: every extreme
point is a permutation corner, and every such corner is feasible. The region is
upward closed and unbounded, unlike a classical-input channel rate polytope. -/
theorem sourceExtremePoints {s : ℕ} (S : HybridSource s) :
(∀ R : Fin s → ℝ, IsExtreme S.lowerRegion R → ∃ pi, R = S.corner pi) ∧
(∀ pi : Equiv.Perm (Fin s), S.corner pi ∈ S.lowerRegion) := by sorry
end QAlgorithms.Papers.Independent.Renew46.P43
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every natural number , let consist of positive alphabet sizes indexed by , a positive system dimension with block labels , a positive number of distinct matrices with and whenever , and a joint probability mass function on alphabet tuples and labels . For , define on pairs , with an alphabet tuple on and , by
Let , where , with , is applied by continuous functional calculus, and define
Two assertions hold: every satisfying, for all and real , the implication , equals the corner vector of some permutation of ; and the corner vector of every permutation belongs to . Here that corner has coordinates
The assertions include , when there is one permutation and one real vector on the empty index set.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.