Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Definitions of TypeDensity.Cluster.Defs

Definition
TypeDensity_Cluster_Defs

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

type-density

The cluster density

Definitions for the cluster clause of Theorem 1.1: the cluster cell (πO)^n (coefficient vectors whose monic polynomial reduces to X^n), the universal cluster expression B_{n,σ} (the coefficient of σ in the root law, the law of the state S(1;n)), and the cluster probability clusterDensity O n σ (the normalized restriction of the coefficient measure to the cluster cell, with the reduced-algebra type predicate HasPolynomialType).

Definition code
-- Generated by the TypeDensity exporter from TypeDensity/Cluster/Defs.lean (namespace TypeDensity); do not edit.
import Definitions.Def_TypeDensity_Basic
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
set_option autoImplicit false

noncomputable section

namespace TypeDensity

open scoped ENNReal

section Classical

variable (O : Type) [CommRing O] [IsDomain O] [IsLocalRing O]

/-- The cluster cell `(πO)^n`: coefficient vectors whose monic polynomial reduces to `X^n`
(paper display (1.1), measure `μ_cluster`). -/
def clusterCell (n : ℕ) : Set (Fin n → O) := {a | ∀ i, a i ∈ IsLocalRing.maximalIdeal O}

end Classical

/-- `B_{n,σ}`: the coefficient of `σ` in the root law, the law of the state `S(1;n)`
(paper display (7.1)). -/
noncomputable def clusterExpr (n : ℕ) (σ : FactorType) : Expr := lawCoeff (rootLaw n) σ

section Measure

variable (O : Type) [CommRing O] [IsDomain O] [IsLocalRing O]
  [TopologicalSpace O] [IsTopologicalRing O] [CompactSpace O] [T2Space O]
  [SecondCountableTopology O]
  [MeasurableSpace O] [BorelSpace O]

/-- The cluster probability of type `σ` (paper display (1.1)): the normalized restriction of
the coefficient measure to the cluster cell. The event uses `HasPolynomialType` (the
reduced-algebra convention: a factorization into distinct monic irreducible factors, inseparable
factors allowed); the inseparable locus is Haar-null, so the étale convention gives the same
value (`clusterDensity_eq_etale`). -/
noncomputable def clusterDensity (n : ℕ) (σ : FactorType) : ℝ≥0∞ :=
  coefficientMeasure O n (clusterCell O n ∩ {a | HasPolynomialType O (monicPolynomial O a) σ}) /
    coefficientMeasure O n (clusterCell O n)

end Measure

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