Definitions of TypeDensity.Formula.FiniteFieldCounts
DefinitionTypeDensity_Formula_FiniteFieldCountstype-density
Counting over finite fields
Elementary counts: the number of monic irreducible polynomials of degree δ over a finite field
is the point-count polynomial at #k; the cardinality of a finite field is a prime power; and a
module of length ℓ over a local ring with finite residue field k has |k|^ℓ elements.
Main results
TypeDensity.finite_field_irreducible_countTypeDensity.finite_field_card_primePowerTypeDensity.finite_length_module_card
Provenance: Thm_SurfaceBlowupV2_{finite_field_irreducible_count, finite_field_card_primePower, finite_length_module_card} (moved from Unramified/LocalDescent.lean and
Blowup/CurveOrders.lean).
Definition code
-- Generated by the TypeDensity exporter from TypeDensity/Formula/FiniteFieldCounts.lean (namespace TypeDensity); do not edit.
import Definitions.Def_TypeDensity_Basic
import Definitions.Def_TypeDensity_Formula_LawAlgebra
import Definitions.Def_TypeDensity_Measure_AdicCylinders
import Definitions.Def_TypeDensity_Measure_HenselProducts
import Definitions.Def_TypeDensity_Surfaces_Lengths
import Definitions.Def_TypeDensity_Surfaces_PowerSeries
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.FieldTheory.Finite.GaloisField
import Mathlib.RingTheory.AdicCompletion.Algebra
import Mathlib.RingTheory.RegularLocalRing.Defs
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.SimpleRing.Principal
import Mathlib.FieldTheory.Finite.Extension
import Mathlib.RingTheory.AdicCompletion.Noetherian
import Mathlib.RingTheory.MvPowerSeries.Equiv
import Mathlib.RingTheory.PicardGroup
set_option autoImplicit false
namespace TypeDensity
/-- The number of monic irreducible polynomials of degree `δ > 0` over a finite field `k` is the
value of the point-count polynomial `pointCount δ` at `#k`. -/
theorem finite_field_irreducible_count (k : Type) [Field k] [Finite k] (δ : ℕ) (hδ : 0 < δ) :
((Nat.card {g : Polynomial k // g.Monic ∧ Irreducible g
∧ g.natDegree = δ} : ℕ) : ℚ) = (pointCount δ).eval (Nat.card k) := by
rw [pointCount_eval, ← irreducible_count_moebius k δ hδ]
have : (δ : ℚ) ≠ 0 := Nat.cast_ne_zero.mpr hδ.ne'
field_simp
end TypeDensity