Alternating permutations are a classical meeting point of enumerative combinatorics, permutation statistics, and special functions. An up--down permutation alternates between rises and falls, and their ordinary counts are the Euler secant and tangent numbers. Refining this count by the inversion statistic produces the -secant polynomial . Its values and congruences retain information that disappears after setting : they distinguish how the alternating permutations are distributed by inversion number and reveal cancellation at roots such as . Ji-Cai Liu's article isolates the next nontrivial term in the -adic expansion of this polynomial, strengthening an earlier Andrews--Foata congruence. The mission formalizes the article's main result, Theorem 1.1, as an exact polynomial-divisibility statement.
For , let be the set of permutations of satisfying
The empty permutation is the unique member of . The inversion number is
The -secant inversion enumerator is the integer polynomial
Congruence modulo means divisibility in : two polynomials and are congruent precisely when divides . This formulation avoids evaluation at a single number and records the first three orders of behavior at .
In Lean, a permutation is represented as an equivalence of Fin (2*n). The alternating inequalities and inversion number are finite predicates and counts on this zero-based type. The polynomial variable is the canonical indeterminate in Polynomial ℤ.
For every integer , prove
Equivalently,
The boundary value is included. With the empty-permutation convention and natural-number truncated subtraction in the exponent, both sides reduce correctly, so the formal target does not hide a separate exceptional case.
The theorem identifies the exact quadratic correction to the highest-inversion monomial near . It therefore explains why the prior congruence modulo does not generally lift unchanged to the cubic modulus. Specializing at also yields the corresponding refinement modulo for the ordinary secant numbers. More broadly, the statement is a compact test case for formal reasoning that combines finite permutations, order predicates, inversion statistics, generating polynomials, binomial coefficients, and divisibility in a polynomial ring.
A machine-checked proof would contribute reusable infrastructure for permutation enumerators and polynomial congruences. The published article supplies a human proof; the Prove2me goal is the formal reconstruction of its theorem in Lean. The mission does not encode a proof certificate, an orbit count, or the desired divisibility inside a definition. A successful submission must derive the divisibility from the concrete finite definitions.
The result also gives a useful interface between two styles of formal combinatorics. On one side, alternating permutations are finite objects that can be enumerated, mapped, and partitioned. On the other, their aggregate is an algebraic object in whose divisibility can be studied without referring to individual permutations. Infrastructure connecting these levels can be reused for other -Euler numbers, descent and major-index enumerators, and congruences obtained from finite weighted actions. The mission keeps that infrastructure general-purpose by making the final target an equality in a quotient of the polynomial ring rather than a specialized computational procedure.
Direct expansion of is factorial in and gives no uniform explanation of divisibility by a third power. Divisibility by is stronger than merely checking the value at : it simultaneously constrains the value and the first two formal orders there. A formal solution must control the entire finite family of alternating permutations while preserving exact inversion exponents and polynomial coefficients. Index conventions are also delicate, because the paper numbers positions and values from , whereas Lean uses Fin indices from .
The source argument introduces combinatorial structure beyond the bare statement. Formalizers may contribute reusable lemmas about switching consecutive values, invariance of alternation under permitted switches, inversion-number changes, finite group actions, and divisibility of orbit enumerators. Those are natural milestones, but the present root goal deliberately remains the stable polynomial congruence rather than committing to one decomposition.
The mission fixes the coefficient ring to and uses exact polynomial divisibility. It does not replace congruence by coefficientwise arithmetic modulo , evaluation at , or a numerical check for bounded . UpDown is defined directly on permutations of Fin (2*n), invNumber counts ordered index pairs with the required inequality, and qSecant is the finite sum of monomials .
The formal statement quantifies over every natural number. The conventions at and are part of the same theorem and have been audited explicitly. The uploaded definition bundle is transparent and sorry-free; the only admitted declaration is the mission theorem itself. Useful contributions include general lemmas about polynomial divisibility, finite involutions and orbit sums, or bridges between one-based paper notation and Lean's finite types.
namespace QSecantCubic
open Polynomial
theorem cubicCongruence (n : ℕ) :
(1 + X) ^ 3 ∣
qSecant n -
(X ^ (2 * n * (n - 1)) -
C (Nat.choose n 2 : ℤ) * (1 + X) ^ 2) := by sorry
end QSecantCubic
Let be the set of up--down alternating permutations of , with the empty permutation included when . For , let be its inversion number, and define the -secant inversion enumerator
For every natural number , prove the polynomial congruence
Equivalently, divides the difference of the two displayed polynomials in . This is the cubic refinement of the Andrews--Foata congruence and determines the quadratic correction at .
Formalization Note Permutations use the zero-based type Fin (2*n), and congruence is represented by exact divisibility in Polynomial ℤ. The cases and are included in the single statement.
No open leaves. Every sub-goal is proved or awaiting decomposition.