module Algebra.Ring.Module where
Modules🔗
A module over a ring is an abelian group equipped with an action by . Modules generalise the idea of vector spaces, which may be familiar from linear algebra, by replacing the field of scalars by a ring of scalars. More pertinently, though, modules specialise functors: specifically, functors into the category
For silly formalisation reasons, when defining modules, we do not take “an into ” as the definition: this correspondence is a theorem we prove later. Instead, we set up as typical algebraic structures, as data (and property) attached to a type.
The structure of an on a type consists of an addition and a scalar multiplication In prose, we generally omit the star, writing rather than the wordlier These must satisfy the following properties:
makes into an abelian group. Since we’ve already defined abelian groups, we can take this entire property as “indivisible”, saving some effort.
is a ring homomorphism of onto endomorphism ring. In other words, we have:
- and
record is-module {ℓ'} {T : Type ℓ'} (_+_ : T → T → T) (_⋆_ : ⌞ R ⌟ → T → T) : Type (ℓ ⊔ ℓ') where
no-eta-equality
field
: is-abelian-group _+_
has-is-ab : ∀ r x y → r ⋆ (x + y) ≡ (r ⋆ x) + (r ⋆ y)
⋆-distribl : ∀ r s x → (r R.+ s) ⋆ x ≡ (r ⋆ x) + (s ⋆ x)
⋆-distribr : ∀ r s x → r ⋆ (s ⋆ x) ≡ (r R.* s) ⋆ x
⋆-assoc : ∀ x → R.1r ⋆ x ≡ x ⋆-id
Correspondingly, a module structure on a type packages the addition, the scalar multiplication, and the proofs that these behave as we set above. A module is a type equipped with a module structure.
record Module-on {ℓ'} (T : Type ℓ') : Type (ℓ ⊔ ℓ') where
no-eta-equality
field
_+_ : T → T → T
_⋆_ : ⌞ R ⌟ → T → T
: is-module _+_ _⋆_
has-is-mod
infixl 25 _+_
infixr 27 _⋆_
open is-module has-is-mod public
: ∀ ℓm → Type (lsuc ℓm ⊔ ℓ)
Module = Σ (Set ℓm) λ X → Module-on ∣ X ∣
Module ℓm
record is-linear-map (f : S → T) (M : Module-on S) (N : Module-on T)
: Type (ℓ ⊔ level-of S ⊔ level-of T) where
Linear maps🔗
The correct notion of morphism between is the linear map; in case we need to make the base ring clear, we shall call them maps. Since the structure of are their additions and their scalar multiplications, it stands to reason that these are what homomorphisms should preserve. Rather than separately asking for preservation of addition and of multiplication, the following single assumption suffices:
field linear : ∀ r s t → f (r ⋆ s + t) ≡ r ⋆ f s + f t
Any map which satisfies this equation must preserve addition, since we have
and standard lemmas about group homomorphisms ensure that will also preserve negation, and, more importantly, zero. We can then derive that preserves the scalar multiplication, by calculating
record Linear-map (M : Module ℓm) (N : Module ℓn) : Type (ℓ ⊔ ℓm ⊔ ℓn) where
no-eta-equality
field
: ⌞ M ⌟ → ⌞ N ⌟
map : is-linear-map map (M .snd) (N .snd)
lin open is-linear-map lin public
The collection of linear maps forms a set, whose identity type is given by pointwise identity of the underlying maps. Therefore, we may take these to be the morphisms of a category is a very standard category, so very standard constructions can set up the category, the functor witnessing its concreteness, and a proof that it is univalent.
: ∀ {ℓ} → Thin-structure _ Module-on
R-Mod-structure {ℓ} = rms where
R-Mod-structure : Thin-structure _ Module-on
rms .is-hom f M N ∣ = is-linear-map {ℓ} {_} {ℓ} f M N
∣ rms .is-hom f M N .is-tr = is-linear-map-is-prop
rms
.id-is-hom .linear r s t = refl
rms .∘-is-hom f g α β .linear r s t =
rms (β .linear r s t) ∙ α .linear _ _ _
ap f
.id-hom-unique {s = s} {t = t} α _ = r where
rms module s = Module-on s
module t = Module-on t
: s ≡ t
r .Module-on._+_ x y = is-linear-map.pres-+ α x y i
r i .Module-on._⋆_ x y = is-linear-map.pres-⋆ α x y i
r i .Module-on.has-is-mod =
r i (λ i → hlevel {T = is-module
is-prop→pathp (λ x y → is-linear-map.pres-+ α x y i)
(λ x y → is-linear-map.pres-⋆ α x y i)} 1)
(Module-on.has-is-mod s) (Module-on.has-is-mod t) i
“Representable” modules🔗
A prototypical example of is.. itself! A ring has an underlying abelian group, and the multiplication operation can certainly be considered a special kind of “scalar multiplication”. If we treat as an with a single object, this construction corresponds to the functor — the “Yoneda embedding” of unique object. Stretching the analogy, we refer to as the “representable”
: Module ℓ
representable-module .fst = R .fst
representable-module .snd = to-module-on record
representable-module { has-is-set = R.has-is-set
; _+_ = R._+_
; inv = R.-_
; 0g = R.0r
; +-assoc = λ x y z → R.+-associative
; +-invl = λ x → R.+-invl
; +-idl = λ x → R.+-idl
; +-comm = λ x y → R.+-commutes
; _⋆_ = R._*_
; ⋆-distribl = λ x y z → R.*-distribl
; ⋆-distribr = λ x y z → R.*-distribr
; ⋆-assoc = λ x y z → R.*-associative
; ⋆-id = λ x → R.*-idl
}
Another perspective on this construction is that we are regarding as the space of “1-dimensional vectors” over itself. Following this line of reasoning one can define the module of vectors over