cube_roots_of_unity_sub_sq
For any two distinct complex cube roots of unity x and y, (x - y)^2 = -3 * x * y.
Statement
theorem cube_roots_of_unity_sub_sq (x y : ℂ) (hx : x ^ 3 = 1) (hy : y ^ 3 = 1) (hxy : x ≠ y) :
(x - y) ^ 2 = -3 * x * y- Source
- arXiv:2610.41820 Lemma 2.4(a)
- Verified
- 04 Nov 2026
- Axioms
Classical.choiceQuot.soundpropext
Read back from the Lean
For any two complex numbers $x$ and $y$, if $x^3 = 1$, $y^3 = 1$, and $x \neq y$, then $(x - y)^2 = -3xy$.
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 factors the difference of cubes x^3 - y^3 into (x - y)(x^2 + xy + y^2), which vanishes because x^3 = y^3 = 1. Since x and y are distinct, x - y is non-zero, forcing x^2 + xy + y^2 = 0. The result follows by rewriting (x - y)^2 as (x^2 + xy + y^2) - 3xy and substituting zero for the first term.
(x - y) * (x ^ 2 + x * y + y ^ 2) = 0
By expanding the difference of cubes, (x - y) * (x ^ 2 + x * y + y ^ 2) equals x ^ 3 - y ^ 3. Since x and y are both cube roots of unity (x ^ 3 = 1 and y ^ 3 = 1), this difference is 1 - 1, which equals 0 by sub_self.
uses
sub_selfhave hfac : (x - y) * (x ^ 2 + x * y + y ^ 2) = 0 := by rw [show (x - y) * (x ^ 2 + x * y + y ^ 2) = x ^ 3 - y ^ 3 by ring, hx, hy, sub_self]
x ^ 2 + x * y + y ^ 2 = 0
The product (x - y) * (x ^ 2 + x * y + y ^ 2) is zero, so by mul_eq_zero.mp, either x - y = 0 or x ^ 2 + x * y + y ^ 2 = 0. Because x ≠ y, sub_ne_zero.mpr ensures x - y ≠ 0, leaving x ^ 2 + x * y + y ^ 2 = 0.
uses
mul_eq_zero.mp,sub_ne_zero.mprhave hsum : x ^ 2 + x * y + y ^ 2 = 0 := by exact (mul_eq_zero.mp hfac).resolve_left (sub_ne_zero.mpr hxy)
(x - y) ^ 2 = -3 * x * y
Algebraically, the square (x - y) ^ 2 can be rewritten as (x ^ 2 + x * y + y ^ 2) - 3 * x * y. Substituting x ^ 2 + x * y + y ^ 2 = 0 reduces this to 0 - 3 * x * y, which simplifies directly to -3 * x * y.
rw [show (x - y) ^ 2 = (x ^ 2 + x * y + y ^ 2) - 3 * x * y by ring, hsum] ring
sub_self- In an additive group, subtracting an element from itself yields zero: a - a = 0.
mul_eq_zero.mp- If the product of two elements is zero, then at least one of the factors is zero: a * b = 0 implies a = 0 or b = 0.
sub_ne_zero.mpr- If two elements are unequal, their difference is non-zero: a ≠ b implies a - b ≠ 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
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
/-- The square of the difference of two distinct complex cube roots of unity equals minus three times their product. -/theorem cube_roots_of_unity_sub_sq (x y : ℂ) (hx : x ^ 3 = 1) (hy : y ^ 3 = 1) (hxy : x ≠ y) : (x - y) ^ 2 = -3 * x * y := by have hfac : (x - y) * (x ^ 2 + x * y + y ^ 2) = 0 := by rw [show (x - y) * (x ^ 2 + x * y + y ^ 2) = x ^ 3 - y ^ 3 by ring, hx, hy, sub_self] have hsum : x ^ 2 + x * y + y ^ 2 = 0 := by exact (mul_eq_zero.mp hfac).resolve_left (sub_ne_zero.mpr hxy) rw [show (x - y) ^ 2 = (x ^ 2 + x * y + y ^ 2) - 3 * x * y by ring, hsum] ring