`BookProof.ClosureUniqueness.factorGraph_quadForm_nonneg` {A : D →ₗ[ℂ] F} {p : F × F} (hp : p ∈ factorGraph A) : 0 ≤ (inner ℂ p.1 p.2 : ℂ).re ∧ (inner ℂ p.1 p.2 : ℂ).im = 0

Initializing...

`BookProof.ClosureUniqueness.factorGraph_quadForm_nonneg` {A : D →ₗ[ℂ] F} {p : F × F} (hp : p ∈ factorGraph A) : 0 ≤ (inner ℂ p.1 p.2 : ℂ).re ∧ (inner ℂ p.1 p.2 : ℂ).im = 0 · Prove2Me