|
Length Of A Module
In abstract algebra, the length of a module is a generalization of the dimension of a vector space which measures its size. page 153 In particular, as in the case of vector spaces, the only modules of finite length are finitely generated modules. It is defined to be the length of the longest chain of submodules. Modules with ''finite'' length share many important properties with finite-dimensional vector spaces. Other concepts used to 'count' in ring and module theory are depth and height; these are both somewhat more subtle to define. Moreover, their use is more aligned with dimension theory whereas length is used to analyze finite modules. There are also various ideas of ''dimension'' that are useful. Finite length commutative rings play an essential role in functorial treatments of formal algebraic geometry and deformation theory where Artin rings are used extensively. Definition Length of a module Let M be a (left or right) module over some ring R. Given a chain of submo ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Abstract Algebra
In mathematics, more specifically algebra, abstract algebra or modern algebra is the study of algebraic structures. Algebraic structures include groups, rings, fields, modules, vector spaces, lattices, and algebras over a field. The term ''abstract algebra'' was coined in the early 20th century to distinguish this area of study from older parts of algebra, and more specifically from elementary algebra, the use of variables to represent numbers in computation and reasoning. Algebraic structures, with their associated homomorphisms, form mathematical categories. Category theory is a formalism that allows a unified way for expressing properties and constructions that are similar for various structures. Universal algebra is a related subject that studies types of algebraic structures as single objects. For example, the structure of groups is a single object in universal algebra, which is called the ''variety of groups''. History Before the nineteenth century, algebra meant ... [...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] |
Multiplicity (mathematics)
In mathematics, the multiplicity of a member of a multiset is the number of times it appears in the multiset. For example, the number of times a given polynomial has a root at a given point is the multiplicity of that root. The notion of multiplicity is important to be able to count correctly without specifying exceptions (for example, ''double roots'' counted twice). Hence the expression, "counted with multiplicity". If multiplicity is ignored, this may be emphasized by counting the number of ''distinct'' elements, as in "the number of distinct roots". However, whenever a set (as opposed to multiset) is formed, multiplicity is automatically ignored, without requiring use of the term "distinct". Multiplicity of a prime factor In prime factorization, the multiplicity of a prime factor is its p-adic valuation. For example, the prime factorization of the integer is : the multiplicity of the prime factor is , while the multiplicity of each of the prime factors and is . ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Jean-Pierre Serre
Jean-Pierre Serre (; born 15 September 1926) is a French mathematician who has made contributions to algebraic topology, algebraic geometry, and algebraic number theory. He was awarded the Fields Medal in 1954, the Wolf Prize in 2000 and the inaugural Abel Prize in 2003. Biography Personal life Born in Bages, Pyrénées-Orientales, France, to pharmacist parents, Serre was educated at the Lycée de Nîmes and then from 1945 to 1948 at the École Normale Supérieure in Paris. He was awarded his doctorate from the Sorbonne in 1951. From 1948 to 1954 he held positions at the Centre National de la Recherche Scientifique in Paris. In 1956 he was elected professor at the Collège de France, a position he held until his retirement in 1994. His wife, Professor Josiane Heulot-Serre, was a chemist; she also was the director of the Ecole Normale Supérieure de Jeunes Filles. Their daughter is the former French diplomat, historian and writer Claudine Monteil. The French mathematician Denis S ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Intersection Theory
In mathematics, intersection theory is one of the main branches of algebraic geometry, where it gives information about the intersection of two subvarieties of a given variety. The theory for varieties is older, with roots in Bézout's theorem on curves and elimination theory. On the other hand, the topological theory more quickly reached a definitive form. There is yet an ongoing development of intersection theory. Currently the main focus is on: virtual fundamental cycles, quantum intersection rings, Gromov-Witten theory and the extension of intersection theory from schemes to stacks. Topological intersection form For a connected oriented manifold of dimension the intersection form is defined on the -th cohomology group (what is usually called the 'middle dimension') by the evaluation of the cup product on the fundamental class in . Stated precisely, there is a bilinear form :\lambda_M \colon H^n(M,\partial M) \times H^n(M,\partial M)\to \mathbf given by :\lambda ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Chinese Remainder Theorem
In mathematics, the Chinese remainder theorem states that if one knows the remainders of the Euclidean division of an integer ''n'' by several integers, then one can determine uniquely the remainder of the division of ''n'' by the product of these integers, under the condition that the divisors are pairwise coprime (no two divisors share a common factor other than 1). For example, if we know that the remainder of ''n'' divided by 3 is 2, the remainder of ''n'' divided by 5 is 3, and the remainder of ''n'' divided by 7 is 2, then without knowing the value of ''n'', we can determine that the remainder of ''n'' divided by 105 (the product of 3, 5, and 7) is 23. Importantly, this tells us that if ''n'' is a natural number less than 105, then 23 is the only possible value of ''n''. The earliest known statement of the theorem is by the Chinese mathematician Sun-tzu in the '' Sun-tzu Suan-ching'' in the 3rd century CE. The Chinese remainder theorem is widely used for computing with lar ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Prime Number
A prime number (or a prime) is a natural number greater than 1 that is not a product of two smaller natural numbers. A natural number greater than 1 that is not prime is called a composite number. For example, 5 is prime because the only ways of writing it as a product, or , involve 5 itself. However, 4 is composite because it is a product (2 × 2) in which both numbers are smaller than 4. Primes are central in number theory because of the fundamental theorem of arithmetic: every natural number greater than 1 is either a prime itself or can be factorized as a product of primes that is unique up to their order. The property of being prime is called primality. A simple but slow method of checking the primality of a given number n, called trial division, tests whether n is a multiple of any integer between 2 and \sqrt. Faster algorithms include the Miller–Rabin primality test, which is fast but has a small chance of error, and the AKS primality test, which always pr ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
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 of mathematics, the set of integers is often denoted by the boldface or blackboard bold \mathbb. The set of natural numbers \mathbb is a subset of \mathbb, which in turn is a subset of the set of all rational numbers \mathbb, itself a subset of the real numbers \mathbb. Like the natural numbers, \mathbb is countably infinite. An integer may be regarded as a real number that can be written without a fractional component. For example, 21, 4, 0, and −2048 are integers, while 9.75, , and are not. The integers form the smallest group and the smallest ring containing the natural numbers. In algebraic number theory, the integers are sometimes qualified as rational integers to distinguish them from the more general algebraic integers ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Cyclic Group
In group theory, a branch of abstract algebra in pure mathematics, a cyclic group or monogenous group is a group, denoted C''n'', that is generated by a single element. That is, it is a set of invertible elements with a single associative binary operation, and it contains an element ''g'' such that every other element of the group may be obtained by repeatedly applying the group operation to ''g'' or its inverse. Each element can be written as an integer power of ''g'' in multiplicative notation, or as an integer multiple of ''g'' in additive notation. This element ''g'' is called a ''generator'' of the group. Every infinite cyclic group is isomorphic to the additive group of Z, the integers. Every finite cyclic group of order ''n'' is isomorphic to the additive group of Z/''n''Z, the integers modulo ''n''. Every cyclic group is an abelian group (meaning that its group operation is commutative), and every finitely generated abelian group ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Simple Module
In mathematics, specifically in ring theory, the simple modules over a ring ''R'' are the (left or right) modules over ''R'' that are non-zero and have no non-zero proper submodules. Equivalently, a module ''M'' is simple if and only if every cyclic submodule generated by a element of ''M'' equals ''M''. Simple modules form building blocks for the modules of finite length, and they are analogous to the simple groups in group theory. In this article, all modules will be assumed to be right unital modules over a ring ''R''. Examples Z-modules are the same as abelian groups, so a simple Z-module is an abelian group which has no non-zero proper subgroups. These are the cyclic groups of prime order. If ''I'' is a right ideal of ''R'', then ''I'' is simple as a right module if and only if ''I'' is a minimal non-zero right ideal: If ''M'' is a non-zero proper submodule of ''I'', then it is also a right ideal, so ''I'' is not minimal. Conversely, if ''I'' is not minimal, then t ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Intersection Theory
In mathematics, intersection theory is one of the main branches of algebraic geometry, where it gives information about the intersection of two subvarieties of a given variety. The theory for varieties is older, with roots in Bézout's theorem on curves and elimination theory. On the other hand, the topological theory more quickly reached a definitive form. There is yet an ongoing development of intersection theory. Currently the main focus is on: virtual fundamental cycles, quantum intersection rings, Gromov-Witten theory and the extension of intersection theory from schemes to stacks. Topological intersection form For a connected oriented manifold of dimension the intersection form is defined on the -th cohomology group (what is usually called the 'middle dimension') by the evaluation of the cup product on the fundamental class in . Stated precisely, there is a bilinear form :\lambda_M \colon H^n(M,\partial M) \times H^n(M,\partial M)\to \mathbf given by :\lambda ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Composition Series
In abstract algebra, a composition series provides a way to break up an algebraic structure, such as a group or a module, into simple pieces. The need for considering composition series in the context of modules arises from the fact that many naturally occurring modules are not semisimple, hence cannot be decomposed into a direct sum of simple modules. A composition series of a module ''M'' is a finite increasing filtration of ''M'' by submodules such that the successive quotients are simple and serves as a replacement of the direct sum decomposition of ''M'' into its simple constituents. A composition series may not exist, and when it does, it need not be unique. Nevertheless, a group of results known under the general name Jordan–Hölder theorem asserts that whenever composition series exist, the ''isomorphism classes'' of simple pieces (although, perhaps, not their ''location'' in the composition series in question) and their multiplicities are uniquely determined. Composition ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
