`BookProof.ClosureUniqueness.mem_adjGraph_iff` {T : D →ₗ[ℂ] F} {p : F × F} : p ∈ adjGraph T ↔ ∀ v : D, (inner ℂ (T v) p.1 : ℂ) = inner ℂ (v : F) p.2

Proved

BookProof.ClosureUniqueness.mem_adjGraph_iff

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

theoremstimepiece

Prove the following Lean 4 theorem from ChapterClosureUniqueness.

BookProof.ClosureUniqueness.mem_adjGraph_iff {T : D →ₗ[ℂ] F} {p : F × F} : p ∈ adjGraph T ↔ ∀ v : D, (inner ℂ (T v) p.1 : ℂ) = inner ℂ (v : F) p.2

Formalization note: Lean 4 identifier BookProof.ClosureUniqueness.mem_adjGraph_iff.

Preamble

-- Generated from ChapterClosureUniqueness.lean — theorem BookProof.ClosureUniqueness.mem_adjGraph_iff
import Definitions.Def_ChapterFarisLavine
import Mathlib
import Definitions.Def_ChapterClosureUniqueness
import Definitions.Def_ChapterEsaClosureCore
open BookProof.EsaClosure
open BookProof.ClosureUniqueness



open BookProof.FarisLavine BookProof.EsaClosure

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

Formal statement

theorem BookProof.ClosureUniqueness.mem_adjGraph_iff {T : D →ₗ[ℂ] F} {p : F × F} :
    p ∈ adjGraph T ↔ ∀ v : D, (inner ℂ (T v) p.1 : ℂ) = inner ℂ (v : F) p.2 := by sorry

View graph