`BookProof.CarlemanSimplex.sBd_multiplicity` (k : ℕ) (a : Fin d →₀ ℕ) (M : ℕ) : (((Finset.range M).filter (fun N => a ∈ sBd d N k)).card) ≤ k
ProvedBookProof.CarlemanSimplex.sBd_multiplicitytheoremstimepiece
Prove the following Lean 4 theorem from ChapterCarlemanSimplex.
BookProof.CarlemanSimplex.sBd_multiplicity (k : ℕ) (a : Fin d →₀ ℕ) (M : ℕ) : (((Finset.range M).filter (fun N => a ∈ sBd d N k)).card) ≤ k
Formalization note: Lean 4 identifier BookProof.CarlemanSimplex.sBd_multiplicity.
Preamble
-- Generated from ChapterCarlemanSimplex.lean — theorem BookProof.CarlemanSimplex.sBd_multiplicity
import Definitions.Def_ChapterHermiteCarlemanEsaPromoted
import Definitions.Def_ChapterCarlemanTwoStepPromoted
import Mathlib
import Definitions.Def_ChapterCarlemanSimplexPromoted
import Definitions.Def_ChapterGaussCoreQuadBounds
open BookProof.CarlemanSimplex
open Finset
open BookProof.HermiteCarleman BookProof.CarlemanTwoStep
noncomputable section
variable {d : ℕ}
variable {u : (Fin d →₀ ℕ) → ℂ}
variable {lam : (Fin d →₀ ℕ) → ℝ} {w : Fin d → ℂ} {W M : Fin d → Fin d → ℂ} {z : ℂ}Formal statement
theorem BookProof.CarlemanSimplex.sBd_multiplicity (k : ℕ) (a : Fin d →₀ ℕ) (M : ℕ) :
(((Finset.range M).filter (fun N => a ∈ sBd d N k)).card) ≤ k := by sorry