`BookProof.SmGaugeConnection.conn_conjTranspose` {g : ℝ} {T : Fin d → Matrix (Fin N) (Fin N) ℂ} {A : Fin d → Fin 3 → ℝ} (hT : ∀ a, (T a)ᴴ = T a) (j : Fin 3) : (conn g T A j)ᴴ = con
ProvedBookProof.SmGaugeConnection.conn_conjTransposetheoremstimepiece
Prove the following Lean 4 theorem from ChapterSmGaugeConnection.
BookProof.SmGaugeConnection.conn_conjTranspose {g : ℝ} {T : Fin d → Matrix (Fin N) (Fin N) ℂ} {A : Fin d → Fin 3 → ℝ} (hT : ∀ a, (T a)ᴴ = T a) (j : Fin 3) : (conn g T A j)ᴴ = conn g T A j
Formalization note: Lean 4 identifier BookProof.SmGaugeConnection.conn_conjTranspose.
Preamble
-- Generated from ChapterSmGaugeConnection.lean — theorem BookProof.SmGaugeConnection.conn_conjTranspose
import Definitions.Def_ChapterYangMillsSU3
import Definitions.Def_ChapterCPTHamiltonian
import Definitions.Def_ChapterSmCarAlgebra
import Definitions.Def_ChapterSmDiracYukawa
import Definitions.Def_ChapterSmDiracSpinor
import Definitions.Def_ChapterFarisLavine
import Mathlib
import Definitions.Def_ChapterSmGaugeConnection
open BookProof.SmGaugeConnection
open Matrix Kronecker
open BookProof.YangMillsSU3 BookProof.ChapterCPTHamiltonian BookProof.SmCar
open BookProof.SmDiracYukawa BookProof.SmDiracSpinor BookProof.FarisLavine
noncomputable section
variable {N d : ℕ}Formal statement
theorem BookProof.SmGaugeConnection.conn_conjTranspose {g : ℝ} {T : Fin d → Matrix (Fin N) (Fin N) ℂ}
{A : Fin d → Fin 3 → ℝ} (hT : ∀ a, (T a)ᴴ = T a) (j : Fin 3) :
(conn g T A j)ᴴ = conn g T A j := by sorry