AFTD Auto-Formalizing Theoretical Domains

SMRHN.sum_familyUniversal

theoremverifiedformalizationimported Lean

SMRHN.sum_familyUniversal

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open SMνCharges in
open BigOperators in
set_option backward.isDefEq.respectTransparency false in
lemma SMRHN.sum_familyUniversal {n : ℕ} (m : ℕ) (S : (SMνCharges 1).Charges) (j : Fin 6) :
    ∑ i, ((fun a => a ^ m) ∘ toSpecies j (familyUniversal n S)) i =
    n * (toSpecies j S ⟨0, by simp⟩) ^ m
Formalizes
Physlib, `SMRHN.sum_familyUniversal`
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 14
Used by 3

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true inopen SMνCharges inopen BigOperators inset_option backward.isDefEq.respectTransparency false inlemma SMRHN.sum_familyUniversal {n : ℕ} (m : ℕ) (S : (SMνCharges 1).Charges) (j : Fin 6) :    ∑ i, ((fun a => a ^ m) ∘ toSpecies j (familyUniversal n S)) i =    n * (toSpecies j S ⟨0, by simp⟩) ^ m := by  simp only [Function.comp_apply, toSpecies_apply, toSpeciesEquiv_apply,    Fin.zero_eta, Fin.isValue, Nat.reduceMul]  have h1 : (n : ℚ) * (toSpecies j S ⟨0, by simp⟩) ^ m =      ∑ _i : Fin n, (toSpecies j S ⟨0, by simp⟩) ^ m := by    rw [Fin.sum_const]    simp  erw [h1]  refine Finset.sum_congr rfl (fun i _ => ?_)  erw [toSpecies_familyUniversal]
See it in the graphDiscuss this resultChallenge it