|
Annihilator (ring Theory)
In mathematics, the annihilator of a subset of a module over a ring is the ideal formed by the elements of the ring that give always zero when multiplied by an element of . Over an integral domain, a module that has a nonzero annihilator is a torsion module, and a finitely generated torsion module has a nonzero annihilator. The above definition applies also in the case noncommutative rings, where the left annihilator of a left module is a left ideal, and the right-annihilator, of a right module is a right ideal. Definitions Let ''R'' be a ring, and let ''M'' be a left ''R''-module. Choose a non-empty subset ''S'' of ''M''. The annihilator of ''S'', denoted Ann''R''(''S''), is the set of all elements ''r'' in ''R'' such that, for all ''s'' in ''S'', . In set notation, :\mathrm_R(S)=\ It is the set of all elements of ''R'' that "annihilate" ''S'' (the elements for which ''S'' is a torsion set). Subsets of right modules may be used as well, after the modification of "" in ... [...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] |
Isomorphic
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 isomorphism is derived from the Ancient Greek: ἴσος ''isos'' "equal", and μορφή ''morphe'' "form" or "shape". The interest in isomorphisms lies in the fact that two isomorphic objects have the same properties (excluding further information such as additional structure or names of objects). Thus isomorphic structures cannot be distinguished from the point of view of structure only, and may be identified. In mathematical jargon, one says that two objects are . An automorphism is an isomorphism from a structure to itself. An isomorphism between two structures is a canonical isomorphism (a canonical map that is an isomorphism) if there is only one isomorphism between the two structures (as it is the case for solutions of a univer ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Kernel (algebra)
In algebra, the kernel of a homomorphism (function that preserves the structure) is generally the inverse image of 0 (except for groups whose operation is denoted multiplicatively, where the kernel is the inverse image of 1). An important special case is the kernel of a linear map. The kernel of a matrix, also called the ''null space'', is the kernel of the linear map defined by the matrix. The kernel of a homomorphism is reduced to 0 (or 1) if and only if the homomorphism is injective, that is if the inverse image of every element consists of a single element. This means that the kernel can be viewed as a measure of the degree to which the homomorphism fails to be injective.See and . For some types of structure, such as abelian groups and vector spaces, the possible kernels are exactly the substructures of the same type. This is not always the case, and, sometimes, the possible kernels have received a special name, such as normal subgroup for groups and two-sided ideals for r ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Goldie Ring
In mathematics, Goldie's theorem is a basic structural result in ring theory, proved by Alfred Goldie during the 1950s. What is now termed a right Goldie ring is a ring ''R'' that has finite uniform dimension (="finite rank") as a right module over itself, and satisfies the ascending chain condition on right annihilators of subsets of ''R''. Goldie's theorem states that the semiprime right Goldie rings are precisely those that have a semisimple Artinian right classical ring of quotients. The structure of this ring of quotients is then completely determined by the Artin–Wedderburn theorem. In particular, Goldie's theorem applies to semiprime right Noetherian rings, since by definition right Noetherian rings have the ascending chain condition on ''all'' right ideals. This is sufficient to guarantee that a right-Noetherian ring is right Goldie. The converse does not hold: every right Ore domain is a right Goldie domain, and hence so is every commutative integral domain. A con ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Uniform Module
In abstract algebra, a module is called a uniform module if the intersection of any two nonzero submodules is nonzero. This is equivalent to saying that every nonzero submodule of ''M'' is an essential submodule. A ring may be called a right (left) uniform ring if it is uniform as a right (left) module over itself. Alfred Goldie used the notion of uniform modules to construct a measure of dimension for modules, now known as the uniform dimension (or Goldie dimension) of a module. Uniform dimension generalizes some, but not all, aspects of the notion of the dimension of a vector space. Finite uniform dimension was a key assumption for several theorems by Goldie, including Goldie's theorem, which characterizes which rings are right orders in a semisimple ring. Modules of finite uniform dimension generalize both Artinian modules and Noetherian modules. In the literature, uniform dimension is also referred to as simply the dimension of a module or the rank of a module. Uniform dim ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Idempotent (ring Theory)
In ring theory, a branch of abstract algebra, an idempotent element or simply idempotent of a ring is an element ''a'' such that . That is, the element is idempotent under the ring's multiplication. Inductively then, one can also conclude that for any positive integer ''n''. For example, an idempotent element of a matrix ring is precisely an idempotent matrix. For general rings, elements idempotent under multiplication are involved in decompositions of modules, and connected to homological properties of the ring. In Boolean algebra, the main objects of study are rings in which all elements are idempotent under both addition and multiplication. Examples Quotients of Z One may consider the ring of integers modulo ''n'' where ''n'' is squarefree. By the Chinese remainder theorem, this ring factors into the product of rings of integers modulo ''p'' where ''p'' is prime. Now each of these factors is a field, so it is clear that the factors' only idempotents will be 0 and 1. Th ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
If And Only If
In logic and related fields such as mathematics and philosophy, "if and only if" (shortened as "iff") is a biconditional logical connective between statements, where either both statements are true or both are false. The connective is biconditional (a statement of material equivalence), and can be likened to the standard material conditional ("only if", equal to "if ... then") combined with its reverse ("if"); hence the name. The result is that the truth of either one of the connected statements requires the truth of the other (i.e. either both statements are true, or both are false), though it is controversial whether the connective thus defined is properly rendered by the English "if and only if"—with its pre-existing meaning. For example, ''P if and only if Q'' means that ''P'' is true whenever ''Q'' is true, and the only case in which ''P'' is true is if ''Q'' is also true, whereas in the case of ''P if Q'', there could be other scenarios where ''P'' is true and ''Q'' is ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Descending Chain Condition
In mathematics, the ascending chain condition (ACC) and descending chain condition (DCC) are finiteness properties satisfied by some algebraic structures, most importantly ideals in certain commutative rings.Jacobson (2009), p. 142 and 147 These conditions played an important role in the development of the structure theory of commutative rings in the works of David Hilbert, Emmy Noether, and Emil Artin. The conditions themselves can be stated in an abstract form, so that they make sense for any partially ordered set. This point of view is useful in abstract algebraic dimension theory due to Gabriel and Rentschler. Definition A partially ordered set (poset) ''P'' is said to satisfy the ascending chain condition (ACC) if no infinite strictly ascending sequence :a_1 < a_2 < a_3 < \cdots of elements of ''P'' exists. Equivalently,Proof: first, a strictly increasing sequence cannot stabilize, obviously. Conversely, suppose there is an ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Ascending Chain Condition
In mathematics, the ascending chain condition (ACC) and descending chain condition (DCC) are finiteness properties satisfied by some algebraic structures, most importantly ideals in certain commutative rings.Jacobson (2009), p. 142 and 147 These conditions played an important role in the development of the structure theory of commutative rings in the works of David Hilbert, Emmy Noether, and Emil Artin. The conditions themselves can be stated in an abstract form, so that they make sense for any partially ordered set. This point of view is useful in abstract algebraic dimension theory due to Gabriel and Rentschler. Definition A partially ordered set (poset) ''P'' is said to satisfy the ascending chain condition (ACC) if no infinite strictly ascending sequence :a_1 < a_2 < a_3 < \cdots of elements of ''P'' exists. Equivalently,Proof: first, a strictly increasing sequence cannot stabilize, obviously. Conversely, suppose there is a ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Partially Ordered
In mathematics, especially order theory, a partially ordered set (also poset) formalizes and generalizes the intuitive concept of an ordering, sequencing, or arrangement of the elements of a set. A poset consists of a set together with a binary relation indicating that, for certain pairs of elements in the set, one of the elements precedes the other in the ordering. The relation itself is called a "partial order." The word ''partial'' in the names "partial order" and "partially ordered set" is used as an indication that not every pair of elements needs to be comparable. That is, there may be pairs of elements for which neither element precedes the other in the poset. Partial orders thus generalize total orders, in which every pair is comparable. Informal definition A partial order defines a notion of comparison. Two elements ''x'' and ''y'' may stand in any of four mutually exclusive relationships to each other: either ''x'' ''y'', or ''x'' and ''y'' are ''incompara ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Complete Lattice
In mathematics, a complete lattice is a partially ordered set in which ''all'' subsets have both a supremum (join) and an infimum (meet). A lattice which satisfies at least one of these properties is known as a ''conditionally complete lattice.'' Specifically, every non-empty finite lattice is complete. Complete lattices appear in many applications in mathematics and computer science. Being a special instance of lattices, they are studied both in order theory and universal algebra. Complete lattices must not be confused with complete partial orders (''cpo''s), which constitute a strictly more general class of partially ordered sets. More specific complete lattices are complete Boolean algebras and complete Heyting algebras (''locales''). Formal definition A partially ordered set (''L'', ≤) is a ''complete lattice'' if every subset ''A'' of ''L'' has both a greatest lower bound (the infimum, also called the ''meet'') and a least upper bound (the supremum, also called the ''j ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Lattice (order)
A lattice is an abstract structure studied in the mathematical subdisciplines of order theory and abstract algebra. It consists of a partially ordered set in which every pair of elements has a unique supremum (also called a least upper bound or join) and a unique infimum (also called a greatest lower bound or meet). An example is given by the power set of a set, partially ordered by inclusion, for which the supremum is the union and the infimum is the intersection. Another example is given by the natural numbers, partially ordered by divisibility, for which the supremum is the least common multiple and the infimum is the greatest common divisor. Lattices can also be characterized as algebraic structures satisfying certain axiomatic identities. Since the two definitions are equivalent, lattice theory draws on both order theory and universal algebra. Semilattices include lattices, which in turn include Heyting and Boolean algebras. These ''lattice-like'' structures all admi ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
