CreateAnnihilate.sum_eq
theoremverifiedformalizationimported Lean
CreateAnnihilate.sum_eq
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in lemma CreateAnnihilate.sum_eq {M : Type} [AddCommMonoid M] (f : CreateAnnihilate → M) : ∑ i, f i = f create + f annihilate
- Formalizes
- Physlib, `CreateAnnihilate.sum_eq`
- Lean proof
- By Joseph Tooby-Smith, from github.com/leanprover-community/physlib at
e411c6e89692(Copyright (c) 2025 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.CreateAnnihilate.sum_eq← CreateAnnihilate.sum_eq (Physlib/QFT/PerturbationTheory/CreateAnnihilate.lean:67): verbatim
- Verified
- 10 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 5
- CreateAnnihilate.instIsTransNormalOrderNormal ordering is transitive.
- CreateAnnihilate.not_normalOrder_annihilate_iff_falseCreateAnnihilate.not_normalOrder_annihilate_iff_false
- CreateAnnihilateThe type
CreateAnnihilateis the type containing two elementscreateandannihilate. This type is used to specify if an operator is… - CreateAnnihilate.instDecidableNormalOrderThe normal ordering on
CreateAnnihilateis decidable. - CreateAnnihilate.instFintypeThe type
CreateAnnihilateis finite.
Lean source view module on GitHub
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
set_option autoImplicit true inset_option relaxedAutoImplicit true inlemma CreateAnnihilate.sum_eq {M : Type} [AddCommMonoid M] (f : CreateAnnihilate → M) : ∑ i, f i = f create + f annihilate := by change ∑ i ∈ {create, annihilate}, f i = f create + f annihilate simp