numBound — Mathlib

English

numBound is defined as MvPolynomialC.numBound (k+n) (1 + count) m, giving the bound used in Chevalley's theorem with complexity.

Русский

numBound задается как MvPolynomialC.numBound (k+n) (1 + count) m, задавая предел в теореме Чевалле с учетом сложности.

LaTeX

$$def numBound (k m n : ℕ) (d : Multiset (Fin m)) : ℕ := MvPolynomialC.numBound (k + n) (1 + (d.map Fin.val).count ·) m$$

Lean4

/-- The bound on the number of polynomials used to describe the constructible set appearing in
Chevalley's theorem with complexity bound. -/
def numBound (k m n : ℕ) (d : Multiset (Fin m)) : ℕ :=
  MvPolynomialC.numBound (k + n) (1 + (d.map Fin.val).count ·) m

Похожие утверждения