AFTD Auto-Formalizing Theoretical Domains

yang_mills_resonance_polynomial

def

For each natural number m, yang_mills_resonance_polynomial m is the rational polynomial P_m in Polynomial ℚ defined as the quotient of (-1)^(m+1) * kappa divided by the monic polynomial X - 1 via Polynomial.divByMonic, where with D = 2m + 3, b_0 = 1, and for 0 <= n < m, b_{n+1} = ((n^2 - (2m+1)n + D) * b_n - D * X * sum_{i=0}^n sum_{j=0}^{n-i} b_i * b_j * b_{n-i-j}) / (2*(n+1)*(m-n)), and kappa = (-m*(m+1) + D) * b_m - D * X * sum_{i=0}^m sum_{j=0}^{m-i} b_i * b_j * b_{m-i-j}.

Statement

noncomputable def yang_mills_resonance_polynomial (m : ℕ) : Polynomial ℚ
Defined in
arXiv:2610.36784, Eq. (2.3)-(2.5)
Verified
30 Oct 2026
Axioms
none listed

Read back from the Lean

For any natural number $m$, yang_mills_resonance_polynomial m is the polynomial over $\mathbb{Q}$ obtained by dividing the polynomial $(-1)^{m+1} \kappa_m(X)$ by $X - 1$ (using polynomial division by a monic polynomial), where $\kappa_m(X)$ and a sequence of polynomials $b_0, b_1, \dots, b_m \in \mathbb{Q}[X]$ are defined as follows: Let $D = 2m + 3$. 1. $b_0(X) = 1$. 2. For $0 \le n < m$, $$b_{n+1}(X) = \frac{1}{2(n+1)(m-n)} \left[ \left(n^2 - (2m+1)n + D\right) b_n(X) - D \cdot X \sum_{\substack{i, j, k \ge 0 \\ i + j + k = n}} b_i(X) b_j(X) b_k(X) \right].$$ 3. $\kappa_m(X) = (-m(m+1) + D) b_m(X) - D \cdot X \sum_{\substack{i, j, k \ge 0 \\ i + j + k = m}} b_i(X) b_j(X) b_k(X)$.

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 rational resonance polynomial P_m(z) for odd spatial dimension d = 2m + 5 in self-similar Yang-Mills theory. -/
noncomputable def yang_mills_resonance_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)
  Polynomial.divByMonic (sign • kappa) (Polynomial.X - 1)
See it in the graphDiscuss this resultChallenge it