Keyboard shortcuts

Press ← or → to navigate between chapters

Press ? to show this help

Press Esc to hide this help

Central factorial transfer coefficients

Abstract

Central factorial polynomials expand the binary spectral polynomial and its homogenized transfer eigenvalue over a field of characteristic zero.

Definition 1.1 (Central factorial polynomials).

Formalization. D5/S1/Recurrence/CentralFactorialTransferExpansion.mPoly (✓ std3).

Citation. Xavier Poncini and Jørgen Rasmussen (2023). Integrability of planar-algebraic models. DOI: 10.1088/1742-5468/acdce7. URL: https://arxiv.org/abs/2206.14462v2.

Commentary.

Page 45, (C.44): “m_j(x) := Π_{k=0}^{j−1} [x − (j − 1 − 2k)], j ∈ ℕ.” The product is a Polynomial over F; the empty product is one.

Definition 1.2 (Double factorial binomial coefficients).

Formalization. D5/S1/Recurrence/CentralFactorialTransferExpansion.dfBinom (✓ std3).

Citation. Xavier Poncini and Jørgen Rasmussen (2023). Integrability of planar-algebraic models. DOI: 10.1088/1742-5468/acdce7. URL: https://arxiv.org/abs/2206.14462v2.

Commentary.

Page 47, (C.65): “n_1!!/(n_2!!(n_1 − n_2)!!).” The integer arguments are sent through Int.toNat before Nat.doubleFactorial, so (−1)!! = 0!! = 1. Division is field division.

Definition 1.3 (Transfer eigenvalues).

Formalization. D5/S1/Recurrence/CentralFactorialTransferExpansion.scalarEigenvalue (✓ std3).

Citation. Xavier Poncini and Jørgen Rasmussen (2023). Integrability of planar-algebraic models. DOI: 10.1088/1742-5468/acdce7. URL: https://arxiv.org/abs/2206.14462v2.

Commentary.

Page 45, (C.46): “λ_k(u) = 2(1 + u²)(1 − u)^(2k)(1 + u)^(2(n − 1 − k))”. Here m = n − 1 counts internal edges and l = k counts sign changes. Natural subtraction is truncated.

Definition 1.4 (Scalar central factorial expansion).

Formalization. D5/S1/Recurrence/CentralFactorialTransferExpansion.scalarExpansion (✓ std3).

Source. Repository-derived.

Acknowledgement. Xavier Poncini and Jørgen Rasmussen (2023). Integrability of planar-algebraic models. DOI: 10.1088/1742-5468/acdce7. URL: https://arxiv.org/abs/2206.14462v2.

Commentary.

The right side evaluates the central factorial polynomials at m − 2l. Nat.div k 2 is natural-number division; subtraction within natural indices is truncated. Polynomial.eval is written with its evaluation point first.

Theorem 1.5 (The central factorial coefficient identity).

Proof. Machine-checked in Lean as D5/S1/Recurrence/CentralFactorialTransferExpansion.central_spectral_coeff (✓ std3). ∎

Source. Repository-derived.

Acknowledgement. Xavier Poncini and Jørgen Rasmussen (2023). Integrability of planar-algebraic models. DOI: 10.1088/1742-5468/acdce7. URL: https://arxiv.org/abs/2206.14462v2.

Commentary.

The coefficient of the binary spectral polynomial is the finite double factorial sum. Formal series substitution and a second-order recurrence give the identity; no convergence hypothesis is needed.

Theorem 1.6 (The scalar transfer identity).

Proof. Machine-checked in Lean as D5/S1/Recurrence/CentralFactorialTransferExpansion.scalar_settlement (✓ std3). ∎

Source. Repository-derived.

Acknowledgement. Xavier Poncini and Jørgen Rasmussen (2023). Integrability of planar-algebraic models. DOI: 10.1088/1742-5468/acdce7. URL: https://arxiv.org/abs/2206.14462v2.

Commentary.

The coefficient identity is homogenized at 2u/(1 + u²); the case 1 + u² = 0 is treated directly. The equality holds over every field of characteristic zero.

References