Universal side divisor: Difference between revisions
(→Facts) |
No edit summary |
||
| (2 intermediate revisions by the same user not shown) | |||
| Line 1: | Line 1: | ||
{{curing-element property}} | |||
==Definition== | ==Definition== | ||
| Line 6: | Line 7: | ||
* For any <math>y \in R</math>, either <math>x</math> divides <math>y</math> or there exists a unit <math>u \in R</math> such that <math>x</math> divides <math>y - u</math>. | * For any <math>y \in R</math>, either <math>x</math> divides <math>y</math> or there exists a unit <math>u \in R</math> such that <math>x</math> divides <math>y - u</math>. | ||
Equivalently, a non-zero non-unit element is a universal side divisor if and only if the [[defining ingredient::unit ball in a commutative unital ring|unit balls]] centered around its multiples cover the whole ring. | |||
===Equivalence up to associate classes=== | |||
If <math>x,y</math> are [[associate element]]s in a commutative unital ring <math>R</math>, then <math>x</math> is a universal side divisor if and only if <math>y</math> is a universal side divisor. {{proofat|[[Universal side divisor property is invariant upto associates]]}} | |||
==Examples== | |||
* In the [[ring of rational integers]] <math>\mathbb{Z}</math>, the only universal side divisors are <math>\pm 2, \pm 3</math>. <math>2</math> is a universal side divisor because every integer is either a multiple of <math>2</math> or differs by <math>1</math> from a multiple of <math>2</math>. <math>3</math> is a universal side divisor because every integer is either <math>0</math>, <math>1</math>, or <math>-1</math> mod <math>3</math>. For any integer <math>n</math> of absolute value greater than <math>3</math>, there is no way of subtracting a unit or zero from <math>2</math> to get a multiple of <math>n</math>. | |||
* In the [[polynomial ring over a field]], the only universal side divisors are the nonconstant linear polynomials. For instance, in the ring <math>k[x]</math>, <math>x</math> is a universal side divisor because for any polynomial, we can subtract the constant term of the polynomial to obtain a multiple of <math>x</math>, and the constant term is either zero or a unit. Similar reasoning applies for all the other nonconstant linear polynomials. On the other hand, for any polynomial of degree greater than <math>1</math>, there is no way of subtracting a unit from <math>x</math> to get a multiple of that polynomial. | |||
==Facts== | ==Facts== | ||
* [[Element of | * [[Element of minimum norm among non-units in Euclidean ring is a universal side divisor]] | ||
* [[Euclidean ring that is not a field has a universal side divisor]] | * [[Euclidean ring that is not a field has a universal side divisor]] | ||
* [[Universal side divisor implies irreducible]] | |||
* [[Irreducible not implies universal side divisor]] | |||
==References== | |||
===Textbook references=== | |||
* {{booklink-defined|DummitFoote|277|Section 8.1 (''Euclidean domains'')}} | |||
Latest revision as of 15:59, 5 February 2009
Template:Curing-element property
Definition
A nonzero element in an commutative unital ring is termed a universal side divisor if satisfies the following two conditions:
- is not a unit.
- For any , either divides or there exists a unit such that divides .
Equivalently, a non-zero non-unit element is a universal side divisor if and only if the unit balls centered around its multiples cover the whole ring.
Equivalence up to associate classes
If are associate elements in a commutative unital ring , then is a universal side divisor if and only if is a universal side divisor. For full proof, refer: Universal side divisor property is invariant upto associates
Examples
- In the ring of rational integers , the only universal side divisors are . is a universal side divisor because every integer is either a multiple of or differs by from a multiple of . is a universal side divisor because every integer is either , , or mod . For any integer of absolute value greater than , there is no way of subtracting a unit or zero from to get a multiple of .
- In the polynomial ring over a field, the only universal side divisors are the nonconstant linear polynomials. For instance, in the ring , is a universal side divisor because for any polynomial, we can subtract the constant term of the polynomial to obtain a multiple of , and the constant term is either zero or a unit. Similar reasoning applies for all the other nonconstant linear polynomials. On the other hand, for any polynomial of degree greater than , there is no way of subtracting a unit from to get a multiple of that polynomial.
Facts
- Element of minimum norm among non-units in Euclidean ring is a universal side divisor
- Euclidean ring that is not a field has a universal side divisor
- Universal side divisor implies irreducible
- Irreducible not implies universal side divisor