Chow's conjecture

What Lean checks

Lean proves consecutive interlacing at every rank at least two, strictly from rank three, for the actual even-signed permutation enumerators. The proof derives the refinement recurrence and all root inequalities internally. All 11 modules passed strict sources, the complete axiom audit, and stock-kernel replay.

For every n≥2n\ge2, the ordinary type-D Eulerian polynomial Dn(x)D_n(x) interlaces Dn+1(x)D_{n+1}(x). The interlacing is strict for n≥3n\ge3. The pair D2,D3D_2,D_3 has a common zero at −1-1.

These polynomials count even-signed permutations by their type-D descent statistic. The assertion is the question in Section 5 of Chak-On Chow's New proofs of interlacing of zeros of Eulerian polynomials (2022).

Proof

Savage and Visontai proved an ordered pairwise interlacing theorem for a refinement Tn,iT_{n,i}. The first entry of row n+1n+1 equals the total of row nn, and the total is 2Dn2D_n. A first member of an interlacing family interlaces its positive sum. This gives the full consecutive-interlacing assertion. The refinement recurrence also excludes common zeros of an entire row; a sign argument then gives strictness.

The proof is a short deduction from established results. The refinement and its compatibility theorem belong to Savage–Visontai, and Yang–Zhang later stated the relevant identities explicitly. The literature audit found no prior explicit resolution of the consecutive assertion, but does not claim the deduction was unknown to every specialist.

Verification

Lean verifies the full assertion for every rank. The formal source polynomial counts actual even-signed permutations by the type-D descent statistic. The append/delete bijection proves the refinement recurrence, and a sign involution proves the factor of two between the total row and the source polynomial. The ordered cone inequalities and strict root sign argument are proved inside Lean.

The conclusion includes full polynomial factorizations, root multiplicities, and the actual alternating root inequalities. Interlacing holds for every rank at least two and is strict from rank three.

All 11 modules passed strict source checks, the complete declaration and axiom audit, and independent stock-kernel replay. The audit covers 329 declarations, including 286 theorem declarations and 149 private declarations. All 48 required endpoints passed. See the formal theorem and verification receipt. The combined repository gate remains a separate pending check.

The script checks the formula conventions by direct enumeration of signed permutations for 2≤n≤62\le n\le6, independently compares the refined recurrence with Stembridge's identity for 2≤n≤322\le n\le32, and checks the cutoff and row-difference identities exactly. It requires Python and SymPy. Run:

python results/chow-conjecture/verify.py

Those finite checks catch indexing and normalization errors. They are not the all-rank proof.

Credits and references

Proof note: Cinna Davis and GPT-6.2 Astra. The central published input is due to Carla D. Savage and Mirkó Visontai.