cycle_rook_poly_one
The rook polynomial of a 1-cycle is equal to 1 in ℚ[x].
Statement
theorem cycle_rook_poly_one : cycle_rook_poly 1 = 1- Source
- arXiv:2610.23958 Proposition 5.1
- Verified
- 24 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 1
- cycle_rook_polyThe rook polynomial Q_m(x) of an m-cycle, defined for m >= 1 as the sum over k from 0 to floor(m/2) of (m / (m - k)) * choose(m - k, k) *…
Read back from the Lean
cycle_rook_poly 1 equals 1 (as an equality of polynomials in Polynomial ℚ).
Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.
The proof, explained
The theorem is proved by unfolding the definition of the cycle rook polynomial `cycle_rook_poly` at $m = 1$. The summation runs over $k \in \text{range}(1/2 + 1) = \{0\}$, leaving only the $k = 0$ term, which simplifies to $1$ via basic polynomial and rational arithmetic.
cycle_rook_poly 1 = 1 automation
Unfold the definition of `cycle_rook_poly` at $m = 1$. The sum is over $k \in \text{range}(1/2 + 1) = \text{range}(1) = \{0\}$. For $k = 0$, the coefficient is $\frac{1}{1 - 0} \binom{1 - 0}{0} = 1$, and $X^0 = 1$, so the single term is $1$. The simplifier computes the range, evaluates the single term, and simplifies the arithmetic to obtain $1$.
uses
cycle_rook_polysimp [cycle_rook_poly]
cycle_rook_poly- Definition of the cycle rook polynomial $Q_m(X) = \sum_{k=0}^{\lfloor m/2 \rfloor} \frac{m}{m-k} \binom{m-k}{k} X^k$
Written by a model (gemini-3.8-flash) from the Lean proof and the goal states Lean reported at each step. Lean verified the proof; this explanation is a reading aid and is not itself machine-checked.
Lean source view module on GitHub
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
/-- Sanity check: Q_1(X) = 1. -/theorem cycle_rook_poly_one : cycle_rook_poly 1 = 1 := by simp [cycle_rook_poly]