`BookProof.FriedrichsCanonical.resolvent_mem_friedrichsDomain` (P : PosSymOp F) (u : F) : friedrichsResolvent P u ∈ friedrichsDomain P
ProvedBookProof.FriedrichsCanonical.resolvent_mem_friedrichsDomaintheoremstimepiece
Prove the following Lean 4 theorem from ChapterFriedrichsCanonical.
BookProof.FriedrichsCanonical.resolvent_mem_friedrichsDomain (P : PosSymOp F) (u : F) : friedrichsResolvent P u ∈ friedrichsDomain P
Formalization note: Lean 4 identifier BookProof.FriedrichsCanonical.resolvent_mem_friedrichsDomain.
Preamble
-- Generated from ChapterFriedrichsCanonical.lean — theorem BookProof.FriedrichsCanonical.resolvent_mem_friedrichsDomain
import Definitions.Def_ChapterFarisLavine
import Definitions.Def_ChapterYangMillsFriedrichs
import Definitions.Def_ChapterComplexShiftCore
import Mathlib
import Definitions.Def_ChapterFriedrichsCanonical
import Definitions.Def_ChapterFriedrichsExtension
open BookProof.FriedrichsExtension
open BookProof.FriedrichsExtension.FormDom
open BookProof.FriedrichsCanonical
open BookProof.FarisLavine BookProof.YangMillsFriedrichs BookProof.HashimotoShiftInvert
open BookProof.FriedrichsExtension BookProof.FriedrichsExtension.FormDom
noncomputable section
variable {F : Type*} [NormedAddCommGroup F] [InnerProductSpace ℂ F] [CompleteSpace F]Formal statement
theorem BookProof.FriedrichsCanonical.resolvent_mem_friedrichsDomain (P : PosSymOp F) (u : F) :
friedrichsResolvent P u ∈ friedrichsDomain P := by sorry