`BookProof.HermiteLadder.hamPolyL_eq` (S : Finset (Fin d)) (q : MvPolynomial (Fin d) ℂ) : hamPolyL S q = -(∑ j ∈ S, coreDL j ∘ₗ coreDL j) + mulL q
ProvedBookProof.HermiteLadder.hamPolyL_eqtheoremstimepiece
Prove the following Lean 4 theorem from ChapterHermiteLadderOrder.
BookProof.HermiteLadder.hamPolyL_eq (S : Finset (Fin d)) (q : MvPolynomial (Fin d) ℂ) : hamPolyL S q = -(∑ j ∈ S, coreDL j ∘ₗ coreDL j) + mulL q
Formalization note: Lean 4 identifier BookProof.HermiteLadder.hamPolyL_eq.
Preamble
-- Generated from ChapterHermiteLadderOrder.lean — theorem BookProof.HermiteLadder.hamPolyL_eq
import Definitions.Def_ChapterHermiteProductCore
import Definitions.Def_ChapterHermiteProductBasis
import Definitions.Def_ChapterQgHermiteCore
import Definitions.Def_ChapterDegSchrodingerCore
import Mathlib
import Definitions.Def_ChapterHermiteLadderOrder
import Definitions.Def_ChapterQgHermiteFriedrichs
import Definitions.Def_ChapterFockWeightedSchurEsa
import Definitions.Def_ChapterGaussCoreQuadBounds
import Definitions.Def_ChapterHermiteLadderShift
open BookProof.QgHermiteFriedrichs
open BookProof.HermiteLadder
open MeasureTheory MvPolynomial
open BookProof.HermiteProductCore BookProof.HermiteProductBasis
open BookProof.QgHermiteCore BookProof.QgHermiteFriedrichs BookProof.DegSchrodinger
open scoped ENNReal
noncomputable section
variable {d : ℕ}Formal statement
theorem BookProof.HermiteLadder.hamPolyL_eq (S : Finset (Fin d)) (q : MvPolynomial (Fin d) ℂ) :
hamPolyL S q = -(∑ j ∈ S, coreDL j ∘ₗ coreDL j) + mulL q := by sorry