Hensel splitting for polynomials over power series #
In this file we derive from the Weierstrass preparation theorem
(PowerSeries.exists_isWeierstrassFactorization) a Hensel-style splitting for a monic
polynomial p over K⟦X⟧: a root of multiplicity k of the reduction of p modulo the
maximal ideal of K⟦X⟧ (that is, of the coefficientwise application of
PowerSeries.constantCoeff to p) lifts to a monic factor of p of degree k.
Main results #
Polynomial.Monic.exists_factorization_rootMultiplicity_zero: a monicpoverK⟦X⟧of degreemwhose reduction has0as a root of multiplicitykwithk ≤ mfactors asp = g * hwithg,hmonic of degreeskandm - k, and the reduction ofgisX ^ k.Polynomial.Monic.exists_factorization_rootMultiplicity: a monicpoverK⟦X⟧of degreemwhose reduction has a roota : Kof multiplicitykwithk ≤ mfactors asp = g * hwithg,hmonic of degreeskandm - k.
Hensel splitting at zero: a monic p over K⟦X⟧ of degree m whose reduction
(coefficientwise PowerSeries.constantCoeff) has 0 as a root of multiplicity k with
k ≤ m factors as p = g * h with g, h monic of degrees k and m - k, and g
distinguished: its reduction is X ^ k.
Hensel splitting at a root: a monic p over K⟦X⟧ of degree m whose reduction
(coefficientwise PowerSeries.constantCoeff) has a root a : K of multiplicity k with
k ≤ m factors as p = g * h with g, h monic of degrees k and m - k.