AFTD Auto-Formalizing Theoretical Domains

KroneckerDelta.finset_sum_smul

theoremverifiedformalizationimported Lean

KroneckerDelta.finset_sum_smul

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open KroneckerDelta in
variable {α M : Type*} [DecidableEq α] in
open Finset in
variable [AddCommMonoid M] in
lemma KroneckerDelta.finset_sum_smul (s : Finset α) (i : α) (f : α → M) :
    ∑ j ∈ s, δ[i,j] • f j = if i ∈ s then f i else 0
Formalizes
Physlib, `KroneckerDelta.finset_sum_smul`
Lean proof
By Gregory J. Loges, from github.com/leanprover-community/physlib at e411c6e89692 (Copyright (c) 2026 Gregory J. Loges. 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 1
Used by 1

Lean source view module on GitHub

set_option quotPrecheck falseopen KroneckerDelta@[inherit_doc]local notation "δ[" i "," j "]" => kroneckerDelta i jset_option autoImplicit true inset_option relaxedAutoImplicit true inopen KroneckerDelta invariable {α M : Type*} [DecidableEq α] inopen Finset invariable [AddCommMonoid M] inlemma KroneckerDelta.finset_sum_smul (s : Finset α) (i : α) (f : α → M) :    ∑ j ∈ s, δ[i,j] • f j = if i ∈ s then f i else 0 := by  simp [kroneckerDelta]
See it in the graphDiscuss this resultChallenge it