A subset is a basis of a module if every has a unique expressionUniqueness concerns the entire family of coefficients, including the zero coefficients. Equivalently, generates and is linearly independent in a module: every finite relation , with , has all .
A module is a free module if it has a basis of a module. An infinite basis of a module still uses only finite sums in each expression; arbitrary infinite sums are not part of the module operations.
Yes. An -module over a field is a vector space. Start with a finite generating list. If it is linearly dependent, one vector has a nonzero coefficient in a linear relation; dividing by that coefficient expresses the vector using the others, so it can be removed without changing the span. Repeating terminates with a linearly independent generating list, which is a basis and therefore a basis of a module.
Thus every finitely generated module over a field is a free module. For the zero module, the empty list is the required basis of a module.
In the direct sum of modules , every has a unique expression , with and . DefineThe uniqueness makes this well-defined. For , and ,so is a module homomorphism. Finally, exactly when , equivalently . Therefore . Its image is , and , so it is the projection onto that direct summand.
Put and , the submodules generated by the two parts of the basis of a module. Every finite expression in the basis of a module splits into its terms and its terms. Thus .
If , there are finite expressionsSubtracting gives a finite relation among distinct members of , because . Their linear independence in a module forces every coefficient to vanish, so . HenceThis proves the basis partition gives a module direct sum lemma, also when one part is empty.
Choose a countable generating family for . For each , the expression of in the basis of a module has a finite set of nonzero coefficients, its coordinate support in a free module. LetBy the countable union of countable sets property, is a countable set. Every belongs to , so all finite -linear combinations of the do too. ThereforeHere and below, countable includes finite. The same construction applies to a finite or empty generating family. This is the countable basis support lemma.
Articles by others on the same topic
There are currently no matching articles.