Definitions of TypeDensity.Measure.HenselProducts
DefinitionTypeDensity_Measure_HenselProductsHensel factorization, finite products and coefficient measures
Hensel's lemma in factorization form over a complete local ring (proved from scratch by a
Newton iteration on the coefficient filtration coeffIdeal (𝔪 ^ k)), its consequences for
families of pairwise coprime factors and uniqueness, and a collection of lemmas on finite products
of rings and modules (adic completeness, quotients, measurable embeddings, division coordinates)
together with the basic mass computations for the normalized coefficient measure of O^n.
Main results
hensel_pair_exists,hensel_family_exists,hensel_pair_unique: Hensel factorization.isCoprime_of_isCoprime_map_residue: monic polynomials with coprime residue reductions are coprime over any local ring.maximal_ideal_power_kills:𝔪 ^ Nkills a module of lengthNover a local ring.monic_residue_polynomial_count: there areq ^ nmonic polynomials of degreenover𝔽_q.power_coordinates_transport: the transported structure onO[X]/(Φ)is a compact second-countable Borel topological ring.coefficient_cylinder_mass,coefficient_measure_probability,coefficient_uniformizer_cylinder_mass: masses of cylinders for the coefficient measure.
Provenance: Thm_SurfaceBlowupV2_*: hensel_pair_exists, hensel_family_exists,
hensel_pair_unique, isAdicComplete_pi, linear_map_preserves_adic_congruence,
maximal_ideal_power_kills, linear_image_bound_from_cokernel_length, measurableEmbedding_pi,
monic_residue_polynomial_count, normalizing_factor_is_unit, pi_algebraMap_mem_jacobson_bot,
pi_ideal_mem_iff_map_eval, pi_quotient_span_linearEquiv, power_coordinates_transport,
principal_generator_orbit_count, product_coordinates_exist, product_division_equiv,
quotient_mul_range_equiv, regular_principal_generators_associated, residue_quotient_card,
coefficient_cylinder_mass, coefficient_measure_probability, chart_measure_total_mass,
coefficient_uniformizer_cylinder_mass.
-- Generated by the TypeDensity exporter from TypeDensity/Measure/HenselProducts.lean (namespace TypeDensity); do not edit.
import Definitions.Def_TypeDensity_Basic
import Definitions.Def_TypeDensity_Measure_AdicCylinders
import Mathlib.FieldTheory.RatFunc.Basic
import Mathlib.MeasureTheory.Measure.Haar.Unique
import Mathlib.NumberTheory.ArithmeticFunction.Moebius
import Mathlib.NumberTheory.Padics.PadicIntegers
import Mathlib.RingTheory.IntegralClosure.IntegralRestrict
import Mathlib.RingTheory.MvPowerSeries.Basic
import Mathlib.RingTheory.RamificationInertia.Basic
import Mathlib.Topology.Algebra.Nonarchimedean.AdicTopology
import Mathlib.Topology.Algebra.MvPolynomial
import Mathlib.Algebra.Group.Pi.Units
import Mathlib.Order.CompletePartialOrder
import Mathlib.RingTheory.Henselian
import Mathlib.RingTheory.Polynomial.Resultant.Basic
import Mathlib.RingTheory.RegularLocalRing.Defs
import Mathlib.RingTheory.SimpleRing.Principal
set_option autoImplicit false
open MeasureTheory
open scoped BigOperators ENNReal
namespace TypeDensity
namespace Hensel
open Polynomial IsLocalRing
section CoeffIdeal
variable {R : Type*} [CommRing R]
/-- **`coeffIdeal J`** — the ideal of `R[X]` consisting of the polynomials all of whose
coefficients lie in `J`. Defined as `Ideal.map C J`; the coefficient description is
`mem_coeffIdeal`. Being an *ideal* is what makes the bookkeeping cheap: it is automatically closed
under multiplication by arbitrary polynomials. -/
noncomputable abbrev coeffIdeal (J : Ideal R) : Ideal (Polynomial R) :=
J.map (Polynomial.C (R := R))
end CoeffIdeal
end Hensel
/-- Over a finite field `k` there are `|k| ^ n` monic polynomials of degree `n`. -/
theorem monic_residue_polynomial_count (k : Type) [Field k] [Finite k] (n : ℕ) :
Nat.card {F : Polynomial k // F.Monic ∧ F.natDegree=n}=(Nat.card k)^n := by
rw [Nat.card_congr ((Polynomial.monicEquivDegreeLT n).trans
(Polynomial.degreeLTEquiv k n).toEquiv), Nat.card_fun]
simp
end TypeDensity