AFTD Auto-Formalizing Theoretical Domains

two_adjacent_chord_cubic_im_le

theoremverified

Every complex root of the nonzero cubic factor of the unscaled directed four-cycle with adjacent chord weights t,u has imaginary part of absolute value at most one, for arbitrary real chord weights.

Statement

theorem two_adjacent_chord_cubic_im_le (t u : ℝ) (z : ℂ)
    (hz : z ^ 3 - ((t + u + 4 : ℝ) : ℂ) * z ^ 2 +
      ((t * u + 3 * t + 3 * u + 6 : ℝ) : ℂ) * z -
      ((2 * t * u + 2 * t + 2 * u + 4 : ℝ) : ℂ) = 0) :
    |z.im| ≤ 1
Source
Supporting cubic algebra for standardized_laplacian_order_four_im_le (OP-465; arXiv:2610.14100 Questions 1 and 3). The two-chord family is from Section 5; experiment 4367 records its explicit factorization.
Verified
24 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 1

The proof, explained

The proof bounds the imaginary parts of the roots of the cubic polynomial by applying `real_cubic_im_le_of_discriminant_bound`, which reduces the goal to two real coefficient inequalities. The first inequality, -3 ≤ a² - 3b, holds because the difference is a positive semidefinite quadratic form expressible as a sum of squares ½((1 - t)² + (1 - u)² + (t - u)²). The second inequality requires showing that the modified discriminant Δ + 4(a² - 3b + 4)² is non-negative; this is established by rewriting the degree-6 polynomial as an explicit sum of squares (t - u)² · ((1 - t)²(1 - u)² + 3(1 - t)² + 3(1 - u)² + ((1 - t) + (1 - u))² + 9), which is manifestly non-negative.

  1. It suffices to verify two real inequality conditions on the coefficients of the cubic polynomial.

    By `real_cubic_im_le_of_discriminant_bound`, any root z of a monic real cubic z³ - az² + bz - c = 0 has imaginary part bounded by |Im(z)| ≤ 1 whenever the coefficients satisfy -3 ≤ a² - 3b and the modified discriminant Δ + 4(a² - 3b + 4)² is non-negative. Applying this lemma with a = t + u + 4, b = tu + 3t + 3u + 6, and c = 2tu + 2t + 2u + 4 reduces the theorem to establishing these two inequalities for all real t and u.

    lines 8–10

    uses real_cubic_im_le_of_discriminant_bound

      apply real_cubic_im_le_of_discriminant_bound
        (t + u + 4) (t * u + 3 * t + 3 * u + 6)
        (2 * t * u + 2 * t + 2 * u + 4) z hz
  2. The first condition holds: -3 ≤ (t + u + 4)² - 3(tu + 3t + 3u + 6) for all real t and u.

    The quantity (t + u + 4)² - 3(tu + 3t + 3u + 6) + 3 simplifies to the quadratic form t² - tu + u² - t - u + 1, which equals ½((1 - t)² + (1 - u)² + (t - u)²). Providing the non-negativity of these three squares via `sq_nonneg`, the nonlinear arithmetic tactic `nlinarith` verifies that the lower bound of -3 is satisfied.

    line 11

    uses sq_nonneg

      · nlinarith [sq_nonneg (1 - t), sq_nonneg (1 - u), sq_nonneg (t - u)]
  3. The second condition holds: the modified discriminant expression is non-negative for all real t and u, completing the proof.

    We first establish an auxiliary algebraic identity `hfactor` showing that the degree-6 modified discriminant expression factors as (t - u)² · ((1 - t)²(1 - u)² + 3(1 - t)² + 3(1 - u)² + ((1 - t) + (1 - u))² + 9), which is verified by expanding both sides using `ring`. Rewriting the goal using this identity (`rw [hfactor]`), the expression is visibly non-negative as a product of (t - u)² ≥ 0 and a sum of non-negative squares plus the strictly positive constant 9. The `positivity` tactic verifies these sign conditions to close the final goal.

    lines 12–24

      · have hfactor :
            (t + u + 4) ^ 2 * (t * u + 3 * t + 3 * u + 6) ^ 2 -
            4 * (t * u + 3 * t + 3 * u + 6) ^ 3 -
            4 * (t + u + 4) ^ 3 * (2 * t * u + 2 * t + 2 * u + 4) -
            27 * (2 * t * u + 2 * t + 2 * u + 4) ^ 2 +
            18 * (t + u + 4) * (t * u + 3 * t + 3 * u + 6) *
              (2 * t * u + 2 * t + 2 * u + 4) +
            4 * ((t + u + 4) ^ 2 - 3 * (t * u + 3 * t + 3 * u + 6) + 4) ^ 2 =
            (t - u) ^ 2 * ((1 - t) ^ 2 * (1 - u) ^ 2 +
              3 * (1 - t) ^ 2 + 3 * (1 - u) ^ 2 + ((1 - t) + (1 - u)) ^ 2 + 9) := by
          ring
        rw [hfactor]
        positivity
real_cubic_im_le_of_discriminant_bound
For any monic real cubic polynomial z³ - az² + bz - c = 0, every complex root z satisfies |Im(z)| ≤ 1 provided that -3 ≤ a² - 3b and 0 ≤ Δ + 4(a² - 3b + 4)², where Δ = a²b² - 4b³ - 4a³c - 27c² + 18abc is the cubic discriminant.
sq_nonneg
The square of any element in a linearly ordered semiring (in particular, any real number) is non-negative: a² ≥ 0.

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

set_option maxHeartbeats 1500000theorem two_adjacent_chord_cubic_im_le (t u : ℝ) (z : ℂ)    (hz : z ^ 3 - ((t + u + 4 : ℝ) : ℂ) * z ^ 2 +      ((t * u + 3 * t + 3 * u + 6 : ℝ) : ℂ) * z -      ((2 * t * u + 2 * t + 2 * u + 4 : ℝ) : ℂ) = 0) :    |z.im| ≤ 1 := by  apply real_cubic_im_le_of_discriminant_bound    (t + u + 4) (t * u + 3 * t + 3 * u + 6)    (2 * t * u + 2 * t + 2 * u + 4) z hz  · nlinarith [sq_nonneg (1 - t), sq_nonneg (1 - u), sq_nonneg (t - u)]  · have hfactor :        (t + u + 4) ^ 2 * (t * u + 3 * t + 3 * u + 6) ^ 2 -        4 * (t * u + 3 * t + 3 * u + 6) ^ 3 -        4 * (t + u + 4) ^ 3 * (2 * t * u + 2 * t + 2 * u + 4) -        27 * (2 * t * u + 2 * t + 2 * u + 4) ^ 2 +        18 * (t + u + 4) * (t * u + 3 * t + 3 * u + 6) *          (2 * t * u + 2 * t + 2 * u + 4) +        4 * ((t + u + 4) ^ 2 - 3 * (t * u + 3 * t + 3 * u + 6) + 4) ^ 2 =        (t - u) ^ 2 * ((1 - t) ^ 2 * (1 - u) ^ 2 +          3 * (1 - t) ^ 2 + 3 * (1 - u) ^ 2 + ((1 - t) + (1 - u)) ^ 2 + 9) := by      ring    rw [hfactor]    positivity
See it in the graphDiscuss this resultChallenge it