Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Definitions of TypeDensity.Recursion.Termination

Definition
TypeDensity_Recursion_Termination

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

type-density

Termination of the recursion

Inputs for the termination step of Theorem 8.1. We construct the index map of a curve on a concrete surface, control division charts under perturbation, attach homogeneous tangent divisors and allowed patterns to initial forms, compute the volume of the state set of a concrete member, build the child member at the point at infinity, and prove that the recursion terminates outside the return and bad-exit events. We also show that order defects decrease along unramified towers and add over products.

Main results

  • concrete_index_map_reindexed: the reindexed index map with cokernel length d(d-1)/2.
  • allowed_pattern_of_divisor: a tangent divisor has an allowed pattern.
  • concrete_member_volume: the volume of the state set of a concrete member.
  • child_ideal_set_map_iff_stateSet, infinity_point_child_member: child members.
  • etale_type_event_eq_term, nonterminating_subset_return_or_bad: termination.
  • order_defect_le_of_tower, order_defect_pi: order defects.

Provenance: Thm_SurfaceBlowupV2_{concrete_index_map_reindexed, division_data_vertical_perturbation, division_quotient_basis_equiv, divisor_affine_polynomial_normalized_factors, divisor_degree_pattern_weight, allowed_pattern_of_divisor, equiv_of_fiber_card_eq, full_rank_free_submodule_finite_length, global_function_of_two_chart_curve_data, has_multiplicity_initial_form, homogeneous_divisor_of_polynomial, homogeneous_divisor_boundary_multiplicities, ideal_atlas_reindex, concrete_member_volume, ideal_data_along_ringEquiv, child_ideal_set_map_iff_stateSet, infinity_point_child_member, initial_form_has_tangent_divisor, length_le_length_restrict, list_get_fiber_card_count, mem_integralClosure_pi_iff, integralClosure_pi_equiv, generic_closure_free_of_type, nonself_cell_child_rank_lt, etale_terminates_of_invariant, etale_type_event_eq_term, nonterminating_subset_return_or_bad, order_defect_le_of_tower, order_defect_pi}.

Definition code
-- Generated by the TypeDensity exporter from TypeDensity/Recursion/Termination.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_Blowup_TwoChartCurveData
import Definitions.Def_TypeDensity_Surfaces_ConcreteAtlas
import Definitions.Def_TypeDensity_Recursion_Members
import Definitions.Def_TypeDensity_Measure_MemberCharts
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
import Mathlib.Algebra.Order.Ring.Star
import Mathlib.Data.Int.Star
import Mathlib.LinearAlgebra.Dimension.Torsion.Finite
set_option autoImplicit false

namespace TypeDensity

open IsLocalRing MeasureTheory

open scoped BigOperators ENNReal

/-- The contact conditions of a state `s` on an exceptional divisor `Dv` of degree `d`: `d` is at
most the contact `c` (and, for a crossing state, at most the second contact `h`), and `Dv` meets the
direction at infinity (resp. the zero direction) exactly when `d < c` (resp. `d < h`). -/
abbrev DivisorContactCondition (k : Type) [Field k] (s : State) (Dv : ExceptionalDivisor k)
    (d : ℕ) : Prop :=
  match s with
  | State.single _ c => d ≤ c ∧ (0 < Dv (infinityDirection k) ↔ d < c)
  | State.crossing _ _ c h => d ≤ c ∧ (0 < Dv (infinityDirection k) ↔ d < c) ∧ d ≤ h ∧
      (0 < Dv (zeroDirection k) ↔ d < h)

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