Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Algebraic number theory
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
===Failure of unique factorization=== An important property of the ring of integers is that it satisfies the [[fundamental theorem of arithmetic]], that every (positive) integer has a factorization into a product of [[prime number]]s, and this factorization is unique up to the ordering of the factors. This may no longer be true in the ring of integers {{math|''O''}} of an algebraic number field {{math|''K''}}. A ''prime element'' is an element {{math|''p''}} of {{math|''O''}} such that if {{math|''p''}} divides a product {{math|''ab''}}, then it divides one of the factors {{math|''a''}} or {{math|''b''}}. This property is closely related to primality in the integers, because any positive integer satisfying this property is either {{math|1}} or a prime number. However, it is strictly weaker. For example, {{math|−2}} is not a prime number because it is negative, but it is a prime element. If factorizations into prime elements are permitted, then, even in the integers, there are alternative factorizations such as :<math>6 = 2 \cdot 3 = (-2) \cdot (-3).</math> In general, if {{math|''u''}} is a [[unit (ring theory)|unit]], meaning a number with a multiplicative inverse in {{math|''O''}}, and if {{math|''p''}} is a prime element, then {{math|''up''}} is also a prime element. Numbers such as {{math|''p''}} and {{math|''up''}} are said to be ''associate''. In the integers, the primes {{math|''p''}} and {{math|−''p''}} are associate, but only one of these is positive. Requiring that prime numbers be positive selects a unique element from among a set of associated prime elements. When ''K'' is not the rational numbers, however, there is no analog of positivity. For example, in the [[Gaussian integers]] {{math|'''Z'''[''i'']}},<ref>This notation indicates the ring obtained from '''Z''' by [[Wiktionary:adjoin|adjoining]] to '''Z''' the element ''i''.</ref> the numbers {{math|1 + 2''i''}} and {{math|−2 + ''i''}} are associate because the latter is the product of the former by {{math|''i''}}, but there is no way to single out one as being more canonical than the other. This leads to equations such as :<math>5 = (1 + 2i)(1 - 2i) = (2 + i)(2 - i),</math> which prove that in {{math|'''Z'''[''i'']}}, it is not true that factorizations are unique up to the order of the factors. For this reason, one adopts the definition of unique factorization used in [[unique factorization domain]]s (UFDs). In a UFD, the prime elements occurring in a factorization are only expected to be unique up to units and their ordering. However, even with this weaker definition, many rings of integers in algebraic number fields do not admit unique factorization. There is an algebraic obstruction called the ideal class group. When the ideal class group is trivial, the ring is a UFD. When it is not, there is a distinction between a prime element and an [[irreducible element]]. An ''irreducible element'' {{math|''x''}} is an element such that if {{math|1=''x'' = ''yz''}}, then either {{math|''y''}} or {{math|''z''}} is a unit. These are the elements that cannot be factored any further. Every element in ''O'' admits a factorization into irreducible elements, but it may admit more than one. This is because, while all prime elements are irreducible, some irreducible elements may not be prime. For example, consider the ring {{math|'''Z'''[β{{Overline|-5}}]}}.<ref>This notation indicates the ring obtained from '''Z''' by [[Wiktionary:adjoin|adjoining]] to '''Z''' the element {{math|β{{Overline|-5}}}}.</ref> In this ring, the numbers {{math|3}}, {{math|2 + β{{Overline|-5}}}} and {{math|2 - β{{Overline|-5}}}} are irreducible. This means that the number {{math|9}} has two factorizations into irreducible elements, :<math>9 = 3^2 = (2 + \sqrt{-5})(2 - \sqrt{-5}).</math> This equation shows that {{math|3}} divides the product {{math|1=(2 + β{{Overline|-5}})(2 - β{{Overline|-5}}) = 9}}. If {{math|3}} were a prime element, then it would divide {{math|2 + β{{Overline|-5}}}} or {{math|2 - β{{Overline|-5}}}}, but it does not, because all elements divisible by {{math|3}} are of the form {{math|3''a'' + 3''b''β{{Overline|-5}}}}. Similarly, {{math|2 + β{{Overline|-5}}}} and {{math|2 - β{{Overline|-5}}}} divide the product {{math|3<sup>2</sup>}}, but neither of these elements divides {{math|3}} itself, so neither of them are prime. As there is no sense in which the elements {{math|3}}, {{math|2 + β{{Overline|-5}}}} and {{math|2 - β{{Overline|-5}}}} can be made equivalent, unique factorization fails in {{math|'''Z'''[β{{Overline|-5}}]}}. Unlike the situation with units, where uniqueness could be repaired by weakening the definition, overcoming this failure requires a new perspective.
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)