|
|
|
|
the multiplicative identity of a cyclic ring must be a generator
|
(Theorem)
|
|
Proof. Let $k$ be the behavior of $R$ . Then there exists a generator $r$ of the additive group of $R$ such that $r^2=kr$ . Let $a \in \mathbb{Z}$ with $u=ar$ . Then $r=ur=(ar)r=ar^2=a(kr)=(ak)r$ . If $R$ is infinite, then $ak=1$ , causing $a=k=1$ since $k$ is a nonnegative integer. If $R$ is finite, then $ak \equiv 1 \operatorname{mod} |R|$ . Thus, $\gcd(k,|R|)=1$ . Since $k$ divides $|R|$ , $k=1$ . Therefore, $a \equiv 1 \operatorname{mod} |R|$ . In either case, $u=r$ . 
Note that it was also proven that, if a cyclic ring has a multiplicative identity, then it has behavior one. Its converse is also true. See this theorem for more details.
|
"the multiplicative identity of a cyclic ring must be a generator" is owned by Wkbj79.
|
|
(view preamble | get metadata)
Cross-references: converse, divides, finite, integer, infinite, behavior, additive group, multiplicative identity, cyclic ring
There is 1 reference to this entry.
This is version 13 of the multiplicative identity of a cyclic ring must be a generator, born on 2006-06-05, modified 2007-05-31.
Object id is 7961, canonical name is MultiplicativeIdentityOfACyclicRingMustBeAGenerator.
Accessed 1548 times total.
Classification:
| AMS MSC: | 13A99 (Commutative rings and algebras :: General commutative ring theory :: Miscellaneous) | | | 16U99 (Associative rings and algebras :: Conditions on elements :: Miscellaneous) | | | 13F10 (Commutative rings and algebras :: Arithmetic rings and other special rings :: Principal ideal rings) |
|
|
|
|
|
|
Pending Errata and Addenda
|
|
|
|
|
|
|
|
|
|
|