Homomorphism ,
ProvedGNFS.exists_ringHom_adjoin_zmodalgebraic-number-theoryinteger-factorizationnumber-theory
Let be irreducible in , let be a root of , let and with
Then there is a ring homomorphism with , where is the subring of generated by .
This homomorphism turns square roots computed in the number field into residues modulo .
Formalization Note Irreducibility in (rather than only over ) includes primitivity, which is necessary: for and the conclusion fails for . For , is .
Preamble
import Mathlib import Definitions.Def_GNFS_defs open Polynomial IntermediateField
Formal statement
namespace GNFS
theorem exists_ringHom_adjoin_zmod (f : ℤ[X]) (hf : Irreducible f) (θ : ℂ)
(hθ : aeval θ f = 0) (n : ℕ) (m : ℤ) (hm : (n : ℤ) ∣ f.eval m) :
∃ φ : Algebra.adjoin ℤ ({θ} : Set ℂ) →+* ZMod n,
φ ⟨θ, Algebra.self_mem_adjoin_singleton ℤ θ⟩ = (m : ZMod n) := by sorry
end GNFSSource
Wikipedia, "General number field sieve" (revision oldid=1377718368, https://en.wikipedia.org/w/index.php?title=General_number_field_sieve&oldid=1377718368), section 'Method — Postprocessing'
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.