AFTD Auto-Formalizing Theoretical Domains

LinearPMap.sum

defimported Lean

A 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 made explicit.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true 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
def LinearPMap.sum : E →ₗ.[R] F
Defined in
Physlib, `LinearPMap.sum`
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
none listed
Used by 6

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true 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
/-- A 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 made explicit. -/
def LinearPMap.sum : E →ₗ.[R] F where
  domain := ⨅ a, (f a).domain
  toFun := ∑ a, (f a).toFun ∘ₗ inclusion (fun _ _ ↦ by simp_all only [mem_iInf])
See it in the graphDiscuss this resultChallenge it