Definitions of TypeDensity.Formula.StateCombinatorics
DefinitionTypeDensity_Formula_StateCombinatoricsCombinatorics of states, ranks and safety of the laws
Combinatorial facts about states and their children under one blowup step: positivity of
degrees, the unique self pattern of a single-branch state, strict decrease of the rank along
non-self children (which makes the fuel-based recursion stateLawFuel stable), and the
resulting safety (no division by zero at integers q ≥ 2) of the local and global laws, hence
regularity of the global formula. Also small arithmetic facts on tri, return weights,
divisor probabilities and scaled types.
Main results
TypeDensity.self_patterns_of_single_state:S(a; c)has a unique self pattern.TypeDensity.nonself_child_rank_lt: non-self children have strictly smaller rank.TypeDensity.state_fuel_stable:stateLawFuel k s = stateLaw soncerank s < k.TypeDensity.state_law_unfold: the law of a non-terminal state in terms of its exit lawexitLaw(the non-self part of the recursion).TypeDensity.local_law_safe,TypeDensity.global_law_safe: safety of the laws.TypeDensity.global_formula_regular: the global formula is regular at prime powers.TypeDensity.scale_type_valid_degree_iff: scaling types byδpreserves validity and multiplies degrees byδ.
Provenance: Thm_SurfaceBlowupV2_* for self_patterns_of_single_state, state_degree_pos,
equal_degree_child_is_unique, state_weight_le_degree, rank_lt_of_weight_gt, nonself_child_rank_lt,
state_fuel_stable, exitLaw, state_law_unfold, tangent_weight_safe, terminal_law, tri_chooseTwo,
tri_ge_three, return_weight_bounds, divisor_probability_pos, local_law_safe, global_law_safe,
global_coefficients_safe, global_formula_regular, type_degree_scale,
scale_type_valid_degree_iff.
-- Generated by the TypeDensity exporter from TypeDensity/Formula/StateCombinatorics.lean (namespace TypeDensity); do not edit.
import Definitions.Def_TypeDensity_Basic
import Definitions.Def_TypeDensity_Formula_LawAlgebra
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
set_option autoImplicit false
open scoped BigOperators ENNReal
namespace TypeDensity
/-- The indicator pattern of the cell `(0, c - 1)`. -/
abbrev IsSelfOther {n : ℕ} (c : ℕ) (m : Pattern n) : Prop :=
∀ ij, (m ij).val = if ij.1.val = 0 ∧ ij.2.val + 1 = c then 1 else 0
/-- The unique self pattern of `S(a; c)`. -/
def selfPattern (a c : ℕ) (hc : 0 < c) (hca : c ≤ a * c) :
TangentPattern (State.single a c).degree where
d := ⟨c, by change c < a*c+1; omega⟩
rt := ⟨0, by change 0 < a*c+1; omega⟩
rx := ⟨0, by change 0 < a*c+1; omega⟩
other := fun ij ↦ if ij.1.val = 0 ∧ ij.2.val + 1 = c then ⟨1, by change 1 < a*c+1; omega⟩
else ⟨0, by change 0 < a*c+1; omega⟩
open scoped Classical in
/-- The non-self part of the recursion of a state `s`: over the allowed tangent patterns `P` that
are not self patterns, the weight `tangentCount · divisorProbability` times the product of the
descended laws of the children of `P`. -/
noncomputable def exitLaw (s : State) : Law :=
(allowedPatterns s).toList.flatMap fun P ↦
if SelfPattern s P then [] else
lawScale (.mul (tangentCount s P) (divisorProbability s P.d.val))
(lawProd ((children s P).map fun z ↦ lawDescend z.1 (stateLaw z.2)))
end TypeDensity