three_val_poly_eval_zero_ne_zero
In any field $K$, if $a, b, c \in K$ are non-zero, then $(0 - a) * (0 - b) * (0 - c) \neq 0$.
Statement
theorem three_val_poly_eval_zero_ne_zero {K : Type*} [Field K] (a b c : K) (ha : a ≠ 0) (hb : b ≠ 0) (hc : c ≠ 0) : (0 - a) * (0 - b) * (0 - c) ≠ 0
- Source
- arXiv:2610.39908, Proposition A.1 proof, Low-rank matrices with three prescribed off-diagonal values over F_p
- Verified
- 03 Nov 2026
- Axioms
Classical.choiceQuot.soundpropext
Read back from the Lean
For any field $K$ and any elements $a, b, c \in K$, if $a \neq 0$, $b \neq 0$, and $c \neq 0$, then $(0 - a) * (0 - b) * (0 - c) \neq 0$.
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
Evaluating the polynomial at 0 yields the product $(0 - a) * (0 - b) * (0 - c)$, which simplifies to $(-a) * (-b) * (-c)$. Because $a, b, c$ are non-zero, their negations are also non-zero, and because a field has no zero divisors, the product of these non-zero elements is non-zero.
The goal simplifies to showing that $(-a) * (-b) * (-c) \neq 0$.
Each factor of the form $0 - x$ is rewritten to its negation $-x$ using the identity $0 - x = -x$ (`zero_sub`).
uses
zero_subsimp only [zero_sub]The product $(-a) * (-b) * (-c)$ is non-zero.
Since $a, b, c \neq 0$ by hypotheses `ha`, `hb`, and `hc`, their negations $-a$, $-b$, and $-c$ are non-zero by `neg_ne_zero.mpr`. In a field, which has no zero divisors, the product of non-zero elements is non-zero; applying `mul_ne_zero` first to $(-a) * (-b)$ and then to the full product completes the proof.
uses
mul_ne_zero,neg_ne_zero.mprexact mul_ne_zero (mul_ne_zero (neg_ne_zero.mpr ha) (neg_ne_zero.mpr hb)) (neg_ne_zero.mpr hc)
zero_sub- Subtracting an element from zero yields its negation: $0 - x = -x$.
mul_ne_zero- In a type with no zero divisors, the product of two non-zero elements is non-zero.
neg_ne_zero.mpr- If an element is non-zero, its negation 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
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 polynomial (X - a)(X - b)(X - c) evaluated at 0 is non-zero when a, b, c are all non-zero. -/theorem three_val_poly_eval_zero_ne_zero {K : Type*} [Field K] (a b c : K) (ha : a ≠ 0) (hb : b ≠ 0) (hc : c ≠ 0) : (0 - a) * (0 - b) * (0 - c) ≠ 0 := by simp only [zero_sub] exact mul_ne_zero (mul_ne_zero (neg_ne_zero.mpr ha) (neg_ne_zero.mpr hb)) (neg_ne_zero.mpr hc)