`BookProof.RelationShiftInvert.unitaryU_mem_relDomain` (hT : IsNonnegSelfAdjoint T) (hsv : ∀ w : F, ((0 : F), w) ∈ T → w = 0) (x : relDomain T) (t : ℝ) : unitaryU hT hsv t (x : F)
ProvedBookProof.RelationShiftInvert.unitaryU_mem_relDomaintheoremstimepiece
Prove the following Lean 4 theorem from ChapterRelationShiftInvert.
BookProof.RelationShiftInvert.unitaryU_mem_relDomain (hT : IsNonnegSelfAdjoint T) (hsv : ∀ w : F, ((0 : F), w) ∈ T → w = 0) (x : relDomain T) (t : ℝ) : unitaryU hT hsv t (x : F) ∈ relDomain T
Formalization note: Lean 4 identifier BookProof.RelationShiftInvert.unitaryU_mem_relDomain.
Preamble
-- Generated from ChapterRelationShiftInvert.lean — theorem BookProof.RelationShiftInvert.unitaryU_mem_relDomain
import Definitions.Def_ChapterPositiveSquareRootUnique
import Definitions.Def_ChapterNonnegSquareRoot
import Definitions.Def_ChapterNonnegResolvent
import Definitions.Def_ChapterNonnegUnitaryGroup
import Definitions.Def_ChapterComplexShiftCore
import Mathlib
import Definitions.Def_ChapterRelationShiftInvert
open BookProof.PositiveSquareRoot
open BookProof.HashimotoShiftInvert
open BookProof.NonnegUnitaryGroup
variable {F : Type*} [NormedAddCommGroup F] [InnerProductSpace ℂ F] [CompleteSpace F]
variable {T T₁ T₂ : Submodule ℂ (F × F)}Formal statement
theorem BookProof.RelationShiftInvert.unitaryU_mem_relDomain (hT : IsNonnegSelfAdjoint T)
(hsv : ∀ w : F, ((0 : F), w) ∈ T → w = 0) (x : relDomain T) (t : ℝ) :
unitaryU hT hsv t (x : F) ∈ relDomain T := by sorry