`BookProof.FriedrichsCanonical.exists_formExt_eq` {P : PosSymOp F} {v : F} (hv : v ∈ formDomain P) : ∃ k : FormSpace P, formExt P k = v
ProvedBookProof.FriedrichsCanonical.exists_formExt_eqtheoremstimepiece
Prove the following Lean 4 theorem from ChapterFriedrichsCanonical.
BookProof.FriedrichsCanonical.exists_formExt_eq {P : PosSymOp F} {v : F} (hv : v ∈ formDomain P) : ∃ k : FormSpace P, formExt P k = v
Formalization note: Lean 4 identifier BookProof.FriedrichsCanonical.exists_formExt_eq.
Preamble
-- Generated from ChapterFriedrichsCanonical.lean — theorem BookProof.FriedrichsCanonical.exists_formExt_eq
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.exists_formExt_eq {P : PosSymOp F} {v : F} (hv : v ∈ formDomain P) :
∃ k : FormSpace P, formExt P k = v := by sorry