AFTD Auto-Formalizing Theoretical Domains

cube_root_four_cycle_identity

theoremverifiedformalization

If ω is a primitive cube root of unity in ℂ and a, b, c, d ∈ {1, ω, ω^2} satisfy a ≠ b, b ≠ c, c ≠ d, and d ≠ a, then (a - b)(b - c)(c - d) = 3bc(a - d).

Statement

theorem cube_root_four_cycle_identity (ω a b c d : ℂ) (hω : ω ^ 2 + ω + 1 = 0)
    (ha : a ∈ ({1, ω, ω ^ 2} : Set ℂ)) (hb : b ∈ ({1, ω, ω ^ 2} : Set ℂ))
    (hc : c ∈ ({1, ω, ω ^ 2} : Set ℂ)) (hd : d ∈ ({1, ω, ω ^ 2} : Set ℂ))
    (hab : a ≠ b) (hbc : b ≠ c) (hcd : c ≠ d) (hda : d ≠ a) :
    (a - b) * (b - c) * (c - d) = 3 * b * c * (a - d)
Formalizes
arXiv:2610.41820 Lemma 2.4, Eq. (16)
Verified
04 Nov 2026
Axioms
Classical.choiceQuot.soundpropext

Read back from the Lean

For all complex numbers $\omega, a, b, c, d \in \mathbb{C}$, if $\omega^2 + \omega + 1 = 0$, $a, b, c, d \in \{1, \omega, \omega^2\}$, $a \ne b$, $b \ne c$, $c \ne d$, and $d \ne a$, then $(a - b)(b - c)(c - d) = 3bc(a - d)$.

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 proof establishes the cyclic difference identity by first showing that any element of {1, ω, ω²} has cube 1, which implies that any two distinct elements x, y ∈ {1, ω, ω²} satisfy x² + xy + y² = (x³ - y³) / (x - y) = 0. Applying this to each adjacent pair (a, b), (b, c), (c, d), and (d, a) yields four vanishing quadratic expressions. The target identity then follows because the difference (a - b)(b - c)(c - d) - 3bc(a - d) can be expressed as an explicit linear combination of these four vanishing expressions.

  1. Every element x ∈ {1, ω, ω²} satisfies x³ = 1.

    Membership in {1, ω, ω²} simplifies to x = 1, x = ω, or x = ω². When x = 1, 1³ = 1 trivially. When x = ω, ω³ - 1 = (ω - 1)(ω² + ω + 1) = 0 using the hypothesis ω² + ω + 1 = 0. When x = ω², (ω²)³ - 1 = (ω³ + 1)(ω - 1)(ω² + ω + 1) = 0 similarly.

    lines 7–13

    uses Set.mem_insert_iff, Set.mem_singleton_iff

      have hcube : ∀ x ∈ ({1, ω, ω ^ 2} : Set ℂ), x ^ 3 = 1 := by
        intro x hx
        simp only [Set.mem_insert_iff, Set.mem_singleton_iff] at hx
        rcases hx with hx | hx | hx
        · rw [hx]; ring
        · rw [hx]; linear_combination (ω - 1) * hω
        · rw [hx]; linear_combination (ω - 1) * (ω ^ 3 + 1) * hω
  2. Any two distinct elements x, y ∈ {1, ω, ω²} satisfy x² + xy + y² = 0.

    Since x³ = 1 and y³ = 1, the product (x - y)(x² + xy + y²) equals x³ - y³ = 1 - 1 = 0. Because x ≠ y, the factor x - y is non-zero, which forces x² + xy + y² = 0.

    lines 14–23

    uses mul_eq_zero.mp, sub_ne_zero.mpr

      have hpair : ∀ x y : ℂ, x ∈ ({1, ω, ω ^ 2} : Set ℂ) →
          y ∈ ({1, ω, ω ^ 2} : Set ℂ) → x ≠ y → x ^ 2 + x * y + y ^ 2 = 0 := by
        intro x y hx hy hxy
        have hx3 : x ^ 3 = 1 := hcube x hx
        have hy3 : y ^ 3 = 1 := hcube y hy
        have hfac : (x - y) * (x ^ 2 + x * y + y ^ 2) = 0 := by
          calc
            (x - y) * (x ^ 2 + x * y + y ^ 2) = x ^ 3 - y ^ 3 := by ring
            _ = 0 := by rw [hx3, hy3]; ring
        exact (mul_eq_zero.mp hfac).resolve_left (sub_ne_zero.mpr hxy)
  3. The four quadratic relations a² + ab + b² = 0, b² + bc + c² = 0, c² + cd + d² = 0, and d² + da + a² = 0 all hold.

    Each consecutive pair in the cycle (a, b), (b, c), (c, d), and (d, a) consists of distinct elements of {1, ω, ω²}, so the pair relation applies to each of them.

    lines 24–27

      have h1 : a ^ 2 + a * b + b ^ 2 = 0 := hpair a b ha hb hab
      have h2 : b ^ 2 + b * c + c ^ 2 = 0 := hpair b c hb hc hbc
      have h3 : c ^ 2 + c * d + d ^ 2 = 0 := hpair c d hc hd hcd
      have h4 : d ^ 2 + d * a + a ^ 2 = 0 := hpair d a hd ha hda
  4. (a - b)(b - c)(c - d) = 3bc(a - d).

    The polynomial difference (a - b)(b - c)(c - d) - 3bc(a - d) is verified to equal (a + b + d)(a² + ab + b²) - (2a + b)(b² + bc + c²) + (a + 2b)(c² + cd + d²) - (a + 2b)(d² + da + a²). Since all four quadratic factors vanish, the difference is zero.

    lines 28–29

      linear_combination (a + b + d) * h1 + (-2 * a - b) * h2 +
        (a + 2 * b) * h3 + (-a - 2 * b) * h4
Set.mem_insert_iff
An element belongs to {a} ∪ s if and only if it equals a or belongs to s.
Set.mem_singleton_iff
An element belongs to the singleton {b} if and only if it equals b.
mul_eq_zero.mp
If a product is zero, then at least one of the factors is zero.
sub_ne_zero.mpr
If two elements are distinct, their difference is non-zero.

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

/-- Cyclic difference identity for four elements in the cube roots of unity. -/theorem cube_root_four_cycle_identity (ω a b c d : ℂ) (hω : ω ^ 2 + ω + 1 = 0)    (ha : a ∈ ({1, ω, ω ^ 2} : Set ℂ)) (hb : b ∈ ({1, ω, ω ^ 2} : Set ℂ))    (hc : c ∈ ({1, ω, ω ^ 2} : Set ℂ)) (hd : d ∈ ({1, ω, ω ^ 2} : Set ℂ))    (hab : a ≠ b) (hbc : b ≠ c) (hcd : c ≠ d) (hda : d ≠ a) :    (a - b) * (b - c) * (c - d) = 3 * b * c * (a - d) := by  have hcube : ∀ x ∈ ({1, ω, ω ^ 2} : Set ℂ), x ^ 3 = 1 := by    intro x hx    simp only [Set.mem_insert_iff, Set.mem_singleton_iff] at hx    rcases hx with hx | hx | hx    · rw [hx]; ring    · rw [hx]; linear_combination (ω - 1) * hω    · rw [hx]; linear_combination (ω - 1) * (ω ^ 3 + 1) * hω  have hpair : ∀ x y : ℂ, x ∈ ({1, ω, ω ^ 2} : Set ℂ) →      y ∈ ({1, ω, ω ^ 2} : Set ℂ) → x ≠ y → x ^ 2 + x * y + y ^ 2 = 0 := by    intro x y hx hy hxy    have hx3 : x ^ 3 = 1 := hcube x hx    have hy3 : y ^ 3 = 1 := hcube y hy    have hfac : (x - y) * (x ^ 2 + x * y + y ^ 2) = 0 := by      calc        (x - y) * (x ^ 2 + x * y + y ^ 2) = x ^ 3 - y ^ 3 := by ring        _ = 0 := by rw [hx3, hy3]; ring    exact (mul_eq_zero.mp hfac).resolve_left (sub_ne_zero.mpr hxy)  have h1 : a ^ 2 + a * b + b ^ 2 = 0 := hpair a b ha hb hab  have h2 : b ^ 2 + b * c + c ^ 2 = 0 := hpair b c hb hc hbc  have h3 : c ^ 2 + c * d + d ^ 2 = 0 := hpair c d hc hd hcd  have h4 : d ^ 2 + d * a + a ^ 2 = 0 := hpair d a hd ha hda  linear_combination (a + b + d) * h1 + (-2 * a - b) * h2 +    (a + 2 * b) * h3 + (-a - 2 * b) * h4
See it in the graphDiscuss this resultChallenge it