AFTD Auto-Formalizing Theoretical Domains

cube_roots_of_unity_cyclic_prod

theoremverified

For any complex cube roots of unity a, b, c, d such that adjacent elements are distinct and either a = c or b = d, (a - b) * (b - c) * (c - d) = 3 * b * c * (a - d).

Statement

theorem cube_roots_of_unity_cyclic_prod (a b c d : ℂ)
    (ha : a ^ 3 = 1) (hb : b ^ 3 = 1) (hc : c ^ 3 = 1) (hd : d ^ 3 = 1)
    (hab : a ≠ b) (hbc : b ≠ c) (hcd : c ≠ d) (hda : d ≠ a)
    (h_cases : a = c ∨ b = d) :
    (a - b) * (b - c) * (c - d) = 3 * b * c * (a - d)
Source
arXiv:2610.41820 Lemma 2.4(b)
Verified
04 Nov 2026
Axioms
Classical.choiceQuot.soundpropext

Read back from the Lean

For all complex numbers $a, b, c, d \in \mathbb{C}$, if: 1. $a^3 = 1$, 2. $b^3 = 1$, 3. $c^3 = 1$, 4. $d^3 = 1$, 5. $a \neq b$, 6. $b \neq c$, 7. $c \neq d$, 8. $d \neq a$, and 9. $a = c$ or $b = d$, 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 first establishes an identity for any two distinct complex cube roots of unity x and y: factoring x^3 - y^3 = (x - y)(x^2 + xy + y^2) = 0 implies x^2 + xy + y^2 = 0 since x ≠ y, from which (x - y)(y - x) = 3xy follows by ring expansion. The main theorem then proceeds by case analysis on whether a = c or b = d. When a = c, substituting c = a groups the product as (a - b)(b - a)(a - d) = 3ab(a - d) = 3bc(a - d); symmetrically, when b = d, substituting d = b groups the product as (a - b)(b - c)(c - b) = (a - b)(3bc) = 3bc(a - d).

  1. (x - y) * (x ^ 2 + x * y + y ^ 2) = 0

    By the difference of cubes identity, x^3 - y^3 factors as (x - y) * (x^2 + x * y + y^2). Since x^3 = 1 and y^3 = 1, their difference is 1 - 1 = 0, so the product equals 0.

    lines 4–8

      have hfac : (x - y) * (x ^ 2 + x * y + y ^ 2) = 0 := by
        have h : x ^ 3 - y ^ 3 = (x - y) * (x ^ 2 + x * y + y ^ 2) := by ring
        rw [← h]
        rw [hx, hy]
        ring
  2. x ^ 2 + x * y + y ^ 2 = 0

    Since the product (x - y) * (x^2 + x * y + y^2) is zero, at least one factor must be zero (mul_eq_zero.mp). If x - y = 0, then x = y (sub_eq_zero.mp), contradicting the hypothesis x ≠ y (False.elim). Thus, the second factor x^2 + x * y + y^2 must be zero.

    lines 9–12

    uses mul_eq_zero.mp, sub_eq_zero.mp, False.elim

      have hsum : x ^ 2 + x * y + y ^ 2 = 0 := by
        rcases mul_eq_zero.mp hfac with h | h
        · exact False.elim (hxy (sub_eq_zero.mp h))
        · exact h
  3. (x - y) * (y - x) = 3 * x * y

    Expanding (x - y) * (y - x) - 3 * x * y algebraically simplifies to -(x^2 + x * y + y^2). Since x^2 + x * y + y^2 = 0, this difference is 0. It follows that (x - y) * (y - x) = 3 * x * y (sub_eq_zero.mp).

    lines 13–17

    uses sub_eq_zero.mp

      have h2 : (x - y) * (y - x) - 3 * x * y = 0 := by
        calc
          (x - y) * (y - x) - 3 * x * y = -(x ^ 2 + x * y + y ^ 2) := by ring
          _ = 0 := by rw [hsum]; ring
      exact sub_eq_zero.mp h2
  4. In the case a = c, (a - b) * (b - c) * (c - d) = 3 * b * c * (a - d)

    We split into cases on the hypothesis a = c ∨ b = d (rcases). In the first case where a = c, substituting c = a reduces the cyclic product to (a - b) * (b - a) * (a - d). By the adjacent lemma cube_roots_of_unity_cyclic_prod_adjacent applied to a and b, the first two factors equal 3 * a * b. Rearranging factors gives 3 * b * a * (a - d), which equals 3 * b * c * (a - d) since a = c.

    lines 25–32

    uses cube_roots_of_unity_cyclic_prod_adjacent

      rcases h_cases with hac | hbd
      · subst c
        have h : (a - b) * (b - a) = 3 * a * b :=
          cube_roots_of_unity_cyclic_prod_adjacent a b ha hb hab
        calc
          (a - b) * (b - a) * (a - d) = ((a - b) * (b - a)) * (a - d) := by ring
          _ = (3 * a * b) * (a - d) := by rw [h]
          _ = 3 * b * a * (a - d) := by ring
  5. In the case b = d, (a - b) * (b - c) * (c - d) = 3 * b * c * (a - d)

    In the second case where b = d, substituting d = b reduces the cyclic product to (a - b) * (b - c) * (c - b). Applying cube_roots_of_unity_cyclic_prod_adjacent to b and c simplifies (b - c) * (c - b) to 3 * b * c. Rearranging factors gives 3 * b * c * (a - b), which equals 3 * b * c * (a - d) since b = d.

    lines 33–39

    uses cube_roots_of_unity_cyclic_prod_adjacent

      · subst d
        have h : (b - c) * (c - b) = 3 * b * c :=
          cube_roots_of_unity_cyclic_prod_adjacent b c hb hc hbc
        calc
          (a - b) * (b - c) * (c - b) = (a - b) * ((b - c) * (c - b)) := by ring
          _ = (a - b) * (3 * b * c) := by rw [h]
          _ = 3 * b * c * (a - b) := by ring
False.elim
from False, any proposition follows (the principle of explosion)
cube_roots_of_unity_cyclic_prod_adjacent
for any two distinct complex cube roots of unity x and y, (x - y) * (y - x) = 3 * x * y
mul_eq_zero.mp
if a product of two elements is zero, then at least one factor is zero
sub_eq_zero.mp
if the difference x - y = 0, then x = y

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

private theorem cube_roots_of_unity_cyclic_prod_adjacent (x y : ℂ)    (hx : x ^ 3 = 1) (hy : y ^ 3 = 1) (hxy : x ≠ y) :    (x - y) * (y - x) = 3 * x * y := by  have hfac : (x - y) * (x ^ 2 + x * y + y ^ 2) = 0 := by    have h : x ^ 3 - y ^ 3 = (x - y) * (x ^ 2 + x * y + y ^ 2) := by ring    rw [← h]    rw [hx, hy]    ring  have hsum : x ^ 2 + x * y + y ^ 2 = 0 := by    rcases mul_eq_zero.mp hfac with h | h    · exact False.elim (hxy (sub_eq_zero.mp h))    · exact h  have h2 : (x - y) * (y - x) - 3 * x * y = 0 := by    calc      (x - y) * (y - x) - 3 * x * y = -(x ^ 2 + x * y + y ^ 2) := by ring      _ = 0 := by rw [hsum]; ring  exact sub_eq_zero.mp h2/-- Cyclic product of differences of four cube roots of unity with matching opposite elements. -/theorem cube_roots_of_unity_cyclic_prod (a b c d : ℂ)    (ha : a ^ 3 = 1) (hb : b ^ 3 = 1) (hc : c ^ 3 = 1) (hd : d ^ 3 = 1)    (hab : a ≠ b) (hbc : b ≠ c) (hcd : c ≠ d) (hda : d ≠ a)    (h_cases : a = c ∨ b = d) :    (a - b) * (b - c) * (c - d) = 3 * b * c * (a - d) := by  rcases h_cases with hac | hbd  · subst c    have h : (a - b) * (b - a) = 3 * a * b :=      cube_roots_of_unity_cyclic_prod_adjacent a b ha hb hab    calc      (a - b) * (b - a) * (a - d) = ((a - b) * (b - a)) * (a - d) := by ring      _ = (3 * a * b) * (a - d) := by rw [h]      _ = 3 * b * a * (a - d) := by ring  · subst d    have h : (b - c) * (c - b) = 3 * b * c :=      cube_roots_of_unity_cyclic_prod_adjacent b c hb hc hbc    calc      (a - b) * (b - c) * (c - b) = (a - b) * ((b - c) * (c - b)) := by ring      _ = (a - b) * (3 * b * c) := by rw [h]      _ = 3 * b * c * (a - b) := by ring
See it in the graphDiscuss this resultChallenge it