Lemma IV.18: Saturation R(K)=H(X(K)|Y X(Kc)) plus lower subset inequalities only for J⊆K or K⊆J imply all subset inequalities.
OpenQAlgorithms.Papers.Independent.Renew46.P43.comparableSourceSubsetsFor any finite correlated classical/hybrid source, write for , with . Let be any sender subset, including empty or full, and suppose its constraint is saturated.
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
/-- Lemma IV.18, PDF pp.57-58: inclusive comparisons with K, including the empty
and full cases. These are lower source bounds, not the channel upper bounds. -/
theorem comparableSourceSubsets {s : ℕ} (S : HybridSource s) (R : Fin s → ℝ)
(K : Finset (Fin s)) (hsaturated : ∑ i ∈ K, R i = S.subsetEntropy K)
(hbelow : ∀ J : Finset (Fin s), J ⊆ K → S.subsetEntropy J ≤ ∑ i ∈ J, R i)
(habove : ∀ J : Finset (Fin s), K ⊆ J → S.subsetEntropy J ≤ ∑ i ∈ J, R i) :
R ∈ 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 specify positive alphabet sizes for the sender indices , a positive system dimension with block labels , a positive number of distinct pure matrices with and entries zero between different blocks, and a joint probability mass function on and . For each , let have rows and columns indexed by , where is an alphabet tuple on and , with entries zero when the two tuples differ and otherwise
Define using continuous functional calculus for , with , and put . For any real vector and any subset , suppose
Then belongs to the defined lower region, meaning
There is no separate nonnegativity hypothesis on , and may be empty or all of . The statement includes , with empty sums equal to zero and the unique empty vector satisfying the conclusion.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.