Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Free module
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
== Formal linear combinations == {{anchor|Free module over a set}}Given a set {{math|''E''}} and ring {{math|''R''}}, there is a free {{math|''R''}}-module that has {{math|''E''}} as a basis: namely, the [[direct sum of modules|direct sum]] of copies of ''R'' indexed by ''E'' : <math>R^{(E)} = \bigoplus_{e \in E} R</math>. Explicitly, it is the submodule of the [[Direct_product#Direct_product_of_modules|Cartesian product]] <math display="inline">\prod_E R</math> (''R'' is viewed as say a left module) that consists of the elements that have only finitely many nonzero components. One can [[Embedding|embed]] ''E'' into {{math|''R''<sup>(''E'')</sup>}} as a subset by identifying an element ''e'' with that of {{math|''R''<sup>(''E'')</sup>}} whose ''e''-th component is 1 (the unity of ''R'') and all the other components are zero. Then each element of {{math|''R''<sup>(''E'')</sup>}} can be written uniquely as : <math>\sum_{e \in E} c_e e ,</math> where only finitely many <math>c_e</math> are nonzero. It is called a ''[[formal linear combination]]'' of elements of {{math|''E''}}. 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 {{math|''R''<sup>(''E'')</sup>}} may also be constructed in the following equivalent way. Given a ring ''R'' and a set ''E'', first as a set we let : <math>R^{(E)} = \{ f: E \to R \mid f(x) = 0 \text { for all but finitely many } x \in E \}.</math> We equip it with a structure of a left module such that the addition is defined by: for ''x'' in ''E'', : <math>(f+g)(x) = f(x) + g(x)</math> and the scalar multiplication by: for ''r'' in ''R'' and ''x'' in ''E'', : <math>(r f)(x) = r f(x)</math> Now, as an ''R''-valued [[Function (mathematics)|function]] on ''E'', each ''f'' in <math>R^{(E)}</math> can be written uniquely as : <math>f = \sum_{e \in E} c_e \delta_e</math> where <math>c_e</math> are in ''R'' and only finitely many of them are nonzero and <math>\delta_e</math> is given as : <math> \delta_e(x) = \begin{cases} 1_R \quad\mbox{if } x=e \\ 0_R \quad\mbox{if } x\neq e \end{cases} </math> (this is a variant of the [[Kronecker delta]]). The above means that the subset <math>\{ \delta_e \mid e \in E \}</math> of <math>R^{(E)}</math> is a basis of <math>R^{(E)}</math>. The mapping <math>e \mapsto \delta_e</math> is a [[bijection]] between {{math|''E''}} and this basis. Through this bijection, <math>R^{(E)}</math> is a free module with the basis ''E''.
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)