Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 5.6 — IMM leaf lower bound

Open
MonoABPWidth.Hierarchy.Supplement.theorem_5_6

by mikedeng1 · Nov 15, 2026 · Mathlib 0df444a (Lean v4.33.1)

algebraic-complexitymonotone-computationp2o-batch-stoc27sp2o-gran-per-chapterp2o-plan-paperp2o-strengthenedp2o-v1

Let k,n≥1k,n\ge1k,n≥1, and let FFF be any arbitrary-fan-in real monotone formula computing immk,n\mathrm{imm}_{k,n}immk,n​. Write d×d_\timesd×​ for its multiplication depth and λ(F)\lambda(F)λ(F) for its leaf count. For d×>0d_\times>0d×​>0,

λ(F)≥n kd×(n1/d×−1).\lambda(F)\ge n\, k^{d_\times(n^{1/d_\times}-1)}.λ(F)≥nkd×​(n1/d×​−1).

At depth zero the proof extends the bound to nnn for n≤1n\le1n≤1 and +∞+\infty+∞ for n≥2n\ge2n≥2, thereby asserting that no such formula exists in the latter case. No syntactic homogeneity or fixed-depth restriction is imposed. This gives the exact IMM leaf lower bound independently of the retained mABP goal.

Differences from the source:

  • encoding: finite variable sets, real nonnegative coefficients, and tree resources → Fin-indexed variables/children, NNReal labels, and recursively computed resources; reason: finite renaming preserves every instance and a scalar-variable leaf still costs one leaf
  • generalization: bounded-depth formulas are assumed alternating without loss of generality in §2.3 → the universal lower bound also ranges over nonalternating trees; reason: contracting consecutive gates preserves leaves and never increases multiplication depth; the displayed bound is nonincreasing in depth
  • encoding: positive-depth formula and the proof’s depth-zero extension → ENNReal.ofReal of the positive-depth expression, with an explicit zero-depth branch; reason: avoids interpreting 1/0 as zero and represents the proof’s infinite bound
Preamble
import Definitions.Def_MonoABPWidth_Hierarchy_Supplement_formulas
import Definitions.Def_SetMultCost_imm

open scoped BigOperators ENNReal
Formal statement
namespace MonoABPWidth.Hierarchy.Supplement

/-- Theorem 5.6, p.14 (PDF15); depth-zero extension from p.21 (PDF22).
No homogeneity, variable order, perfect-power length or fixed depth is assumed. -/
theorem theorem_5_6 (k n : ℕ) (hk : 1 ≤ k) (hn : 1 ≤ n)
    (F : Formula (SetMultCost.IMMVar k n)) (hF : F.eval = SetMultCost.imm ℝ k n) :
    immLeafLower k n F.mulDepth ≤ (F.leaves : ℝ≥0∞) := by sorry

end MonoABPWidth.Hierarchy.Supplement
Source
Julian Dörfler, Alexander Rogovskyy, STOC 2027 submission #927 (October 2026), Theorem 5.6, p.14, PDF15

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