(hκ : ∀ i, 0 ≤ κ i) (i : Fin d) (g : Occ d → ℂ) (β : Occ d) : (modeData hκ i).hop g β = if 2 ≤ β i then g (dn i (dn i β)) else 0
ProvedBookProof.NavierStokesFlow.FockCanonical.hop_modeData_eqnavier-stokesoperator-algebrastimepiece
Lean 4 theorem BookProof.NavierStokesFlow.FockCanonical.hop_modeData_eq (module BookProof.NavierStokesFlow), source chapter BookProof/ChapterNavierStokesFlow.lean.
Preamble
-- Generated from ChapterNavierStokesFockCanonical.lean — theorem BookProof.NavierStokesFlow.FockCanonical.hop_modeData_eq
import Mathlib
import Definitions.Def_ChapterNavierStokesFockCanonical
import Definitions.Def_ChapterFockSecondQuantization
import Definitions.Def_ChapterNavierStokesFockManyMode
import Definitions.Def_ChapterNavierStokesShiftHamiltonian
import Definitions.Def_ChapterStoneResolvent
import Definitions.Def_ChapterNavierStokesAffineFiberEsa
open BookProof.FockSecondQuantization
open BookProof.NavierStokesFlow
open BookProof.NavierStokesFlow
open BookProof.NavierStokesFlow.ShiftHamiltonian.ShiftData
open BookProof.NavierStokesFlow
open BookProof.NavierStokesFlow.FockCanonical
variable {d : ℕ} {κ : Fin d → ℝ}
open scoped ENNReal
open LpNat BookProof.FarisLavine IkebeKato ShiftHamiltonian FockManyMode HermiteCanonicalFormal statement
theorem BookProof.NavierStokesFlow.FockCanonical.hop_modeData_eq (hκ : ∀ i, 0 ≤ κ i) (i : Fin d) (g : Occ d → ℂ) (β : Occ d) :
(modeData hκ i).hop g β = if 2 ≤ β i then g (dn i (dn i β)) else 0 := by sorrySource