`BookProof.NsCutoffUniformity.totalDegree_redFormPoly_le` (p : Fin n) (r : Fin 7) : (redFormPoly nu k n p r).totalDegree ≤ 2
ProvedBookProof.NsCutoffUniformity.totalDegree_redFormPoly_letheoremstimepiece
Prove the following Lean 4 theorem from ChapterNsCutoffUniformity.
BookProof.NsCutoffUniformity.totalDegree_redFormPoly_le (p : Fin n) (r : Fin 7) : (redFormPoly nu k n p r).totalDegree ≤ 2
Formalization note: Lean 4 identifier BookProof.NsCutoffUniformity.totalDegree_redFormPoly_le.
Preamble
-- Generated from ChapterNsCutoffUniformity.lean — theorem BookProof.NsCutoffUniformity.totalDegree_redFormPoly_le
import Definitions.Def_ChapterNavierStokesFullEulerianFock
import Mathlib
import Definitions.Def_ChapterNsCutoffUniformity
open MvPolynomial BookProof.NsFullEuler
noncomputable section
variable {n : ℕ}
variable {ι : Type*}
variable (nu : ℝ) (k : Fin 3 → ℝ)Formal statement
theorem BookProof.NsCutoffUniformity.totalDegree_redFormPoly_le (p : Fin n) (r : Fin 7) :
(redFormPoly nu k n p r).totalDegree ≤ 2 := by sorry