Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Squared 112 extractions attain their combined entropy rate

Proved
mme_112_squared_extraction_entropy_rate

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

matrix-multiplicationregional-extraction

The two directional binomial capacities and a squared explicit extraction bound give their full combined logarithmic copy rate, up to any prescribed positive loss. The proof absorbs polynomial, square-root and Behrend losses, and allows zero outer count when total count is positive. The full matrix exponent bound remains a separate obligation.

Preamble
import Theorems.Thm_mme_complete_split_112_outer_star_entropy_rate
import Theorems.Thm_mme_central_binomial_sqrt_loss_log_rate
import Theorems.Thm_mme_log_sqrt_loss_eventually_le_linear
open Filter
Formal statement
theorem mme_112_squared_extraction_entropy_rate
    (l g : ℕ) (hD : 0 < l + g) (C delta : ℝ) (hdelta : 0 < delta) :
    ∀ᶠ m : ℕ in atTop,
      let N := (l + g) * m
      let p : ℝ := (l : ℝ) / (2 * ((l + g : ℕ) : ℝ))
      ∀ A H copies : ℕ, 0 < A → 0 < H → H ≤ 4 ^ N →
        ((Nat.choose (2 * N) (l * m) *
          Nat.choose (2 * N - l * m) (l * m) : ℕ) : ℝ) *
          Real.exp (-C * Real.sqrt ((N + 1 : ℕ) : ℝ)) ≤ (A : ℝ) →
        (Nat.choose (2 * N) N : ℝ) *
          Real.exp (-2 * C * Real.sqrt ((N + 1 : ℕ) : ℝ)) ≤
            4 * (A : ℝ) * (H : ℝ) →
        ((A : ℝ) ^ 3 * ((H : ℝ) ^ 2 *
          Real.exp (-100 * Real.sqrt (Real.log ((H + 1 : ℕ) : ℝ))))) ^ 2 ≤
            (copies : ℝ) →
        ((4 * N : ℕ) : ℝ) *
          (Real.log 2 * (mme_modern_entropyBits ![p, p, 1 - 2 * p] + 2) - delta) ≤
            Real.log (copies : ℝ) := by sorry
Source
Kernel-checked regional count identities and exact extraction with empty regions.

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