Linear algebra #
This file defines the basics of linear algebra. It sets up the "categorical/lattice structure" of modules over a ring, submodules, and linear maps.
Many of the relevant definitions, including module, submodule, and linear_map, are found in
src/algebra/module.
Main definitions #
- Many constructors for linear maps
submodule.span sis defined to be the smallest submodule containing the sets.- If
pis a submodule ofM,submodule.quotient pis the quotient ofMwith respect top: that is, elements ofMare identified if their difference is inp. This is itself a module. - The kernel
kerand rangerangeof a linear map are submodules of the domain and codomain respectively. - The general linear group is defined to be the group of invertible linear maps from
Mto itself.
Main statements #
- The first, second and third isomorphism laws for modules are proved as
linear_map.quot_ker_equiv_range,linear_map.quotient_inf_equiv_sup_quotientandsubmodule.quotient_quotient_equiv_quotient.
Notations #
- We continue to use the notation
M →ₗ[R] M₂for the type of linear maps fromMtoM₂over the ringR. - We introduce the notations
M ≃ₗ M₂andM ≃ₗ[R] M₂forlinear_equiv M M₂. In the first, the ringRis implicit. - We introduce the notation
R ∙ vfor the span of a singleton,submodule.span R {v}. This is\., not the same as the scalar multiplication•/\bub.
Implementation notes #
We note that, when constructing linear maps, it is convenient to use operations defined on bundled
maps (linear_map.prod, linear_map.coprod, arithmetic operations like +) instead of defining a
function and proving it is linear.
Tags #
linear algebra, vector space, module
theorem
finsupp.smul_sum
{α : Type u}
{β : Type v}
{R : Type w}
{M : Type y}
[has_zero β]
[monoid R]
[add_comm_monoid M]
[distrib_mul_action R M]
{v : α →₀ β}
{c : R}
{h : α → β → M} :
@[simp]
@[simp]
theorem
finsupp.linear_equiv_fun_on_fintype_apply
(R : Type u)
{M : Type v}
{α : Type u_1}
[fintype α]
[add_comm_monoid M]
[semiring R]
[module R M]
(x : α →₀ M)
(ᾰ : α) :
⇑(finsupp.linear_equiv_fun_on_fintype R) x ᾰ = ⇑x ᾰ
def
finsupp.linear_equiv_fun_on_fintype
(R : Type u)
{M : Type v}
{α : Type u_1}
[fintype α]
[add_comm_monoid M]
[semiring R]
[module R M] :
Given fintype α, linear_equiv_fun_on_fintype R is the natural R-linear equivalence between
α →₀ β and α → β.
Equations
- finsupp.linear_equiv_fun_on_fintype R = {to_fun := coe_fn finsupp.has_coe_to_fun, map_add' := _, map_smul' := _, inv_fun := finsupp.equiv_fun_on_fintype.inv_fun, left_inv := _, right_inv := _}
@[simp]
theorem
finsupp.linear_equiv_fun_on_fintype_single
(R : Type u)
{M : Type v}
{α : Type u_1}
[decidable_eq α]
[fintype α]
[add_comm_monoid M]
[semiring R]
[module R M]
(x : α)
(m : M) :
⇑(finsupp.linear_equiv_fun_on_fintype R) (finsupp.single x m) = pi.single x m
@[simp]
theorem
finsupp.linear_equiv_fun_on_fintype_symm_single
(R : Type u)
{M : Type v}
{α : Type u_1}
[decidable_eq α]
[fintype α]
[add_comm_monoid M]
[semiring R]
[module R M]
(x : α)
(m : M) :
⇑((finsupp.linear_equiv_fun_on_fintype R).symm) (pi.single x m) = finsupp.single x m
Properties of linear maps #
theorem
linear_map.comp_assoc
{R : Type u}
{M : Type v}
{M₂ : Type w}
{M₃ : Type y}
{M₄ : Type z}
[semiring R]
[add_comm_monoid M]
[add_comm_monoid M₂]
[add_comm_monoid M₃]
[add_comm_monoid M₄]
[module R M]
[module R M₂]
[module R M₃]
[module R M₄]
(f : M →ₗ[R] M₂)
(g : M₂ →ₗ[R] M₃)
(h : M₃ →ₗ[R] M₄) :
def
linear_map.dom_restrict
{R : Type u}
{M : Type v}
{M₂ : Type w}
[semiring R]
[add_comm_monoid M]
[add_comm_monoid M₂]
[module R M]
[module R M₂]
(f : M →ₗ[R] M₂)
(p : submodule R M) :
The restriction of a linear map f : M → M₂ to a submodule p ⊆ M gives a linear map
p → M₂.
Equations
- f.dom_restrict p = f.comp p.subtype
@[simp]
theorem
linear_map.dom_restrict_apply
{R : Type u}
{M : Type v}
{M₂ : Type w}
[semiring R]
[add_comm_monoid M]
[add_comm_monoid M₂]
[module R M]
[module R M₂]
(f : M →ₗ[R] M₂)
(p : submodule R M)
(x : ↥p) :
⇑(f.dom_restrict p) x = ⇑f ↑x
def
linear_map.cod_restrict
{R : Type u}
{M : Type v}
{M₂ : Type w}
[semiring R]
[add_comm_monoid M]
[add_comm_monoid M₂]
[module R M]
[module R M₂]
(p : submodule R M)
(f : M₂ →ₗ[R] M)
(h : ∀ (c : M₂), ⇑f c ∈ p) :
A linear map f : M₂ → M whose values lie in a submodule p ⊆ M can be restricted to a
linear map M₂ → p.
@[simp]
theorem
linear_map.cod_restrict_apply
{R : Type u}
{M : Type v}
{M₂ : Type w}
[semiring R]
[add_comm_monoid M]
[add_comm_monoid M₂]
[module R M]
[module R M₂]
(p : submodule R M)
(f : M₂ →ₗ[R] M)
{h : ∀ (c : M₂), ⇑f c ∈ p}
(x : M₂) :
↑(⇑(linear_map.cod_restrict p f h) x) = ⇑f x
@[simp]
theorem
linear_map.comp_cod_restrict
{R : Type u}
{M : Type v}
{M₂ : Type w}
{M₃ : Type y}
[semiring R]
[add_comm_monoid M]
[add_comm_monoid M₂]
[add_comm_monoid M₃]
[module R M]
[module R M₂]
[module R M₃]
(f : M →ₗ[R] M₂)
(p : submodule R M₂)
(h : ∀ (b : M), ⇑f b ∈ p)
(g : M₃ →ₗ[R] M) :
(linear_map.cod_restrict p f h).comp g = linear_map.cod_restrict p (f.comp g) _
@[simp]
theorem
linear_map.subtype_comp_cod_restrict
{R : Type u}
{M : Type v}
{M₂ : Type w}
[semiring R]
[add_comm_monoid M]
[add_comm_monoid M₂]
[module R M]
[module R M₂]
(f : M →ₗ[R] M₂)
(p : submodule R M₂)
(h : ∀ (b : M), ⇑f b ∈ p) :
p.subtype.comp (linear_map.cod_restrict p f h) = f
def
linear_map.restrict
{R : Type u}
{M : Type v}
[semiring R]
[add_comm_monoid M]
[module R M]
(f : M →ₗ[R] M)
{p : submodule R M}
(hf : ∀ (x : M), x ∈ p → ⇑f x ∈ p) :
Restrict domain and codomain of an endomorphism.
Equations
- f.restrict hf = linear_map.cod_restrict p (f.dom_restrict p) _
theorem
linear_map.restrict_eq_cod_restrict_dom_restrict
{R : Type u}
{M : Type v}
[semiring R]
[add_comm_monoid M]
[module R M]
{f : M →ₗ[R] M}
{p : submodule R M}
(hf : ∀ (x : M), x ∈ p → ⇑f x ∈ p) :
f.restrict hf = linear_map.cod_restrict p (f.dom_restrict p) _
theorem
linear_map.restrict_eq_dom_restrict_cod_restrict
{R : Type u}
{M : Type v}
[semiring R]
[add_comm_monoid M]
[module R M]
{f : M →ₗ[R] M}
{p : submodule R M}
(hf : ∀ (x : M), ⇑f x ∈ p) :
f.restrict _ = (linear_map.cod_restrict p f hf).dom_restrict p
@[instance]
def
linear_map.has_zero
{R : Type u}
{M : Type v}
{M₂ : Type w}
[semiring R]
[add_comm_monoid M]
[add_comm_monoid M₂]
[module R M]
[module R M₂] :
The constant 0 map is linear.
@[instance]
def
linear_map.inhabited
{R : Type u}
{M : Type v}
{M₂ : Type w}
[semiring R]
[add_comm_monoid M]
[add_comm_monoid M₂]
[module R M]
[module R M₂] :
Equations
- linear_map.inhabited = {default := 0}
@[simp]
theorem
linear_map.zero_apply
{R : Type u}
{M : Type v}
{M₂ : Type w}
[semiring R]
[add_comm_monoid M]
[add_comm_monoid M₂]
[module R M]
[module R M₂]
(x : M) :
@[simp]
theorem
linear_map.default_def
{R : Type u}
{M : Type v}
{M₂ : Type w}
[semiring R]
[add_comm_monoid M]
[add_comm_monoid M₂]
[module R M]
[module R M₂] :
@[instance]
def
linear_map.unique_of_left
{R : Type u}
{M : Type v}
{M₂ : Type w}
[semiring R]
[add_comm_monoid M]
[add_comm_monoid M₂]
[module R M]
[module R M₂]
[subsingleton M] :
Equations
- linear_map.unique_of_left = {to_inhabited := {default := default (M →ₗ[R] M₂) linear_map.inhabited}, uniq := _}
@[instance]
def
linear_map.unique_of_right
{R : Type u}
{M : Type v}
{M₂ : Type w}
[semiring R]
[add_comm_monoid M]
[add_comm_monoid M₂]
[module R M]
[module R M₂]
[subsingleton M₂] :
@[instance]
def
linear_map.has_add
{R : Type u}
{M : Type v}
{M₂ : Type w}
[semiring R]
[add_comm_monoid M]
[add_comm_monoid M₂]
[module R M]
[module R M₂] :
The sum of two linear maps is linear.
@[simp]
theorem
linear_map.add_apply
{R : Type u}
{M : Type v}
{M₂ : Type w}
[semiring R]
[add_comm_monoid M]
[add_comm_monoid M₂]
[module R M]
[module R M₂]
(f g : M →ₗ[R] M₂)
(x : M) :
@[instance]
def
linear_map.add_comm_monoid
{R : Type u}
{M : Type v}
{M₂ : Type w}
[semiring R]
[add_comm_monoid M]
[add_comm_monoid M₂]
[module R M]
[module R M₂] :
add_comm_monoid (M →ₗ[R] M₂)
The type of linear maps is an additive monoid.
Equations
- linear_map.add_comm_monoid = {add := has_add.add linear_map.has_add, add_assoc := _, zero := 0, zero_add := _, add_zero := _, nsmul := λ (n : ℕ) (f : M →ₗ[R] M₂), {to_fun := λ (x : M), n • ⇑f x, map_add' := _, map_smul' := _}, nsmul_zero' := _, nsmul_succ' := _, add_comm := _}
def
linear_map.eval_add_monoid_hom
{R : Type u}
{M : Type v}
{M₂ : Type w}
[semiring R]
[add_comm_monoid M]
[add_comm_monoid M₂]
[module R M]
[module R M₂]
(a : M) :
Evaluation of an R-linear map at a fixed a, as an add_monoid_hom.
theorem
linear_map.add_comp
{R : Type u}
{M : Type v}
{M₂ : Type w}
{M₃ : Type y}
[semiring R]
[add_comm_monoid M]
[add_comm_monoid M₂]
[add_comm_monoid M₃]
[module R M]
[module R M₂]
[module R M₃]
(f : M →ₗ[R] M₂)
(g h : M₂ →ₗ[R] M₃) :
theorem
linear_map.comp_add
{R : Type u}
{M : Type v}
{M₂ : Type w}
{M₃ : Type y}
[semiring R]
[add_comm_monoid M]
[add_comm_monoid M₂]
[add_comm_monoid M₃]
[module R M]
[module R M₂]
[module R M₃]
(f g : M →ₗ[R] M₂)
(h : M₂ →ₗ[R] M₃) :
def
linear_map.to_add_monoid_hom'
{R : Type u}
{M : Type v}
{M₂ : Type w}
[semiring R]
[add_comm_monoid M]
[add_comm_monoid M₂]
[module R M]
[module R M₂] :
linear_map.to_add_monoid_hom promoted to an add_monoid_hom
Equations
- linear_map.to_add_monoid_hom' = {to_fun := linear_map.to_add_monoid_hom _inst_7, map_zero' := _, map_add' := _}
theorem
linear_map.sum_apply
{R : Type u}
{M : Type v}
{M₂ : Type w}
{ι : Type x}
[semiring R]
[add_comm_monoid M]
[add_comm_monoid M₂]
[module R M]
[module R M₂]
(t : finset ι)
(f : ι → (M →ₗ[R] M₂))
(b : M) :
def
linear_map.smul_right
{R : Type u}
{M : Type v}
{M₂ : Type w}
[semiring R]
[add_comm_monoid M]
[add_comm_monoid M₂]
[module R M]
[module R M₂]
{S : Type u_1}
[semiring S]
[module R S]
[module S M]
[is_scalar_tower R S M]
(f : M₂ →ₗ[R] S)
(x : M) :
When f is an R-linear map taking values in S, then λb, f b • x is an R-linear map.
@[simp]
theorem
linear_map.coe_smul_right
{R : Type u}
{M : Type v}
{M₂ : Type w}
[semiring R]
[add_comm_monoid M]
[add_comm_monoid M₂]
[module R M]
[module R M₂]
{S : Type u_1}
[semiring S]
[module R S]
[module S M]
[is_scalar_tower R S M]
(f : M₂ →ₗ[R] S)
(x : M) :
⇑(f.smul_right x) = λ (c : M₂), ⇑f c • x
theorem
linear_map.smul_right_apply
{R : Type u}
{M : Type v}
{M₂ : Type w}
[semiring R]
[add_comm_monoid M]
[add_comm_monoid M₂]
[module R M]
[module R M₂]
{S : Type u_1}
[semiring S]
[module R S]
[module S M]
[is_scalar_tower R S M]
(f : M₂ →ₗ[R] S)
(x : M)
(c : M₂) :
⇑(f.smul_right x) c = ⇑f c • x
@[instance]
Equations
- linear_map.has_one = {one := linear_map.id _inst_6}
@[instance]
Equations
- linear_map.has_mul = {mul := linear_map.comp _inst_6}
theorem
linear_map.one_eq_id
{R : Type u}
{M : Type v}
[semiring R]
[add_comm_monoid M]
[module R M] :
theorem
linear_map.mul_eq_comp
{R : Type u}
{M : Type v}
[semiring R]
[add_comm_monoid M]
[module R M]
(f g : M →ₗ[R] M) :
@[simp]
theorem
linear_map.one_apply
{R : Type u}
{M : Type v}
[semiring R]
[add_comm_monoid M]
[module R M]
(x : M) :
theorem
linear_map.coe_one
{R : Type u}
{M : Type v}
[semiring R]
[add_comm_monoid M]
[module R M] :
@[instance]
def
linear_map.module.End.nontrivial
{R : Type u}
{M : Type v}
[semiring R]
[add_comm_monoid M]
[module R M]
[nontrivial M] :
nontrivial (module.End R M)
@[simp]
theorem
linear_map.comp_zero
{R : Type u}
{M : Type v}
{M₂ : Type w}
{M₃ : Type y}
[semiring R]
[add_comm_monoid M]
[add_comm_monoid M₂]
[add_comm_monoid M₃]
[module R M]
[module R M₂]
[module R M₃]
(f : M →ₗ[R] M₂) :
@[simp]
theorem
linear_map.zero_comp
{R : Type u}
{M : Type v}
{M₂ : Type w}
{M₃ : Type y}
[semiring R]
[add_comm_monoid M]
[add_comm_monoid M₂]
[add_comm_monoid M₃]
[module R M]
[module R M₂]
[module R M₃]
(f : M →ₗ[R] M₂) :
@[simp]
theorem
linear_map.coe_fn_sum
{R : Type u}
{M : Type v}
{M₂ : Type w}
[semiring R]
[add_comm_monoid M]
[add_comm_monoid M₂]
[module R M]
[module R M₂]
{ι : Type u_1}
(t : finset ι)
(f : ι → (M →ₗ[R] M₂)) :
@[instance]
Equations
- linear_map.monoid = {mul := has_mul.mul linear_map.has_mul, mul_assoc := _, one := 1, one_mul := _, mul_one := _, npow := npow_rec {mul := has_mul.mul linear_map.has_mul}, npow_zero' := _, npow_succ' := _}
theorem
linear_map.pow_map_zero_of_le
{R : Type u}
{M : Type v}
[semiring R]
[add_comm_monoid M]
[module R M]
{f : module.End R M}
{m : M}
{k l : ℕ}
(hk : k ≤ l)
(hm : ⇑(f ^ k) m = 0) :
theorem
linear_map.commute_pow_left_of_commute
{R : Type u}
{M : Type v}
{M₂ : Type w}
[semiring R]
[add_comm_monoid M]
[add_comm_monoid M₂]
[module R M]
[module R M₂]
{f : M →ₗ[R] M₂}
{g : module.End R M}
{g₂ : module.End R M₂}
(h : linear_map.comp g₂ f = f.comp g)
(k : ℕ) :
linear_map.comp (g₂ ^ k) f = f.comp (g ^ k)
theorem
linear_map.submodule_pow_eq_zero_of_pow_eq_zero
{R : Type u}
{M : Type v}
[semiring R]
[add_comm_monoid M]
[module R M]
{N : submodule R M}
{g : module.End R ↥N}
{G : module.End R M}
(h : linear_map.comp G N.subtype = N.subtype.comp g)
{k : ℕ}
(hG : G ^ k = 0) :
@[simp]
theorem
linear_map.id_pow
{R : Type u}
{M : Type v}
[semiring R]
[add_comm_monoid M]
[module R M]
(n : ℕ) :
theorem
linear_map.iterate_surjective
{R : Type u}
{M : Type v}
[semiring R]
[add_comm_monoid M]
[module R M]
{f' : M →ₗ[R] M}
(h : function.surjective ⇑f')
(n : ℕ) :
function.surjective ⇑(f' ^ n)
theorem
linear_map.iterate_injective
{R : Type u}
{M : Type v}
[semiring R]
[add_comm_monoid M]
[module R M]
{f' : M →ₗ[R] M}
(h : function.injective ⇑f')
(n : ℕ) :
function.injective ⇑(f' ^ n)
theorem
linear_map.iterate_bijective
{R : Type u}
{M : Type v}
[semiring R]
[add_comm_monoid M]
[module R M]
{f' : M →ₗ[R] M}
(h : function.bijective ⇑f')
(n : ℕ) :
function.bijective ⇑(f' ^ n)
theorem
linear_map.injective_of_iterate_injective
{R : Type u}
{M : Type v}
[semiring R]
[add_comm_monoid M]
[module R M]
{f' : M →ₗ[R] M}
{n : ℕ}
(hn : n ≠ 0)
(h : function.injective ⇑(f' ^ n)) :
theorem
linear_map.pi_apply_eq_sum_univ
{R : Type u}
{M : Type v}
{ι : Type x}
[semiring R]
[add_comm_monoid M]
[module R M]
[fintype ι]
(f : (ι → R) →ₗ[R] M)
(x : ι → R) :
A linear map f applied to x : ι → R can be computed using the image under f of elements
of the canonical basis.
@[instance]
def
linear_map.has_neg
{R : Type u}
{M : Type v}
{M₂ : Type w}
[semiring R]
[add_comm_monoid M]
[add_comm_group M₂]
[module R M]
[module R M₂] :
The negation of a linear map is linear.
@[simp]
theorem
linear_map.neg_apply
{R : Type u}
{M : Type v}
{M₂ : Type w}
[semiring R]
[add_comm_monoid M]
[add_comm_group M₂]
[module R M]
[module R M₂]
(f : M →ₗ[R] M₂)
(x : M) :
@[simp]
theorem
linear_map.comp_neg
{R : Type u}
{M : Type v}
{M₂ : Type w}
{M₃ : Type y}
[semiring R]
[add_comm_monoid M]
[add_comm_group M₂]
[add_comm_group M₃]
[module R M]
[module R M₂]
[module R M₃]
(f : M →ₗ[R] M₂)
(g : M₂ →ₗ[R] M₃) :
@[instance]
def
linear_map.has_sub
{R : Type u}
{M : Type v}
{M₂ : Type w}
[semiring R]
[add_comm_monoid M]
[add_comm_group M₂]
[module R M]
[module R M₂] :
The negation of a linear map is linear.
@[simp]
theorem
linear_map.sub_apply
{R : Type u}
{M : Type v}
{M₂ : Type w}
[semiring R]
[add_comm_monoid M]
[add_comm_group M₂]
[module R M]
[module R M₂]
(f g : M →ₗ[R] M₂)
(x : M) :
theorem
linear_map.sub_comp
{R : Type u}
{M : Type v}
{M₂ : Type w}
{M₃ : Type y}
[semiring R]
[add_comm_monoid M]
[add_comm_group M₂]
[add_comm_group M₃]
[module R M]
[module R M₂]
[module R M₃]
(f : M →ₗ[R] M₂)
(g h : M₂ →ₗ[R] M₃) :
theorem
linear_map.comp_sub
{R : Type u}
{M : Type v}
{M₂ : Type w}
{M₃ : Type y}
[semiring R]
[add_comm_monoid M]
[add_comm_group M₂]
[add_comm_group M₃]
[module R M]
[module R M₂]
[module R M₃]
(f g : M →ₗ[R] M₂)
(h : M₂ →ₗ[R] M₃) :
@[instance]
def
linear_map.add_comm_group
{R : Type u}
{M : Type v}
{M₂ : Type w}
[semiring R]
[add_comm_monoid M]
[add_comm_group M₂]
[module R M]
[module R M₂] :
add_comm_group (M →ₗ[R] M₂)
The type of linear maps is an additive group.
Equations
- linear_map.add_comm_group = {add := has_add.add linear_map.has_add, add_assoc := _, zero := 0, zero_add := _, add_zero := _, nsmul := λ (n : ℕ) (f : M →ₗ[R] M₂), {to_fun := λ (x : M), n • ⇑f x, map_add' := _, map_smul' := _}, nsmul_zero' := _, nsmul_succ' := _, neg := has_neg.neg linear_map.has_neg, sub := has_sub.sub linear_map.has_sub, sub_eq_add_neg := _, gsmul := λ (n : ℤ) (f : M →ₗ[R] M₂), {to_fun := λ (x : M), n • ⇑f x, map_add' := _, map_smul' := _}, gsmul_zero' := _, gsmul_succ' := _, gsmul_neg' := _, add_left_neg := _, add_comm := _}
@[instance]
def
linear_map.has_scalar
{R : Type u}
{M : Type v}
{M₂ : Type w}
{S : Type u_1}
[semiring R]
[monoid S]
[add_comm_monoid M]
[add_comm_monoid M₂]
[module R M]
[module R M₂]
[distrib_mul_action S M₂]
[smul_comm_class R S M₂] :
has_scalar S (M →ₗ[R] M₂)
@[simp]
theorem
linear_map.smul_apply
{R : Type u}
{M : Type v}
{M₂ : Type w}
{S : Type u_1}
[semiring R]
[monoid S]
[add_comm_monoid M]
[add_comm_monoid M₂]
[module R M]
[module R M₂]
[distrib_mul_action S M₂]
[smul_comm_class R S M₂]
(f : M →ₗ[R] M₂)
(a : S)
(x : M) :
@[instance]
def
linear_map.smul_comm_class
{R : Type u}
{M : Type v}
{M₂ : Type w}
{S : Type u_1}
[semiring R]
[monoid S]
[add_comm_monoid M]
[add_comm_monoid M₂]
[module R M]
[module R M₂]
[distrib_mul_action S M₂]
[smul_comm_class R S M₂]
{T : Type u_2}
[monoid T]
[distrib_mul_action T M₂]
[smul_comm_class R T M₂]
[smul_comm_class S T M₂] :
smul_comm_class S T (M →ₗ[R] M₂)
@[instance]
def
linear_map.is_scalar_tower
{R : Type u}
{M : Type v}
{M₂ : Type w}
{S : Type u_1}
[semiring R]
[monoid S]
[add_comm_monoid M]
[add_comm_monoid M₂]
[module R M]
[module R M₂]
[distrib_mul_action S M₂]
[smul_comm_class R S M₂]
{T : Type u_2}
[monoid T]
[has_scalar S T]
[distrib_mul_action T M₂]
[smul_comm_class R T M₂]
[is_scalar_tower S T M₂] :
is_scalar_tower S T (M →ₗ[R] M₂)
@[instance]
def
linear_map.distrib_mul_action
{R : Type u}
{M : Type v}
{M₂ : Type w}
{S : Type u_1}
[semiring R]
[monoid S]
[add_comm_monoid M]
[add_comm_monoid M₂]
[module R M]
[module R M₂]
[distrib_mul_action S M₂]
[smul_comm_class R S M₂] :
distrib_mul_action S (M →ₗ[R] M₂)
Equations
- linear_map.distrib_mul_action = {to_mul_action := {to_has_scalar := linear_map.has_scalar _inst_10, one_smul := _, mul_smul := _}, smul_add := _, smul_zero := _}
theorem
linear_map.smul_comp
{R : Type u}
{M : Type v}
{M₂ : Type w}
{M₃ : Type y}
{S : Type u_1}
[semiring R]
[monoid S]
[add_comm_monoid M]
[add_comm_monoid M₂]
[add_comm_monoid M₃]
[module R M]
[module R M₂]
[module R M₃]
[distrib_mul_action S M₂]
[smul_comm_class R S M₂]
(a : S)
(g : M₃ →ₗ[R] M₂)
(f : M →ₗ[R] M₃) :
@[instance]
def
linear_map.module
{R : Type u}
{M : Type v}
{M₂ : Type w}
{S : Type u_1}
[semiring R]
[semiring S]
[add_comm_monoid M]
[add_comm_monoid M₂]
[module R M]
[module R M₂]
[module S M₂]
[smul_comm_class R S M₂] :
Equations
- linear_map.module = {to_distrib_mul_action := linear_map.distrib_mul_action _inst_11, add_smul := _, zero_smul := _}
@[simp]
theorem
linear_map.applyₗ'_apply_apply
{R : Type u}
{M : Type v}
{M₂ : Type w}
(S : Type u_1)
[semiring R]
[semiring S]
[add_comm_monoid M]
[add_comm_monoid M₂]
[module R M]
[module R M₂]
[module S M₂]
[smul_comm_class R S M₂]
(v : M)
(f : M →ₗ[R] M₂) :
⇑(⇑(linear_map.applyₗ' S) v) f = ⇑f v
def
linear_map.applyₗ'
{R : Type u}
{M : Type v}
{M₂ : Type w}
(S : Type u_1)
[semiring R]
[semiring S]
[add_comm_monoid M]
[add_comm_monoid M₂]
[module R M]
[module R M₂]
[module S M₂]
[smul_comm_class R S M₂] :
Applying a linear map at v : M, seen as S-linear map from M →ₗ[R] M₂ to M₂.
See linear_map.applyₗ for a version where S = R.
@[simp]
theorem
linear_map.ring_lmap_equiv_self_apply
(R : Type u)
(M : Type v)
(S : Type u_1)
[semiring R]
[semiring S]
[add_comm_monoid M]
[module R M]
[module S M]
[smul_comm_class R S M]
(f : R →ₗ[R] M) :
⇑(linear_map.ring_lmap_equiv_self R M S) f = ⇑f 1
@[simp]
theorem
linear_map.ring_lmap_equiv_self_symm_apply
(R : Type u)
(M : Type v)
(S : Type u_1)
[semiring R]
[semiring S]
[add_comm_monoid M]
[module R M]
[module S M]
[smul_comm_class R S M]
(x : M) :
⇑((linear_map.ring_lmap_equiv_self R M S).symm) x = 1.smul_right x
def
linear_map.ring_lmap_equiv_self
(R : Type u)
(M : Type v)
(S : Type u_1)
[semiring R]
[semiring S]
[add_comm_monoid M]
[module R M]
[module S M]
[smul_comm_class R S M] :
The equivalence between R-linear maps from R to M, and points of M itself.
This says that the forgetful functor from R-modules to types is representable, by R.
This as an S-linear equivalence, under the assumption that S acts on M commuting with R.
When R is commutative, we can take this to be the usual action with S = R.
Otherwise, S = ℕ shows that the equivalence is additive.
See note [bundled maps over different rings].
theorem
linear_map.comp_smul
{R : Type u}
{M : Type v}
{M₂ : Type w}
{M₃ : Type y}
[comm_semiring R]
[add_comm_monoid M]
[add_comm_monoid M₂]
[add_comm_monoid M₃]
[module R M]
[module R M₂]
[module R M₃]
(f : M →ₗ[R] M₂)
(g : M₂ →ₗ[R] M₃)
(a : R) :
def
linear_map.comp_right
{R : Type u}
{M : Type v}
{M₂ : Type w}
{M₃ : Type y}
[comm_semiring R]
[add_comm_monoid M]
[add_comm_monoid M₂]
[add_comm_monoid M₃]
[module R M]
[module R M₂]
[module R M₃]
(f : M₂ →ₗ[R] M₃) :
Composition by f : M₂ → M₃ is a linear map from the space of linear maps M → M₂
to the space of linear maps M₂ → M₃.
@[simp]
theorem
linear_map.applyₗ_apply_apply
{R : Type u}
{M : Type v}
{M₂ : Type w}
[comm_semiring R]
[add_comm_monoid M]
[add_comm_monoid M₂]
[module R M]
[module R M₂]
(v : M)
(f : M →ₗ[R] M₂) :
⇑(⇑linear_map.applyₗ v) f = ⇑f v
def
linear_map.applyₗ
{R : Type u}
{M : Type v}
{M₂ : Type w}
[comm_semiring R]
[add_comm_monoid M]
[add_comm_monoid M₂]
[module R M]
[module R M₂] :
Applying a linear map at v : M, seen as a linear map from M →ₗ[R] M₂ to M₂.
See also linear_map.applyₗ' for a version that works with two different semirings.
This is the linear_map version of add_monoid_hom.eval.
def
linear_map.dom_restrict'
{R : Type u}
{M : Type v}
{M₂ : Type w}
[comm_semiring R]
[add_comm_monoid M]
[add_comm_monoid M₂]
[module R M]
[module R M₂]
(p : submodule R M) :
Alternative version of dom_restrict as a linear map.
Equations
- linear_map.dom_restrict' p = {to_fun := λ (φ : M →ₗ[R] M₂), φ.dom_restrict p, map_add' := _, map_smul' := _}
@[simp]
theorem
linear_map.dom_restrict'_apply
{R : Type u}
{M : Type v}
{M₂ : Type w}
[comm_semiring R]
[add_comm_monoid M]
[add_comm_monoid M₂]
[module R M]
[module R M₂]
(f : M →ₗ[R] M₂)
(p : submodule R M)
(x : ↥p) :
@[instance]
def
linear_map.endomorphism_semiring
{R : Type u}
{M : Type v}
[semiring R]
[add_comm_monoid M]
[module R M] :
Equations
- linear_map.endomorphism_semiring = {add := has_add.add linear_map.has_add, add_assoc := _, zero := 0, zero_add := _, add_zero := _, nsmul := add_comm_monoid.nsmul linear_map.add_comm_monoid, nsmul_zero' := _, nsmul_succ' := _, add_comm := _, mul := has_mul.mul linear_map.has_mul, left_distrib := _, right_distrib := _, zero_mul := _, mul_zero := _, mul_assoc := _, one := 1, one_mul := _, mul_one := _, npow := npow_rec {mul := has_mul.mul linear_map.has_mul}, npow_zero' := _, npow_succ' := _}
@[instance]
def
linear_map.endomorphism_ring
{R : Type u}
{M : Type v}
[ring R]
[add_comm_group M]
[module R M] :
Equations
- linear_map.endomorphism_ring = {add := semiring.add linear_map.endomorphism_semiring, add_assoc := _, zero := semiring.zero linear_map.endomorphism_semiring, zero_add := _, add_zero := _, nsmul := semiring.nsmul linear_map.endomorphism_semiring, nsmul_zero' := _, nsmul_succ' := _, neg := add_comm_group.neg linear_map.add_comm_group, sub := add_comm_group.sub linear_map.add_comm_group, sub_eq_add_neg := _, gsmul := add_comm_group.gsmul linear_map.add_comm_group, gsmul_zero' := _, gsmul_succ' := _, gsmul_neg' := _, add_left_neg := _, add_comm := _, mul := semiring.mul linear_map.endomorphism_semiring, mul_assoc := _, one := semiring.one linear_map.endomorphism_semiring, one_mul := _, mul_one := _, npow := semiring.npow linear_map.endomorphism_semiring, npow_zero' := _, npow_succ' := _, left_distrib := _, right_distrib := _}
def
linear_map.smul_rightₗ
{R : Type u}
{M : Type v}
{M₂ : Type w}
[comm_ring R]
[add_comm_group M]
[add_comm_group M₂]
[module R M]
[module R M₂] :
The family of linear maps M₂ → M parameterised by f ∈ M₂ → R, x ∈ M, is linear in f, x.
@[simp]
theorem
linear_map.smul_rightₗ_apply
{R : Type u}
{M : Type v}
{M₂ : Type w}
[comm_ring R]
[add_comm_group M]
[add_comm_group M₂]
[module R M]
[module R M₂]
(f : M₂ →ₗ[R] R)
(x : M)
(c : M₂) :
@[simp]
theorem
add_monoid_hom_lequiv_nat_apply
{A : Type u_1}
{B : Type u_2}
[add_comm_monoid A]
[add_comm_monoid B]
(f : A →+ B) :
@[simp]
theorem
add_monoid_hom_lequiv_nat_symm_apply
{A : Type u_1}
{B : Type u_2}
[add_comm_monoid A]
[add_comm_monoid B]
(f : A →ₗ[ℕ] B) :
def
add_monoid_hom_lequiv_nat
{A : Type u_1}
{B : Type u_2}
[add_comm_monoid A]
[add_comm_monoid B] :
The ℕ-linear equivalence between additive morphisms A →+ B and ℕ-linear morphisms A →ₗ[ℕ] B.
Equations
- add_monoid_hom_lequiv_nat = {to_fun := add_monoid_hom.to_nat_linear_map _inst_2, map_add' := _, map_smul' := _, inv_fun := linear_map.to_add_monoid_hom add_comm_monoid.nat_module, left_inv := _, right_inv := _}
@[simp]
theorem
add_monoid_hom_lequiv_int_symm_apply
{A : Type u_1}
{B : Type u_2}
[add_comm_group A]
[add_comm_group B]
(f : A →ₗ[ℤ] B) :
The ℤ-linear equivalence between additive morphisms A →+ B and ℤ-linear morphisms A →ₗ[ℤ] B.
Equations
- add_monoid_hom_lequiv_int = {to_fun := add_monoid_hom.to_int_linear_map _inst_2, map_add' := _, map_smul' := _, inv_fun := linear_map.to_add_monoid_hom (add_comm_group.int_module B), left_inv := _, right_inv := _}
@[simp]
theorem
add_monoid_hom_lequiv_int_apply
{A : Type u_1}
{B : Type u_2}
[add_comm_group A]
[add_comm_group B]
(f : A →+ B) :
Properties of submodules #
def
submodule.of_le
{R : Type u}
{M : Type v}
[semiring R]
[add_comm_monoid M]
[module R M]
{p p' : submodule R M}
(h : p ≤ p') :
If two submodules p and p' satisfy p ⊆ p', then of_le p p' is the linear map version of
this inclusion.
Equations
- submodule.of_le h = linear_map.cod_restrict p' p.subtype _
@[simp]
theorem
submodule.coe_of_le
{R : Type u}
{M : Type v}
[semiring R]
[add_comm_monoid M]
[module R M]
{p p' : submodule R M}
(h : p ≤ p')
(x : ↥p) :
↑(⇑(submodule.of_le h) x) = ↑x
theorem
submodule.of_le_apply
{R : Type u}
{M : Type v}
[semiring R]
[add_comm_monoid M]
[module R M]
{p p' : submodule R M}
(h : p ≤ p')
(x : ↥p) :
⇑(submodule.of_le h) x = ⟨↑x, _⟩
theorem
submodule.subtype_comp_of_le
{R : Type u}
{M : Type v}
[semiring R]
[add_comm_monoid M]
[module R M]
(p q : submodule R M)
(h : p ≤ q) :
q.subtype.comp (submodule.of_le h) = p.subtype
@[instance]
def
submodule.add_comm_monoid_submodule
{R : Type u}
{M : Type v}
[semiring R]
[add_comm_monoid M]
[module R M] :
add_comm_monoid (submodule R M)
Equations
- submodule.add_comm_monoid_submodule = {add := has_sup.sup (semilattice_sup.to_has_sup (submodule R M)), add_assoc := _, zero := ⊥, zero_add := _, add_zero := _, nsmul := add_monoid.nsmul._default ⊥ has_sup.sup submodule.add_comm_monoid_submodule._proof_4 submodule.add_comm_monoid_submodule._proof_5, nsmul_zero' := _, nsmul_succ' := _, add_comm := _}
@[simp]
theorem
submodule.add_eq_sup
{R : Type u}
{M : Type v}
[semiring R]
[add_comm_monoid M]
[module R M]
(p q : submodule R M) :
@[simp]
theorem
submodule.zero_eq_bot
{R : Type u}
{M : Type v}
[semiring R]
[add_comm_monoid M]
[module R M] :
theorem
submodule.subsingleton_iff
(R : Type u)
{M : Type v}
[semiring R]
[add_comm_monoid M]
[module R M] :
subsingleton M ↔ subsingleton (submodule R M)
theorem
submodule.nontrivial_iff
(R : Type u)
{M : Type v}
[semiring R]
[add_comm_monoid M]
[module R M] :
nontrivial M ↔ nontrivial (submodule R M)
@[instance]
def
submodule.unique
{R : Type u}
{M : Type v}
[semiring R]
[add_comm_monoid M]
[module R M]
[subsingleton M] :
Equations
- submodule.unique = {to_inhabited := {default := ⊥}, uniq := _}
@[instance]
def
submodule.unique'
{R : Type u}
{M : Type v}
[semiring R]
[add_comm_monoid M]
[module R M]
[subsingleton R] :
Equations
@[instance]
def
submodule.nontrivial
{R : Type u}
{M : Type v}
[semiring R]
[add_comm_monoid M]
[module R M]
[nontrivial M] :
nontrivial (submodule R M)
def
submodule.map
{R : Type u}
{M : Type v}
{M₂ : Type w}
[semiring R]
[add_comm_monoid M]
[add_comm_monoid M₂]
[module R M]
[module R M₂]
(f : M →ₗ[R] M₂)
(p : submodule R M) :
submodule R M₂
The pushforward of a submodule p ⊆ M by f : M → M₂
@[simp]
theorem
submodule.map_coe
{R : Type u}
{M : Type v}
{M₂ : Type w}
[semiring R]
[add_comm_monoid M]
[add_comm_monoid M₂]
[module R M]
[module R M₂]
(f : M →ₗ[R] M₂)
(p : submodule R M) :
@[simp]
theorem
submodule.mem_map
{R : Type u}
{M : Type v}
{M₂ : Type w}
[semiring R]
[add_comm_monoid M]
[add_comm_monoid M₂]
[module R M]
[module R M₂]
{f : M →ₗ[R] M₂}
{p : submodule R M}
{x : M₂} :
theorem
submodule.mem_map_of_mem
{R : Type u}
{M : Type v}
{M₂ : Type w}
[semiring R]
[add_comm_monoid M]
[add_comm_monoid M₂]
[module R M]
[module R M₂]
{f : M →ₗ[R] M₂}
{p : submodule R M}
{r : M}
(h : r ∈ p) :
⇑f r ∈ submodule.map f p
theorem
submodule.apply_coe_mem_map
{R : Type u}
{M : Type v}
{M₂ : Type w}
[semiring R]
[add_comm_monoid M]
[add_comm_monoid M₂]
[module R M]
[module R M₂]
(f : M →ₗ[R] M₂)
{p : submodule R M}
(r : ↥p) :
⇑f ↑r ∈ submodule.map f p
@[simp]
theorem
submodule.map_id
{R : Type u}
{M : Type v}
[semiring R]
[add_comm_monoid M]
[module R M]
(p : submodule R M) :
theorem
submodule.map_comp
{R : Type u}
{M : Type v}
{M₂ : Type w}
{M₃ : Type y}
[semiring R]
[add_comm_monoid M]
[add_comm_monoid M₂]
[add_comm_monoid M₃]
[module R M]
[module R M₂]
[module R M₃]
(f : M →ₗ[R] M₂)
(g : M₂ →ₗ[R] M₃)
(p : submodule R M) :
submodule.map (g.comp f) p = submodule.map g (submodule.map f p)
theorem
submodule.map_mono
{R : Type u}
{M : Type v}
{M₂ : Type w}
[semiring R]
[add_comm_monoid M]
[add_comm_monoid M₂]
[module R M]
[module R M₂]
{f : M →ₗ[R] M₂}
{p p' : submodule R M} :
p ≤ p' → submodule.map f p ≤ submodule.map f p'
@[simp]
theorem
submodule.map_zero
{R : Type u}
{M : Type v}
{M₂ : Type w}
[semiring R]
[add_comm_monoid M]
[add_comm_monoid M₂]
[module R M]
[module R M₂]
(p : submodule R M) :
submodule.map 0 p = ⊥
theorem
submodule.range_map_nonempty
{R : Type u}
{M : Type v}
{M₂ : Type w}
[semiring R]
[add_comm_monoid M]
[add_comm_monoid M₂]
[module R M]
[module R M₂]
(N : submodule R M) :
(set.range (λ (ϕ : M →ₗ[R] M₂), submodule.map ϕ N)).nonempty
def
submodule.equiv_map_of_injective
{R : Type u}
{M : Type v}
{M₂ : Type w}
[semiring R]
[add_comm_monoid M]
[add_comm_monoid M₂]
[module R M]
[module R M₂]
(f : M →ₗ[R] M₂)
(i : function.injective ⇑f)
(p : submodule R M) :
↥p ≃ₗ[R] ↥(submodule.map f p)
The pushforward of a submodule by an injective linear map is linearly equivalent to the original submodule.
@[simp]
theorem
submodule.coe_equiv_map_of_injective_apply
{R : Type u}
{M : Type v}
{M₂ : Type w}
[semiring R]
[add_comm_monoid M]
[add_comm_monoid M₂]
[module R M]
[module R M₂]
(f : M →ₗ[R] M₂)
(i : function.injective ⇑f)
(p : submodule R M)
(x : ↥p) :
def
submodule.comap
{R : Type u}
{M : Type v}
{M₂ : Type w}
[semiring R]
[add_comm_monoid M]
[add_comm_monoid M₂]
[module R M]
[module R M₂]
(f : M →ₗ[R] M₂)
(p : submodule R M₂) :
submodule R M
The pullback of a submodule p ⊆ M₂ along f : M → M₂
@[simp]
theorem
submodule.comap_coe
{R : Type u}
{M : Type v}
{M₂ : Type w}
[semiring R]
[add_comm_monoid M]
[add_comm_monoid M₂]
[module R M]
[module R M₂]
(f : M →ₗ[R] M₂)
(p : submodule R M₂) :
@[simp]
theorem
submodule.mem_comap
{R : Type u}
{M : Type v}
{M₂ : Type w}
[semiring R]
[add_comm_monoid M]
[add_comm_monoid M₂]
[module R M]
[module R M₂]
{x : M}
{f : M →ₗ[R] M₂}
{p : submodule R M₂} :
x ∈ submodule.comap f p ↔ ⇑f x ∈ p
theorem
submodule.comap_id
{R : Type u}
{M : Type v}
[semiring R]
[add_comm_monoid M]
[module R M]
(p : submodule R M) :
theorem
submodule.comap_comp
{R : Type u}
{M : Type v}
{M₂ : Type w}
{M₃ : Type y}
[semiring R]
[add_comm_monoid M]
[add_comm_monoid M₂]
[add_comm_monoid M₃]
[module R M]
[module R M₂]
[module R M₃]
(f : M →ₗ[R] M₂)
(g : M₂ →ₗ[R] M₃)
(p : submodule R M₃) :
submodule.comap (g.comp f) p = submodule.comap f (submodule.comap g p)
theorem
submodule.comap_mono
{R : Type u}
{M : Type v}
{M₂ : Type w}
[semiring R]
[add_comm_monoid M]
[add_comm_monoid M₂]
[module R M]
[module R M₂]
{f : M →ₗ[R] M₂}
{q q' : submodule R M₂} :
q ≤ q' → submodule.comap f q ≤ submodule.comap f q'
theorem
submodule.map_le_iff_le_comap
{R : Type u}
{M : Type v}
{M₂ : Type w}
[semiring R]
[add_comm_monoid M]
[add_comm_monoid M₂]
[module R M]
[module R M₂]
{f : M →ₗ[R] M₂}
{p : submodule R M}
{q : submodule R M₂} :
submodule.map f p ≤ q ↔ p ≤ submodule.comap f q
theorem
submodule.gc_map_comap
{R : Type u}
{M : Type v}
{M₂ : Type w}
[semiring R]
[add_comm_monoid M]
[add_comm_monoid M₂]
[module R M]
[module R M₂]
(f : M →ₗ[R] M₂) :
@[simp]
theorem
submodule.map_bot
{R : Type u}
{M : Type v}
{M₂ : Type w}
[semiring R]
[add_comm_monoid M]
[add_comm_monoid M₂]
[module R M]
[module R M₂]
(f : M →ₗ[R] M₂) :
submodule.map f ⊥ = ⊥
@[simp]
theorem
submodule.map_sup
{R : Type u}
{M : Type v}
{M₂ : Type w}
[semiring R]
[add_comm_monoid M]
[add_comm_monoid M₂]
[module R M]
[module R M₂]
(p p' : submodule R M)
(f : M →ₗ[R] M₂) :
submodule.map f (p ⊔ p') = submodule.map f p ⊔ submodule.map f p'
@[simp]
theorem
submodule.map_supr
{R : Type u}
{M : Type v}
{M₂ : Type w}
[semiring R]
[add_comm_monoid M]
[add_comm_monoid M₂]
[module R M]
[module R M₂]
{ι : Sort u_1}
(f : M →ₗ[R] M₂)
(p : ι → submodule R M) :
submodule.map f (⨆ (i : ι), p i) = ⨆ (i : ι), submodule.map f (p i)
@[simp]
theorem
submodule.comap_top
{R : Type u}
{M : Type v}
{M₂ : Type w}
[semiring R]
[add_comm_monoid M]
[add_comm_monoid M₂]
[module R M]
[module R M₂]
(f : M →ₗ[R] M₂) :
submodule.comap f ⊤ = ⊤
@[simp]
theorem
submodule.comap_inf
{R : Type u}
{M : Type v}
{M₂ : Type w}
[semiring R]
[add_comm_monoid M]
[add_comm_monoid M₂]
[module R M]
[module R M₂]
(q q' : submodule R M₂)
(f : M →ₗ[R] M₂) :
submodule.comap f (q ⊓ q') = submodule.comap f q ⊓ submodule.comap f q'
@[simp]
theorem
submodule.comap_infi
{R : Type u}
{M : Type v}
{M₂ : Type w}
[semiring R]
[add_comm_monoid M]
[add_comm_monoid M₂]
[module R M]
[module R M₂]
{ι : Sort u_1}
(f : M →ₗ[R] M₂)
(p : ι → submodule R M₂) :
submodule.comap f (⨅ (i : ι), p i) = ⨅ (i : ι), submodule.comap f (p i)
@[simp]
theorem
submodule.comap_zero
{R : Type u}
{M : Type v}
{M₂ : Type w}
[semiring R]
[add_comm_monoid M]
[add_comm_monoid M₂]
[module R M]
[module R M₂]
(q : submodule R M₂) :
submodule.comap 0 q = ⊤
theorem
submodule.map_comap_le
{R : Type u}
{M : Type v}
{M₂ : Type w}
[semiring R]
[add_comm_monoid M]
[add_comm_monoid M₂]
[module R M]
[module R M₂]
(f : M →ₗ[R] M₂)
(q : submodule R M₂) :
submodule.map f (submodule.comap f q) ≤ q
theorem
submodule.le_comap_map
{R : Type u}
{M : Type v}
{M₂ : Type w}
[semiring R]
[add_comm_monoid M]
[add_comm_monoid M₂]
[module R M]
[module R M₂]
(f : M →ₗ[R] M₂)
(p : submodule R M) :
p ≤ submodule.comap f (submodule.map f p)
def
submodule.gci_map_comap
{R : Type u}
{M : Type v}
{M₂ : Type w}
[semiring R]
[add_comm_monoid M]
[add_comm_monoid M₂]
[module R M]
[module R M₂]
{f : M →ₗ[R] M₂}
(hf : function.injective ⇑f) :
map f and comap f form a galois_coinsertion when f is injective.
Equations
theorem
submodule.comap_map_eq_of_injective
{R : Type u}
{M : Type v}
{M₂ : Type w}
[semiring R]
[add_comm_monoid M]
[add_comm_monoid M₂]
[module R M]
[module R M₂]
{f : M →ₗ[R] M₂}
(hf : function.injective ⇑f)
(p : submodule R M) :
submodule.comap f (submodule.map f p) = p
theorem
submodule.comap_surjective_of_injective
{R : Type u}
{M : Type v}
{M₂ : Type w}
[semiring R]
[add_comm_monoid M]
[add_comm_monoid M₂]
[module R M]
[module R M₂]
{f : M →ₗ[R] M₂}
(hf : function.injective ⇑f) :
theorem
submodule.map_injective_of_injective
{R : Type u}
{M : Type v}
{M₂ : Type w}
[semiring R]
[add_comm_monoid M]
[add_comm_monoid M₂]
[module R M]
[module R M₂]
{f : M →ₗ[R] M₂}
(hf : function.injective ⇑f) :
theorem
submodule.comap_inf_map_of_injective
{R : Type u}
{M : Type v}
{M₂ : Type w}
[semiring R]
[add_comm_monoid M]
[add_comm_monoid M₂]
[module R M]
[module R M₂]
{f : M →ₗ[R] M₂}
(hf : function.injective ⇑f)
(p q : submodule R M) :
submodule.comap f (submodule.map f p ⊓ submodule.map f q) = p ⊓ q
theorem
submodule.comap_infi_map_of_injective
{R : Type u}
{M : Type v}
{M₂ : Type w}
{ι : Type x}
[semiring R]
[add_comm_monoid M]
[add_comm_monoid M₂]
[module R M]
[module R M₂]
{f : M →ₗ[R] M₂}
(hf : function.injective ⇑f)
(S : ι → submodule R M) :
submodule.comap f (⨅ (i : ι), submodule.map f (S i)) = infi S
theorem
submodule.comap_sup_map_of_injective
{R : Type u}
{M : Type v}
{M₂ : Type w}
[semiring R]
[add_comm_monoid M]
[add_comm_monoid M₂]
[module R M]
[module R M₂]
{f : M →ₗ[R] M₂}
(hf : function.injective ⇑f)
(p q : submodule R M) :
submodule.comap f (submodule.map f p ⊔ submodule.map f q) = p ⊔ q
theorem
submodule.comap_supr_map_of_injective
{R : Type u}
{M : Type v}
{M₂ : Type w}
{ι : Type x}
[semiring R]
[add_comm_monoid M]
[add_comm_monoid M₂]
[module R M]
[module R M₂]
{f : M →ₗ[R] M₂}
(hf : function.injective ⇑f)
(S : ι → submodule R M) :
submodule.comap f (⨆ (i : ι), submodule.map f (S i)) = supr S
theorem
submodule.map_le_map_iff_of_injective
{R : Type u}
{M : Type v}
{M₂ : Type w}
[semiring R]
[add_comm_monoid M]
[add_comm_monoid M₂]
[module R M]
[module R M₂]
{f : M →ₗ[R] M₂}
(hf : function.injective ⇑f)
(p q : submodule R M) :
submodule.map f p ≤ submodule.map f q ↔ p ≤ q
theorem
submodule.map_strict_mono_of_injective
{R : Type u}
{M : Type v}
{M₂ : Type w}
[semiring R]
[add_comm_monoid M]
[add_comm_monoid M₂]
[module R M]
[module R M₂]
{f : M →ₗ[R] M₂}
(hf : function.injective ⇑f) :
theorem
submodule.map_inf_eq_map_inf_comap
{R : Type u}
{M : Type v}
{M₂ : Type w}
[semiring R]
[add_comm_monoid M]
[add_comm_monoid M₂]
[module R M]
[module R M₂]
{f : M →ₗ[R] M₂}
{p : submodule R M}
{p' : submodule R M₂} :
submodule.map f p ⊓ p' = submodule.map f (p ⊓ submodule.comap f p')
theorem
submodule.map_comap_subtype
{R : Type u}
{M : Type v}
[semiring R]
[add_comm_monoid M]
[module R M]
(p p' : submodule R M) :
submodule.map p.subtype (submodule.comap p.subtype p') = p ⊓ p'
theorem
submodule.eq_zero_of_bot_submodule
{R : Type u}
{M : Type v}
[semiring R]
[add_comm_monoid M]
[module R M]
(b : ↥⊥) :
b = 0
def
submodule.span
(R : Type u)
{M : Type v}
[semiring R]
[add_comm_monoid M]
[module R M]
(s : set M) :
submodule R M
The span of a set s ⊆ M is the smallest submodule of M that contains s.
theorem
submodule.mem_span
{R : Type u}
{M : Type v}
[semiring R]
[add_comm_monoid M]
[module R M]
{x : M}
{s : set M} :
theorem
submodule.subset_span
{R : Type u}
{M : Type v}
[semiring R]
[add_comm_monoid M]
[module R M]
{s : set M} :
s ⊆ ↑(submodule.span R s)
theorem
submodule.span_le
{R : Type u}
{M : Type v}
[semiring R]
[add_comm_monoid M]
[module R M]
{s : set M}
{p : submodule R M} :
submodule.span R s ≤ p ↔ s ⊆ ↑p
theorem
submodule.span_mono
{R : Type u}
{M : Type v}
[semiring R]
[add_comm_monoid M]
[module R M]
{s t : set M}
(h : s ⊆ t) :
submodule.span R s ≤ submodule.span R t
theorem
submodule.span_eq_of_le
{R : Type u}
{M : Type v}
[semiring R]
[add_comm_monoid M]
[module R M]
(p : submodule R M)
{s : set M}
(h₁ : s ⊆ ↑p)
(h₂ : p ≤ submodule.span R s) :
submodule.span R s = p
@[simp]
theorem
submodule.span_eq
{R : Type u}
{M : Type v}
[semiring R]
[add_comm_monoid M]
[module R M]
(p : submodule R M) :
submodule.span R ↑p = p
theorem
submodule.map_span
{R : Type u}
{M : Type v}
{M₂ : Type w}
[semiring R]
[add_comm_monoid M]
[add_comm_monoid M₂]
[module R M]
[module R M₂]
(f : M →ₗ[R] M₂)
(s : set M) :
submodule.map f (submodule.span R s) = submodule.span R (⇑f '' s)
theorem
linear_map.map_span
{R : Type u}
{M : Type v}
{M₂ : Type w}
[semiring R]
[add_comm_monoid M]
[add_comm_monoid M₂]
[module R M]
[module R M₂]
(f : M →ₗ[R] M₂)
(s : set M) :
submodule.map f (submodule.span R s) = submodule.span R (⇑f '' s)
Alias of submodule.map_span.
theorem
submodule.map_span_le
{R : Type u_1}
{M : Type u_2}
{M₂ : Type u_3}
[semiring R]
[add_comm_monoid M]
[add_comm_monoid M₂]
[module R M]
[module R M₂]
(f : M →ₗ[R] M₂)
(s : set M)
(N : submodule R M₂) :
submodule.map f (submodule.span R s) ≤ N ↔ ∀ (m : M), m ∈ s → ⇑f m ∈ N
theorem
linear_map.map_span_le
{R : Type u_1}
{M : Type u_2}
{M₂ : Type u_3}
[semiring R]
[add_comm_monoid M]
[add_comm_monoid M₂]
[module R M]
[module R M₂]
(f : M →ₗ[R] M₂)
(s : set M)
(N : submodule R M₂) :
submodule.map f (submodule.span R s) ≤ N ↔ ∀ (m : M), m ∈ s → ⇑f m ∈ N
Alias of submodule.map_span_le.
theorem
submodule.span_preimage_le
{R : Type u}
{M : Type v}
{M₂ : Type w}
[semiring R]
[add_comm_monoid M]
[add_comm_monoid M₂]
[module R M]
[module R M₂]
(f : M →ₗ[R] M₂)
(s : set M₂) :
submodule.span R (⇑f ⁻¹' s) ≤ submodule.comap f (submodule.span R s)
theorem
linear_map.span_preimage_le
{R : Type u}
{M : Type v}
{M₂ : Type w}
[semiring R]
[add_comm_monoid M]
[add_comm_monoid M₂]
[module R M]
[module R M₂]
(f : M →ₗ[R] M₂)
(s : set M₂) :
submodule.span R (⇑f ⁻¹' s) ≤ submodule.comap f (submodule.span R s)
Alias of submodule.span_preimage_le.
theorem
submodule.span_induction
{R : Type u}
{M : Type v}
[semiring R]
[add_comm_monoid M]
[module R M]
{x : M}
{s : set M}
{p : M → Prop}
(h : x ∈ submodule.span R s)
(Hs : ∀ (x : M), x ∈ s → p x)
(H0 : p 0)
(H1 : ∀ (x y : M), p x → p y → p (x + y))
(H2 : ∀ (a : R) (x : M), p x → p (a • x)) :
p x
An induction principle for span membership. If p holds for 0 and all elements of s, and is
preserved under addition and scalar multiplication, then p holds for all elements of the span of
s.
@[simp]
theorem
submodule.span_nat_eq
{M : Type v}
[add_comm_monoid M]
(s : add_submonoid M) :
(submodule.span ℕ ↑s).to_add_submonoid = s
@[simp]
theorem
submodule.span_int_eq
{M : Type u_1}
[add_comm_group M]
(s : add_subgroup M) :
(submodule.span ℤ ↑s).to_add_subgroup = s
span forms a Galois insertion with the coercion from submodule to set.
Equations
- submodule.gi R M = {choice := λ (s : set M) (_x : ↑(submodule.span R s) ≤ s), submodule.span R s, gc := _, le_l_u := _, choice_eq := _}
@[simp]
theorem
submodule.span_empty
{R : Type u}
{M : Type v}
[semiring R]
[add_comm_monoid M]
[module R M] :
submodule.span R ∅ = ⊥
@[simp]
theorem
submodule.span_univ
{R : Type u}
{M : Type v}
[semiring R]
[add_comm_monoid M]
[module R M] :
theorem
submodule.span_union
{R : Type u}
{M : Type v}
[semiring R]
[add_comm_monoid M]
[module R M]
(s t : set M) :
submodule.span R (s ∪ t) = submodule.span R s ⊔ submodule.span R t
theorem
submodule.span_Union
{R : Type u}
{M : Type v}
[semiring R]
[add_comm_monoid M]
[module R M]
{ι : Sort u_1}
(s : ι → set M) :
submodule.span R (⋃ (i : ι), s i) = ⨆ (i : ι), submodule.span R (s i)
theorem
submodule.span_eq_supr_of_singleton_spans
{R : Type u}
{M : Type v}
[semiring R]
[add_comm_monoid M]
[module R M]
(s : set M) :
submodule.span R s = ⨆ (x : M) (H : x ∈ s), submodule.span R {x}
theorem
submodule.sum_mem_supr
{R : Type u}
{M : Type v}
[semiring R]
[add_comm_monoid M]
[module R M]
{ι : Type u_1}
[fintype ι]
{f : ι → M}
{p : ι → submodule R M}
(h : ∀ (i : ι), f i ∈ p i) :
∑ (i : ι), f i ∈ ⨆ (i : ι), p i
theorem
submodule.coe_scott_continuous
{R : Type u}
{M : Type v}
[semiring R]
[add_comm_monoid M]
[module R M] :
We can regard coe_supr_of_chain as the statement that coe : (submodule R M) → set M is
Scott continuous for the ω-complete partial order induced by the complete lattice structures.
theorem
submodule.mem_span_singleton_self
{R : Type u}
{M : Type v}
[semiring R]
[add_comm_monoid M]
[module R M]
(x : M) :
x ∈ submodule.span R {x}
theorem
submodule.nontrivial_span_singleton
{R : Type u}
{M : Type v}
[semiring R]
[add_comm_monoid M]
[module R M]
{x : M}
(h : x ≠ 0) :
nontrivial ↥(submodule.span R {x})
theorem
submodule.mem_span_singleton
{R : Type u}
{M : Type v}
[semiring R]
[add_comm_monoid M]
[module R M]
{x y : M} :
x ∈ submodule.span R {y} ↔ ∃ (a : R), a • y = x
theorem
submodule.le_span_singleton_iff
{R : Type u}
{M : Type v}
[semiring R]
[add_comm_monoid M]
[module R M]
{s : submodule R M}
{v₀ : M} :
theorem
submodule.span_singleton_eq_top_iff
{R : Type u}
{M : Type v}
[semiring R]
[add_comm_monoid M]
[module R M]
(x : M) :
@[simp]
theorem
submodule.span_zero_singleton
{R : Type u}
{M : Type v}
[semiring R]
[add_comm_monoid M]
[module R M] :
submodule.span R {0} = ⊥
theorem
submodule.span_singleton_eq_range
{R : Type u}
{M : Type v}
[semiring R]
[add_comm_monoid M]
[module R M]
(y : M) :
↑(submodule.span R {y}) = set.range (λ (_x : R), _x • y)
theorem
submodule.span_singleton_smul_le
{R : Type u}
{M : Type v}
[semiring R]
[add_comm_monoid M]
[module R M]
(r : R)
(x : M) :
submodule.span R {r • x} ≤ submodule.span R {x}
theorem
submodule.span_singleton_smul_eq
{K : Type u_1}
{E : Type u_2}
[division_ring K]
[add_comm_group E]
[module K E]
{r : K}
(x : E)
(hr : r ≠ 0) :
submodule.span K {r • x} = submodule.span K {x}
theorem
submodule.disjoint_span_singleton
{K : Type u_1}
{E : Type u_2}
[division_ring K]
[add_comm_group E]
[module K E]
{s : submodule K E}
{x : E} :
disjoint s (submodule.span K {x}) ↔ x ∈ s → x = 0
theorem
submodule.disjoint_span_singleton'
{K : Type u_1}
{E : Type u_2}
[division_ring K]
[add_comm_group E]
[module K E]
{p : submodule K E}
{x : E}
(x0 : x ≠ 0) :
disjoint p (submodule.span K {x}) ↔ x ∉ p
theorem
submodule.mem_span_insert
{R : Type u}
{M : Type v}
[semiring R]
[add_comm_monoid M]
[module R M]
{x : M}
{s : set M}
{y : M} :
x ∈ submodule.span R (insert y s) ↔ ∃ (a : R) (z : M) (H : z ∈ submodule.span R s), x = a • y + z
theorem
submodule.span_insert_eq_span
{R : Type u}
{M : Type v}
[semiring R]
[add_comm_monoid M]
[module R M]
{x : M}
{s : set M}
(h : x ∈ submodule.span R s) :
submodule.span R (insert x s) = submodule.span R s
theorem
submodule.span_span
{R : Type u}
{M : Type v}
[semiring R]
[add_comm_monoid M]
[module R M]
{s : set M} :
submodule.span R ↑(submodule.span R s) = submodule.span R s
theorem
submodule.span_eq_bot
{R : Type u}
{M : Type v}
[semiring R]
[add_comm_monoid M]
[module R M]
{s : set M} :
@[simp]
theorem
submodule.span_singleton_eq_bot
{R : Type u}
{M : Type v}
[semiring R]
[add_comm_monoid M]
[module R M]
{x : M} :
submodule.span R {x} = ⊥ ↔ x = 0
@[simp]
theorem
submodule.span_zero
{R : Type u}
{M : Type v}
[semiring R]
[add_comm_monoid M]
[module R M] :
submodule.span R 0 = ⊥
@[simp]
theorem
submodule.span_image
{R : Type u}
{M : Type v}
{M₂ : Type w}
[semiring R]
[add_comm_monoid M]
[add_comm_monoid M₂]
[module R M]
[module R M₂]
{s : set M}
(f : M →ₗ[R] M₂) :
submodule.span R (⇑f '' s) = submodule.map f (submodule.span R s)
theorem
submodule.apply_mem_span_image_of_mem_span
{R : Type u}
{M : Type v}
{M₂ : Type w}
[semiring R]
[add_comm_monoid M]
[add_comm_monoid M₂]
[module R M]
[module R M₂]
(f : M →ₗ[R] M₂)
{x : M}
{s : set M}
(h : x ∈ submodule.span R s) :
⇑f x ∈ submodule.span R (⇑f '' s)
theorem
submodule.not_mem_span_of_apply_not_mem_span_image
{R : Type u}
{M : Type v}
{M₂ : Type w}
[semiring R]
[add_comm_monoid M]
[add_comm_monoid M₂]
[module R M]
[module R M₂]
(f : M →ₗ[R] M₂)
{x : M}
{s : set M}
(h : ⇑f x ∉ submodule.span R (⇑f '' s)) :
x ∉ submodule.span R s
f is an explicit argument so we can apply this theorem and obtain h as a new goal.
theorem
submodule.supr_eq_span
{R : Type u}
{M : Type v}
[semiring R]
[add_comm_monoid M]
[module R M]
{ι : Sort w}
(p : ι → submodule R M) :
(⨆ (i : ι), p i) = submodule.span R (⋃ (i : ι), ↑(p i))
theorem
submodule.span_singleton_le_iff_mem
{R : Type u}
{M : Type v}
[semiring R]
[add_comm_monoid M]
[module R M]
(m : M)
(p : submodule R M) :
submodule.span R {m} ≤ p ↔ m ∈ p
theorem
submodule.singleton_span_is_compact_element
{R : Type u}
{M : Type v}
[semiring R]
[add_comm_monoid M]
[module R M]
(x : M) :
@[instance]
def
submodule.is_compactly_generated
{R : Type u}
{M : Type v}
[semiring R]
[add_comm_monoid M]
[module R M] :
theorem
submodule.lt_add_iff_not_mem
{R : Type u}
{M : Type v}
[semiring R]
[add_comm_monoid M]
[module R M]
{I : submodule R M}
{a : M} :
I < I + submodule.span R {a} ↔ a ∉ I
theorem
submodule.mem_span_finite_of_mem_span
{R : Type u}
{M : Type v}
[semiring R]
[add_comm_monoid M]
[module R M]
{S : set M}
{x : M}
(hx : x ∈ submodule.span R S) :
For every element in the span of a set, there exists a finite subset of the set such that the element is contained in the span of the subset.
def
submodule.prod
{R : Type u}
{M : Type v}
{M₂ : Type w}
[semiring R]
[add_comm_monoid M]
[add_comm_monoid M₂]
[module R M]
[module R M₂]
(p : submodule R M)
(q : submodule R M₂) :
The product of two submodules is a submodule.
@[simp]
theorem
submodule.prod_coe
{R : Type u}
{M : Type v}
{M₂ : Type w}
[semiring R]
[add_comm_monoid M]
[add_comm_monoid M₂]
[module R M]
[module R M₂]
(p : submodule R M)
(q : submodule R M₂) :
theorem
submodule.span_prod_le
{R : Type u}
{M : Type v}
{M₂ : Type w}
[semiring R]
[add_comm_monoid M]
[add_comm_monoid M₂]
[module R M]
[module R M₂]
(s : set M)
(t : set M₂) :
submodule.span R (s.prod t) ≤ (submodule.span R s).prod (submodule.span R t)
@[simp]
theorem
submodule.prod_top
{R : Type u}
{M : Type v}
{M₂ : Type w}
[semiring R]
[add_comm_monoid M]
[add_comm_monoid M₂]
[module R M]
[module R M₂] :
@[simp]
theorem
submodule.prod_bot
{R : Type u}
{M : Type v}
{M₂ : Type w}
[semiring R]
[add_comm_monoid M]
[add_comm_monoid M₂]
[module R M]
[module R M₂] :
theorem
submodule.prod_mono
{R : Type u}
{M : Type v}
{M₂ : Type w}
[semiring R]
[add_comm_monoid M]
[add_comm_monoid M₂]
[module R M]
[module R M₂]
{p p' : submodule R M}
{q q' : submodule R M₂} :
@[simp]
theorem
submodule.neg_coe
{R : Type u}
{M : Type v}
[ring R]
[add_comm_group M]
[module R M]
(p : submodule R M) :
@[simp]
theorem
submodule.map_neg
{R : Type u}
{M : Type v}
{M₂ : Type w}
[ring R]
[add_comm_group M]
[add_comm_group M₂]
[module R M]
[module R M₂]
(p : submodule R M)
(f : M →ₗ[R] M₂) :
submodule.map (-f) p = submodule.map f p
@[simp]
theorem
submodule.span_neg
{R : Type u}
{M : Type v}
[ring R]
[add_comm_group M]
[module R M]
(s : set M) :
submodule.span R (-s) = submodule.span R s
theorem
submodule.mem_span_insert'
{R : Type u}
{M : Type v}
[ring R]
[add_comm_group M]
[module R M]
{x y : M}
{s : set M} :
x ∈ submodule.span R (insert y s) ↔ ∃ (a : R), x + a • y ∈ submodule.span R s
def
submodule.quotient_rel
{R : Type u}
{M : Type v}
[ring R]
[add_comm_group M]
[module R M]
(p : submodule R M) :
setoid M
The equivalence relation associated to a submodule p, defined by x ≈ y iff y - x ∈ p.
def
submodule.quotient
{R : Type u}
{M : Type v}
[ring R]
[add_comm_group M]
[module R M]
(p : submodule R M) :
Type v
The quotient of a module M by a submodule p ⊆ M.
Equations
def
submodule.quotient.mk
{R : Type u}
{M : Type v}
[ring R]
[add_comm_group M]
[module R M]
{p : submodule R M} :
M → p.quotient
Map associating to an element of M the corresponding element of M/p,
when p is a submodule of M.
Equations
@[simp]
theorem
submodule.quotient.mk_eq_mk
{R : Type u}
{M : Type v}
[ring R]
[add_comm_group M]
[module R M]
{p : submodule R M}
(x : M) :
@[simp]
theorem
submodule.quotient.mk'_eq_mk
{R : Type u}
{M : Type v}
[ring R]
[add_comm_group M]
[module R M]
{p : submodule R M}
(x : M) :
@[simp]
theorem
submodule.quotient.quot_mk_eq_mk
{R : Type u}
{M : Type v}
[ring R]
[add_comm_group M]
[module R M]
{p : submodule R M}
(x : M) :
quot.mk setoid.r x = submodule.quotient.mk x
theorem
submodule.quotient.eq
{R : Type u}
{M : Type v}
[ring R]
[add_comm_group M]
[module R M]
(p : submodule R M)
{x y : M} :
submodule.quotient.mk x = submodule.quotient.mk y ↔ x - y ∈ p
@[instance]
def
submodule.quotient.has_zero
{R : Type u}
{M : Type v}
[ring R]
[add_comm_group M]
[module R M]
(p : submodule R M) :
Equations
@[instance]
def
submodule.quotient.inhabited
{R : Type u}
{M : Type v}
[ring R]
[add_comm_group M]
[module R M]
(p : submodule R M) :
Equations
- submodule.quotient.inhabited p = {default := 0}
@[simp]
theorem
submodule.quotient.mk_zero
{R : Type u}
{M : Type v}
[ring R]
[add_comm_group M]
[module R M]
(p : submodule R M) :
@[simp]
theorem
submodule.quotient.mk_eq_zero
{R : Type u}
{M : Type v}
[ring R]
[add_comm_group M]
[module R M]
(p : submodule R M)
{x : M} :
submodule.quotient.mk x = 0 ↔ x ∈ p
@[instance]
def
submodule.quotient.has_add
{R : Type u}
{M : Type v}
[ring R]
[add_comm_group M]
[module R M]
(p : submodule R M) :
Equations
- submodule.quotient.has_add p = {add := λ (a b : p.quotient), quotient.lift_on₂' a b (λ (a b : M), submodule.quotient.mk (a + b)) _}
@[simp]
theorem
submodule.quotient.mk_add
{R : Type u}
{M : Type v}
[ring R]
[add_comm_group M]
[module R M]
(p : submodule R M)
{x y : M} :
@[instance]
def
submodule.quotient.has_neg
{R : Type u}
{M : Type v}
[ring R]
[add_comm_group M]
[module R M]
(p : submodule R M) :
Equations
- submodule.quotient.has_neg p = {neg := λ (a : p.quotient), quotient.lift_on' a (λ (a : M), submodule.quotient.mk (-a)) _}
@[simp]
theorem
submodule.quotient.mk_neg
{R : Type u}
{M : Type v}
[ring R]
[add_comm_group M]
[module R M]
(p : submodule R M)
{x : M} :
@[instance]
def
submodule.quotient.has_sub
{R : Type u}
{M : Type v}
[ring R]
[add_comm_group M]
[module R M]
(p : submodule R M) :
Equations
- submodule.quotient.has_sub p = {sub := λ (a b : p.quotient), quotient.lift_on₂' a b (λ (a b : M), submodule.quotient.mk (a - b)) _}
@[simp]
theorem
submodule.quotient.mk_sub
{R : Type u}
{M : Type v}
[ring R]
[add_comm_group M]
[module R M]
(p : submodule R M)
{x y : M} :
@[instance]
def
submodule.quotient.add_comm_group
{R : Type u}
{M : Type v}
[ring R]
[add_comm_group M]
[module R M]
(p : submodule R M) :
Equations
- submodule.quotient.add_comm_group p = {add := has_add.add (submodule.quotient.has_add p), add_assoc := _, zero := 0, zero_add := _, add_zero := _, nsmul := λ (n : ℕ) (x : p.quotient), quotient.lift_on' x (λ (x : M), submodule.quotient.mk (n • x)) _, nsmul_zero' := _, nsmul_succ' := _, neg := has_neg.neg (submodule.quotient.has_neg p), sub := has_sub.sub (submodule.quotient.has_sub p), sub_eq_add_neg := _, gsmul := λ (n : ℤ) (x : p.quotient), quotient.lift_on' x (λ (x : M), submodule.quotient.mk (n • x)) _, gsmul_zero' := _, gsmul_succ' := _, gsmul_neg' := _, add_left_neg := _, add_comm := _}
@[instance]
def
submodule.quotient.has_scalar
{R : Type u}
{M : Type v}
[ring R]
[add_comm_group M]
[module R M]
(p : submodule R M) :
has_scalar R p.quotient
Equations
- submodule.quotient.has_scalar p = {smul := λ (a : R) (x : p.quotient), quotient.lift_on' x (λ (x : M), submodule.quotient.mk (a • x)) _}
@[simp]
theorem
submodule.quotient.mk_smul
{R : Type u}
{M : Type v}
[ring R]
[add_comm_group M]
[module R M]
(p : submodule R M)
{r : R}
{x : M} :
submodule.quotient.mk (r • x) = r • submodule.quotient.mk x
@[simp]
theorem
submodule.quotient.mk_nsmul
{R : Type u}
{M : Type v}
[ring R]
[add_comm_group M]
[module R M]
(p : submodule R M)
{x : M}
(n : ℕ) :
submodule.quotient.mk (n • x) = n • submodule.quotient.mk x
@[instance]
def
submodule.quotient.module
{R : Type u}
{M : Type v}
[ring R]
[add_comm_group M]
[module R M]
(p : submodule R M) :
Equations
- submodule.quotient.module p = module.of_core {to_has_scalar := {smul := has_scalar.smul (submodule.quotient.has_scalar p)}, smul_add := _, add_smul := _, mul_smul := _, one_smul := _}
theorem
submodule.quotient.mk_surjective
{R : Type u}
{M : Type v}
[ring R]
[add_comm_group M]
[module R M]
(p : submodule R M) :
theorem
submodule.quotient.nontrivial_of_lt_top
{R : Type u}
{M : Type v}
[ring R]
[add_comm_group M]
[module R M]
(p : submodule R M)
(h : p < ⊤) :
theorem
submodule.quot_hom_ext
{R : Type u}
{M : Type v}
{M₂ : Type w}
[ring R]
[add_comm_group M]
[add_comm_group M₂]
[module R M]
[module R M₂]
(p : submodule R M)
⦃f g : p.quotient →ₗ[R] M₂⦄
(h : ∀ (x : M), ⇑f (submodule.quotient.mk x) = ⇑g (submodule.quotient.mk x)) :
f = g
theorem
submodule.comap_smul
{K : Type u'}
{V : Type v'}
{V₂ : Type w'}
[field K]
[add_comm_group V]
[module K V]
[add_comm_group V₂]
[module K V₂]
(f : V →ₗ[K] V₂)
(p : submodule K V₂)
(a : K)
(h : a ≠ 0) :
submodule.comap (a • f) p = submodule.comap f p
theorem
submodule.map_smul
{K : Type u'}
{V : Type v'}
{V₂ : Type w'}
[field K]
[add_comm_group V]
[module K V]
[add_comm_group V₂]
[module K V₂]
(f : V →ₗ[K] V₂)
(p : submodule K V)
(a : K)
(h : a ≠ 0) :
submodule.map (a • f) p = submodule.map f p
theorem
submodule.comap_smul'
{K : Type u'}
{V : Type v'}
{V₂ : Type w'}
[field K]
[add_comm_group V]
[module K V]
[add_comm_group V₂]
[module K V₂]
(f : V →ₗ[K] V₂)
(p : submodule K V₂)
(a : K) :
submodule.comap (a • f) p = ⨅ (h : a ≠ 0), submodule.comap f p
theorem
submodule.map_smul'
{K : Type u'}
{V : Type v'}
{V₂ : Type w'}
[field K]
[add_comm_group V]
[module K V]
[add_comm_group V₂]
[module K V₂]
(f : V →ₗ[K] V₂)
(p : submodule K V)
(a : K) :
submodule.map (a • f) p = ⨆ (h : a ≠ 0), submodule.map f p
Properties of linear maps #
theorem
linear_map.eq_on_span
{R : Type u}
{M : Type v}
{M₂ : Type w}
[semiring R]
[add_comm_monoid M]
[add_comm_monoid M₂]
[module R M]
[module R M₂]
{s : set M}
{f g : M →ₗ[R] M₂}
(H : set.eq_on ⇑f ⇑g s)
⦃x : M⦄
(h : x ∈ submodule.span R s) :
If two linear maps are equal on a set s, then they are equal on submodule.span s.
See also linear_map.eq_on_span' for a version using set.eq_on.
theorem
linear_map.eq_on_span'
{R : Type u}
{M : Type v}
{M₂ : Type w}
[semiring R]
[add_comm_monoid M]
[add_comm_monoid M₂]
[module R M]
[module R M₂]
{s : set M}
{f g : M →ₗ[R] M₂}
(H : set.eq_on ⇑f ⇑g s) :
set.eq_on ⇑f ⇑g ↑(submodule.span R s)
If two linear maps are equal on a set s, then they are equal on submodule.span s.
This version uses set.eq_on, and the hidden argument will expand to h : x ∈ (span R s : set M).
See linear_map.eq_on_span for a version that takes h : x ∈ span R s as an argument.
theorem
linear_map.ext_on
{R : Type u}
{M : Type v}
{M₂ : Type w}
[semiring R]
[add_comm_monoid M]
[add_comm_monoid M₂]
[module R M]
[module R M₂]
{s : set M}
{f g : M →ₗ[R] M₂}
(hv : submodule.span R s = ⊤)
(h : set.eq_on ⇑f ⇑g s) :
f = g
If s generates the whole module and linear maps f, g are equal on s, then they are
equal.
theorem
linear_map.ext_on_range
{R : Type u}
{M : Type v}
{M₂ : Type w}
{ι : Type x}
[semiring R]
[add_comm_monoid M]
[add_comm_monoid M₂]
[module R M]
[module R M₂]
{v : ι → M}
{f g : M →ₗ[R] M₂}
(hv : submodule.span R (set.range v) = ⊤)
(h : ∀ (i : ι), ⇑f (v i) = ⇑g (v i)) :
f = g
If the range of v : ι → M generates the whole module and linear maps f, g are equal at
each v i, then they are equal.
@[simp]
theorem
linear_map.map_finsupp_sum
{R : Type u}
{M : Type v}
{M₂ : Type w}
{ι : Type x}
[semiring R]
[add_comm_monoid M]
[add_comm_monoid M₂]
[module R M]
[module R M₂]
{γ : Type u_1}
[has_zero γ]
(f : M →ₗ[R] M₂)
{t : ι →₀ γ}
{g : ι → γ → M} :
@[simp]
theorem
linear_map.finsupp_sum_apply
{R : Type u}
{M : Type v}
{M₂ : Type w}
{ι : Type x}
[semiring R]
[add_comm_monoid M]
[add_comm_monoid M₂]
[module R M]
[module R M₂]
{γ : Type u_1}
[has_zero γ]
(t : ι →₀ γ)
(g : ι → γ → (M →ₗ[R] M₂))
(b : M) :
@[simp]
theorem
linear_map.map_dfinsupp_sum
{R : Type u}
{M : Type v}
{M₂ : Type w}
{ι : Type x}
[semiring R]
[add_comm_monoid M]
[add_comm_monoid M₂]
[module R M]
[module R M₂]
{γ : ι → Type u_1}
[decidable_eq ι]
[Π (i : ι), has_zero (γ i)]
[Π (i : ι) (x : γ i), decidable (x ≠ 0)]
(f : M →ₗ[R] M₂)
{t : Π₀ (i : ι), γ i}
{g : Π (i : ι), γ i → M} :
theorem
linear_map.coe_dfinsupp_sum
{R : Type u}
{M : Type v}
{M₂ : Type w}
{ι : Type x}
[semiring R]
[add_comm_monoid M]
[add_comm_monoid M₂]
[module R M]
[module R M₂]
{γ : ι → Type u_1}
[decidable_eq ι]
[Π (i : ι), has_zero (γ i)]
[Π (i : ι) (x : γ i), decidable (x ≠ 0)]
(t : Π₀ (i : ι), γ i)
(g : Π (i : ι), γ i → (M →ₗ[R] M₂)) :
@[simp]
theorem
linear_map.dfinsupp_sum_apply
{R : Type u}
{M : Type v}
{M₂ : Type w}
{ι : Type x}
[semiring R]
[add_comm_monoid M]
[add_comm_monoid M₂]
[module R M]
[module R M₂]
{γ : ι → Type u_1}
[decidable_eq ι]
[Π (i : ι), has_zero (γ i)]
[Π (i : ι) (x : γ i), decidable (x ≠ 0)]
(t : Π₀ (i : ι), γ i)
(g : Π (i : ι), γ i → (M →ₗ[R] M₂))
(b : M) :
@[simp]
theorem
linear_map.map_dfinsupp_sum_add_hom
{R : Type u}
{M : Type v}
{M₂ : Type w}
{ι : Type x}
[semiring R]
[add_comm_monoid M]
[add_comm_monoid M₂]
[module R M]
[module R M₂]
{γ : ι → Type u_1}
[decidable_eq ι]
[Π (i : ι), add_zero_class (γ i)]
(f : M →ₗ[R] M₂)
{t : Π₀ (i : ι), γ i}
{g : Π (i : ι), γ i →+ M} :
⇑f (⇑(dfinsupp.sum_add_hom g) t) = ⇑(dfinsupp.sum_add_hom (λ (i : ι), f.to_add_monoid_hom.comp (g i))) t
theorem
linear_map.map_cod_restrict
{R : Type u}
{M : Type v}
{M₂ : Type w}
[semiring R]
[add_comm_monoid M]
[add_comm_monoid M₂]
[module R M]
[module R M₂]
(p : submodule R M)
(f : M₂ →ₗ[R] M)
(h : ∀ (c : M₂), ⇑f c ∈ p)
(p' : submodule R M₂) :
submodule.map (linear_map.cod_restrict p f h) p' = submodule.comap p.subtype (submodule.map f p')
theorem
linear_map.comap_cod_restrict
{R : Type u}
{M : Type v}
{M₂ : Type w}
[semiring R]
[add_comm_monoid M]
[add_comm_monoid M₂]
[module R M]
[module R M₂]
(p : submodule R M)
(f : M₂ →ₗ[R] M)
(hf : ∀ (c : M₂), ⇑f c ∈ p)
(p' : submodule R ↥p) :
submodule.comap (linear_map.cod_restrict p f hf) p' = submodule.comap f (submodule.map p.subtype p')
def
linear_map.range
{R : Type u}
{M : Type v}
{M₂ : Type w}
[semiring R]
[add_comm_monoid M]
[add_comm_monoid M₂]
[module R M]
[module R M₂]
(f : M →ₗ[R] M₂) :
submodule R M₂
The range of a linear map f : M → M₂ is a submodule of M₂. See Note [range copy pattern].
theorem
linear_map.range_coe
{R : Type u}
{M : Type v}
{M₂ : Type w}
[semiring R]
[add_comm_monoid M]
[add_comm_monoid M₂]
[module R M]
[module R M₂]
(f : M →ₗ[R] M₂) :
@[simp]
theorem
linear_map.mem_range
{R : Type u}
{M : Type v}
{M₂ : Type w}
[semiring R]
[add_comm_monoid M]
[add_comm_monoid M₂]
[module R M]
[module R M₂]
{f : M →ₗ[R] M₂}
{x : M₂} :
theorem
linear_map.range_eq_map
{R : Type u}
{M : Type v}
{M₂ : Type w}
[semiring R]
[add_comm_monoid M]
[add_comm_monoid M₂]
[module R M]
[module R M₂]
(f : M →ₗ[R] M₂) :
f.range = submodule.map f ⊤
theorem
linear_map.mem_range_self
{R : Type u}
{M : Type v}
{M₂ : Type w}
[semiring R]
[add_comm_monoid M]
[add_comm_monoid M₂]
[module R M]
[module R M₂]
(f : M →ₗ[R] M₂)
(x : M) :
@[simp]
theorem
linear_map.range_id
{R : Type u}
{M : Type v}
[semiring R]
[add_comm_monoid M]
[module R M] :
theorem
linear_map.range_comp
{R : Type u}
{M : Type v}
{M₂ : Type w}
{M₃ : Type y}
[semiring R]
[add_comm_monoid M]
[add_comm_monoid M₂]
[add_comm_monoid M₃]
[module R M]
[module R M₂]
[module R M₃]
(f : M →ₗ[R] M₂)
(g : M₂ →ₗ[R] M₃) :
(g.comp f).range = submodule.map g f.range
theorem
linear_map.range_comp_le_range
{R : Type u}
{M : Type v}
{M₂ : Type w}
{M₃ : Type y}
[semiring R]
[add_comm_monoid M]
[add_comm_monoid M₂]
[add_comm_monoid M₃]
[module R M]
[module R M₂]
[