`BookProof.NsNonlinearFarisLavine.nsSquareComparison_relBound` (x : polyGaussCore (d := d)) : ‖nsKoopmanOp S x‖ ≤ ‖nsSquareComparison S x‖ + ‖(x : L2d d)‖
ProvedBookProof.NsNonlinearFarisLavine.nsSquareComparison_relBoundtheoremstimepiece
Prove the following Lean 4 theorem from ChapterNsNonlinearFarisLavine.
BookProof.NsNonlinearFarisLavine.nsSquareComparison_relBound (x : polyGaussCore (d := d)) : ‖nsKoopmanOp S x‖ ≤ ‖nsSquareComparison S x‖ + ‖(x : L2d d)‖
Formalization note: Lean 4 identifier BookProof.NsNonlinearFarisLavine.nsSquareComparison_relBound.
Preamble
-- Generated from ChapterNsNonlinearFarisLavine.lean — theorem BookProof.NsNonlinearFarisLavine.nsSquareComparison_relBound
import Definitions.Def_ChapterYangMillsHermite
import Definitions.Def_ChapterFarisLavine
import Definitions.Def_ChapterA4
import Mathlib
import Definitions.Def_ChapterNsNonlinearFarisLavine
import Definitions.Def_ChapterHermiteProductCore
import Definitions.Def_ChapterNsKoopman
open BookProof.HermiteProductCore
open MvPolynomial
open BookProof.HermiteProductCore BookProof.YangMillsHermite BookProof.FarisLavine
open BookProof.NsKoopman
noncomputable section
variable {d : ℕ} (S : NsSystem d)Formal statement
theorem BookProof.NsNonlinearFarisLavine.nsSquareComparison_relBound (x : polyGaussCore (d := d)) :
‖nsKoopmanOp S x‖ ≤ ‖nsSquareComparison S x‖ + ‖(x : L2d d)‖ := by sorry