http___en.wikipedia.org_wiki_Ideal__ring_theory__1.xml
1.1 2.1 3.1 3.2 4.1 5.1 6.1 6.2 6.3 7.1 8.1 8.2 9.1 9.2 10.1 11.1 12.1 13.1 13.2 14.1 14.2 15.1 16.1 17.1 18.1 19.1 20.1 20.2 20.3 21.1 21.2 22.1 23.1 24.1 25.1 26.1 27.1 28.1 29.1 30.1 31.1 32.1
Идеал (теория на пръстените) Идеал в теория на пръстените е подмножество на пръстен притежаващо специални свойства. Идеалът е конструкция подобна на нормалната група от теория на групите. Използувайки идеали може да се образуват факторпръстени, както чрез използуване на нормални гупи се образуват факторгрупи. Съдържание История на понятието[редактиране | edit source] Идеалите са въведени от Рихард Дедекинд през 1876 в книгата му Лекции по теория на числата (Vorlesungen über Zahlentheorie). Появяват се като обобщение на понятието идеално число въведено от Ернст Кумер. Основни заслуги за развитието на теория на идеалите имат Давид Хилберт и Еми Ньотер. Формални определения[редактиране | edit source] Нека е пръстен. Подмножеството на , ще наричаме ляв( съответно десен) идеал, ако е непразно и са удоволетворени условията: , ще наричаме двустранен идеал или само идеал, ако е едновременно ляв и десен идеал (означава се с ). Ако пръстенът е комутативен, то всеки ляв/десен идеал е двустранен идеал. Сума на идеали дефинираме, като множеството . Собствен идеал е идеал, който не съвпада, като множество, с (бележи се с ). Примери[редактиране | edit source] - Всяка адитивна подгрупа на целите числа е идеал в пръстена на целите числа. Четните числа образуват идеал в пръстена . - В пръстена на квадратните матрици, подмножеството от матрици, чиито последен стълб е съставен само от нули, е ляв (,но не десен) идеал. Обратно, подмножеството от матрици, чиито последен ред е съставен само от нули, е десен (, но не ляв) идеал. - и са идеали във всеки пръстен . - Компактните оператори образуват идеал в пръстена на ограничените оператори. Видове идеали[редактиране | edit source] - Максимален идеал. наричаме максимален идеал ако не съществува друг собствен идеал такъв, че да съдържа като подмножество. - Прост идеал е собствен идеал, за който е изпълнено: , ако , то следва, че поне едно от a и b принадлежи на . - Примитивен идеал. Ако за всеки , ако от , следва че поне едно от a и bn принадлежи на за някое n - естествено. Всеки прост идеал е примитивен, но обратното не е вярно. - Главен идеал е идеал породен от един елемент a на комутативен пръстен с единица , бележи се . Лесно се вижда, че . - Неприводим идеал е такъв, който не може да се представи като сечение на идеали, които го съдържат като собствено подмножество. - Два идеала и се наричат комаксимални, ако за някое и . Свойства на идеалите[редактиране | edit source] - Един идеал е собствен тогава и само тогава, когато не съдържа 1. - Всеки собствен идеал се съдържа в максимален идеал. - Комутативен пръстен с 1 е поле тогава и само тогава, когато няма нетривиални идеали (различни от {0} и самият пръстен). - Всеки идеал е непразен, защото 0 принадлежи на идеала, следователно идеалът е подгрупа на адитивната група на пръстена, както и подпръстен на пръстена. - Всеки ляв/десен идеал на е ляв/десен R-подмодул на . - Сечение на леви/десни/двустранни идеали е ляв/десен/двустранен идеал. - Всеки идеал е псевдопръстен. - Идеалите на един пръстен образуват полупръстен с действия събиране и умножение на идеали.
1.1 2.1 2.2 2.3 3.1 3.2 3.3 3.4 3.5 4.1 4.2 5.1 6.1 7.1 7.2 8.1 9.1 9.2 9.3 10.1 11.1 12.1 13.1 14.1 15.1 16.1 17.1 18.1 19.1 19.2 19.3 20.1 21.1 21.2 21.3 22.1 22.2 23.1 24.1 25.1 26.1 26.2 27.1 28.1 29.1 30.1 31.1 31.2 32.1 33.1 33.2 34.1 34.2 34.3 35.1 36.1 36.2 36.3 37.1 37.2 38.1 39.1 40.1 40.2 40.3 41.1 41.2 42.1 43.1 44.1 45.1 45.2 46.1 47.1 47.2 48.1 48.2 48.3 49.1 50.1 50.2 50.3 50.4 50.5 51.1 52.1 52.2 53.1 53.2 54.1 55.1 56.1 57.1 58.1 58.2 58.3 59.1 60.1 61.1 61.2 61.3 61.4 61.5 61.6 62.1 63.1 64.1 64.2 65.1 66.1 66.2 67.1 67.2 68.1 68.2 69.1 70.1 71.1 71.2 71.3 72.1 72.2 72.3 73.1 73.2 73.3 74.1 75.1 76.1 77.1 77.2 78.1 79.1 79.2 80.1 80.2 80.3 81.1 82.1 83.1 84.1 84.2 85.1 86.1 87.1 88.1 89.1 90.1 91.1 92.1 93.1 94.1 95.1 96.1 97.1 98.1 98.2 98.3 99.1 99.2 100.1 101.1 102.1 103.1 104.1 104.2 104.3 105.1 105.2 105.3 105.4
Ideal (ring theory) In ring theory, a branch of abstract algebra, an ideal is a special subset of a ring. Ideals generalize certain subsets of the integers, such as the even numbers or the multiples of 3. Addition and subtraction of even numbers preserves evenness, and multiplying an even number by any other integer results in another even number; these closure and absorption properties are the defining properties of an ideal. Among the integers, the ideals correspond one-for-one with the non-negative integers: in this ring, every ideal is a principal ideal consisting of the multiples of a single non-negative number. However, in other rings, the ideals may be distinct from the ring elements, and certain properties of integers, when generalized to rings, attach more naturally to the ideals than to the elements of the ring. For instance, the prime ideals of a ring are analogous to prime numbers, and the Chinese remainder theorem can be generalized to ideals. There is a version of unique prime factorization for the ideals of a Dedekind domain (a type of ring important in number theory). An ideal can be used to construct a quotient ring similarly to the way that modular arithmetic can be defined from integer arithmetic, and also similarly to the way that, in group theory, a normal subgroup can be used to construct a quotient group. The concept of an order ideal in order theory is derived from the notion of ideal in ring theory. A fractional ideal is a generalization of an ideal, and the usual ideals are sometimes called integral ideals for clarity. Contents History[edit] Ideals were first proposed by Richard Dedekind in 1876 in the third edition of his book Vorlesungen über Zahlentheorie (English: Lectures on Number Theory). They were a generalization of the concept of ideal numbers developed by Ernst Kummer.[1][2] Later the concept was expanded by David Hilbert and especially Emmy Noether. Definitions[edit] For an arbitrary ring , let be its additive group. A subset is called a two-sided ideal (or simply an ideal) of if it is an additive subgroup of R that "absorbs multiplication by elements of R". Formally we mean that is an ideal if it satisfies the following conditions: - is a subgroup of Equivalently, an ideal of R is a sub-R-bimodule of R. A subset of is called a right ideal of [3] if it is an additive subgroup of R and absorbs multiplication on the right, that is: - is a subgroup of Equivalently, a right ideal of is a right -submodule of . Similarly a subset of is called a left ideal of if it is an additive subgroup of R absorbing multiplication on the left: - is a subgroup of Equivalently, a left ideal of is a left -submodule of . In all cases, the first condition can be replaced by the following well-known criterion that ensures a nonempty subset of a group is a subgroup: The left ideals in R are exactly the right ideals in the opposite ring Ro and vice versa. A two-sided ideal is a left ideal that is also a right ideal, and is often called an ideal except to emphasize that there might exist single-sided ideals. When R is a commutative ring, the definitions of left, right, and two-sided ideal coincide, and the term ideal is used alone. Properties[edit] {0} and R are ideals in every ring R. If R is a division ring or a field, then these are its only ideals. The ideal R is called the unit ideal. I is a proper ideal if it is a proper subset of R, that is, I does not equal R.[5] Just as normal subgroups of groups are kernels of group homomorphisms, ideals have interpretations as kernels. For a nonempty subset A of R: - A is an ideal of R if and only if it is a kernel of a ring homomorphism from R. - A is a right ideal of R if and only if it is a kernel of a homomorphism from the right R module RR to another right R module. - A is a left ideal of R if and only if it is a kernel of a homomorphism from the left R module RR to another left R module. If p is in R, then pR is a right ideal and Rp is a left ideal of R. These are called, respectively, the principal right and left ideals generated by p. To remember which is which, note that right ideals are stable under right-multiplication (IR ⊆ I) and left ideals are stable under left-multiplication (RI ⊆ I). The connection between cosets and ideals can be seen by switching the operation from "multiplication" to "addition". Motivation[edit] Intuitively, the definition can be motivated as follows: Suppose we have a subset of elements Z of a ring R and that we would like to obtain a ring with the same structure as R, except that the elements of Z should be zero (they are in some sense "negligible"). But if and in our new ring, then surely should be zero too, and as well as should be zero for any element (zero or not). The definition of an ideal is such that the ideal I generated (see below) by Z is exactly the set of elements that are forced to become zero if Z becomes zero, and the quotient ring R/I is the desired ring where Z is zero, and only elements that are forced by Z to be zero are zero. The requirement that R and R/I should have the same structure (except that I becomes zero) is formalized by the condition that the projection from R to R/I is a (surjective) ring homomorphism. Examples[edit] - In a ring R, the set R itself forms an ideal of R. Also, the subset containing only the additive identity 0R forms an ideal. These two ideals are usually referred to as the trivial ideals of R. - The even integers form an ideal in the ring Z of all integers; it is usually denoted by 2Z. This is because the sum of any even integers is even, and the product of any integer with an even integer is also even. Similarly, the set of all integers divisible by a fixed integer n is an ideal denoted nZ. - The set of all polynomials with real coefficients which are divisible by the polynomial x2 + 1 is an ideal in the ring of all polynomials. - The set of all n-by-n matrices whose last row is zero forms a right ideal in the ring of all n-by-n matrices. It is not a left ideal. The set of all n-by-n matrices whose last column is zero forms a left ideal but not a right ideal. - The ring C(R) of all continuous functions f from R to R under pointwise multiplication contains the ideal of all continuous functions f such that f(1) = 0. Another ideal in C(R) is given by those functions which vanish for large enough arguments, i.e. those continuous functions f for which there exists a number L > 0 such that f(x) = 0 whenever |x| > L. - Compact operators form an ideal in the ring of bounded operators. Ideal generated by a set[edit] Let R be a (possibly not unital) ring. Any intersection of any nonempty family of left ideals of R is again a left ideal of R. If X is any subset of R, then the intersection of all left ideals of R containing X is a left ideal I of R containing X, and is clearly the smallest left ideal to do so. This ideal I is said to be the left ideal generated by X. Similar definitions can be created by using right ideals or two-sided ideals in place of left ideals. If R has unity, then the left, right, or two-sided ideal of R generated by a subset X of R can be expressed internally as we will now describe. The following set is a left ideal: Each element described would have to be in every left ideal containing X, so this left ideal is in fact the left ideal generated by X. The right ideal and ideal generated by X can also be expressed in the same way: The former is the right ideal generated by X, and the latter is the ideal generated by X. By convention, 0 is viewed as the sum of zero such terms, agreeing with the fact that the ideal of R generated by ∅ is {0} by the previous definition. If a left ideal I of R has a finite subset F such that I is the left ideal generated by F, then the left ideal I is said to be finitely generated. Similar terms are also applied to right ideals and two-sided ideals generated by finite subsets. In the special case where the set X is just a singleton {a} for some a in R, then the above definitions turn into the following: These ideals are known as the left/right/two-sided principal ideals generated by a. It is also very common to denote the two-sided ideal generated by a as (a). If R does not have a unit, then the internal descriptions above must be modified slightly. In addition to the finite sums of products of things in X with things in R, we must allow the addition of n-fold sums of the form x+x+...+x, and n-fold sums of the form (−x)+(−x)+...+(−x) for every x in X and every n in the natural numbers. When R has a unit, this extra requirement becomes superfluous. Example[edit] - In the ring Z of integers, every ideal can be generated by a single number (so Z is a principal ideal domain), and the only two generators of pR are p and −p. The concepts of "ideal" and "number" are therefore almost identical in Z. If aR = bR in an arbitrary domain, then au = b for some unit u. Conversely, for any unit u, aR = auu−1R = auR. So, in a commutative principal ideal domain, the generators of the ideal aR are just the elements au where u is an arbitrary unit. This explains the case of Z since 1 and −1 are the only units of Z. Types of ideals[edit] - To simplify the description all rings are assumed to be commutative. The non-commutative case is discussed in detail in the respective articles. Ideals are important because they appear as kernels of ring homomorphisms and allow one to define factor rings. Different types of ideals are studied because they can be used to construct different types of factor rings. - Maximal ideal: A proper ideal I is called a maximal ideal if there exists no other proper ideal J with I a proper subset of J. The factor ring of a maximal ideal is a simple ring in general and is a field for commutative rings.[6] - Minimal ideal: A nonzero ideal is called minimal if it contains no other nonzero ideal. - Prime ideal: A proper ideal I is called a prime ideal if for any a and b in R, if ab is in I, then at least one of a and b is in I. The factor ring of a prime ideal is a prime ring in general and is an integral domain for commutative rings. - Radical ideal or semiprime ideal: A proper ideal I is called radical or semiprime if for any a in R, if an is in I for some n, then a is in I. The factor ring of a radical ideal is a semiprime ring for general rings, and is a reduced ring for commutative rings. - Primary ideal: An ideal I is called a primary ideal if for all a and b in R, if ab is in I, then at least one of a and bn is in I for some natural number n. Every prime ideal is primary, but not conversely. A semiprime primary ideal is prime. - Principal ideal: An ideal generated by one element. - Finitely generated ideal: This type of ideal is finitely generated as a module. - Primitive ideal: A left primitive ideal is the annihilator of a simple left module. A right primitive ideal is defined similarly. Actually (despite the name) the left and right primitive ideals are always two-sided ideals. Primitive ideals are prime. A factor rings constructed with a right (left) primitive ideals is a right (left) primitive ring. For commutative rings the primitive ideals are maximal, and so commutative primitive rings are all fields. - Irreducible ideal: An ideal is said to be irreducible if it cannot be written as an intersection of ideals which properly contain it. - Comaximal ideals: Two ideals are said to be comaximal if for some and . - Regular ideal: This term has multiple uses. See the article for a list. - Nil ideal: An ideal is a nil ideal if each of its elements is nilpotent. Two other important terms using "ideal" are not always ideals of their ring. See their respective articles for details: - Fractional ideal: This is usually defined when R is a commutative domain with quotient field K. Despite their names, fractional ideals are R submodules of K with a special property. If the fractional ideal is contained entirely in R, then it is truly an ideal of R. - Invertible ideal: Usually an invertible ideal A is defined as a fractional ideal for which there is another fractional ideal B such that AB=BA=R. Some authors may also apply "invertible ideal" to ordinary ring ideals A and B with AB=BA=R in rings other than domains. Further properties[edit] - In rings with identity, an ideal is proper if and only if it does not contain 1 or equivalently it does not contain a unit. - The set of ideals of any ring are partially ordered via subset inclusion, in fact they are additionally a complete modular lattice in this order with join operation given by addition of ideals and meet operation given by set intersection. The trivial ideals supply the least and greatest elements: the largest ideal is the entire ring, and the smallest ideal is the zero ideal. The lattice is not, in general, a distributive lattice. - Unfortunately Zorn's lemma does not necessarily apply to the collection of proper ideals of R. However when R has identity 1, this collection can be reexpressed as "the collection of ideals which do not contain 1". It can be checked that Zorn's lemma now applies to this collection, and consequently there are maximal proper ideals of R. With a little more work, it can be shown that every proper ideal is contained in a maximal ideal. See Krull's theorem at maximal ideal. - The ring R can be considered as a left module over itself, and the left ideals of R are then seen as the submodules of this module. Similarly, the right ideals are submodules of R as a right module over itself, and the two-sided ideals are submodules of R as a bimodule over itself. If R is commutative, then all three sorts of module are the same, just as all three sorts of ideal are the same. - Every ideal is a pseudo-ring. - The ideals of a ring form a semiring (with identity element R) under addition and multiplication of ideals. Ideal operations[edit] The sum and product of ideals are defined as follows. For and , ideals of a ring R, and i.e. the product of two ideals and is defined to be the ideal generated by all products of the form ab with a in and b in . The product is contained in the intersection of and . The sum and the intersection of ideals is again an ideal; with these two operations as join and meet, the set of all ideals of a given ring forms a complete modular lattice. Also, the union of two ideals is a subset of the sum of those two ideals, because for any element a inside an ideal, we can write it as a+0, or 0+a, therefore, it is contained in the sum as well. However, the union of two ideals is not necessarily an ideal. Ideals and congruence relations[edit] There is a bijective correspondence between ideals and congruence relations (equivalence relations that respect the ring structure) on the ring: Given an ideal I of a ring R, let x ~ y if x − y ∈ I. Then ~ is a congruence relation on R. Conversely, given a congruence relation ~ on R, let I = {x : x ~ 0}. Then I is an ideal of R. See also[edit] - Modular arithmetic - Noether isomorphism theorem - Boolean prime ideal theorem - Ideal theory - Ideal (order theory) - Ideal quotient - Ideal norm - Artinian ideal - Noncommutative ring - Regular ideal - Idealizer References[edit] - ^ Harold M. Edwards (1977). Fermat's last theorem. A genetic introduction to algebraic number theory. - ^ Everest G., Ward T. (2005). An introduction to number theory. - ^ See Hazewinkel et al. (2004), p. 4. - ^ In fact, since R is assumed to be unital, it suffices that x + y is in I, since the second condition implies that −y is in I. - ^ Lang 2005, Section III.2 - ^ Because simple commutative rings are fields. - Lang, Serge (2005). Undergraduate Algebra (Third ed.). Springer-Verlag. - Michiel Hazewinkel, Nadiya Gubareni, Nadezhda Mikhaĭlovna Gubareni, Vladimir V. Kirichenko. Algebras, rings and modules. Volume 1. Springer, 2004.