Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Permanent, independent leaf optimum, and ordered-composition recurrence

Definition
MonoABPWidth_Hierarchy_Supplement_permanent

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

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

For the generic real n×nn\times nn×n matrix, define

per⁡n=∑π∈Sn∏i=1nxi,π(i).\operatorname{per}_n=\sum_{\pi\in S_n}\prod_{i=1}^n x_{i,\pi(i)}.pern​=π∈Sn​∑​i=1∏n​xi,π(i)​.

The true optimum Opt⁡(n,d)\operatorname{Opt}(n,d)Opt(n,d) is the infimum of leaf counts of actual monotone trees computing this polynomial with multiplication depth exactly ddd. It is +∞+\infty+∞ if there is no feasible formula. This definition uses no recurrence.

Separately define the candidate function L(n,1)=n n!L(n,1)=n\,n!L(n,1)=nn! and, for d≥2d\ge2d≥2,

L(n,d)=min⁡n=n1+⋯+nℓℓ≥1, ni≥1n!∏ini!∑iL(ni,d−1).L(n,d)=\min_{n=n_1+\cdots+n_\ell\atop \ell\ge1,\ n_i\ge1}\frac{n!}{\prod_i n_i!}\sum_i L(n_i,d-1).L(n,d)=ℓ≥1, ni​≥1n=n1​+⋯+nℓ​​min​∏i​ni​!n!​i∑​L(ni​,d−1).

Mathlib's finite type of ordered positive compositions supplies every decomposition, including a single part and unbalanced parts. The multinomial coefficient uses exact integer division. At depth zero set L(n,0)=nL(n,0)=nL(n,0)=n for n≤1n\le1n≤1 and +∞+\infty+∞ otherwise, as in the proof. Only positive nnn is used in the permanent theorems; the recurrence has an unused empty-composition extension at n=0n=0n=0. Finally ℓd(x)\ell_d(x)ℓd​(x) is the (d−1)(d-1)(d−1)-fold composition of natural logarithm. This separates the actual optimum from both the proposed recurrence and its claimed asymptotic.

Definition code
import Definitions.Def_MonoABPWidth_Hierarchy_Supplement_formulas

open scoped BigOperators ENNReal

namespace MonoABPWidth.Hierarchy.Supplement

/-- §7, p.22: the permanent of the generic real n×n matrix. -/
noncomputable def permanent (n : ℕ) : MvPolynomial (Fin n × Fin n) ℝ :=
  ∑ π : Equiv.Perm (Fin n), ∏ i : Fin n, MvPolynomial.X (i, π i)

/-- True optimum over actual formulas, independent of any recurrence. The empty
feasible set has infimum +infinity in ENNReal. -/
noncomputable def permanentOpt (n d : ℕ) : ℝ≥0∞ :=
  ⨅ F : {F : Formula (Fin n × Fin n) // F.eval = permanent n ∧ F.mulDepth = d},
    (F.val.leaves : ℝ≥0∞)

/-- The finite ordered-composition recurrence in Theorem 7.5, with d=0 extended
as on p.22. Composition n contains every ordered positive composition, including
the single part n for n>0. Its finite nonempty minimum never uses a default value. -/
noncomputable def permanentL : ℕ → ℕ → ℝ≥0∞
  | n, 0 => if n ≤ 1 then (n : ℝ≥0∞) else ⊤
  | n, 1 => (n * n.factorial : ℕ)
  | n, d + 2 => Finset.univ.inf' Finset.univ_nonempty (fun c : Composition n =>
      (n.factorial / (c.blocks.map Nat.factorial).prod : ℕ) *
        (c.blocks.map (fun m => permanentL m (d + 1))).sum)

/-- Composition of natural log (d−1) times, not a power or a change of base. -/
noncomputable def iteratedLog (d : ℕ) (x : ℝ) : ℝ := (Real.log^[d - 1]) x

end MonoABPWidth.Hierarchy.Supplement
Source
Julian Dörfler, Alexander Rogovskyy, STOC 2027 submission #927 (October 2026), §7, p.22, PDF23; Theorem 7.6 and proof, pp.22–24, PDF23–25

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