AFTD Auto-Formalizing Theoretical Domains

LinearPMap.compRestricted

defimported Lean

g ∘ᵣ f is the composition of g with f restricted to a domain consisting of exactly those x : f.domain for which f x ∈ g.domain.

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 {G : Type*} [AddCommGroup G] [Module R G] in
variable (g g₁ g₂ : F →ₗ.[R] G) (f f₁ f₂ : E →ₗ.[R] F) in
variable {v : F →ₗ.[R] G} {u : E →ₗ.[R] F} in
def LinearPMap.compRestricted : E →ₗ.[R] G
Defined in
Physlib, `LinearPMap.compRestricted`
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 2
  • LinearPMap.sum_applyLinearPMap.sum_apply
  • 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 24

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 {G : Type*} [AddCommGroup G] [Module R G] in
variable (g g₁ g₂ : F →ₗ.[R] G) (f f₁ f₂ : E →ₗ.[R] F) in
variable {v : F →ₗ.[R] G} {u : E →ₗ.[R] F} in
/-- `g ∘ᵣ f` is the composition of `g` with `f` restricted to a domain consisting of exactly those `x : f.domain` for which `f x ∈ g.domain`. -/
def LinearPMap.compRestricted : E →ₗ.[R] G :=
  g.comp (f.domRestrict <| (g.domain.comap f.toFun).map f.domain.subtype) (by
    intro x
    have h : (x : E) ∈ (g.domain.comap f.toFun).map f.domain.subtype := x.2.1
    simp only [mem_map, mem_comap, toFun_eq_coe, subtype_apply] at h
    obtain ⟨y, hy, hy'⟩ := h
    rw [domRestrict_apply hy'.symm]
    exact hy)
See it in the graphDiscuss this resultChallenge it