Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Definitions of TypeDensity.Assembly.NullBridges

Definition
TypeDensity_Assembly_NullBridges

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

type-density

Strict-transform measures, type events and the projective null bridge

This file computes the Haar measure of preimages under the strict-transform chart maps of the blow-up recursion: the scaled strict map multiplies measure by q^(a n + k) (q the residue field cardinality), the child coordinate map by a further q⁻¹^n, and on the ball of radius |pi|^(s+a-1) the net factor is q⁻¹^(tri d). It then defines the coefficient-space type events and the RootCellLaw interface consumed by the density assembly, and proves that the original monic and projective densities agree with the route-F ones: the numerator events differ only on the Haar-null inseparable locus (and {a_n = 0} in the projective case).

Main results

  • TypeDensity.strict_normalizer_preimage_measure, TypeDensity.child_coordinate_preimage_measure, TypeDensity.strict_chart_one_ball_measure, TypeDensity.strict_transform_translate_measure
  • TypeDensity.RootCellLaw, TypeDensity.typeEvent, TypeDensity.binaryTypeEvent, TypeDensity.affineTypeEvent, TypeDensity.HasArray, TypeDensity.arrayLaw
  • TypeDensity.orig_monicDensity_eq, TypeDensity.orig_projectiveDensity_eq

Provenance: Thm_SurfaceBlowupV2_{strict_normalizer_preimage_measure, child_coordinate_preimage_measure, strict_chart_one_ball_measure, strict_transform_translate_measure}, Def_SurfaceBlowupV2_{RootCellLaw, TypeEvents}, Thm_Gen_ProjBridge.

Definition code
-- Generated by the TypeDensity exporter from TypeDensity/Assembly/NullBridges.lean (namespace TypeDensity); do not edit.
import Definitions.Def_TypeDensity_Basic
import Definitions.Def_TypeDensity_Blowup_Directions
import Definitions.Def_TypeDensity_Measure_AdicCylinders
import Definitions.Def_TypeDensity_Formula_LawAlgebra
import Definitions.Def_TypeDensity_Measure_HenselProducts
import Definitions.Def_TypeDensity_Surfaces_Lengths
import Definitions.Def_TypeDensity_Surfaces_PowerSeries
import Definitions.Def_TypeDensity_Formula_FiniteFieldCounts
import Definitions.Def_TypeDensity_Formula_StateCombinatorics
import Definitions.Def_TypeDensity_Formula_PatternCounts
import Definitions.Def_TypeDensity_Unramified_Extension
import Definitions.Def_TypeDensity_Blowup_Charts
import Definitions.Def_TypeDensity_Algebra_AlgebraType
import Definitions.Def_TypeDensity_Measure_PrimitiveLocus
import Definitions.Def_TypeDensity_Algebra_FactorInvariant
import Definitions.Def_TypeDensity_Surfaces_TruncatedSeries
import Definitions.Def_TypeDensity_Blowup_TwoChartCurveData
import Definitions.Def_TypeDensity_Surfaces_ConcreteAtlas
import Definitions.Def_TypeDensity_Recursion_Members
import Definitions.Def_TypeDensity_Measure_MemberCharts
import Definitions.Def_TypeDensity_Recursion_Termination
import Definitions.Def_TypeDensity_Recursion_OrderDefect
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.FieldTheory.Finite.GaloisField
import Mathlib.RingTheory.AdicCompletion.Algebra
import Mathlib.RingTheory.RegularLocalRing.Defs
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
import Mathlib.FieldTheory.RatFunc.AsPolynomial
import Mathlib.RingTheory.AdicCompletion.Completeness
import Mathlib.Algebra.GroupWithZero.Submonoid.CancelMulZero
import Mathlib.Algebra.Module.StablyFree.Basic
import Mathlib.NumberTheory.Padics.RingHoms
import Mathlib.Algebra.Azumaya.Basic
import Mathlib.RingTheory.AdicCompletion.RingHom
import Mathlib.RingTheory.TotallySplit
import Mathlib.RingTheory.AdicCompletion.LocalRing
import Mathlib.RingTheory.KrullDimension.NonZeroDivisors
import Mathlib.Algebra.Group.NatPowAssoc
import Mathlib.Algebra.Order.Ring.Star
import Mathlib.Data.Int.Star
import Mathlib.LinearAlgebra.Dimension.Torsion.Finite
set_option autoImplicit false

noncomputable section

namespace TypeDensity

section RootCell

open IsLocalRing MeasureTheory

/-- `RootCellLaw`: for every complete DVR `O` with finite residue field and a compact adic
Borel structure, every uniformizer `pi`, every `r ≥ 1` and every type `σ`, the event
`{z : Fin r → O | X^r + ∑ (pi z_i) X^i has type σ}` is measurable and has normalized
coefficient Haar mass `coeff_σ(stateLaw (S(1;r)))(q)`, `q = |k|`. It is the interface between the
measured recursion (which proves it) and the polynomial/projective assembly (which consumes it). -/
def RootCellLaw : Prop :=
  ∀ (O : Type) [CommRing O] [IsDomain O] [IsDiscreteValuationRing O]
    [IsAdicComplete (maximalIdeal O) O] [Finite (ResidueField O)] [TopologicalSpace O]
    [IsTopologicalRing O] [CompactSpace O] [T2Space O] [SecondCountableTopology O]
    [MeasurableSpace O] [BorelSpace O],
    IsAdic (maximalIdeal O) → ∀ (pi : O), Irreducible pi → ∀ (r : ℕ), 0 < r → ∀ (σ : FactorType),
      MeasurableSet {z : Fin r → O | HasPolynomialTypeF O (monicPolynomial O (pi • z)) σ} ∧
      coefficientMeasure O r {z : Fin r → O | HasPolynomialTypeF O (monicPolynomial O (pi • z)) σ} =
        densityValue (lawCoeff (stateLaw (State.single 1 r)) σ) (Nat.card (ResidueField O))

end RootCell

section TypeEvents

open Polynomial IsLocalRing

open scoped BigOperators

section

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

/-- The classical monic type event in degree `n`: coefficient vectors whose monic polynomial has
type `σ`. -/
def typeEvent (n : ℕ) (σ : FactorType) : Set (Fin n → O) :=
  {a | HasPolynomialTypeF O (monicPolynomial O a) σ}

/-- The primitive binary type event (the numerator event of `projectiveDensityF`). -/
def binaryTypeEvent (n : ℕ) (σ : FactorType) : Set (Fin (n+1) → O) :=
  {a | primitive O a ∧ HasBinaryTypeF O a σ}

/-- The affine-chart type event: the top coefficient is nonzero and the monic normalization of the
affine polynomial has classical type `σ`. -/
def affineTypeEvent (n : ℕ) (σ : FactorType) : Set (Fin (n+1) → O) :=
  {a | a (Fin.last n) ≠ 0 ∧ HasPolynomialTypeF O
    (C (algebraMap O (BaseField O) (a (Fin.last n)))⁻¹ * affinePolynomial O a) σ}

/-- The repeated-root event of `RootCellLaw`: `z` with `X^r + ∑ (pi z_i) X^i` of type `σ`. -/
def rootEvent (pi : O) (r : ℕ) (σ : FactorType) : Set (Fin r → O) :=
  {z | HasPolynomialTypeF O (monicPolynomial O (pi • z)) σ}

/-- The infinity block event in reduced coordinates: for the reversed block
`R_b = 1 + ∑ b_j X^(j+1)` (the dehomogenization of the normalized form `insertOne 0 b`), the top
coefficient `b_(r-1)` is nonzero and the monic normalization of `R_b` has type `σ`. -/
def infinityBlockEvent (r : ℕ) (σ : FactorType) : Set (Fin r → O) :=
  {b | (formPoly (insertOne (0 : Fin (r+1)) b)).coeff r ≠ 0 ∧ HasPolynomialTypeF O
    (C (algebraMap O (BaseField O) ((formPoly (insertOne (0 : Fin (r+1)) b)).coeff r))⁻¹ *
      (formPoly (insertOne (0 : Fin (r+1)) b)).map (algebraMap O (BaseField O))) σ}

end

section

variable (O : Type) [CommRing O] [IsLocalRing O] (Φ : Polynomial O)

/-- The point chart of a nonrational point: select the block above `θ̄` and translate it to the
`X^r` cell over `O_δ`. -/
def pointChart (r : ℕ) (a : Fin (Φ.natDegree * r) → O) : Fin r → AdjoinRoot Φ :=
  translateBlock O Φ r (selectBlock O Φ r a)

end

section

variable (k : Type) [Field k]

/-- `HasArray k n D m`: the divisor `D` has exactly `m (δ-1, r-1)` closed points of degree `δ`
and multiplicity `r`, for all `1 ≤ δ, r ≤ n`; infinity is counted like every other point. -/
def HasArray (n : ℕ) (D : ExceptionalDivisor k) (m : Pattern n) : Prop :=
  ∀ ij : Fin n × Fin n,
    Nat.card {Q : ClosedDirection k // directionDegree k Q = ij.1.val + 1 ∧ D Q = ij.2.val + 1} =
      (m ij).val

/-- An affine divisor of degree `n`: no multiplicity at infinity and total degree `n`. -/
def AffineDivisor (n : ℕ) (D : ExceptionalDivisor k) : Prop :=
  D (infinityDirection k) = 0 ∧ exceptionalDegree k D = n

/-- The residue vector of a divisor in degree `n`: the coefficients of its affine polynomial, read
as a binary form of degree `n` (the multiplicity at infinity is `n - natDegree`). -/
def divisorVector (n : ℕ) (D : ExceptionalDivisor k) : Fin (n+1) → k :=
  fun i => (divisorAffinePolynomial k D).coeff i

end

/-- The law attached to an array: the product over its points of the descended repeated-root laws
`T_δ B_r` — the inner factor of `globalLaw`. -/
def arrayLaw {n : ℕ} (m : Pattern n) : Law :=
  lawProd ((otherChildren 1 m).map fun z => lawDescend z.1 (stateLaw z.2))

end TypeEvents

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