Discover

In mathematics, a 'free module' is a free object in the category of modules. Given a set ''S'', a free module on ''S'' is a (particular construction of a) free module with basis ''S''.
Every vector space is free, and the free vector space on a set is a special case of a free module on a set.

Contents

Definition

Construction

Dual: functions on a set

Universal property

See also

Definition

A free module is a module with a ''free basis'': a linearly independent generating set.
For an ''R''-module ''M'', the set ''E'' = {''e''₁, ''e''₂, ... ''e''_''n''} is a free basis for ''M'' if:
# ''E'' is a generating set for ''M'', that is to say every element of ''M'' is a finite sum of elements of ''E'' multiplied by coefficients in ''R'';
# ''E'' is a 'free set' that is if ''r''₁''e''₁ + ''r''₂''e''₂ + ... + ''r''_''n''''e''_''n'' = '0', then ''r''₁ = ''r''₂ = ... = ''r''_n = ''0'' (where '0' is the zero element of ''M'' and ''0'' is the zero element of ''R'').
If ''R'' has invariant basis number, then by definition any two bases have the same cardinality. The cardinality of any (and therefore every) basis is called the 'rank' of the free module ''M'', and ''M'' is said to be ''free of rank n'', or simply ''free of finite rank'' if the cardinality is finite.
Note that an immediate corollary of (2) is that the coefficients in (1) are unique for each ''x''.
The definition of an infinite free basis is similar, except that ''E'' will have infinitely many elements. However the sum must be finite, and thus for any particular ''x'' only finitely many of the elements of ''E'' are involved.
In the case of an infinite basis, the rank of ''M'' is the cardinality of ''E''.

Construction

Given a set ''E'', we can construct a free ''R''-module over ''E'', denoted by ''C''(''E''), as follows:

★ 'As a set,' ''C''(''E'') contains the functions ''f'' : ''E'' → ''R'' such that ''f''(''x'') = 0 for cofinitely many (all but finitely many) ''x'' in ''E''.

★ 'Addition:' for two elements ''f'', ''g'' ∈ ''C''(''E''), we define ''f'' + ''g'' ∈ ''C''(''E'') by (''f'' + ''g'')(''x'') = ''f''(''x'') + ''g''(''x'') for all ''x'' ∈ ''E''.

★ 'Scalar multiplication:' for α ∈ ''R'' and ''f'' ∈ ''C''(''E''), we define α''f'' ∈ ''C''(''E'') by (α''f'')(''x'') = α''f''(''x'') for all ''x'' ∈ ''E''.
A basis for ''C''(''E'') is given by the set { Δ_''a'' : ''a'' ∈ ''E'' } where
:
eq a. end{cases}
Define the mapping ι : ''E'' → ''C''(''E'') by ι(''a'') = Δ_''a''. This mapping gives a bijection between ''E'' and the basis vectors {Δ_''a''}_{''a''∈''E''}. We can thus identify these spaces. Then ''E'' becomes a linearly independent basis for ''C''(''E'').

Dual: functions on a set

Universal property

The mapping ι : ''E'' → ''C''(''E'') defined above is universal in the following sense. If φ is an arbitrary mapping from ''E'' to some ''R''-module ''M'', then there exists a unique mapping ψ: ''C''(''E'') → ''M'' such that φ = ψ
o ι.

See also

★ Free object