An entry `m(i,j)` of a pattern of weight `< (i+1)(j+1)` vanishes.
ProvedTypeDensity.pattern_entry_eq_zero_of_lttype-density
An entry m(i,j) of a pattern of weight < (i+1)(j+1) vanishes.
Preamble
import Definitions.Def_TypeDensity_Basic import Definitions.Def_TypeDensity_Reciprocity_Defs 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.RatFunc.AsPolynomial import Mathlib.RingTheory.PowerSeries.Expand import Mathlib.RingTheory.PowerSeries.Log set_option autoImplicit false open TypeDensity
Formal statement
theorem TypeDensity.pattern_entry_eq_zero_of_lt (N : ℕ) (m : Pattern N) (ij : Fin N × Fin N)
(h : patternWeight m < (ij.1.val + 1) * (ij.2.val + 1)) : (m ij).val = 0 := by sorrySource
TypeDensity/Reciprocity/Defs.lean#L643-L649