AFTD Auto-Formalizing Theoretical Domains

SMACCs.accSU2_ext

theoremverifiedformalizationimported Lean

Extensionality lemma for accSU2.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open SMACCs in
open Nat in
open BigOperators in
open SMCharges in
variable {n : ℕ} in
set_option backward.isDefEq.respectTransparency false in
lemma SMACCs.accSU2_ext {S T : (SMCharges n).Charges}
    (hj : ∀ (j : Fin 5), ∑ i, (toSpecies j) S i = ∑ i, (toSpecies j) T i) :
    accSU2 S = accSU2 T
Formalizes
Physlib, `SMACCs.accSU2_ext`
Lean proof
By Joseph Tooby-Smith, from github.com/leanprover-community/physlib at e411c6e89692 (Copyright (c) 2024 Joseph Tooby-Smith. All rights reserved, Apache-2.0). Compiled here against leanprover/lean4:v4.33.1, Mathlib v4.33.1; written for leanprover/lean4:v4.34.1.
Verified
09 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 13
Used by 1

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true inopen SMACCs inopen Nat inopen BigOperators inopen SMCharges invariable {n : ℕ} inset_option backward.isDefEq.respectTransparency false in/-- Extensionality lemma for `accSU2`. -/lemma SMACCs.accSU2_ext {S T : (SMCharges n).Charges}    (hj : ∀ (j : Fin 5), ∑ i, (toSpecies j) S i = ∑ i, (toSpecies j) T i) :    accSU2 S = accSU2 T := by  simp only [accSU2, toSpecies_apply, Fin.isValue, LinearMap.coe_mk,    AddHom.coe_mk]  repeat rw [Finset.sum_add_distrib]  repeat rw [← Finset.mul_sum]  exact Mathlib.Tactic.LinearCombination.add_eq_eq (congrArg (HMul.hMul 3) (hj 0)) (hj 3)
See it in the graphDiscuss this resultChallenge it