Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Definitions of TypeDensity.Blowup.DivisorPoints

Definition
TypeDensity_Blowup_DivisorPoints

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

type-density

Exceptional divisor points of two-chart curve data

For the blow-up of a regular local surface at its closed point, this file relates two-chart curve data (finitely many points of the two charts with local curve generators) to divisors on the exceptional line ℙ¹_k. It computes level-one kernels as products of powers of irreducible polynomials, shows that a curve datum matching a divisor Dv has degree deg Dv, constructs curve data realizing prescribed child ideals, and proves that the glued global function lies in the fixed tangent cell.

Main results

  • TypeDensity.level_one_kernel_polynomial: the level-one kernel on a blow-up chart maps to the ideal of k[X] generated by a product of powers of distinct monic irreducibles; TypeDensity.two_chart_left_level_one_kernel_polynomial specialises it to the left chart.
  • TypeDensity.child_ideals_curve_datum: prescribed child ideals are realized by a curve datum.
  • TypeDensity.fixed_tangent_cell_curve_datum: every ideal of the fixed tangent cell comes from a curve datum matching Dv.
  • TypeDensity.matches_divisor_degree: a curve datum matching Dv has degree deg Dv.
  • TypeDensity.matches_divisor_level_one_polynomial: its level-one left kernel is generated by the affine polynomial of Dv.
  • TypeDensity.global_function_has_tangent_divisor, TypeDensity.global_function_mem_cell: the glued global function has tangent divisor Dv and lies in the fixed tangent cell.

Implementation notes

Statements about the concrete surfaces ConcreteSurface O pi u a b are written with the local notations tChart, tExc, ... for the blow-up charts and their data; see the notation section.

Provenance: Thm_SurfaceBlowupV2_{boundary_contact_of_twisted_generator, contracted_level_one_ideal_is_irreducible_power, two_chart_common_multiplicity_eq, child_ideals_curve_datum, curve_datum_common_and_zero_clauses, curve_datum_matches_divisor, matches_divisor_degree, fixed_tangent_cell_curve_datum, two_chart_left_level_one_kernel_polynomial, matches_divisor_level_one_polynomial, global_function_has_tangent_divisor, global_function_mem_cell}.

Definition code
-- Generated by the TypeDensity exporter from TypeDensity/Blowup/DivisorPoints.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 Definitions.Def_TypeDensity_Formula_FiniteFieldCounts
import Definitions.Def_TypeDensity_Formula_StateCombinatorics
import Definitions.Def_TypeDensity_Blowup_Directions
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_Surfaces_ConcreteAtlas
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
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
set_option autoImplicit false

namespace TypeDensity

open scoped BigOperators ENNReal

noncomputable def completedLocalCast {A : Type} [CommRing A] {P' P : Ideal A} [P'.IsPrime]
    [P.IsPrime] (h : P' = P) :
    CompletedLocalAt A P' ≃+* CompletedLocalAt A P := by
  subst h; exact RingEquiv.refl _

/-- At the prime `P` of `A`, every element `g` of the completed local ring such that `(g, z)` has
finite colength `n` is transverse to `z` (multiplication by `z` is injective modulo `g`), and the
ideal `(g, z)` contains a power of the maximal ideal. -/
def TransverseFiniteAt (A : Type) [CommRing A] (P : Ideal A) [P.IsPrime] (z : A) : Prop :=
  ∀ (g : CompletedLocalAt A P) (n : ℕ),
    Module.length (CompletedLocalAt A P) (CompletedLocalAt A P ⧸
      (Ideal.span {g} ⊔ Ideal.span {completedPointMap A P z})) = n →
    Function.Injective (fun w : CompletedLocalAt A P ⧸ Ideal.span {g} =>
      Ideal.Quotient.mk (Ideal.span {g}) (completedPointMap A P z) * w) ∧
    ∃ L : ℕ, ((IsLocalRing.maximalIdeal (Localization.AtPrime P)).map
      (localCompletionMap (Localization.AtPrime P)))^L ≤ finiteLocalCurveIdeal A P z g 1

/-- The nonzero affine directions in the support of the divisor `Dv`. -/
abbrev CommonDirections {k : Type} [Field k] (Dv : ExceptionalDivisor k) : Type :=
  {φ : AffineDirection k // φ ≠ zeroAffine k ∧ 0 < Dv (some φ)}

/-- The overlap point of a nonzero direction (a named function, so that the instance arguments
in the curve datum built below stay syntactically uniform). -/
noncomputable def commonPoint (R : Type) [CommRing R] [IsLocalRing R] (t x : R)
    (e : (BlowupChart R t x ⧸ chartExceptional R t x) ≃+* Polynomial (IsLocalRing.ResidueField R))
    {Dv : ExceptionalDivisor (IsLocalRing.ResidueField R)} (i : CommonDirections Dv) :
    Ideal (BlowupOverlap R t x) :=
  (directionPoint R t x e i.1).map (algebraMap (BlowupChart R t x) (BlowupOverlap R t x))

noncomputable def restrictLeftData {R : Type} [CommRing R] {t x : R}
    {beta : BlowupRestriction R t x}
    (D : TwoChartCurveData R t x beta) (p : D.ι → Prop) (q : D.ι0 → Prop) :
    TwoChartCurveData R t x beta where
  ι := {i // p i}
  fin := inferInstance
  Q := fun i => D.Q i.1
  maximal := fun i => D.maximal i.1
  inj := fun _ _ h => Subtype.ext (D.inj h)
  onE := fun i => D.onE i.1
  g := fun i => D.g i.1
  transverse := fun i => D.transverse i.1
  finite := fun i => D.finite i.1
  leftIso := fun i => D.leftIso i.1
  leftIso_compat := fun i => D.leftIso_compat i.1
  rightIso := fun i => D.rightIso i.1
  rightIso_compat := fun i => D.rightIso_compat i.1
  ι0 := {k // q k}
  fin0 := inferInstance
  P0 := fun k => D.P0 k.1
  maximal0 := fun k => D.maximal0 k.1
  inj0 := fun _ _ h => Subtype.ext (D.inj0 h)
  slope0 := fun k => D.slope0 k.1
  onE0 := fun k => D.onE0 k.1
  g0 := fun k => D.g0 k.1
  transverse0 := fun k => D.transverse0 k.1
  finite0 := fun k => D.finite0 k.1
  ιinf := D.ιinf
  fininf := D.fininf
  Pinf := D.Pinf
  maximalinf := D.maximalinf
  injinf := D.injinf
  slopeinf := D.slopeinf
  onEinf := D.onEinf
  ginf := D.ginf
  transverseinf := D.transverseinf
  finiteinf := D.finiteinf

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