Every child of a non-self allowed pattern has strictly smaller rank than its parent.
ProvedTypeDensity.nonself_child_rank_lttype-density
Every child of a non-self allowed pattern has strictly smaller rank than its parent.
Preamble
import Definitions.Def_TypeDensity_Basic import Definitions.Def_TypeDensity_Formula_LawAlgebra import Definitions.Def_TypeDensity_Formula_StateCombinatorics import Theorems.Thm_TypeDensity_children_degree_identity import Theorems.Thm_TypeDensity_children_residue_degree_pos import Theorems.Thm_TypeDensity_child_degree_le import Theorems.Thm_TypeDensity_children_valid import Theorems.Thm_TypeDensity_rank_lt_of_degree_lt 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 TypeDensity open scoped BigOperators ENNReal
Formal statement
theorem TypeDensity.nonself_child_rank_lt (s : State) (hs : s.Valid) (P : TangentPattern s.degree)
(hP : Allowed s P) (hself : ¬ SelfPattern s P) (z : ℕ × State) (hz : z ∈ children s P) :
z.2.rank < s.rank := by sorrySource
TypeDensity/Formula/StateCombinatorics.lean#L254-L293