`BookProof.FriedrichsSquare.factorRel_quadForm_nonneg` {A : D →ₗ[ℂ] F} {p : F × F} (hp : p ∈ factorRel A) : 0 ≤ (inner ℂ p.1 p.2 : ℂ).re ∧ (inner ℂ p.1 p.2 : ℂ).im = 0
ProvedBookProof.FriedrichsSquare.factorRel_quadForm_nonnegtheoremstimepiece
Prove the following Lean 4 theorem from ChapterFriedrichsSquareFactorization.
BookProof.FriedrichsSquare.factorRel_quadForm_nonneg {A : D →ₗ[ℂ] F} {p : F × F} (hp : p ∈ factorRel A) : 0 ≤ (inner ℂ p.1 p.2 : ℂ).re ∧ (inner ℂ p.1 p.2 : ℂ).im = 0
Formalization note: Lean 4 identifier BookProof.FriedrichsSquare.factorRel_quadForm_nonneg.
Preamble
-- Generated from ChapterFriedrichsSquareFactorization.lean — theorem BookProof.FriedrichsSquare.factorRel_quadForm_nonneg
import Definitions.Def_ChapterFarisLavine
import Definitions.Def_ChapterEsaClosureCore
import Definitions.Def_ChapterClosureUniqueness
import Mathlib
import Definitions.Def_ChapterFriedrichsSquareFactorization
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.factorRel_quadForm_nonneg {A : D →ₗ[ℂ] F} {p : F × F} (hp : p ∈ factorRel A) :
0 ≤ (inner ℂ p.1 p.2 : ℂ).re ∧ (inner ℂ p.1 p.2 : ℂ).im = 0 := by sorry