AFTD Auto-Formalizing Theoretical Domains

nae_angle_poly_high

theoremverified

For real x with 1/20 ≤ x ≤ 1/14, nae_angle_poly x is nonnegative.

Statement

theorem nae_angle_poly_high (x : ℝ) (hx0 : 1 / 20 ≤ x) (hx : x ≤ 1 / 14) :
    0 ≤ nae_angle_poly x
Source
arXiv:1211.0721, Section 3.3, p-computation rule analysis
Verified
14 Nov 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 1
  • nae_angle_polyThe real-valued function nae_angle_poly is defined for real x by 9(16x²−20x+5)²−128x(1−x)²(3−4x)⁴(1−4x)⁴.
Used by 1

The proof, explained

To show that $\operatorname{nae\_angle\_poly}(x) \ge 0$ on the interval $[1/20, 1/14]$, the polynomial is re-expressed in the Bernstein basis using the non-negative barycentric coordinates $a = (140x - 7)/3$ and $b = (10 - 140x)/3$. In this degree-11 homogeneous expansion, every coefficient is strictly positive. Since $a \ge 0$ and $b \ge 0$, the sum is non-negative, and dividing by the positive scaling factor $96549157373046875$ yields $\operatorname{nae\_angle\_poly}(x) \ge 0$.

  1. The affine coordinates $a = (140x - 7)/3$ and $b = (10 - 140x)/3$ are both non-negative.

    We introduce $a$ and $b$ as the barycentric coordinates parameterizing the interval $[1/20, 1/14]$ (so that $a + b = 1$). Since $x \ge 1/20 = 7/140$, we have $140x - 7 \ge 0$ and thus $a \ge 0$. Similarly, since $x \le 1/14 = 10/140$, we have $10 - 140x \ge 0$ and thus $b \ge 0$. Both bounds follow by linear arithmetic (`linarith`).

    lines 3–6

      let a : ℝ := (140 * x - 7) / 3
      let b : ℝ := (10 - 140 * x) / 3
      have ha : 0 ≤ a := by dsimp [a]; linarith
      have hb : 0 ≤ b := by dsimp [b]; linarith
  2. The homogeneous degree-11 polynomial $142509918726743659 b^{11} + 1151878116961806815 a b^{10} + \dots + 841883855810546875 a^{11}$ is non-negative.

    All twelve coefficients in the polynomial are strictly positive integers. Because $a \ge 0$ and $b \ge 0$, every monomial $a^i b^{11-i}$ is non-negative, so the sum of these non-negative terms is non-negative. This is checked by the `positivity` tactic.

    lines 7–13

      have hpos : 0 ≤
          142509918726743659 * b^11 + 1151878116961806815 * a*b^10 +
          5315499883836256450 * a^2*b^9 + 18904695335091016500 * a^3*b^8 +
          51180999291745693125 * a^4*b^7 + 99372532206124734375 * a^5*b^6 +
          134778483993429609375 * a^6*b^5 + 126197568178586953125 * a^7*b^4 +
          79993288283327343750 * a^8*b^3 + 32822354439847656250 * a^9*b^2 +
          7880130761357421875 * a^10*b + 841883855810546875 * a^11 := by positivity
  3. The rescaled polynomial satisfies $(96549157373046875 : \mathbb{R}) \cdot \operatorname{nae\_angle\_poly}(x) = 142509918726743659 b^{11} + \dots + 841883855810546875 a^{11}$.

    Expanding `nae_angle_poly x` and substituting the definitions of $a$ and $b$ in terms of $x$, both sides become identical polynomials in $x$ of degree at most 11. Lean's `ring` tactic confirms this polynomial identity algebraically.

    lines 14–22

      have hid : (96549157373046875 : ℝ) * nae_angle_poly x =
          142509918726743659 * b^11 + 1151878116961806815 * a*b^10 +
          5315499883836256450 * a^2*b^9 + 18904695335091016500 * a^3*b^8 +
          51180999291745693125 * a^4*b^7 + 99372532206124734375 * a^5*b^6 +
          134778483993429609375 * a^6*b^5 + 126197568178586953125 * a^7*b^4 +
          79993288283327343750 * a^8*b^3 + 32822354439847656250 * a^9*b^2 +
          7880130761357421875 * a^10*b + 841883855810546875 * a^11 := by
        dsimp [a, b, nae_angle_poly]
        ring
  4. $0 \le \operatorname{nae\_angle\_poly}(x)$.

    By the identity `hid`, $96549157373046875 \cdot \operatorname{nae\_angle\_poly}(x)$ equals the homogeneous polynomial expression, which was shown in `hpos` to be non-negative. Since the integer constant $96549157373046875$ is strictly positive, dividing by it proves that $\operatorname{nae\_angle\_poly}(x) \ge 0$.

    line 23

      nlinarith

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

theorem nae_angle_poly_high (x : ℝ) (hx0 : 1 / 20 ≤ x) (hx : x ≤ 1 / 14) :    0 ≤ nae_angle_poly x := by  let a : ℝ := (140 * x - 7) / 3  let b : ℝ := (10 - 140 * x) / 3  have ha : 0 ≤ a := by dsimp [a]; linarith  have hb : 0 ≤ b := by dsimp [b]; linarith  have hpos : 0 ≤      142509918726743659 * b^11 + 1151878116961806815 * a*b^10 +      5315499883836256450 * a^2*b^9 + 18904695335091016500 * a^3*b^8 +      51180999291745693125 * a^4*b^7 + 99372532206124734375 * a^5*b^6 +      134778483993429609375 * a^6*b^5 + 126197568178586953125 * a^7*b^4 +      79993288283327343750 * a^8*b^3 + 32822354439847656250 * a^9*b^2 +      7880130761357421875 * a^10*b + 841883855810546875 * a^11 := by positivity  have hid : (96549157373046875 : ℝ) * nae_angle_poly x =      142509918726743659 * b^11 + 1151878116961806815 * a*b^10 +      5315499883836256450 * a^2*b^9 + 18904695335091016500 * a^3*b^8 +      51180999291745693125 * a^4*b^7 + 99372532206124734375 * a^5*b^6 +      134778483993429609375 * a^6*b^5 + 126197568178586953125 * a^7*b^4 +      79993288283327343750 * a^8*b^3 + 32822354439847656250 * a^9*b^2 +      7880130761357421875 * a^10*b + 841883855810546875 * a^11 := by    dsimp [a, b, nae_angle_poly]    ring  nlinarith
See it in the graphDiscuss this resultChallenge it