AFTD Auto-Formalizing Theoretical Domains

LinearPMap.instMonoid

instanceimported Lean

LinearPMap.instMonoid

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
instance LinearPMap.instMonoid : Monoid (E →ₗ.[R] E)
Defined in
Physlib, `LinearPMap.instMonoid`
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
Built on 4
Used by 20

Lean source view module on GitHub

set_option quotPrecheck false
open LinearPMap
@[inherit_doc compRestricted]
local infixr:80 " ∘ᵣ " => compRestricted

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
instance LinearPMap.instMonoid : Monoid (E →ₗ.[R] E) where
  mul := compRestricted
  mul_assoc := compRestricted_assoc
  one := ⟨⊤, topEquiv.toLinearMap⟩
  one_mul f := by
    change ⟨⊤, topEquiv.toLinearMap⟩ ∘ᵣ f = f
    ext
    · simp [mem_compRestricted_domain_iff]
    · rfl
  mul_one f := by
    change f ∘ᵣ ⟨⊤, topEquiv.toLinearMap⟩ = f
    ext
    · simp [mem_compRestricted_domain_iff]
    · rfl
See it in the graphDiscuss this resultChallenge it