`BookProof.FriedrichsSquare.mem_flipGraph_iff` {A : D →ₗ[ℂ] F} {p : WithLp 2 (F × F)} : p ∈ flipGraph A ↔ ((WithLp.ofLp p).2, -(WithLp.ofLp p).1) ∈ clGraph A

Proved

BookProof.FriedrichsSquare.mem_flipGraph_iff

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

theoremstimepiece

Prove the following Lean 4 theorem from ChapterFriedrichsSquareFactorization.

BookProof.FriedrichsSquare.mem_flipGraph_iff {A : D →ₗ[ℂ] F} {p : WithLp 2 (F × F)} : p ∈ flipGraph A ↔ ((WithLp.ofLp p).2, -(WithLp.ofLp p).1) ∈ clGraph A

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

Preamble

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



open BookProof.FarisLavine BookProof.EsaClosure BookProof.ClosureUniqueness

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

variable [CompleteSpace F]

Formal statement

theorem BookProof.FriedrichsSquare.mem_flipGraph_iff {A : D →ₗ[ℂ] F} {p : WithLp 2 (F × F)} :
    p ∈ flipGraph A ↔ ((WithLp.ofLp p).2, -(WithLp.ofLp p).1) ∈ clGraph A := by sorry

View graph