LinearPMap.neg_compRestricted
theoremverifiedformalizationimported Lean
LinearPMap.neg_compRestricted
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 @[simp] lemma LinearPMap.neg_compRestricted : (-g) ∘ᵣ f = -g ∘ᵣ f
- Formalizes
- Physlib, `LinearPMap.neg_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.neg_compRestricted← LinearPMap.neg_compRestricted (Physlib/Mathematics/ForMathlib/LinearPMap.lean:265): verbatim
- Verified
- 09 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 2
- LinearPMap.compRestricted
g ∘ᵣ fis the composition ofgwithfrestricted to a domain consisting of exactly thosex : f.domainfor whichf x ∈ g.domain. - LinearPMap.sum_applyLinearPMap.sum_apply
- LinearPMap.compRestricted
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 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 @[simp] lemma LinearPMap.neg_compRestricted : (-g) ∘ᵣ f = -g ∘ᵣ f := rfl