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.LinearPMap.compRestricted← LinearPMap.compRestricted (Physlib/Mathematics/ForMathlib/LinearPMap.lean:178): verbatim
- Verified
- 09 Oct 2026
- Axioms
- none listed
- Built on 2
- LinearPMap.sum_applyLinearPMap.sum_apply
- LinearPMap.sumA finite sum of partial linear maps.
sum fand∑ a, f aare equal, but not by definition. Withsum fbothdomainandtoFunare…
- Used by 24
- LinearPMap.adjoint_compRestricted_le_compRestricted_adjointLinearPMap.adjoint_compRestricted_le_compRestricted_adjoint
- LinearPMap.adjoint_pow_le_pow_adjointLinearPMap.adjoint_pow_le_pow_adjoint
- LinearPMap.compRestricted_zeroThe zero map is right-absorbing.
- LinearPMap.IsSymmetric.powLinearPMap.IsSymmetric.pow
- LinearPMap.compRestricted_mono_leftLinearPMap.compRestricted_mono_left
- LinearPMap.neg_compRestrictedLinearPMap.neg_compRestricted
- LinearPMap.mem_compRestricted_domain_iff'LinearPMap.mem_compRestricted_domain_iff'
- LinearPMap.instMonoidLinearPMap.instMonoid
- LinearPMap.compRestricted_negLinearPMap.compRestricted_neg
- LinearPMap.mul_defLinearPMap.mul_def
- LinearPMap.compRestricted_eq_comp
compRestrictedis the same ascompwhen the range ofuis contained inv.domain. - LinearPMap.compRestricted_add_geLinearPMap.compRestricted_add_ge
- LinearPMap.compRestricted_mono_rightLinearPMap.compRestricted_mono_right
- LinearPMap.compRestricted_assocLinearPMap.compRestricted_assoc
- LinearPMap.add_compRestrictedLinearPMap.add_compRestricted
- LinearPMap.mem_domain_of_mem_compRestricted_domainLinearPMap.mem_domain_of_mem_compRestricted_domain
- LinearPMap.compRestricted_sub_geLinearPMap.compRestricted_sub_ge
- LinearPMap.compRestricted_domain_leLinearPMap.compRestricted_domain_le
- LinearPMap.mem_compRestricted_domain_iffLinearPMap.mem_compRestricted_domain_iff
- LinearPMap.compRestricted_applyLinearPMap.compRestricted_apply
- LinearPMap.smul_compRestrictedLinearPMap.smul_compRestricted
- LinearPMap.comp_le_compRestricted
compRestrictedis maximal amongst compositions ofvwith domain restrictions ofu. - LinearPMap.compRestricted_domainLinearPMap.compRestricted_domain
- LinearPMap.compRestricted_smulLinearPMap.compRestricted_smul
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)