`BookProof.ClosureUniqueness.factorGraph_symmetric` {A : D →ₗ[ℂ] F} {p q : F × F} (hp : p ∈ factorGraph A) (hq : q ∈ factorGraph A) : (inner ℂ p.2 q.1 : ℂ) = inner ℂ p.1 q.2

Initializing...

`BookProof.ClosureUniqueness.factorGraph_symmetric` {A : D →ₗ[ℂ] F} {p q : F × F} (hp : p ∈ factorGraph A) (hq : q ∈ factorGraph A) : (inner ℂ p.2 q.1 : ℂ) = inner ℂ p.1 q.2 · Prove2Me