`BookProof.NsCutoffUniformity.norm_coeff_redFormPoly_le` (nu : ℝ) {Λ : ℝ} {k : Fin 3 → ℝ} (hΛ : 0 ≤ Λ) (hk : ∀ j, |k j| ≤ Λ) (p : Fin n) (r : Fin 7) (m : Fin (n * 6) →₀ ℕ)...
ProvedBookProof.NsCutoffUniformity.norm_coeff_redFormPoly_letheoremstimepiece
Prove the following Lean 4 theorem from ChapterNsCutoffUniformity.
BookProof.NsCutoffUniformity.norm_coeff_redFormPoly_le (nu : ℝ) {Λ : ℝ} {k : Fin 3 → ℝ} (hΛ : 0 ≤ Λ) (hk : ∀ j, |k j| ≤ Λ) (p : Fin n) (r : Fin 7) (m : Fin (n * 6) →₀ ℕ) : ‖coeff m (redFormPoly nu k n p r)‖ ≤ cutoffBound nu Λ
Formalization note: Lean 4 identifier BookProof.NsCutoffUniformity.norm_coeff_redFormPoly_le.
Preamble
-- Generated from ChapterNsCutoffUniformity.lean — theorem BookProof.NsCutoffUniformity.norm_coeff_redFormPoly_le
import Definitions.Def_ChapterNavierStokesFullEulerianFock
import Mathlib
import Definitions.Def_ChapterNsCutoffUniformity
open MvPolynomial BookProof.NsFullEuler
noncomputable section
variable {n : ℕ}
variable {ι : Type*}Formal statement
theorem BookProof.NsCutoffUniformity.norm_coeff_redFormPoly_le (nu : ℝ) {Λ : ℝ} {k : Fin 3 → ℝ} (hΛ : 0 ≤ Λ)
(hk : ∀ j, |k j| ≤ Λ) (p : Fin n) (r : Fin 7) (m : Fin (n * 6) →₀ ℕ) :
‖coeff m (redFormPoly nu k n p r)‖ ≤ cutoffBound nu Λ := by sorry