is_intersective
def
An integer polynomial $h \in \mathbb{Z}[X]$ is intersective if for every positive integer $m$, there exists an integer $n$ such that $h(n) \equiv 0 \pmod m$.
Statement
def is_intersective (h : Polynomial ℤ) : Prop
- Defined in
- arXiv:2610.07765, Sec. 1, line 244
- Verified
- 18 Oct 2026
- Axioms
- none listed
- Used by 7
- is_intersective_of_rootEvery integer polynomial with an integer root has a root modulo every positive integer m.
- is_intersective_mul_rightIf $g \in \mathbb{Z}[X]$ is intersective, then $g \cdot h$ is intersective for any $h \in \mathbb{Z}[X]$.
- is_intersective_mul_leftFor any polynomials g, h ∈ ℤ[X], if h is intersective then g * h is intersective.
- op_153_intersective_quadratic_normalize_positiveIf the eventual subexponential difference bound holds for every degree-2 intersective integer polynomial that is strictly positive on all…
- is_intersective_comp_X_add_CIf $h \in \mathbb{Z}[X]$ is intersective, then the translated polynomial $h(X + c)$ is also intersective for any integer $c$.
- is_intersective_exists_evenEvery intersective polynomial $h \in \mathbb{Z}[X]$ takes an even value at some positive natural number $n > 0$.
- is_intersective_exists_posIf h ∈ ℤ[X] is intersective and m is a positive integer, there exists a positive integer n > 0 such that h(n) ≡ 0 (mod m).
Read back from the Lean
For a polynomial $h$ with integer coefficients, is_intersective h asserts that for every natural number $m$ strictly greater than $0$, there exists an integer $n$ such that $h(n) \equiv 0 \pmod m$ (the evaluation of $h$ at $n$ is congruent to $0$ modulo $m$).
Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.
Lean source view module on GitHub
/-- A polynomial h ∈ ℤ[X] is intersective if it has a root modulo every positive integer m. -/ def is_intersective (h : Polynomial ℤ) : Prop := ∀ m : ℕ, 0 < m → ∃ n : ℤ, h.eval n ≡ 0 [ZMOD m]