`BookProof.NsCutoffUniformity.norm_coeff_redFormPoly_unbounded_of_no_cutoff` (nu : ℝ) (C₀ : ℝ) : ∃ (k : Fin 3 → ℝ) (m : Fin (1 * 6) →₀ ℕ) (p : Fin 1) (r : Fin 7), C₀ <...
ProvedBookProof.NsCutoffUniformity.norm_coeff_redFormPoly_unbounded_of_no_cutofftheoremstimepiece
Prove the following Lean 4 theorem from ChapterNsCutoffUniformity.
BookProof.NsCutoffUniformity.norm_coeff_redFormPoly_unbounded_of_no_cutoff (nu : ℝ) (C₀ : ℝ) : ∃ (k : Fin 3 → ℝ) (m : Fin (1 * 6) →₀ ℕ) (p : Fin 1) (r : Fin 7), C₀ < ‖coeff m (redFormPoly nu k 1 p r)‖
Formalization note: Lean 4 identifier BookProof.NsCutoffUniformity.norm_coeff_redFormPoly_unbounded_of_no_cutoff.
Preamble
-- Generated from ChapterNsCutoffUniformity.lean — theorem BookProof.NsCutoffUniformity.norm_coeff_redFormPoly_unbounded_of_no_cutoff
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_unbounded_of_no_cutoff (nu : ℝ) (C₀ : ℝ) :
∃ (k : Fin 3 → ℝ) (m : Fin (1 * 6) →₀ ℕ) (p : Fin 1) (r : Fin 7),
C₀ < ‖coeff m (redFormPoly nu k 1 p r)‖ := by sorry