Alexandersson's Fuss–Catalan conjecture

What Lean checks

Lean proves the literal Fuss–Dyck enumeration and closed formula, real-rootedness, the exact simple-negative-root count, and scalar reduction to the ordinary case. It proves that any ordinary-case relation between root multisets transfers; the cited ordinary-case interlacing theorems themselves are not re-proved. Strict standalone compilation, all-owned axiom audit and isolated stock-kernel replay passed; the combined repository gate is pending.

Status: proved as a short deduction from classical results; priority qualified.

Lean status: verified. Conjectures.FussFinal proves real-rootedness of the literal sum over Fuss–Dyck words, its closed formula and scalar reduction, including the boundary. Conjectures.FussRoots proves the stated simple-negative-root count and proves that any ordinary-case root relation transfers to the Fuss case. The cited ordinary-case interlacing theorems are inputs to that transfer and are not re-proved in Lean. Strict standalone compilation, axiom audit and isolated kernel replay passed; the combined repository gate is pending.

For every m,n≥1m,n\geq1 and 1≤k≤n1\leq k\leq n, the polynomial counting mm-Dyck paths with exactly kk factors NENE, by the number of factors NNENNE, is real-rooted. The Fuss parameter changes this polynomial only by a positive scalar.

The exact refinement is classical Kreweras/cycle-lemma enumeration. Its real-rooted binomial factor is already proved in the ordinary-Dyck work of Bóna et al. and Wang–Zhang. This note identifies their uniform scalar reduction for the conjecture still listed by Alexandersson and supplies a self-contained proof. It does not claim a new enumeration or root-preserving method.

Exact formula

Let the paths have nn north steps and mnmn east steps, staying weakly above y=x/my=x/m. For n>kn>k,

Wn,k(m)(t)=1mn+1(mn+1k)∑i=1min(k,n−k)(ki)(n−k−1i−1)ti.W_{n,k}^{(m)}(t) =\frac1{mn+1}\binom{mn+1}{k} \sum_{i=1}^{\min(k,n-k)} \binom ki\binom{n-k-1}{i-1}t^i.

For n=kn=k the polynomial is the positive constant (mn+1n)/(mn+1)\binom{mn+1}{n}/(mn+1). Therefore

Wn,k(m)(t)=(n+1)(mn+1k)(mn+1)(n+1k)Wn,k(1)(t).W_{n,k}^{(m)}(t) =\frac{(n+1)\binom{mn+1}{k}} {(mn+1)\binom{n+1}{k}} W_{n,k}^{(1)}(t).

When n>kn>k, there is one simple zero at zero and min(k−1,n−k−1)\min(k-1,n-k-1) simple negative zeros. The proof covers every parameter simultaneously. It also transfers the previously established root-order statements for the ordinary-Dyck family.

Proof and audit

PROOF.md gives the exact cyclic-block count and an elementary Rolle argument for the binomial factor. It includes the empty-path convention, constant boundary, orbit periodicity issue, endpoint multiplicities and degree count. An independent reviewer checked the full argument.

NOVELTY.md records the prior-work audit and classical attributions. No explicit earlier statement resolving this exact named Fuss conjecture was found in the inspected sources. Alexandersson–Leite's recent graph-peaks full text could not be retrieved, so an unconditional priority claim is not justified.

verify.py independently enumerates 10,188 paths across 18 small parameter pairs to check the source convention and coefficient formula. It does not approximate roots and is not a proof step. Run it with Python 3; it has no external dependencies.

Conjecture sources:

Coordination and review: issue #95.