AFTD Auto-Formalizing Theoretical Domains

LinearPMap.sum_apply

theoremverifiedformalizationimported Lean

LinearPMap.sum_apply

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open LinearPMap in
open Submodule in
variable {R : Type*} [Ring R] in
variable {E : Type*} [AddCommGroup E] [Module R E] in
variable {F : Type*} [AddCommGroup F] [Module R F] in
variable {α : Type*} [Fintype α] (f : α → E →ₗ.[R] F) in
@[simp]
lemma LinearPMap.sum_apply (ψ : (sum f).domain) : sum f ψ = ∑ a, f a ⟨ψ, sum_domain_le f a ψ.2⟩
Formalizes
Physlib, `LinearPMap.sum_apply`
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 2
  • LinearPMap.sum_domain_leLinearPMap.sum_domain_le
  • LinearPMap.sumA finite sum of partial linear maps. sum f and ∑ a, f a are equal, but not by definition. With sum f both domain and toFun are…
Used by 27

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open LinearPMap in
open Submodule in
variable {R : Type*} [Ring R] in
variable {E : Type*} [AddCommGroup E] [Module R E] in
variable {F : Type*} [AddCommGroup F] [Module R F] in
variable {α : Type*} [Fintype α] (f : α → E →ₗ.[R] F) in
@[simp]
lemma LinearPMap.sum_apply (ψ : (sum f).domain) : sum f ψ = ∑ a, f a ⟨ψ, sum_domain_le f a ψ.2⟩ :=
  LinearMap.sum_apply Finset.univ (fun a ↦ (f a).toFun ∘ₗ inclusion (sum_domain_le f a)) ψ
See it in the graphDiscuss this resultChallenge it