yang_mills_residual_polynomial
For each natural number m, yang_mills_residual_polynomial m is the rational polynomial S_m in Polynomial ℚ obtained as the quotient of the resonance polynomial P_m (computed as in yang_mills_resonance_polynomial m) divided by the monic quadratic polynomial X^2 + b_coeff * X + c_coeff via Polynomial.divByMonic, where d = 2m + 5, b_coeff = -2 * (d^3 - 16*d^2 + 89*d - 146) / ((d - 2)*(d - 1)^2), and c_coeff = ((d - 10)*(d - 5) / ((d - 2)*(d - 1)))^2.
Statement
noncomputable def yang_mills_residual_polynomial (m : ℕ) : Polynomial ℚ
- Defined in
- arXiv:2610.36784, Eq. (3.1) and Sec. 3
- Verified
- 30 Oct 2026
- Axioms
- none listed
- Used by 1
- yang_mills_residual_root_m3The rational residual polynomial yang_mills_residual_polynomial 3 evaluated at the rational number 1/21 equals 0.
Read back from the Lean
yang_mills_residual_polynomial is a function that maps each natural number $m$ to a polynomial with rational coefficients, defined as the polynomial quotient (via Polynomial.divByMonic) of a polynomial $P$ by a monic quadratic polynomial $Q$, where:
1. A sequence of polynomials $b_0, b_1, \dots, b_m \in \mathbb{Q}[X]$ is defined recursively by:
- $b_0 = 1$
- For each $n < m$, with $D = 2m + 3 \in \mathbb{Q}$:
$$b_{n+1} = \frac{1}{2(n+1)(m-n)} \left( \left(n^2 - (2m+1)n + D\right) b_n - D \cdot X \sum_{i=0}^n \sum_{j=0}^{n-i} b_i b_j b_{n-i-j} \right)$$
2. Using $b_m$ and the cubic convolution at order $m$:
$$\kappa = \left(-m(m+1) + D\right) b_m - D \cdot X \sum_{i=0}^m \sum_{j=0}^{m-i} b_i b_j b_{m-i-j}$$
3. $P \in \mathbb{Q}[X]$ is the quotient of $(-1)^{m+1} \kappa$ divided by $X - 1$ using monic polynomial division (Polynomial.divByMonic).
4. Setting $d = 2m + 5 \in \mathbb{Q}$, two rational coefficients are defined:
$$b_{\mathrm{coeff}} = -2 \cdot \frac{d^3 - 16d^2 + 89d - 146}{(d - 2)(d - 1)^2}$$
$$c_{\mathrm{coeff}} = \left( \frac{(d - 10)(d - 5)}{(d - 2)(d - 1)} \right)^2$$
and $Q = X^2 + b_{\mathrm{coeff}} X + c_{\mathrm{coeff}} \in \mathbb{Q}[X]$.
5. The result is Polynomial.divByMonic P Q, the quotient of $P$ divided by $Q$ using monic polynomial division.
Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.
Lean source view module on GitHub
/-- The residual polynomial S_m(z) = P_m(z) / ((z - z_-)(z - z_+)) dividing out the explicit profile roots. -/ noncomputable def yang_mills_residual_polynomial (m : ℕ) : Polynomial ℚ := open BigOperators in let rec cube_sum (l : List (Polynomial ℚ)) (n : ℕ) : Polynomial ℚ := ∑ i ∈ Finset.range (n + 1), ∑ j ∈ Finset.range (n + 1 - i), l.getD i 0 * l.getD j 0 * l.getD (n - i - j) 0 let rec b_list : ℕ → List (Polynomial ℚ) | 0 => [1] | n + 1 => let prev := b_list n if n < m then let D : ℚ := 2 * m + 3 let bn := prev.getD n 0 let triple := cube_sum prev n let num := ((n ^ 2 - (2 * m + 1 : ℚ) * n + D : ℚ) • bn) - (D • Polynomial.X * triple) let den : ℚ := 2 * (n + 1) * (m - n) prev ++ [(den⁻¹ : ℚ) • num] else prev ++ [0] let l := b_list m let D : ℚ := 2 * m + 3 let bm := l.getD m 0 let triple_m := cube_sum l m let kappa := ((-((m : ℚ) * (m + 1)) + D : ℚ) • bm) - (D • Polynomial.X * triple_m) let sign : ℚ := (-1 : ℚ) ^ (m + 1) let P : Polynomial ℚ := Polynomial.divByMonic (sign • kappa) (Polynomial.X - 1) let d : ℚ := 2 * m + 5 let b_coeff : ℚ := -2 * (d^3 - 16 * d^2 + 89 * d - 146) / ((d - 2) * (d - 1)^2) let c_coeff : ℚ := ((d - 10) * (d - 5) / ((d - 2) * (d - 1)))^2 let Q : Polynomial ℚ := Polynomial.X ^ 2 + (Polynomial.C b_coeff) * Polynomial.X + Polynomial.C c_coeff Polynomial.divByMonic P Q