Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Definitions of TypeDensity.Algebra.FactorInvariant

Definition
TypeDensity_Algebra_FactorInvariant

by asving · Oct 16, 2026 · Mathlib 0df444a (Lean v4.33.1)

type-density

Invariance of factor invariants and uniqueness of algebra types

Over a complete DVR O with finite residue field and fraction field K = BaseField O, the invariants (e, f) of the integral closure of O in a finite extension L/K depend only on the K-isomorphism class of L. Consequences: polynomial types are invariant under normalized reversal g ↦ g(0)⁻¹ · reverse g, algebra types are unique, and a monic F ∈ O[X] has polynomial type σ over K exactly when O[X]/(F) has algebra type σ.

Main results

  • TypeDensity.field_invariant_algEquiv, TypeDensity.factor_invariant_algEquiv
  • TypeDensity.reverse_normalized_irreducible, TypeDensity.reverse_polynomial_type_iff
  • TypeDensity.algebra_type_unique, TypeDensity.polynomial_type_iff_algebra_type

Provenance: Thm_SurfaceBlowupV2_{factor_invariant_algEquiv, reverse_normalized_irreducible, reverse_polynomial_type_iff, field_invariant_algEquiv, algebra_type_unique, polynomial_type_iff_algebra_type}.

Definition code
-- Generated by the TypeDensity exporter from TypeDensity/Algebra/FactorInvariant.lean (namespace TypeDensity); do not edit.
import Definitions.Def_TypeDensity_Basic
import Definitions.Def_TypeDensity_Formula_LawAlgebra
import Definitions.Def_TypeDensity_Algebra_AlgebraType
import Definitions.Def_TypeDensity_Measure_AdicCylinders
import Definitions.Def_TypeDensity_Measure_HenselProducts
import Definitions.Def_TypeDensity_Unramified_Extension
import Definitions.Def_TypeDensity_Measure_PrimitiveLocus
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.RingTheory.Henselian
import Mathlib.Topology.Algebra.MvPolynomial
import Mathlib.Algebra.Group.Pi.Units
import Mathlib.Order.CompletePartialOrder
import Mathlib.RingTheory.Polynomial.Resultant.Basic
import Mathlib.RingTheory.SimpleRing.Principal
import Mathlib.Algebra.GroupWithZero.Submonoid.CancelMulZero
import Mathlib.Algebra.Module.StablyFree.Basic
import Mathlib.NumberTheory.Padics.RingHoms
set_option autoImplicit false

namespace TypeDensity

open Polynomial

section Reverse

variable {K : Type} [Field K]

/-- The normalized reversal `f(0)⁻¹ · reverse f`. -/
noncomputable def rho (f : K[X]) : K[X] := C (f.coeff 0)⁻¹ * f.reverse

end Reverse

end TypeDensity

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me