|
Localisation Of A Module
In commutative algebra and algebraic geometry, localization is a formal way to introduce the "denominators" to a given ring or module. That is, it introduces a new ring/module out of an existing ring/module ''R'', so that it consists of fractions \frac, such that the denominator ''s'' belongs to a given subset ''S'' of ''R''. If ''S'' is the set of the non-zero elements of an integral domain, then the localization is the field of fractions: this case generalizes the construction of the field \Q of rational numbers from the ring \Z of integers. The technique has become fundamental, particularly in algebraic geometry, as it provides a natural link to sheaf theory. In fact, the term ''localization'' originated in algebraic geometry: if ''R'' is a ring of functions defined on some geometric object (algebraic variety) ''V'', and one wants to study this variety "locally" near a point ''p'', then one considers the set ''S'' of all functions that are not zero at ''p'' and localizes ''R' ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Commutative Algebra
Commutative algebra, first known as ideal theory, is the branch of algebra that studies commutative rings, their ideal (ring theory), ideals, and module (mathematics), modules over such rings. Both algebraic geometry and algebraic number theory build on commutative algebra. Prominent examples of commutative rings include polynomial rings; rings of algebraic integers, including the ordinary integers \mathbb; and p-adic number, ''p''-adic integers. Commutative algebra is the main technical tool of algebraic geometry, and many results and concepts of commutative algebra are strongly related with geometrical concepts. The study of rings that are not necessarily commutative is known as noncommutative algebra; it includes ring theory, representation theory, and the theory of Banach algebras. Overview Commutative algebra is essentially the study of the rings occurring in algebraic number theory and algebraic geometry. Several concepts of commutative algebras have been developed in ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Rational Numbers
In mathematics, a rational number is a number that can be expressed as the quotient or fraction (mathematics), fraction of two integers, a numerator and a non-zero denominator . For example, is a rational number, as is every integer (for example, The set (mathematics), set of all rational numbers is often referred to as "the rationals", and is closure (mathematics), closed under addition, subtraction, multiplication, and division (mathematics), division by a nonzero rational number. It is a field (mathematics), field under these operations and therefore also called the field of rationals or the field of rational numbers. It is usually denoted by boldface , or blackboard bold A rational number is a real number. The real numbers that are rational are those whose decimal expansion either terminates after a finite number of numerical digit, digits (example: ), or eventually begins to repeating decimal, repeat the same finite sequence of digits over and over (example: ). This st ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Zero Ring
In ring theory, a branch of mathematics, the zero ring or trivial ring is the unique ring (up to isomorphism) consisting of one element. (Less commonly, the term "zero ring" is used to refer to any rng of square zero, i.e., a rng in which for all ''x'' and ''y''. This article refers to the one-element ring.) In the category of rings, the zero ring is the terminal object, whereas the ring of integers Z is the initial object. Definition The zero ring, denoted or simply 0, consists of the one-element set with the operations + and · defined such that 0 + 0 = 0 and 0 · 0 = 0. Properties * The zero ring is the unique ring in which the additive identity 0 and multiplicative identity 1 coincide. (Proof: If in a ring ''R'', then for all ''r'' in ''R'', we have . The proof of the last equality is found here.) * The zero ring is commutative. * The element 0 in the zero ring is a unit, serving as its own multiplicative inverse. * The unit group of the zero ring is the ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Injective Function
In mathematics, an injective function (also known as injection, or one-to-one function ) is a function that maps distinct elements of its domain to distinct elements of its codomain; that is, implies (equivalently by contraposition, implies ). In other words, every element of the function's codomain is the image of one element of its domain. The term must not be confused with that refers to bijective functions, which are functions such that each element in the codomain is an image of exactly one element in the domain. A homomorphism between algebraic structures is a function that is compatible with the operations of the structures. For all common algebraic structures, and, in particular for vector spaces, an is also called a . However, in the more general context of category theory, the definition of a monomorphism differs from that of an injective homomorphism. This is thus a theorem that they are equivalent for algebraic structures; see for more details. A func ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Ring Homomorphism
In mathematics, 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 that preserves addition, multiplication and multiplicative identity; that is, : \begin f(a+b)&= f(a) + f(b),\\ f(ab) &= f(a)f(b), \\ f(1_R) &= 1_S, \end for all ''a'', ''b'' in ''R''. These conditions imply that additive inverses and the additive identity are also preserved. If, in addition, is a bijection, then its inverse −1 is also a ring homomorphism. In this case, is called a ring isomorphism, and the rings ''R'' and ''S'' are called ''isomorphic''. From the standpoint of ring theory, isomorphic rings have exactly the same properties. If ''R'' and ''S'' are s, then the corresponding notion is that of a homomorphism, defined as above except without the third condition ''f''(1''R'') = 1''S''. A homomorphism between (unital) rings need not be a ring homomorphism. The composition of two rin ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Multiplicative Identity
In mathematics, an identity element or neutral element of a binary operation is an element that leaves unchanged every element when the operation is applied. For example, 0 is an identity element of the addition of real numbers. This concept is used in algebraic structures such as groups and rings. The term ''identity element'' is often shortened to ''identity'' (as in the case of additive identity and multiplicative identity) when there is no possibility of confusion, but the identity implicitly depends on the binary operation it is associated with. Definitions Let be a set equipped with a binary operation ∗. Then an element of is called a if for all in , and a if for all in . If is both a left identity and a right identity, then it is called a , or simply an . An identity with respect to addition is called an (often denoted as 0) and an identity with respect to multiplication is called a (often denoted as 1). The ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Additive Identity
In mathematics, the additive identity of a set that is equipped with the operation of addition is an element which, when added to any element in the set, yields . One of the most familiar additive identities is the number 0 from elementary mathematics, but additive identities occur in other mathematical structures where addition is defined, such as in groups and rings. Elementary examples * The additive identity familiar from elementary mathematics is zero, denoted 0. For example, *:5+0 = 5 = 0+5. * In the natural numbers (if 0 is included), the integers the rational numbers the real numbers and the complex numbers the additive identity is 0. This says that for a number belonging to any of these sets, *:n+0 = n = 0+n. Formal definition Let be a group that is closed under the operation of addition, denoted +. An additive identity for , denoted , is an element in such that for any element in , :e+n = n = n+e. Further examples * In a group, the additive identi ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Equivalence Class
In mathematics, when the elements of some set S have a notion of equivalence (formalized as an equivalence relation), then one may naturally split the set S into equivalence classes. These equivalence classes are constructed so that elements a and b belong to the same equivalence class if, and only if, they are equivalent. Formally, given a set S and an equivalence relation \sim on S, the of an element a in S is denoted /math> or, equivalently, to emphasize its equivalence relation \sim, and is defined as the set of all elements in S with which a is \sim-related. The definition of equivalence relations implies that the equivalence classes form a partition of S, meaning, that every element of the set belongs to exactly one equivalence class. The set of the equivalence classes is sometimes called the quotient set or the quotient space of S by \sim, and is denoted by S /. When the set S has some structure (such as a group operation or a topology) and the equivalence re ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Equivalence Relation
In mathematics, an equivalence relation is a binary relation that is reflexive, symmetric, and transitive. The equipollence relation between line segments in geometry is a common example of an equivalence relation. A simpler example is equality. Any number a is equal to itself (reflexive). If a = b, then b = a (symmetric). If a = b and b = c, then a = c (transitive). Each equivalence relation provides a partition of the underlying set into disjoint equivalence classes. Two elements of the given set are equivalent to each other if and only if they belong to the same equivalence class. Notation Various notations are used in the literature to denote that two elements a and b of a set are equivalent with respect to an equivalence relation R; the most common are "a \sim b" and "", which are used when R is implicit, and variations of "a \sim_R b", "", or "" to specify R explicitly. Non-equivalence may be written "" or "a \not\equiv b". Definitions A binary relation \,\si ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Decimal Fraction
The decimal numeral system (also called the base-ten positional numeral system and denary or decanary) is the standard system for denoting integer and non-integer numbers. It is the extension to non-integer numbers (''decimal fractions'') of the Hindu–Arabic numeral system. The way of denoting numbers in the decimal system is often referred to as ''decimal notation''. A decimal numeral (also often just ''decimal'' or, less correctly, ''decimal number''), refers generally to the notation of a number in the decimal numeral system. Decimals may sometimes be identified by a decimal separator (usually "." or "," as in or ). ''Decimal'' may also refer specifically to the digits after the decimal separator, such as in " is the approximation of to ''two decimals''". Zero-digits after a decimal separator serve the purpose of signifying the precision of a value. The numbers that may be represented in the decimal system are the decimal fractions. That is, fractions of the form , wher ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Subring
In mathematics, a subring of a ring is a subset of that is itself a ring when binary operations of addition and multiplication on ''R'' are restricted to the subset, and that shares the same multiplicative identity as .In general, not all subsets of a ring are rings. Definition A subring of a ring is a subset of that preserves the structure of the ring, i.e. a ring with . Equivalently, it is both a subgroup of and a submonoid of . Equivalently, is a subring if and only if it contains the multiplicative identity of , and is closed under multiplication and subtraction. This is sometimes known as the ''subring test''. Variations Some mathematicians define rings without requiring the existence of a multiplicative identity (see '). In this case, a subring of is a subset of that is a ring for the operations of (this does imply it contains the additive identity of ). This alternate definition gives a strictly weaker condition, even for rings that do have a mult ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Prime Ideal
In algebra, a prime ideal is a subset of a ring (mathematics), ring that shares many important properties of a prime number in the ring of Integer#Algebraic properties, integers. The prime ideals for the integers are the sets that contain all the multiple (mathematics), multiples of a given prime number, together with the zero ideal. Primitive ideals are prime, and prime ideals are both primary ideal, primary and semiprime ideal, semiprime. Prime ideals for commutative rings Definition An ideal (ring theory), ideal of a commutative ring is prime if it has the following two properties: * If and are two elements of such that their product is an element of , then is in or is in , * is not the whole ring . This generalizes the following property of prime numbers, known as Euclid's lemma: if is a prime number and if divides a product of two integers, then divides or divides . We can therefore say :A positive integer is a prime number if and only if n\Z is a prime ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
