24
edits
Changes
Jump to navigation
Jump to search
Line 1:
Line 1: − + − − '''1.''' ''R'' with addition is a [[commutative]] [[Group (mathematics)|group]]; − − '''2.''' ''R'' is closed under multiplication; − − '''3.''' Multiplication is [[associative]]; − − '''4.''' Multiplication [[Distributivity|distribute]]s over addition. + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + − A '''ring with unity''' is a ring for which multiplication has a [[neutral element]].+ − A '''division ring''' is a ring such that ''R'' with multiplication is a (not necessarily [[commutative]]) [[Group (mathematics)|group]].+ + + + + + + + +
Rewrite to explicitly state the axioms, also include the hierarchy ring->field in this article as a start to flesh out the abstract algebra topics. Written to consistently include 1 in the definition
A '''ring''' in [[mathematics]] is a set ''R'' equipped with two [[binary]] [[operation]]s, usually called addition and multiplication, satisfying that
A '''ring''' in [[mathematics]] is a set ''R'' equipped with two [[binary]] [[operation]]s, usually called addition and multiplication, that is a [[group]] under the operation of addition and a semi-group (no inverses) under the operation of multiplication.
==Examples==
==Examples==
*<math>(\mathbb{Z},+, \cdot)</math> - the set of the [[integers]] - together with the usual [[addition]] and [[multiplication]] is a ring.
*<math>(\mathbb{Z},+, \cdot)</math> - the set of the [[integers]] - together with the usual [[addition]] and [[multiplication]] is a ring.
*For any ring <math>R</math> the polynomial ring <math>R[x]</math> consisting of elements of the form <math>b_0 +b_1x+...+b_mx^m</math> where <math>b_i \in R</math> is a Ring as well. All polynomials with integer coefficients form the ring <math>Z[x]</math>
*the [[subring]] of the even numbers is a ring, too: this shows that there is not necessarily a neutral element of the multiplication in a ring. A ring without multiplicative identity is sometimes called (tongue-in-cheek) a "rng".
*the [[subring]] of the even numbers is a ring, too: this shows that there is not necessarily a neutral element of the multiplication in a ring. A ring without multiplicative identity is sometimes called (tongue-in-cheek) a "rng".
*<math>(\mathbb{Z} / 6\mathbb{Z},+, \cdot)</math> : this is the ring of six elements {0,1,2,3,4,5} and the usual addition and multiplication [[modulo]] six. So, here 1+3= 4, but 4+5 = 3. Interestingly, <math>2 \cdot 3 = 0 </math>, so, you can multiply two elements, neither of which is zero, and get zero as the result!
*<math>(\mathbb{Z} / 6\mathbb{Z},+, \cdot)</math> : this is the ring of six elements {0,1,2,3,4,5} and the usual addition and multiplication [[modulo]] six. So, here 1+3= 4, but 4+5 = 3. Interestingly, <math>2 \cdot 3 = 0 </math>, so, you can multiply two elements, neither of which is zero, and get zero as the result!
*<math>M^{n \times n}(\mathbb R)</math>, the set of <math>n \times n</math> real matrices, with operations of matrix addition and multiplication, is a ring.
*<math>M^{n \times n}(\mathbb R)</math>, the set of <math>n \times n</math> real matrices, with operations of matrix addition and multiplication, is a ring.
==Axioms==
Explicitly, a ring <math> R</math> is a set, with two binary operations usually labeled <math>*</math> and <math>+</math> that satisfy the following axioms.
'''Axioms of Addition'''
<br/>
1. '''Identity''' - there exists an element (usually labeled <math> 0</math> ) such that <math> 0+x = x+0 = x \ \forall x \in R </math>
<br/>
2. '''Associativity''' - for any three elements <math>a,b,c\in R\ ,(a+b)+c = a+(b+c)</math>
<br/>
3. '''Inverses''' - for any element <math>a \in R</math> there exists an element (usually labeled as <math>-a</math> such that <math>a+(-a) = (-a)+a = 0</math>
<br/>
4. ''''Commutativity''' - for any two elements <math>a,b \in R\ ,a+b = b+a</math>
'''Axioms of Multiplication'''
<br/>
1. '''Identity*''' - there exists an element (usually labeled <math>1</math> ) such that <math> 1*x = x*1 = x \ \forall x \in R</math>
<br/>
2. '''Associativity''' - for any three elements <math>a,b,c\in R\ ,(a*b)*c = a*(b*c)</math>
'''Distributive Property'''
<br/>
1. For three elements <math>a,b,c \in R\ , a*(b+c) = a*b =a*c</math>
'''*''' - Some texts define a ring without a multiplicative identity. See [[ring (mathematics)#Remarks|rng]]
==Elements==
An element of a ring <math> a \in R</math> is a '''unit''' if it has a multiplicative inverse. The numbers <math>\pm 1 \in \mathbb{Z}</math> are the only units in the Integers
An element of a <math> x \in R </math> is a '''zero divisor''' if there is another element <math> y\in R \ ,\ y \neq 0\mbox{ such that } xy = 0 \mbox{ or } yx = 0 </math> . In the third example above, 2 and 3 are zero divisors. In fact, for any ring of Integers modulo m, all prime factors of m and their producs are zero divisors.
The '''multiplicative identity''' (usually denoted as <math> 1 \in R</math> ) is the unique element of the ring that <math> 1x = x1 = x \ \forall x \in R</math>
The '''additive Identity''' (usually denoted as <math> 0 \in R </math> ) is the unique element of the ring that <math> 0+x = x+0 = x \ \forall x \in R </math>
A '''prime element''' (or prime) is an element of a ''commutative'' ring s.t. a non-unit <math> p \in R</math> is prime if and only if <math>p|ab \rightarrow p|a \mbox{ or } p|b</math> (note that this differs from the definition of a [[prime]] that is more commonly presented in grade school).
An '''irreducible element''' is an element of an [[integral domain]] (a special type of ring) such that <math>a\in R</math> is irreducible if it cannot be written as a product of two non-units. When applied to the integers (which is an integral domain) this means that an irreducible element is any element that only has itself and 1 as prime factors (1 is unit, so we satisfy the definition), this is the common way to define [[prime|prime numbers]]. Note that every ''prime element'' is necessarily irreducible, but not every irreducible element is necessarily a prime element (this motivates us to exclude 1 from the list of prime numbers)
==Remarks==
==Remarks==
A '''rng''' (pronounced "rung") is an a ring without a multiplicative identity. In some texts, a ring is defined as rng, it turns out that many of the most elementary theorems (the ones that apply to arbitrary rings) do not require an identity, this ambiguity causes the confusion.
In texts where a ring is defined as a rng - a '''ring with unity''' is a rng with a multiplicative identity (our definition of a ring)
A '''commutative ring''' is a ring in which multiplication is commutative. The first three examples of rings given above are commutative rings: the last is not, since matrix multiplication is not in general commutative. The study of the properties of commutative rings is usually called '''commutative algebra'''.
A '''commutative ring''' is a ring in which multiplication is commutative. The first three examples of rings given above are commutative rings: the last is not, since matrix multiplication is not in general commutative. The study of the properties of commutative rings is usually called '''commutative algebra'''.
An '''entire ring''' is a ring that has no zero divisors.
An '''integral domain''' is a commutative entire ring.
A '''Unique Factorization Domain (UFD)''' is an integral domain in which every element that is not 0 or a unit can be written as a product of irreducible elements. i.e. every element can be factored into a product of primes, analogous to the integers (In a related theorem, every irreducible element of a UFD is prime)
A [[Field]] is a commutative ring where every element except 0 is a unit (is invertible). In other words, a field is a ring that is an [[abelian group]] over both addition and multiplication
A '''division ring''' (also known as a skew field) is a ring that is a [[group]] over multiplication (every non-zero element has an inverse, but not necessarily commutative). A division ring can also be thought of as a [[field]] that is not commutative.
[[Category:Algebra]]
[[Category:Algebra]]