`BookProof.SmBrstGhost.sum_delta_right` (M P : Matrix (Fin N) (Fin N) ℂ) : ∑ i : Fin N, ∑ j : Fin N, ∑ k : Fin N, ∑ l : Fin N, (M i j * P k l) • (if l = i then (creat k * annih j :

Proved

BookProof.SmBrstGhost.sum_delta_right

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

theoremstimepiece

Prove the following Lean 4 theorem from ChapterSmBrstGhost.

BookProof.SmBrstGhost.sum_delta_right (M P : Matrix (Fin N) (Fin N) ℂ) : ∑ i : Fin N, ∑ j : Fin N, ∑ k : Fin N, ∑ l : Fin N, (M i j * P k l) • (if l = i then (creat k * annih j : Module.End ℂ (FermiFock N)) else 0) = fermiBilin (P * M)

Formalization note: Lean 4 identifier BookProof.SmBrstGhost.sum_delta_right.

Preamble

-- Generated from ChapterSmBrstGhost.lean — theorem BookProof.SmBrstGhost.sum_delta_right
import Definitions.Def_ChapterBRSTNilpotent
import Definitions.Def_ChapterYangMillsSU3
import Mathlib
import Definitions.Def_ChapterSmBrstGhost
import Definitions.Def_ChapterNavierStokesFockSpace
import Definitions.Def_ChapterSmCarAlgebra
open BookProof.SmCar
open BookProof.SmBrstGhost



open BookProof.SmCar BookProof.BRSTNilpotent BookProof.YangMillsSU3

noncomputable section

variable {m : ℕ}
variable {R : Type*} [Ring R] [Algebra ℝ R] {n : ℕ}
variable {N : ℕ}

Formal statement

theorem BookProof.SmBrstGhost.sum_delta_right (M P : Matrix (Fin N) (Fin N) ℂ) :
    ∑ i : Fin N, ∑ j : Fin N, ∑ k : Fin N, ∑ l : Fin N,
        (M i j * P k l) • (if l = i then (creat k * annih j : Module.End ℂ (FermiFock N)) else 0)
      = fermiBilin (P * M) := by sorry

View graph