Why are Numbers like -2, e and i not Prime?
I know that Primes are by definition only natural Numbers (1, 2, 3 ...). But why is that? What would happen if we allowed -2 to be Prime?
Posted Oct 29, 2015, 1:42 PM UTC
67
I know that Primes are by definition only natural Numbers (1, 2, 3 ...). But why is that? What would happen if we allowed -2 to be Prime?
Posted Oct 29, 2015, 1:42 PM UTC
-2 is a prime. 1 is not a prime.
A prime is defined to be an integer that has exactly two positive divisors. -2 has two positive divisors (1, 2), 1 has only one positive divisor. Though we don't really care to talk about -2 when we talk about primes because it is essentially 2. e and i are not integers so they don't even qualify for consideration as primes.
This definition of "Prime" is used so that we can have the Fundamental Theorem of Arithmetic which says:
If we include 1 in there, we lose this uniqueness. But 1 and -1 have a special categorization, they are Units. These are numbers that I can multiply by an integer to get 1, and are the only ones with this property. Primality is a property of the integers, if you make the number system too big everything becomes a Unit (eg in the Real Numbers 2 is a unit because 2(1/2)=1 so it is not prime as a real number).
We can extend the integers in a more systematic way to get new number systems that have their own collection of primes, but things don't work in exactly the same way and our notion of primes and the Fundamental Theorem of Arithmetic start to require a complete overhaul. But we can, for instance, just include i=sqrt(-1) into our number system and see what we get. This extended number system is called the Gaussian Integers and this is a simple enough extension where the notion of "Prime" remains essentially the same. In the Gaussian Integers, i is a unit (because i^(4)=1), 2 is no longer prime (2=-i(1+i)^(2)), 3, 7, 11 are prime but 5=(1+2i)(1-2i) and 13=(2+3i)(2-3i) are not prime. Including e into a number system does not give us a simple enough extension for any of these notions of prime to be meaningful because e is a Transcendental Number.
That really depends on who you ask. E.g. Wolfram MathWorld says:
If we go by that definition and extend to integers then -1 is prime. Then every negative number can be resolved into a prime factorization consisting of -1 and the prime factorization of the absolute value of that number. We do lose uniqueness if we do that though as (-1)^2n = 1 and (-1)^(2n+1) = -1, so the fundamental theorem of arithmetic needs to be restated as:
Of course this is just another way of extending prime numbers to a larger domain based on an alternative formulation. Also note that the formulation I cited from MathWorld is equivalent to the definition given by u/functor7 for positive natural numbers. Often different but equivalent formulations of the same property gives rise to different generalizations.
Edit: Added missing parentheses to -1 exponentiated.
No, it really does not depend on the definition. Basically a prime element of some ring is an element generating a prime ideal. (-1) does not generate a prime ideal anywhere (it is invertible) so it is by no way a prime number (the same goes for i). It could, sometimes, be used by convenience, as a label, to represent a thing called "the place at infinity" (I'm looking at you, theory of quadratic forms) which is basically a pedantic way of considering the real numbers. If you extend the Wolfram definition (which is correct) to the negatives, then you need to extend correctly!
but just to nitpick u/functor7, actually (-2) is a rational prime number since it generates the ideal 2ℤ, which is a perfectly fine prime ideal. Obviously this does not break the fundamental theorem of arithmetic if we write it in its more precise form as using chosen representatives from each prime ideal, and of course the positive primes are the best candidates!.
Alternatively, we could go for the more general definition: A non-zero element p of a domain R is prime if it is not a unit, and for all a, b in R, if p|ab, then p|a or p|b (the definitions above are what I'd call "irreducible", but they coincide on GCD domains). The smallest ring containing -2 is Z, in which it is true that if -2|ab, then there is some integer c such that ab = -2c = 2(-c), so 2|ab, and 2 is prime, so 2|a or 2|b, hence -2|a or -2|b (since -2 and 2 differ by only a unit), so -2 is prime. The smallest ring containing e is Z(e), but that's horrible and complicated, so we'll work in R, in which nothing is prime (since everything's a unit). The smallest ring containing i is Z(i), the Gaussian integers, in which i is not prime, since it is a unit.
[removed]
Thanks for clearing this up, every article i've ever read so far that dealt with Primes
stated that they have to be natural Integers, so i was wondering why,
but apparently they got it wrong.
In math up to the high school level (and in some historical work), people like to include "positive" in the definition of primes. You can see this on Wikipedia, for instance. Mathematicians prefer to let any number be prime, because of things like the example u/functor7 gave; you can generalize the concept of prime numbers to systems where numbers aren't really positive or negative.
[removed]