Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Arbitrary child partitions retain the total rate bound

Proved
mme_child_partition_rate_sum_bound

by Robertboy18 · Sep 23, 2026 · Mathlib 777aaa6 (Lean v4.29.0-rc3)

matrix-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 sorry
Source
Checked tensor restrictions and released global histogram extraction.

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me