AFTD Auto-Formalizing Theoretical Domains

cube_roots_of_unity_diff_prod

theoremverified

For any pairwise distinct complex cube roots of unity z, x, y, (z - x) * (z - y) = 3 * z^2.

Statement

theorem cube_roots_of_unity_diff_prod (z x y : ℂ)
    (hz : z ^ 3 = 1) (hx : x ^ 3 = 1) (hy : y ^ 3 = 1)
    (hzx : z ≠ x) (hzy : z ≠ y) (hxy : x ≠ y) :
    (z - x) * (z - y) = 3 * z ^ 2
Source
arXiv:2610.41820 Eq (17)
Verified
04 Nov 2026
Axioms
Classical.choiceQuot.soundpropext

Read back from the Lean

For all complex numbers $z, x, y \in \mathbb{C}$, if $z^3 = 1$, $x^3 = 1$, $y^3 = 1$, $z \neq x$, $z \neq y$, and $x \neq y$, then $(z - x)(z - y) = 3 z^2$.

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 exploits the difference-of-cubes factorization for distinct roots of unity. Factoring $x^3 - z^3 = 0$ and $y^3 - z^3 = 0$ while canceling the non-zero differences $(x - z)$ and $(y - z)$ shows that both $x$ and $y$ satisfy the quadratic relation $t^2 + t z + z^2 = 0$. Subtracting these two relations and canceling the non-zero factor $(x - y)$ proves that the sum of all three roots vanishes, $x + y + z = 0$. Finally, the polynomial identity $(z - x)(z - y) - 3 z^2 = (x - z)(x + y + z) - (x^2 + x z + z^2)$ equates the product of differences to $3 z^2$.

  1. $x^2 + x z + z^2 = 0$

    Factoring the difference of cubes gives $(x - z)(x^2 + x z + z^2) = x^3 - z^3$. Since both $x$ and $z$ are cube roots of unity ($x^3 = 1$ and $z^3 = 1$), the right-hand side is $1 - 1 = 0$. Because $z \neq x$, the difference $x - z$ is non-zero. Since a product is zero only if a factor is zero, the second factor must vanish, giving $x^2 + x z + z^2 = 0$.

    lines 6–11

    uses mul_eq_zero.mp, resolve_left, sub_ne_zero.mpr, Ne.symm

      have hx2 : x ^ 2 + x * z + z ^ 2 = 0 := by
        have h : (x - z) * (x ^ 2 + x * z + z ^ 2) = 0 := by
          calc (x - z) * (x ^ 2 + x * z + z ^ 2) = x ^ 3 - z ^ 3 := by ring
          _ = 1 - 1 := by rw [hx, hz]
          _ = 0 := by ring
        exact (mul_eq_zero.mp h).resolve_left (sub_ne_zero.mpr (Ne.symm hzx))
  2. $y^2 + y z + z^2 = 0$

    Applying the same difference-of-cubes factorization to $y$ and $z$ gives $(y - z)(y^2 + y z + z^2) = y^3 - z^3 = 1 - 1 = 0$. Since $z \neq y$, the difference $y - z$ is non-zero, which forces $y^2 + y z + z^2 = 0$.

    lines 12–17

    uses mul_eq_zero.mp, resolve_left, sub_ne_zero.mpr, Ne.symm

      have hy2 : y ^ 2 + y * z + z ^ 2 = 0 := by
        have h : (y - z) * (y ^ 2 + y * z + z ^ 2) = 0 := by
          calc (y - z) * (y ^ 2 + y * z + z ^ 2) = y ^ 3 - z ^ 3 := by ring
          _ = 1 - 1 := by rw [hy, hz]
          _ = 0 := by ring
        exact (mul_eq_zero.mp h).resolve_left (sub_ne_zero.mpr (Ne.symm hzy))
  3. $x + y + z = 0$

    Subtracting the two quadratic relations yields $(x^2 + x z + z^2) - (y^2 + y z + z^2) = 0 - 0 = 0$. Factoring this difference gives $(x - y)(x + y + z) = 0$. Since $x \neq y$, the factor $x - y$ is non-zero, implying that the sum of the three roots is zero: $x + y + z = 0$.

    lines 18–23

    uses mul_eq_zero.mp, resolve_left, sub_ne_zero.mpr

      have hxyz : x + y + z = 0 := by
        have h : (x - y) * (x + y + z) = 0 := by
          calc (x - y) * (x + y + z) = (x ^ 2 + x * z + z ^ 2) - (y ^ 2 + y * z + z ^ 2) := by ring
          _ = 0 - 0 := by rw [hx2, hy2]
          _ = 0 := by ring
        exact (mul_eq_zero.mp h).resolve_left (sub_ne_zero.mpr hxy)
  4. $(z - x)(z - y) = 3 z^2$

    The target expression $(z - x)(z - y) - 3 z^2$ expands to the polynomial combination $(x - z)(x + y + z) - (x^2 + x z + z^2)$. Because both $x + y + z = 0$ and $x^2 + x z + z^2 = 0$, this combination is zero, which establishes $(z - x)(z - y) = 3 z^2$.

    line 24

      linear_combination (x - z) * hxyz - hx2
mul_eq_zero.mp
If a product of two numbers is zero, then at least one factor is zero: $a \cdot b = 0 \implies a = 0 \lor b = 0$.
Ne.symm
Inequality is symmetric: if $a \neq b$, then $b \neq a$.
resolve_left
If at least one of two statements holds and the first is false, then the second holds: $a \lor b \implies \neg a \implies b$.
sub_ne_zero.mpr
If two elements are unequal, their difference is non-zero: $a \neq b \implies a - b \neq 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

/-- Product of differences of a cube root of unity with the other two distinct cube roots equals three times its square. -/theorem cube_roots_of_unity_diff_prod (z x y : ℂ)    (hz : z ^ 3 = 1) (hx : x ^ 3 = 1) (hy : y ^ 3 = 1)    (hzx : z ≠ x) (hzy : z ≠ y) (hxy : x ≠ y) :    (z - x) * (z - y) = 3 * z ^ 2 := by  have hx2 : x ^ 2 + x * z + z ^ 2 = 0 := by    have h : (x - z) * (x ^ 2 + x * z + z ^ 2) = 0 := by      calc (x - z) * (x ^ 2 + x * z + z ^ 2) = x ^ 3 - z ^ 3 := by ring      _ = 1 - 1 := by rw [hx, hz]      _ = 0 := by ring    exact (mul_eq_zero.mp h).resolve_left (sub_ne_zero.mpr (Ne.symm hzx))  have hy2 : y ^ 2 + y * z + z ^ 2 = 0 := by    have h : (y - z) * (y ^ 2 + y * z + z ^ 2) = 0 := by      calc (y - z) * (y ^ 2 + y * z + z ^ 2) = y ^ 3 - z ^ 3 := by ring      _ = 1 - 1 := by rw [hy, hz]      _ = 0 := by ring    exact (mul_eq_zero.mp h).resolve_left (sub_ne_zero.mpr (Ne.symm hzy))  have hxyz : x + y + z = 0 := by    have h : (x - y) * (x + y + z) = 0 := by      calc (x - y) * (x + y + z) = (x ^ 2 + x * z + z ^ 2) - (y ^ 2 + y * z + z ^ 2) := by ring      _ = 0 - 0 := by rw [hx2, hy2]      _ = 0 := by ring    exact (mul_eq_zero.mp h).resolve_left (sub_ne_zero.mpr hxy)  linear_combination (x - z) * hxyz - hx2
See it in the graphDiscuss this resultChallenge it