|
Conductor (ring Theory)
In ring theory, a branch of mathematics, the conductor is a measurement of how far apart a commutative ring and an extension ring are. Most often, the larger ring is a domain integrally closed in its field of fractions, and then the conductor measures the failure of the smaller ring to be integrally closed. The conductor is of great importance in the study of non-maximal orders in the ring of integers of an algebraic number field. One interpretation of the conductor is that it measures the failure of unique factorization into prime ideals. Definition Let ''A'' and ''B'' be commutative rings, and assume . The conductor of ''A'' in ''B'' is the ideal :\mathfrak(B/A) = \operatorname_A(B/A). Here is viewed as a quotient of ''A''-modules, and denotes the annihilator. More concretely, the conductor is the set :\mathfrak(B/A) = \. Because the conductor is defined as an annihilator, it is an ideal of ''A''. If ''B'' is an integral domain, then the conductor may be rewritten as ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Ring Theory
In algebra, ring theory is the study of rings— algebraic structures in which addition and multiplication are defined and have similar properties to those operations defined for the integers. Ring theory studies the structure of rings, their representations, or, in different language, modules, special classes of rings (group rings, division rings, universal enveloping algebras), as well as an array of properties that proved to be of interest both within the theory itself and for its applications, such as homological algebra, homological properties and Polynomial identity ring, polynomial identities. Commutative rings are much better understood than noncommutative ones. Algebraic geometry and algebraic number theory, which provide many natural examples of commutative rings, have driven much of the development of commutative ring theory, which is now, under the name of ''commutative algebra'', a major area of modern mathematics. Because these three fields (algebraic geometry, alge ... [...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] |
Quadratic Extension
In mathematics, particularly in algebra, a field extension is a pair of fields E\subseteq F, such that the operations of ''E'' are those of ''F'' restricted to ''E''. In this case, ''F'' is an extension field of ''E'' and ''E'' is a subfield of ''F''. For example, under the usual notions of addition and multiplication, the complex numbers are an extension field of the real numbers; the real numbers are a subfield of the complex numbers. Field extensions are fundamental in algebraic number theory, and in the study of polynomial roots through Galois theory, and are widely used in algebraic geometry. Subfield A subfield K of a field L is a subset K\subseteq L that is a field with respect to the field operations inherited from L. Equivalently, a subfield is a subset that contains 1, and is closed under the operations of addition, subtraction, multiplication, and taking the inverse of a nonzero element of K. As , the latter definition implies K and L have the same zero element. F ... [...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] |
Bijection
In mathematics, a bijection, also known as a bijective function, one-to-one correspondence, or invertible function, is a function between the elements of two sets, where each element of one set is paired with exactly one element of the other set, and each element of the other set is paired with exactly one element of the first set. There are no unpaired elements. In mathematical terms, a bijective function is a one-to-one (injective) and onto (surjective) mapping of a set ''X'' to a set ''Y''. The term ''one-to-one correspondence'' must not be confused with ''one-to-one function'' (an injective function; see figures). A bijection from the set ''X'' to the set ''Y'' has an inverse function from ''Y'' to ''X''. If ''X'' and ''Y'' are finite sets, then the existence of a bijection means they have the same number of elements. For infinite sets, the picture is more complicated, leading to the concept of cardinal number—a way to distinguish the various sizes of infinite sets. ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Isomorphism
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] |
Ring Homomorphism
In ring theory, a branch of abstract algebra, a ring homomorphism is a structure-preserving function between two rings. More explicitly, if ''R'' and ''S'' are rings, then a ring homomorphism is a function such that ''f'' is: :addition preserving: ::f(a+b)=f(a)+f(b) for all ''a'' and ''b'' in ''R'', :multiplication preserving: ::f(ab)=f(a)f(b) for all ''a'' and ''b'' in ''R'', :and unit (multiplicative identity) preserving: ::f(1_R)=1_S. Additive inverses and the additive identity are part of the structure too, but it is not necessary to require explicitly that they too are respected, because these conditions are consequences of the three conditions above. If in addition ''f'' is a bijection, then its inverse ''f''−1 is also a ring homomorphism. In this case, ''f'' is called a ring isomorphism, and the rings ''R'' and ''S'' are called ''isomorphic''. From the standpoint of ring theory, isomorphic rings cannot be distinguished. If ''R'' and ''S'' are rngs, then the cor ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Coprime Integers
In mathematics, two integers and are coprime, relatively prime or mutually prime if the only positive integer that is a divisor of both of them is 1. Consequently, any prime number that divides does not divide , and vice versa. This is equivalent to their greatest common divisor (GCD) being 1. One says also '' is prime to '' or '' is coprime with ''. The numbers 8 and 9 are coprime, despite the fact that neither considered individually is a prime number, since 1 is their only common divisor. On the other hand, 6 and 9 are not coprime, because they are both divisible by 3. The numerator and denominator of a reduced fraction are coprime, by definition. Notation and testing Standard notations for relatively prime integers and are: and . In their 1989 textbook ''Concrete Mathematics'', Ronald Graham, Donald Knuth, and Oren Patashnik proposed that the notation a\perp b be used to indicate that and are relatively prime and that the term "prime" be used instead of coprime (as ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Finite Field
In mathematics, a finite field or Galois field (so-named in honor of Évariste Galois) is a field that contains a finite number of elements. As with any field, a finite field is a set on which the operations of multiplication, addition, subtraction and division are defined and satisfy certain basic rules. The most common examples of finite fields are given by the integers mod when is a prime number. The ''order'' of a finite field is its number of elements, which is either a prime number or a prime power. For every prime number and every positive integer there are fields of order p^k, all of which are isomorphic. Finite fields are fundamental in a number of areas of mathematics and computer science, including number theory, algebraic geometry, Galois theory, finite geometry, cryptography and coding theory. Properties A finite field is a finite set which is a field; this means that multiplication, addition, subtraction and division (excluding division by zero) are ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Number Field
In mathematics, an algebraic number field (or simply number field) is an extension field K of the field of rational numbers such that the field extension K / \mathbb has finite degree (and hence is an algebraic field extension). Thus K is a field that contains \mathbb and has finite dimension when considered as a vector space over The study of algebraic number fields, and, more generally, of algebraic extensions of the field of rational numbers, is the central topic of algebraic number theory. This study reveals hidden structures behind usual rational numbers, by using algebraic methods. Definition Prerequisites The notion of algebraic number field relies on the concept of a field. A field consists of a set of elements together with two operations, namely addition, and multiplication, and some distributivity assumptions. A prominent example of a field is the field of rational numbers, commonly denoted together with its usual operations of addition and multiplication. ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Dedekind Domain
In abstract algebra, a Dedekind domain or Dedekind ring, named after Richard Dedekind, is an integral domain in which every nonzero proper ideal factors into a product of prime ideals. It can be shown that such a factorization is then necessarily unique up to the order of the factors. There are at least three other characterizations of Dedekind domains that are sometimes taken as the definition: see below. A field is a commutative ring in which there are no nontrivial proper ideals, so that any field is a Dedekind domain, however in a rather vacuous way. Some authors add the requirement that a Dedekind domain not be a field. Many more authors state theorems for Dedekind domains with the implicit proviso that they may require trivial modifications for the case of fields. An immediate consequence of the definition is that every principal ideal domain (PID) is a Dedekind domain. In fact a Dedekind domain is a unique factorization domain (UFD) if and only if it is a PID. Th ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Finitely Generated Module
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] |
