`BookProof.CarlemanTwoStep.shiftedK_multiplicity` (i : Fin d) (k : ℕ) (b : Fin d →₀ ℕ) (M : ℕ) : (((Finset.range M).filter (fun N => b ∈ (faceK d N i k).image (fun a => a + Finsupp
ProvedBookProof.CarlemanTwoStep.shiftedK_multiplicitytheoremstimepiece
Prove the following Lean 4 theorem from ChapterCarlemanTwoStep.
BookProof.CarlemanTwoStep.shiftedK_multiplicity (i : Fin d) (k : ℕ) (b : Fin d →₀ ℕ) (M : ℕ) : (((Finset.range M).filter (fun N => b ∈ (faceK d N i k).image (fun a => a + Finsupp.single i k))).card) ≤ k
Formalization note: Lean 4 identifier BookProof.CarlemanTwoStep.shiftedK_multiplicity.
Preamble
-- Generated from ChapterCarlemanTwoStep.lean — theorem BookProof.CarlemanTwoStep.shiftedK_multiplicity
import Definitions.Def_ChapterHermiteCarlemanEsaPromoted
import Mathlib
import Definitions.Def_ChapterCarlemanTwoStepPromoted
import Definitions.Def_ChapterGaussCoreQuadBounds
open BookProof.CarlemanTwoStep
open Finset
open BookProof.HermiteCarleman
noncomputable section
variable {d : ℕ}
variable {u : (Fin d →₀ ℕ) → ℂ}
variable {lam : (Fin d →₀ ℕ) → ℝ} {w1 w2 : Fin d → ℂ} {z : ℂ}Formal statement
theorem BookProof.CarlemanTwoStep.shiftedK_multiplicity (i : Fin d) (k : ℕ) (b : Fin d →₀ ℕ) (M : ℕ) :
(((Finset.range M).filter
(fun N => b ∈ (faceK d N i k).image (fun a => a + Finsupp.single i k))).card) ≤ k := by sorry