Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

`BookProof.FriedrichsCanonical.friedrichs_unique_selfAdjoint` (P : PosSymOp F) (hdense : Dense (P.dom : Set F)) {Dom' : Submodule ℂ F} (A' : Dom' →ₗ[ℂ] F) (hA' : IsPositiveSelfAdjo

Proved
BookProof.FriedrichsCanonical.friedrichs_unique_selfAdjoint

by leonardopedro · Oct 17, 2026 · Mathlib 0df444a (Lean v4.33.1)

theoremstimepiece

Prove the following Lean 4 theorem from ChapterFriedrichsCanonical.

BookProof.FriedrichsCanonical.friedrichs_unique_selfAdjoint (P : PosSymOp F) (hdense : Dense (P.dom : Set F)) {Dom' : Submodule ℂ F} (A' : Dom' →ₗ[ℂ] F) (hA' : IsPositiveSelfAdjointExtension P.op A') (hform : Dom' ≤ formDomain P) : Dom' = friedrichsDomain P ∧ ∀ (x : F) (hx : x ∈ Dom') (hx' : x ∈ friedrichsDomain P), A' ⟨x, hx⟩ = friedrichsOp P hdense ⟨x, hx'⟩

Formalization note: Lean 4 identifier BookProof.FriedrichsCanonical.friedrichs_unique_selfAdjoint.

Preamble
-- Generated from ChapterFriedrichsCanonical.lean — theorem BookProof.FriedrichsCanonical.friedrichs_unique_selfAdjoint
import Definitions.Def_ChapterFarisLavine
import Definitions.Def_ChapterComplexShiftCore
import Mathlib
import Definitions.Def_ChapterFriedrichsCanonical
import Definitions.Def_ChapterFarisLavineCore
import Definitions.Def_ChapterFriedrichsExtension
import Definitions.Def_ChapterYangMillsFriedrichs
open BookProof.FriedrichsExtension
open BookProof.FriedrichsExtension.FormDom
open BookProof.YangMillsFriedrichs
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.friedrichs_unique_selfAdjoint (P : PosSymOp F) (hdense : Dense (P.dom : Set F))
    {Dom' : Submodule ℂ F} (A' : Dom' →ₗ[ℂ] F)
    (hA' : IsPositiveSelfAdjointExtension P.op A') (hform : Dom' ≤ formDomain P) :
    Dom' = friedrichsDomain P ∧
      ∀ (x : F) (hx : x ∈ Dom') (hx' : x ∈ friedrichsDomain P),
        A' ⟨x, hx⟩ = friedrichsOp P hdense ⟨x, hx'⟩ := by sorry

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me