Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Every released child partition has a uniform error budget

Proved
mme_released_interior_child_partition_loss_bound

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

matrix-multiplicationtensor-extraction

The bound of ninety actual child cells combines with the finite partition rate inequality to bound the normalized loss by 540 times the common error parameter, for any boundary and interior enumeration. The root exponent bound remains a separate obligation.

Preamble
import Theorems.Thm_mme_child_partition_rate_sum_bound
import Theorems.Thm_mme_released_interior_child_card_bound
open scoped BigOperators
open MME MME.ReleasedInterior MME.RecursiveYZ
Formal statement
theorem mme_released_interior_child_partition_loss_bound
    (s : Fin 45) (nB nI : ℕ)
    (e : (Fin nB ⊕ Fin nI) ≃ Cell 4 6 (parent s))
    (q : Cell 4 6 (parent s) → ℝ)
    (b : Fin nB → ℝ) (i : Fin nI → ℝ)
    (scale delta bound : ℝ) (hscale : 0 ≤ scale) (hdelta : 0 ≤ delta)
    (hsum : bound ≤ ∑ c, q c)
    (hb : ∀ r, scale * (q (e (.inl r)) - 6 * delta) ≤ b r)
    (hi : ∀ r, scale * (q (e (.inr r)) - 6 * delta) ≤ i r) :
    scale * (bound - 540 * delta) ≤ (∑ 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