Module

Polynomial.lean

Nyll.ValuedFieldTheory.Ramification.HilbertRamification.Polynomial
1 declaration indexed from sourceView source ↗

Hilbert ramification theory: polynomial sources

This file contains the generic polynomial congruence lemma used by the completion-free formalization of ramification-number theory.

Imports4
  • Mathlib.Algebra.Polynomial.Eval.Defs
  • Mathlib.Algebra.Ring.GeomSum
  • Mathlib.RingTheory.Ideal.Defs
  • Mathlib.Tactic.Ring
Imported by2

Declarations

RamificationTheory.HilbertRamification.Higher.polynomial_eval₂_sub_mem_of_sub_mem

If two evaluation points are congruent modulo an ideal, then evaluating any polynomial at them gives congruent results modulo the same ideal.

Source context 2 commands

Surrounding namespaces, section variables, and local commands at this declaration.

namespace RamificationTheory.HilbertRamification
namespace Higher
theorem polynomial_eval₂_sub_mem_of_sub_mem
    {R S : Type*} [CommRing R] [CommRing S]
    (f : R →+* S) (I : Ideal S) {x y : S} (hxy : x - y ∈ I)
    (P : Polynomial R) :
    P.eval₂ f x - P.eval₂ f y ∈ I