Module Of Finite Type
In mathematics, a finitely generated module is a module that has a finite generating set. A finitely generated module over a ring ''R'' may also be called a finite ''R''-module, finite over ''R'', or a module of finite type. Related concepts include finitely cogenerated modules, finitely presented modules, finitely related modules and coherent modules all of which are defined below. Over a Noetherian ring the concepts of finitely generated, finitely presented and coherent modules coincide. A finitely generated module over a field is simply a finite-dimensional vector space, and a finitely generated module over the integers is simply a finitely generated abelian group. Definition The left ''R''-module ''M'' is finitely generated if there exist ''a''1, ''a''2, ..., ''a''''n'' in ''M'' such that for any ''x'' in ''M'', there exist ''r''1, ''r''2, ..., ''r''''n'' in ''R'' with ''x'' = ''r''1''a''1 + ''r''2''a''2 + ... + ''r''''n''''a''''n''. The set is referred to as a generating ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Mathematics
Mathematics is an area of knowledge that includes the topics of numbers, formulas and related structures, shapes and the spaces in which they are contained, and quantities and their changes. These topics are represented in modern mathematics with the major subdisciplines of number theory, algebra, geometry, and analysis, respectively. There is no general consensus among mathematicians about a common definition for their academic discipline. Most mathematical activity involves the discovery of properties of abstract objects and the use of pure reason to prove them. These objects consist of either abstractions from nature orin modern mathematicsentities that are stipulated to have certain properties, called axioms. A ''proof'' consists of a succession of applications of deductive rules to already established results. These results include previously proved theorems, axioms, andin case of abstraction from naturesome basic properties that are considered true starting points of ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Field (mathematics)
In mathematics, a field is a set on which addition, subtraction, multiplication, and division are defined and behave as the corresponding operations on rational and real numbers do. A field is thus a fundamental algebraic structure which is widely used in algebra, number theory, and many other areas of mathematics. The best known fields are the field of rational numbers, the field of real numbers and the field of complex numbers. Many other fields, such as fields of rational functions, algebraic function fields, algebraic number fields, and ''p''-adic fields are commonly used and studied in mathematics, particularly in number theory and algebraic geometry. Most cryptographic protocols rely on finite fields, i.e., fields with finitely many elements. The relation of two fields is expressed by the notion of a field extension. Galois theory, initiated by Évariste Galois in the 1830s, is devoted to understanding the symmetries of field extensions. Among other results, thi ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Polynomial
In mathematics, a polynomial is an expression consisting of indeterminates (also called variables) and coefficients, that involves only the operations of addition, subtraction, multiplication, and positive-integer powers of variables. An example of a polynomial of a single indeterminate is . An example with three indeterminates is . Polynomials appear in many areas of mathematics and science. For example, they are used to form polynomial equations, which encode a wide range of problems, from elementary word problems to complicated scientific problems; they are used to define polynomial functions, which appear in settings ranging from basic chemistry and physics to economics and social science; they are used in calculus and numerical analysis to approximate other functions. In advanced mathematics, polynomials are used to construct polynomial rings and algebraic varieties, which are central concepts in algebra and algebraic geometry. Etymology The word ''polynomial'' join ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Submodule
In mathematics, a module is a generalization of the notion of vector space in which the field of scalars is replaced by a ring. The concept of ''module'' generalizes also the notion of abelian group, since the abelian groups are exactly the modules over the ring of integers. Like a vector space, a module is an additive abelian group, and scalar multiplication is distributive over the operation of addition between elements of the ring or module and is compatible with the ring multiplication. Modules are very closely related to the representation theory of groups. They are also one of the central notions of commutative algebra and homological algebra, and are used widely in algebraic geometry and algebraic topology. Introduction and definition Motivation In a vector space, the set of scalars is a field and acts on the vectors by scalar multiplication, subject to certain axioms such as the distributive law. In a module, the scalars need only be a ring, so the module conce ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Division Ring
In algebra, a division ring, also called a skew field, is a nontrivial ring in which division by nonzero elements is defined. Specifically, it is a nontrivial ring in which every nonzero element has a multiplicative inverse, that is, an element usually denoted , such that . So, (right) ''division'' may be defined as , but this notation is avoided, as one may have . A commutative division ring is a field. Wedderburn's little theorem asserts that all finite division rings are commutative and therefore finite fields. Historically, division rings were sometimes referred to as fields, while fields were called "commutative fields". In some languages, such as French, the word equivalent to "field" ("corps") is used for both commutative and noncommutative cases, and the distinction between the two cases is made by adding qualificatives such as "corps commutatif" (commutative field) or "corps gauche" (skew field). All division rings are simple. That is, they have no two-sided ideal besi ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Structure Theorem For Finitely Generated Modules Over A Principal Ideal Domain
In mathematics, in the field of abstract algebra, the structure theorem for finitely generated modules over a principal ideal domain is a generalization of the fundamental theorem of finitely generated abelian groups and roughly states that finitely generated modules over a principal ideal domain (PID) can be uniquely decomposed in much the same way that integers have a prime factorization. The result provides a simple framework to understand various canonical form results for square matrices over fields. Statement When a vector space over a field ''F'' has a finite generating set, then one may extract from it a basis consisting of a finite number ''n'' of vectors, and the space is therefore isomorphic to ''F''''n''. The corresponding statement with the ''F'' generalized to a principal ideal domain ''R'' is no longer true, since a basis for a finitely generated module over ''R'' might not exist. However such a module is still isomorphic to a quotient of some module ''Rn'' with '' ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Fractional Ideal
In mathematics, in particular commutative algebra, the concept of fractional ideal is introduced in the context of integral domains and is particularly fruitful in the study of Dedekind domains. In some sense, fractional ideals of an integral domain are like ideals where denominators are allowed. In contexts where fractional ideals and ordinary ring ideals are both under discussion, the latter are sometimes termed ''integral ideals'' for clarity. Definition and basic results Let R be an integral domain, and let K = \operatornameR be its field of fractions. A fractional ideal of R is an R-submodule I of K such that there exists a non-zero r \in R such that rI\subseteq R. The element r can be thought of as clearing out the denominators in I, hence the name fractional ideal. The principal fractional ideals are those R-submodules of K generated by a single nonzero element of K. A fractional ideal I is contained in R if, and only if, it is an ('integral') ideal of R. A fractional id ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Cyclic Module
In mathematics, more specifically in ring theory, a cyclic module or monogenous module is a module over a ring that is generated by one element. The concept is a generalization of the notion of a cyclic group, that is, an Abelian group (i.e. Z-module) that is generated by one element. Definition A left ''R''-module ''M'' is called cyclic if ''M'' can be generated by a single element i.e. for some ''x'' in ''M''. Similarly, a right ''R''-module ''N'' is cyclic if for some . Examples * 2Z as a Z-module is a cyclic module. * In fact, every cyclic group is a cyclic Z-module. * Every simple ''R''-module ''M'' is a cyclic module since the submodule generated by any non-zero element ''x'' of ''M'' is necessarily the whole module ''M''. In general, a module is simple if and only if it is nonzero and is generated by each of its nonzero elements. * If the ring ''R'' is considered as a left module over itself, then its cyclic submodules are exactly its left principal ideals as a ring ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Noetherian Module
In abstract algebra, a Noetherian module is a module that satisfies the ascending chain condition on its submodules, where the submodules are partially ordered by inclusion. Historically, Hilbert was the first mathematician to work with the properties of finitely generated submodules. He proved an important theorem known as Hilbert's basis theorem which says that any ideal in the multivariate polynomial ring of an arbitrary field is finitely generated. However, the property is named after Emmy Noether who was the first one to discover the true importance of the property. Characterizations and properties In the presence of the axiom of choice, two other characterizations are possible: *Any nonempty set ''S'' of submodules of the module has a maximal element (with respect to set inclusion). This is known as the maximum condition. *All of the submodules of the module are finitely generated. If ''M'' is a module and ''K'' a submodule, then ''M'' is Noetherian if and only if ''K ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Maximal Submodule
In mathematics, more specifically in ring theory, a maximal ideal is an ideal that is maximal (with respect to set inclusion) amongst all ''proper'' ideals. In other words, ''I'' is a maximal ideal of a ring ''R'' if there are no other ideals contained between ''I'' and ''R''. Maximal ideals are important because the quotients of rings by maximal ideals are simple rings, and in the special case of unital commutative rings they are also fields. In noncommutative ring theory, a maximal right ideal is defined analogously as being a maximal element in the poset of proper right ideals, and similarly, a maximal left ideal is defined to be a maximal element of the poset of proper left ideals. Since a one sided maximal ideal ''A'' is not necessarily two-sided, the quotient ''R''/''A'' is not necessarily a ring, but it is a simple module over ''R''. If ''R'' has a unique maximal right ideal, then ''R'' is known as a local ring, and the maximal right ideal is also the unique maximal lef ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Directed Set
In mathematics, a directed set (or a directed preorder or a filtered set) is a nonempty set A together with a reflexive and transitive binary relation \,\leq\, (that is, a preorder), with the additional property that every pair of elements has an upper bound. In other words, for any a and b in A there must exist c in A with a \leq c and b \leq c. A directed set's preorder is called a . The notion defined above is sometimes called an . A is defined analogously, meaning that every pair of elements is bounded below. Some authors (and this article) assume that a directed set is directed upward, unless otherwise stated. Other authors call a set directed if and only if it is directed both upward and downward. Directed sets are a generalization of nonempty totally ordered sets. That is, all totally ordered sets are directed sets (contrast ordered sets, which need not be directed). Join-semilattices (which are partially ordered sets) are directed sets as well, but not conversely. ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |