is_intersective_mul_right
If $g \in \mathbb{Z}[X]$ is intersective, then $g \cdot h$ is intersective for any $h \in \mathbb{Z}[X]$.
Statement
theorem is_intersective_mul_right (g h : Polynomial ℤ) (hg : is_intersective g) :
is_intersective (g * h)- Source
- step towards op_153_subexp_bound_intersective_quadratic
- Verified
- 20 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 2
- is_intersectiveAn integer polynomial $h \in \mathbb{Z}[X]$ is intersective if for every positive integer $m$, there exists an integer $n$ such that…
- is_intersective_mul_leftFor any polynomials g, h ∈ ℤ[X], if h is intersective then g * h is intersective.
The proof, explained
The proof reduces right-multiplication by an intersective polynomial to left-multiplication using commutativity. Since multiplication in ℤ[X] is commutative, g · h = h · g. The claim then follows immediately from the companion lemma `is_intersective_mul_left`, which shows that any left multiple of an intersective polynomial is intersective.
It suffices to show that h · g is intersective.
By the commutativity of polynomial multiplication (`mul_comm`), the product g · h is equal to h · g. Rewriting the goal replaces the target is_intersective (g · h) with is_intersective (h · g).
uses
mul_commrw [mul_comm]The product h · g is intersective, completing the proof.
By `is_intersective_mul_left`, multiplying an intersective polynomial on the left by any polynomial yields an intersective polynomial. Applying this lemma to h and g using the hypothesis `hg` that g is intersective proves that h · g is intersective.
uses
is_intersective_mul_leftexact is_intersective_mul_left h g hg
mul_comm- Multiplication is commutative: for any elements a and b, a * b = b * a.
is_intersective_mul_left- If h is an intersective polynomial with integer coefficients, then for any polynomial g with integer coefficients, the product g * h is also intersective.
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.
/-- If g ∈ ℤ[X] is intersective, then g * h is intersective for any polynomial h. -/theorem is_intersective_mul_right (g h : Polynomial ℤ) (hg : is_intersective g) : is_intersective (g * h) := by rw [mul_comm] exact is_intersective_mul_left h g hg