Free Module
   HOME

TheInfoList



OR:

In mathematics, a free module is a module that has a basis – that is, a generating set consisting of
linearly independent In the theory of vector spaces, a set of vectors is said to be if there is a nontrivial linear combination of the vectors that equals the zero vector. If no such linear combination exists, then the vectors are said to be . These concepts ...
elements. Every
vector space In mathematics and physics, a vector space (also called a linear space) is a set whose elements, often called '' vectors'', may be added together and multiplied ("scaled") by numbers called '' scalars''. Scalars are often real numbers, but ...
is a free module, but, if the ring of the coefficients is not a division ring (not a field in the
commutative In mathematics, a binary operation is commutative if changing the order of the operands does not change the result. It is a fundamental property of many binary operations, and many mathematical proofs depend on it. Most familiar as the name o ...
case), then there exist non-free modules. Given any set and ring , there is a free -module with basis , which is called the ''free module on'' or ''module of formal'' -''linear combinations'' of the elements of . A
free abelian group In mathematics, a free abelian group is an abelian group with a basis. Being an abelian group means that it is a set with an addition operation that is associative, commutative, and invertible. A basis, also called an integral basis, is a su ...
is precisely a free module over the ring of
integer An integer is the number zero (), a positive natural number (, , , etc.) or a negative integer with a minus sign ( −1, −2, −3, etc.). The negative numbers are the additive inverses of the corresponding positive numbers. In the language ...
s.


Definition

For a ring R and an R- module M, the set E\subseteq M is a 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; and * E is
linearly independent In the theory of vector spaces, a set of vectors is said to be if there is a nontrivial linear combination of the vectors that equals the zero vector. If no such linear combination exists, then the vectors are said to be . These concepts ...
, that is, for every subset \ of distinct elements of E, r_1 e_1 + r_2 e_2 + \cdots + r_n e_n = 0_M implies that r_1 = r_2 = \cdots = r_n = 0_R (where 0_M is the zero element of M and 0_R is the zero element of R). A free module is a module with a basis. An immediate consequence of the second half of the definition is that the coefficients in the first half are unique for each element of ''M''. If R has invariant basis number, then by definition any two bases have the same cardinality. For example, nonzero commutative rings have invariant basis number. The cardinality of any (and therefore every) basis is called the rank of the free module M. If this cardinality is finite, the free module is said to be ''free of finite rank'', or ''free of rank'' if the rank is known to be .


Examples

Let ''R'' be a ring. *''R'' is a free module of rank one over itself (either as a left or right module); any unit element is a basis. *More generally, If ''R'' is commutative, a nonzero ideal ''I'' of ''R'' is free if and only if it is a principal ideal generated by a nonzerodivisor, with a generator being a basis.Proof: Suppose I is free with a basis \. For j \ne k, x_j x_k must have the unique linear combination in terms of x_j and x_k, which is not true. Thus, since I \ne 0, there is only one basis element which must be a nonzerodivisor. The converse is clear.\square *If ''R'' is commutative, the polynomial ring R /math> in indeterminate ''X'' is a free module with a possible basis 1, ''X'', ''X''2, .... *Let A /math> be a polynomial ring over a commutative ring ''A'', ''f'' a monic polynomial of degree ''d'' there, B = A (f) and \xi the image of ''t'' in ''B''. Then ''B'' contains ''A'' as a subring and is free as an ''A''-module with a basis 1, \xi, \dots, \xi^. *For any non-negative integer ''n'', R^n = R \times \cdots \times R, the
cartesian product In mathematics, specifically set theory, the Cartesian product of two sets ''A'' and ''B'', denoted ''A''×''B'', is the set of all ordered pairs where ''a'' is in ''A'' and ''b'' is in ''B''. In terms of set-builder notation, that is : A\ ...
of ''n'' copies of ''R'' as a left ''R''-module, is free. If ''R'' has invariant basis number, then its rank is ''n''. *A
direct sum The direct sum is an operation between structures in abstract algebra, a branch of mathematics. It is defined differently, but analogously, for different kinds of structures. To see how the direct sum is used in abstract algebra, consider a mo ...
of free modules is free, while an infinite cartesian product of free modules is generally ''not'' free (cf. the Baer–Specker group). * Kaplansky's theorem states a projective module over a local ring is free.


Formal linear combinations

Given a set and ring , there is a free -module that has as a basis: namely, the
direct sum The direct sum is an operation between structures in abstract algebra, a branch of mathematics. It is defined differently, but analogously, for different kinds of structures. To see how the direct sum is used in abstract algebra, consider a mo ...
of copies of ''R'' indexed by ''E'' :R^ = \bigoplus_ R. Explicitly, it is the submodule of the
Cartesian product In mathematics, specifically set theory, the Cartesian product of two sets ''A'' and ''B'', denoted ''A''×''B'', is the set of all ordered pairs where ''a'' is in ''A'' and ''b'' is in ''B''. In terms of set-builder notation, that is : A\ ...
\prod_E R (''R'' is viewed as say a left module) that consists of the elements that have only finitely many nonzero components. One can embed ''E'' into as a subset by identifying an element ''e'' with that of whose ''e''-th component is 1 (the unity of ''R'') and all the other components are zero. Then each element of can be written uniquely as :\sum_ c_e e , where only finitely many c_e are nonzero. It is called a '' formal linear combination'' of elements of . A similar argument shows that every free left (resp. right) ''R''-module is isomorphic to a direct sum of copies of ''R'' as left (resp. right) module.


Another construction

The free module may also be constructed in the following equivalent way. Given a ring ''R'' and a set ''E'', first as a set we let :R^ = \. We equip it with a structure of a left module such that the addition is defined by: for ''x'' in ''E'', :(f+g)(x) = f(x) + g(x) and the scalar multiplication by: for ''r'' in ''R'' and ''x'' in ''E'', :(r f)(x) = r (f(x)) Now, as an ''R''-valued function on ''E'', each ''f'' in R^ can be written uniquely as :f = \sum_ c_e \delta_e where c_e are in ''R'' and only finitely many of them are nonzero and \delta_e is given as : \delta_e(x) = \begin 1_R \quad\mbox x=e \\ 0_R \quad\mbox x\neq e \end (this is a variant of the
Kronecker delta In mathematics, the Kronecker delta (named after Leopold Kronecker) is a function of two variables, usually just non-negative integers. The function is 1 if the variables are equal, and 0 otherwise: \delta_ = \begin 0 &\text i \neq j, \\ 1 ...
.) The above means that the subset \ of R^ is a basis of R^. The mapping e \mapsto \delta_e is a bijection between and this basis. Through this bijection, R^ is a free module with the basis ''E''.


Universal property

The inclusion mapping \iota : E\to R^ defined above is universal in the following sense. Given an arbitrary function f : E\to N from a set to a left -module , there exists a unique module homomorphism \overline: R^\to N such that f = \overline \circ\iota; namely, \overline is defined by the formula: :\overline\left (\sum_ r_e e \right) = \sum_ r_e f(e) and \overline is said to be obtained by ''extending f by linearity.'' The uniqueness means that each ''R''-linear map R^ \to N is uniquely determined by its
restriction Restriction, restrict or restrictor may refer to: Science and technology * restrict, a keyword in the C programming language used in pointer declarations * Restriction enzyme, a type of enzyme that cleaves genetic material Mathematics and log ...
to ''E''. As usual for universal properties, this defines
up to Two mathematical objects ''a'' and ''b'' are called equal up to an equivalence relation ''R'' * if ''a'' and ''b'' are related by ''R'', that is, * if ''aRb'' holds, that is, * if the equivalence classes of ''a'' and ''b'' with respect to ''R'' a ...
a
canonical isomorphism In mathematics, an isomorphism is a structure-preserving mapping between two structures of the same type that can be reversed by an inverse mapping. Two mathematical structures are isomorphic if an isomorphism exists between them. The word i ...
. Also the formation of \iota : E\to R^ for each set ''E'' determines a
functor In mathematics, specifically category theory, a functor is a mapping between categories. Functors were first considered in algebraic topology, where algebraic objects (such as the fundamental group) are associated to topological spaces, an ...
:R^: \textbf \to R-\mathsf, \, E \mapsto R^, from the
category of sets In the mathematical field of category theory, the category of sets, denoted as Set, is the category whose objects are sets. The arrows or morphisms between sets ''A'' and ''B'' are the total functions from ''A'' to ''B'', and the composition ...
to the category of left -modules. It is called the free functor and satisfies a natural relation: for each set ''E'' and a left module ''N'', :\operatorname_(E, U(N)) \simeq \operatorname_R(R^, N), \, f \mapsto \overline where U: R-\mathsf \to \textbf is the forgetful functor, meaning R^ is a left adjoint of the forgetful functor.


Generalizations

Many statements about free modules, which are wrong for general modules over rings, are still true for certain generalisations of free modules. Projective modules are direct summands of free modules, so one can choose an injection into a free module and use the basis of this one to prove something for the projective module. Even weaker generalisations are flat modules, which still have the property that tensoring with them preserves exact sequences, and torsion-free modules. If the ring has special properties, this hierarchy may collapse, e.g., for any perfect local Dedekind ring, every torsion-free module is flat, projective and free as well. A finitely generated torsion-free module of a commutative PID is free. A finitely generated ''Z''-module is free if and only if it is flat. : See local ring,
perfect ring In the area of abstract algebra known as ring theory, a left perfect ring is a type of ring in which all left modules have projective covers. The right case is defined by analogy, and the condition is not left-right symmetric; that is, there exis ...
and Dedekind ring.


See also

*
Free object In mathematics, the idea of a free object is one of the basic concepts of abstract algebra. Informally, a free object over a set ''A'' can be thought of as being a "generic" algebraic structure over ''A'': the only equations that hold between ele ...
*
Projective object In category theory, the notion of a projective object generalizes the notion of a projective module. Projective objects in abelian categories are used in homological algebra. The dual notion of a projective object is that of an injective object ...
* free presentation * free resolution *
Quillen–Suslin theorem The Quillen–Suslin theorem, also known as Serre's problem or Serre's conjecture, is a theorem in commutative algebra concerning the relationship between free modules and projective modules over polynomial rings. In the geometric setting it i ...
* stably free module * generic freeness


Notes


References

* * * . {{Dimension topics Module theory Free algebraic structures