Arbitrary child partitions retain the total rate bound
Provedmme_child_partition_rate_sum_boundmatrix-multiplicationtensor-extraction
Pointwise lower bounds for the boundary and interior parts of any finite partition imply a lower bound for their total rate, with one explicit loss per original cell. The root exponent bound remains a separate obligation.
Preamble
import Theorems.Thm_mme_boundary_normalized_weight_rate_bound open scoped BigOperators
Formal statement
theorem mme_child_partition_rate_sum_bound {C : Type*} [Fintype C]
(nB nI : ℕ) (e : (Fin nB ⊕ Fin nI) ≃ C)
(q : C → ℝ) (b : Fin nB → ℝ) (i : Fin nI → ℝ)
(scale loss : ℝ)
(hb : ∀ r, scale * (q (e (.inl r)) - loss) ≤ b r)
(hi : ∀ r, scale * (q (e (.inr r)) - loss) ≤ i r) :
scale * ((∑ c, q c) - (Fintype.card C : ℝ) * loss) ≤
(∑ r, b r) + ∑ r, i r := by sorrySource
Checked tensor restrictions and released global histogram extraction.