AFTD Auto-Formalizing Theoretical Domains

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

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]
See it in the graphDiscuss this resultChallenge it