AFTD Auto-Formalizing Theoretical Domains

yang_mills_residual_root_m3

theoremverifiedformalization

The rational residual polynomial yang_mills_residual_polynomial 3 evaluated at the rational number 1/21 equals 0.

Statement

theorem yang_mills_residual_root_m3 :
    (yang_mills_residual_polynomial 3).eval (1 / 21 : ℚ) = 0
Formalizes
arXiv:2610.36784, Section 3
Verified
31 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 1
  • yang_mills_residual_polynomialFor each natural number m, yang_mills_residual_polynomial m is the rational polynomial S_m in Polynomial ℚ obtained as the quotient of the…

Read back from the Lean

The rational polynomial yang_mills_residual_polynomial 3 evaluates to 0 at 1/21 (that is, 1/21 is a root of yang_mills_residual_polynomial 3).

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 residual polynomial S₃(X) is defined via a recurrence sequence b_n, a triple convolution of the sequence, and two successive quotient divisions by X - 1 and a monic quadratic Q(X). The proof evaluates the recurrence and triple convolution explicitly, factors the numerator to cancel X - 1, and factors the resulting cubic to cancel Q(X), simplifying S₃(X) to the linear polynomial (42525/32)X - 2025/32. Finally, evaluating this linear polynomial at X = 1/21 yields 2025/32 - 2025/32 = 0.

  1. The initial polynomials b₀, b₁, b₂, b₃ generated by the recurrence `b_list 3 3` are computed explicitly.

    To simplify the residual polynomial S₃, the proof first calculates the recurrence sequence b_n up to n = 3. Unfolding the recursive definitions of `b_list` and `cube_sum` and expanding the finite sums via `Finset.sum_range_succ` reduces each entry to an explicit polynomial. The `polynomial` tactic verifies that b₀ = 1, b₁ = 3/2 - (3/2)X, b₂ = (81/16)X² - (45/8)X + 9/16, and b₃ = -(1053/32)X³ + (1431/32)X² - (375/32)X - 3/32.

    lines 4–15

    uses yang_mills_residual_polynomial.b_list.eq_def, yang_mills_residual_polynomial.cube_sum.eq_def, Finset.sum_range_succ

      have hS : yang_mills_residual_polynomial 3
          = Polynomial.C (42525/32) * Polynomial.X - Polynomial.C (2025/32) := by
        have hbl : yang_mills_residual_polynomial.b_list 3 3 =
            ([1,
              Polynomial.C (3/2) - Polynomial.C (3/2) * Polynomial.X,
              Polynomial.C (81/16) * Polynomial.X^2 - Polynomial.C (45/8) * Polynomial.X + Polynomial.C (9/16),
              -Polynomial.C (1053/32) * Polynomial.X^3 + Polynomial.C (1431/32) * Polynomial.X^2
                - Polynomial.C (375/32) * Polynomial.X - Polynomial.C (3/32)] : List (Polynomial ℚ)) := by
          simp only [yang_mills_residual_polynomial.b_list.eq_def,
            yang_mills_residual_polynomial.cube_sum.eq_def]
          norm_num [Finset.sum_range_succ]
          refine ⟨?_, ?_, ?_⟩ <;> polynomial
  2. The threefold convolution `cube_sum` of the polynomial list at degree 3 is computed explicitly.

    The definition of the residual polynomial requires the degree-3 term of the threefold convolution ∑_{i+j+k=3} b_i b_j b_k. Unfolding `cube_sum.eq_def` and evaluating the finite sum over the computed coefficients b₀, ..., b₃ using `Finset.sum_range_succ`, the `polynomial` tactic simplifies the sum to -(4725/32)X³ + (7695/32)X² - (3231/32)X + 261/32.

    lines 16–26

    uses yang_mills_residual_polynomial.cube_sum.eq_def, Finset.sum_range_succ

        have hcs : yang_mills_residual_polynomial.cube_sum
            ([1,
              Polynomial.C (3/2) - Polynomial.C (3/2) * Polynomial.X,
              Polynomial.C (81/16) * Polynomial.X^2 - Polynomial.C (45/8) * Polynomial.X + Polynomial.C (9/16),
              -Polynomial.C (1053/32) * Polynomial.X^3 + Polynomial.C (1431/32) * Polynomial.X^2
                - Polynomial.C (375/32) * Polynomial.X - Polynomial.C (3/32)] : List (Polynomial ℚ)) 3 =
            -Polynomial.C (4725/32) * Polynomial.X^3 + Polynomial.C (7695/32) * Polynomial.X^2
              - Polynomial.C (3231/32) * Polynomial.X + Polynomial.C (261/32) := by
          simp only [yang_mills_residual_polynomial.cube_sum.eq_def]
          norm_num [Finset.sum_range_succ]
          polynomial
  3. Unfolding the definition of `yang_mills_residual_polynomial 3` expresses it as two successive monic polynomial divisions.

    Unfolding `yang_mills_residual_polynomial 3` and substituting the precomputed values of b₃ and the threefold convolution, numerical evaluation (`norm_num`) computes the constants: D = 9, κ = -3 b₃ - 9 X · (cube_sum), the sign factor (-1)⁴ = 1, and the quadratic polynomial Q = X² - (38/75)X + 1/225. This reduces the residual polynomial to (κ /ₘ (X - 1)) /ₘ Q.

    lines 27–29

        unfold yang_mills_residual_polynomial
        simp only [hbl, hcs]
        norm_num
  4. The first polynomial division by X - 1 cancels, leaving a cubic polynomial.

    The numerator κ factors as (X - 1) · ((42525/32)X³ - (23571/32)X² + (1215/32)X - 9/32), verified by polynomial arithmetic in `hnum`. Because X - 1 is monic (`Polynomial.monic_X_sub_C`), dividing by X - 1 cancels the factor via `Polynomial.mul_divByMonic_cancel_left`, leaving the cubic quotient.

    lines 30–43

    uses Polynomial.mul_divByMonic_cancel_left, Polynomial.monic_X_sub_C

        have hnum :
            (-((3 : ℚ) • (-(Polynomial.C (1053 / 32) * Polynomial.X ^ 3)
                  + Polynomial.C (1431 / 32) * Polynomial.X ^ 2
                  - Polynomial.C (375 / 32) * Polynomial.X - Polynomial.C (3 / 32))) -
                  (9 : ℚ) • (Polynomial.X * (-(Polynomial.C (4725 / 32) * Polynomial.X ^ 3)
                  + Polynomial.C (7695 / 32) * Polynomial.X ^ 2
                  - Polynomial.C (3231 / 32) * Polynomial.X + Polynomial.C (261 / 32))) : Polynomial ℚ)
              = (Polynomial.X - 1) * (Polynomial.C (42525/32) * Polynomial.X^3
                  - Polynomial.C (23571/32) * Polynomial.X^2
                  + Polynomial.C (1215/32) * Polynomial.X - Polynomial.C (9/32)) := by
          polynomial
        rw [hnum]
        rw [Polynomial.mul_divByMonic_cancel_left (q := Polynomial.X - 1) _
          (Polynomial.monic_X_sub_C (1:ℚ))]
  5. The second polynomial division cancels the quadratic factor Q, proving that S₃(X) = (42525/32)X - 2025/32.

    The cubic polynomial factors as Q · ((42525/32)X - 2025/32), where Q = X² - (38/75)X + 1/225, verified by polynomial arithmetic in `hQS`. Since Q is monic (proven by `monicity` and `norm_num`), `Polynomial.mul_divByMonic_cancel_left` cancels Q, establishing that the residual polynomial simplifies to the linear polynomial (42525/32)X - 2025/32 (`hS`).

    lines 44–52

    uses Polynomial.mul_divByMonic_cancel_left

        have hQS : (Polynomial.C (42525/32) * Polynomial.X^3 - Polynomial.C (23571/32) * Polynomial.X^2
            + Polynomial.C (1215/32) * Polynomial.X - Polynomial.C (9/32) : Polynomial ℚ)
            = (Polynomial.X ^ 2 + -(Polynomial.C (38 / 75) * Polynomial.X) + Polynomial.C (1 / 225))
              * (Polynomial.C (42525/32) * Polynomial.X - Polynomial.C (2025/32)) := by
          polynomial
        rw [hQS]
        rw [Polynomial.mul_divByMonic_cancel_left
          (q := Polynomial.X ^ 2 + -(Polynomial.C (38 / 75) * Polynomial.X) + Polynomial.C (1 / 225))
          _ (by monicity <;> norm_num)]
  6. Evaluating the linear residual polynomial at 1/21 gives 0.

    Rewriting with `hS` substitutes the linear form (42525/32)X - 2025/32. Evaluating at X = 1/21 gives (42525/32) · (1/21) - 2025/32 = 2025/32 - 2025/32 = 0, which `norm_num` evaluates to 0.

    lines 53–55

      rw [hS]
      simp
      norm_num
yang_mills_residual_polynomial.b_list.eq_def
The recursive equation defining `b_list`: `b_list m 0 = [1]`, and `b_list m (n + 1)` appends the next polynomial computed from the previous list if n < m, or 0 otherwise.
yang_mills_residual_polynomial.cube_sum.eq_def
The definition of `cube_sum l n`, which computes the degree-n term of the threefold Cauchy product ∑_{i+j+k=n} l_i l_j l_k over a list of polynomials l.
Finset.sum_range_succ
Splits a sum over {0, ..., n} into the sum over {0, ..., n - 1} plus the term at index n: ∑_{x=0}^{n} f(x) = (∑_{x=0}^{n-1} f(x)) + f(n).
Polynomial.mul_divByMonic_cancel_left
For any monic polynomial q and polynomial p, dividing q * p by q via monic division yields p: (q * p) /ₘ q = p.
Polynomial.monic_X_sub_C
For any scalar constant c, the linear polynomial X - C(c) is monic (its leading coefficient is 1).

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

/-- The rational number 1/21 is a root of the residual polynomial S_3. -/theorem yang_mills_residual_root_m3 :    (yang_mills_residual_polynomial 3).eval (1 / 21 : ℚ) = 0 := by  have hS : yang_mills_residual_polynomial 3      = Polynomial.C (42525/32) * Polynomial.X - Polynomial.C (2025/32) := by    have hbl : yang_mills_residual_polynomial.b_list 3 3 =        ([1,          Polynomial.C (3/2) - Polynomial.C (3/2) * Polynomial.X,          Polynomial.C (81/16) * Polynomial.X^2 - Polynomial.C (45/8) * Polynomial.X + Polynomial.C (9/16),          -Polynomial.C (1053/32) * Polynomial.X^3 + Polynomial.C (1431/32) * Polynomial.X^2            - Polynomial.C (375/32) * Polynomial.X - Polynomial.C (3/32)] : List (Polynomial ℚ)) := by      simp only [yang_mills_residual_polynomial.b_list.eq_def,        yang_mills_residual_polynomial.cube_sum.eq_def]      norm_num [Finset.sum_range_succ]      refine ⟨?_, ?_, ?_⟩ <;> polynomial    have hcs : yang_mills_residual_polynomial.cube_sum        ([1,          Polynomial.C (3/2) - Polynomial.C (3/2) * Polynomial.X,          Polynomial.C (81/16) * Polynomial.X^2 - Polynomial.C (45/8) * Polynomial.X + Polynomial.C (9/16),          -Polynomial.C (1053/32) * Polynomial.X^3 + Polynomial.C (1431/32) * Polynomial.X^2            - Polynomial.C (375/32) * Polynomial.X - Polynomial.C (3/32)] : List (Polynomial ℚ)) 3 =        -Polynomial.C (4725/32) * Polynomial.X^3 + Polynomial.C (7695/32) * Polynomial.X^2          - Polynomial.C (3231/32) * Polynomial.X + Polynomial.C (261/32) := by      simp only [yang_mills_residual_polynomial.cube_sum.eq_def]      norm_num [Finset.sum_range_succ]      polynomial    unfold yang_mills_residual_polynomial    simp only [hbl, hcs]    norm_num    have hnum :        (-((3 : ℚ) • (-(Polynomial.C (1053 / 32) * Polynomial.X ^ 3)              + Polynomial.C (1431 / 32) * Polynomial.X ^ 2              - Polynomial.C (375 / 32) * Polynomial.X - Polynomial.C (3 / 32))) -              (9 : ℚ) • (Polynomial.X * (-(Polynomial.C (4725 / 32) * Polynomial.X ^ 3)              + Polynomial.C (7695 / 32) * Polynomial.X ^ 2              - Polynomial.C (3231 / 32) * Polynomial.X + Polynomial.C (261 / 32))) : Polynomial ℚ)          = (Polynomial.X - 1) * (Polynomial.C (42525/32) * Polynomial.X^3              - Polynomial.C (23571/32) * Polynomial.X^2              + Polynomial.C (1215/32) * Polynomial.X - Polynomial.C (9/32)) := by      polynomial    rw [hnum]    rw [Polynomial.mul_divByMonic_cancel_left (q := Polynomial.X - 1) _      (Polynomial.monic_X_sub_C (1:ℚ))]    have hQS : (Polynomial.C (42525/32) * Polynomial.X^3 - Polynomial.C (23571/32) * Polynomial.X^2        + Polynomial.C (1215/32) * Polynomial.X - Polynomial.C (9/32) : Polynomial ℚ)        = (Polynomial.X ^ 2 + -(Polynomial.C (38 / 75) * Polynomial.X) + Polynomial.C (1 / 225))          * (Polynomial.C (42525/32) * Polynomial.X - Polynomial.C (2025/32)) := by      polynomial    rw [hQS]    rw [Polynomial.mul_divByMonic_cancel_left      (q := Polynomial.X ^ 2 + -(Polynomial.C (38 / 75) * Polynomial.X) + Polynomial.C (1 / 225))      _ (by monicity <;> norm_num)]  rw [hS]  simp  norm_num
See it in the graphDiscuss this resultChallenge it