`BookProof.FriedrichsSquare.clGraph_le_adjGraph` {A : D →ₗ[ℂ] F} (hsym : SymmetricOn D A) : clGraph A ≤ adjGraph A

Proved

BookProof.FriedrichsSquare.clGraph_le_adjGraph

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

theoremstimepiece

Prove the following Lean 4 theorem from ChapterFriedrichsSquareFactorization.

BookProof.FriedrichsSquare.clGraph_le_adjGraph {A : D →ₗ[ℂ] F} (hsym : SymmetricOn D A) : clGraph A ≤ adjGraph A

Formalization note: Lean 4 identifier BookProof.FriedrichsSquare.clGraph_le_adjGraph.

Preamble

-- Generated from ChapterFriedrichsSquareFactorization.lean — theorem BookProof.FriedrichsSquare.clGraph_le_adjGraph
import Definitions.Def_ChapterFarisLavine
import Mathlib
import Definitions.Def_ChapterFriedrichsSquareFactorization
import Definitions.Def_ChapterClosureUniqueness
import Definitions.Def_ChapterEsaClosureCore
import Definitions.Def_ChapterFarisLavineCore
open BookProof.ClosureUniqueness
open BookProof.EsaClosure
open BookProof.FriedrichsSquare



open BookProof.FarisLavine BookProof.EsaClosure BookProof.ClosureUniqueness

variable {F : Type*} [NormedAddCommGroup F] [InnerProductSpace ℂ F]
variable {D : Submodule ℂ F}

Formal statement

theorem BookProof.FriedrichsSquare.clGraph_le_adjGraph {A : D →ₗ[ℂ] F} (hsym : SymmetricOn D A) :
    clGraph A ≤ adjGraph A := by sorry

View graph