Is zero considered a number in mathematics?

[hamlet69]

a simple question

what is zero "0" does it count as a number?

any answers

 

[HallsofIvy]

"0" is the cardinality of the empty set (that's one definition).

"0" is the additive identity (that's another).

Yes, 0 is a number just like -1, π, √(2) and i.

 

[gimpy]

0 is the mark i will get on my linear exam if i don't study ;)

 

[suyver]

Zero is the only solution of the equation x = -x.

Also, zero is both the limit of the largest negative numbers and the limit of the smallest positive numbers...

Naturally, even more important (due to Euler):

0 \; = \; e^{i\pi}-1

Had enough?

 

[himanshu121]

0 was transferred from India to Arabians and to world

I don't know much of its importance given by Our Ancient Seers

But mathematically it is an essence in every field

Metaphysically it represents DEATH,GLOOMY,INAUSPICIOUS

 

[jcsd]

Zero is the identity element in addition (of vectors, integers, etc.)

edited to add: looks like HallsofIvy has beaten me to the punch on that defintion.

 

[HallsofIvy]

Only by 19 days!

 

[luther_paul]

zero makes mathematics full of identities and definitions...

 

[kishtik]

Originally posted by suyver
Zero is the only solution of the equation x = -x.

Also, zero is both the limit of the largest negative numbers and the limit of the smallest positive numbers...

Naturally, even more important (due to Euler):

0 \; = \; e^{i\pi}-1

Had enough?

That should be
0 \; = \; e^{i\pi}+1

 

[matt grime]

Originally posted by suyver
Zero is the only solution of the equation x = -x.

Not in mod 2 arithmetic.

 

[turin]

What is i or π in mod2?

 

[suyver]

Originally posted by kishtik
That should be
0 \; = \; e^{i\pi}+1

I hang my head in deep shame. You are (of course) very right.

 

[matt grime]

Originally posted by turin
What is i or π in mod2?

i is defined to be the square root of -1 isn't it? well, then -1=1 (mod 2) and the polynomial

x^2-1 = (x+1)(x+1) mod 2

so the answer is i=1

and n is either 0 or 1 depending on n odd or even resp.

 

[NoEffEks]

Some people consider 0 to be an asymtote. Not saying i do. but some do.

 

[quartodeciman]

I like the title of a monograph by nineteenth-century German mathematician Richard Dedekind.

"Was sind und was sollen die Zahlen?"

This can be rendered roughly in English by the following.

What are numbers, and what should they be?"

I think that is the fundamental question behind this topic.

 

[turin]

Originally posted by matt grime
... n is either 0 or 1 depending on n odd or even resp.

Not n, π. That is pi.

I'm still trying to understand that bit about i.

 

[matt grime]

do you know what the integers are mod 2? where did pi come from?

if that's all too much, then you probably don't want to know about maximal ideals in the ring of integers

by n I assumed you mean 1+1+1...+1, n times.

The key thing to understand is that when i introduced mod 2 arithmetic, i was pointing out that the question, and many of the answers were assuming that it was posed in the the real numbers. that is notthe only place where zero occurs.

 

[HallsofIvy]

Originally posted by quartodeciman[/b]
I like the title of a monograph by nineteenth-century German mathematician Richard Dedekind.

"Was sind und was sollen die Zahlen?"

This can be rendered roughly in English by the following.

What are numbers, and what should they be?"

It sounds a lot better in German, doesn't it. But you are right, it's a cool title.

 

[turin]

Matt grime,
It almost seems that you're not listening to me. But first, I will assume that I am very confused about mod2 (being not a math person).

First of all, I thought that mod2 could only deal with two distinct discrete objects, for instance 0 and 1. Then, the combination rule is defined such that 1 + 1 = 0, so that you always stay in the group.

I didn't know that multiplication, exponentiation, imaginary, or irational numbers were allowed in this scheme. I read through your bit about what i is in mod2 over and over again, and I still don't get it. If i = 1, then why write i? Does it only equal 1 when it is considered by itself, but it equals √-1 when it is in a product or exponent? It seems like there is 0 and there is 1, and then there is an infinitude of other "values" (not mod2) that you either have to identify with 0 or with 1. Why not say that i = 0?

I never asked about n. I think you may have seen the html "pi" in my post and interpretted it as an "n." Anyway, I'm curious what you would call pi in mod2. And now I realize that I forgot to ask about e. Both of these are irrational. That seems like it would be a problem for any discrete number system.

Tell me where I have gone way off. You said something about a ring. What is that?

edit:
Well, I don't know why I screwed this whole thing up so bad. For some reason, I thought we were talking about Euler's identity. But you were just talking about -x = x this whole time (I just read through the thread again). No wonder you think I'm whacko. I am TERRIBLY sorry about that. I would still like to hear what you have to say about the questions/concerns that I posed above, though.

 

[matt grime]

for turin

indeed i was only talking about x=-x, nothing to do with e or pi.

Firstly, F_2 is the set {0,1} as you know, with the addition and mult. as you stated. Now, this is all I was using. Now, i is defined as the square root of -1 in C, here there is a analogous element in the field because -1=1 has a square root. Notice however that there is a polynomial

x^2+x+1

that has no root in F_2. Just like in the real/complex case, we simply define A to be a root of this polynomial (the other root is 1+A), then there is an extension F_2[A] which we call F_4, it is the field with 4 elements, it is still not posible to find roots of every polynomial in F_4, so we can extend again and again. Each extension has 2^r elements for some r. The 'limit' of this construction, we'll call F, and it is the algebraic closure of F_2. It is infinite.

In all these fields 1=-1.


In the same way as there is a surjection from Z to F_2, there is a way of relating algebraic integers to "an" algebraic closure of F_2.

Let (2) be the ideal generated by 2 inside the ring of algebraic integers (that is the set of solutions of all monic polynomials with integer coeffs), the ideal is just the set of all things 2x, where x is an algebraic integer. Just like mod 2 arithmetc, we can declare two elments in the alg, integers to be the same if their difference lies in (2) (actually we require a maximal ideal containing (2) but that's a technicality).

Thus it is possible to define the image of any algebraic integer in a field of characteristic 2. However, neither e nor pi are alg. integers so i can't define their images.


To explain the high faluting maximal thing - 2 must get sent to zero, and so sqrt(2) must also get sent to zero if this were to make any sense, but sqrt(2) is not in the ideal (2). The maximal thing there corrects that problem and makes sure that the quotient is a field.

the vast majority of algebraic integers are irrational, in fact the only rational ones are the integers. it's a useful exercise to prove that

interestingly, the golden ratio, a root of x^2+x+1 must get sent to A, or 1+A in this scheme. note that A has no value as a real number! just as i doesn't, it's just a symbol we manipulate according to the rule A^2=A+1


Matt

 

[turin]

Matt, I understood just about none of that termonology, but thanks for explicating. I suppose I can inch through it and eventually understand it.

 

[Hurkyl]

Here it is in simpler terms.


In the world of complex numbers, a perfectly valid definition of i is:

i is a root of x^2 + 1.

All of the arithmetic we do with i can be done algebraically using this fact; for instance:

<br /> \begin{equation*}\begin{split}<br /> (a + bi) (c + di) &amp;= ac + adi + bic + bidi \\<br /> &amp;= ac + (ad + bc) i + bd (i^2) \\<br /> &amp;= ac + (ad + bc) i + bd (i^2 + 1 - 1) \\<br /> &amp;= ac + (ad + bc) i + bd (0 - 1) \\<br /> &amp;= (ac - bd) + (ad + bc) i<br /> \end{split}\end{equation*}<br />

So, for any practical algebraic purpose, we can simply say that we've simply declared that i is a root of x^2 + 1.


(Behind the curtain, there is quite a bit of mathematics involved to prove that such a declaration can be sensible, but you don't need to know what goes on behind the curtain to use such declarations)


Why stop there? We could instead declare \alpha is a root of x^2 - 2x + 2! (1)

This is also a perfectly valid way to create the complex numbers; declare them to be all numbers of the form p + q \alpha. (exercise for those of you at home, and I strongly suggest you do it, things will make more sense!: what is (a + b \alpha) (c + d \alpha) written in the form p + q \alpha?)

It turns out in this case that (assuming my hasty algebra was correct) if we make the substitution \alpha \rightarrow i + 1 that we can convert from this new definition of the complex numbers to the normal definition.



Anyways, we can apply this same idea to any other field, such as the integers mod 2 (F_2). (a field is essentially just a number system in which you can divide by nonzero things)


One could try and define a new number system that is all numbers of the form p + q \alpha where p, q \in F_2 and \alpha is a root of x^2 + 1... but that isn't helpful because x^2 + 1 already has a root in F_2!

But, as before, we can simply pick another polynomial and declare some new field (let's call it F_2(\alpha)) as all numbers of the form p + q \alpha where p, q \in F_2 and \alpha is a root of x^2 + x + 1. This system is interesting because x^2 + x + 1 doesn't already have a root in F_2.


It turns out that when doing this type of construction over a finite field (such as the integers mod a prime), things are much more interesting than the boring world of the real and complex numbers.


(that's boring algebraically; they're still very interesting because of their topology)


(1) This sentence was originally incorrectly written as "Why stop there? We could instead declare \alpha is a root of \alpha^2 - 2\alpha + 2!"

 

[matt grime]

I'm not sure I can countenance using x to be a root of x^2-2x+2...

 

[Hurkyl]

While my typo was still technically correct, I will admit it was extraordinarily confusing. Fixed.

 

[turin]

Originally posted by Hurkyl
... for any practical algebraic purpose, we can simply say that we've simply declared that i is a root of x^2 + 1.


(Behind the curtain, there is quite a bit of mathematics involved to prove that such a declaration can be sensible, but you don't need to know what goes on behind the curtain to use such declarations)

I don't see how this could be nonsensible. It is a definition, and I don't see how it could be self-contradictory in this case. I'm assuming we already take for granted what ^2, +, 1, and "root" mean? Then, we just introduce another entry into our dictionary: i. What could be wrong with that?

Originally posted by Hurkyl
Why stop there? We could instead declare \alpha is a root of x^2 - 2x + 2

It doesn't seem to be an issue to continue with replacement. Why stop with the definition for &alpha;, when we could instead declare &beta; is a root of x² + x + 1? And then why stop here, when we could instead declare is a root of x² + x + ? In answer to "why stop there?" I would reply, because it is just as good a place as any (better IMO). Are you saying that this use of &alpha; is a better way to define complex numbers?

Originally posted by Hurkyl
(exercise for those of you at home, and I strongly suggest you do it, things will make more sense!: what is (a + b \alpha) (c + d \alpha) written in the form p + q \alpha?)

I don't get it. Isn't it already in that form, that is, two factors of that form?

Originally posted by Hurkyl
Anyways, we can apply this same idea to any other field, such as the integers mod 2 (F_2). (a field is essentially just a number system in which you can divide by nonzero things)

I think I missed what the idea was. You mean we can define things in mod2? I don't get why that is so special. Are you talking about the analogy of extending the real numbers into the complex numbers? Is this F₂ the short way of writing "the field of integers mod 2?"

Originally posted by Hurkyl
One could try and define a new number system that is all numbers of the form p + q \alpha where p, q \in F_2 and \alpha is a root of x^2 + 1... but that isn't helpful because x^2 + 1 already has a root in F_2!

I don't understand this. What does "p, q \in F_2" mean? So what if it's not helpful if it's valid. Does this not prove that i is, by definition, 1 in mod 2? (since the definition of i is the root of x² + 1)

Originally posted by Hurkyl
But, as before, we can simply pick another polynomial and declare some new field (let's call it F_2(\alpha)) as all numbers of the form p + q \alpha where p, q \in F_2 and \alpha is a root of x^2 + x + 1. This system is interesting because x^2 + x + 1 doesn't already have a root in F_2.

Is this just a random polynomial that you chose as an example that doesn't have roots in mod 2, or is there something special/conventional about it?

 

[matt grime]

It would probably help if you knew what a ring, field etc were,

But ignore that bit.

The key here is that algebraically the real numbers are not complete - there is a polynomial with real coeffs that has no real root - x^2+1. We can declare that there is some element i, the
at behaves accoridng to the rule i.i=-1, and form C as R(i). Now it is an important result that you've now gone far enough - every polynomial with coeffs in C has roots in C, that is it is alg closed. Npw, we could equally have well defined j to be the root of the poly x^2+5, and algebraically,R(i) and R(j) are indistinguishable, that is one is a subfield of the other. So all though you say, well, adjoin other roots, the thing is they are already there.

Now, let's take polys with coeffs on F_2 or Z_2 depending on your preference. the equation x^2+1 has both its roots in F_2 already. There is however no root of X^2+x+1 in F_2. Traditionally, that is the first one you look at. Now it as a theorem that is not important (but whose proof is, bizarrely*) that no finite field (find a definition on Wolfram) has roots to every polynomial in it.


Look up field, field extension and algebraic closure.


* to explain that assertion, for instance, it is not very important that sqrt(2) is irrational, but that there is a proof (not the one you know at a guess) that implies that no integer has a rational square root unless it is a square of an integer - look at prime factors.

 

[Hurkyl]

I don't see how this could be nonsensible.

It could lead to a new number system that doesn't have nice properties. (e.g. maybe division isn't well-defined) It could require more complicated notation. (maybe we have to represent things like a + bi + ci^2) The definition might not be self-contradictory, but it might lead to a contradiction in the future!

These are things that one might worry about when trying to extend a number system. However, there is a nice theorem:

Let F be a field, and let p(x) be an irreducible polynomial^1 of degree n whose coefficients are in F.

Then, there exists a field F(\alpha) that consists of all numbers of the form:

a_0 + a_1 \alpha + a_2 \alpha^2 + ... + a_{n-1} \alpha^{n-1}

where all of the a_i are elements of F, and we have that p(\alpha) = 0.


So the mathematics behind the curtain say we're rigorously justified to do this sort of thing.


The mathematics behind the curtain also say there's exactly one extension of the real numbers that you can make in this way; the complex numbers.


Here's an example of something that yields a system that has less nice properties (though this system is an interesting one):

Define h to be a root of x^2 - 1, but also require that h \neq 1. Then we consider numbers of the form a + bh where a, b \in \mathbb{R}. (that is, a and b are real numbers)


The problem with this system is that division isn't always possible. For instance, what is (1 - h)^{-1}? If we try a generic possibility (1 - h)^{-1} = (a + bh) and multiply, we find:

<br /> \begin{equation*}\begin{split}<br /> (a + bh) (1 - h) &amp;= (a + bh - ah - bh^2) \\<br /> &amp;= (a - b) + (b - a) h<br /> \end{split}\end{equation*}<br />

So no matter what we choose for a and b, this cannot equal 1, thus 1 - h doesn't have a multiplicative inverse; i.e. we cannot divide by 1 - h.


So we have to be careful when we decree things like this; the result might not be quite what we expect!

Are you saying that this use of ? is a better way to define complex numbers?

No, I just wanted to make another example before leaving the comfortable world of the real and complex numbers. Besides, IMHO, playing around with at least one alternate definition of \mathbb{C} is a good exercise for understanding things.

I don't get it. Isn't it already in that form, that is, two factors of that form?

Well, if we foil, we get:

<br /> (a + b\alpha) (c + d\alpha) = ac + (ad + bc) \alpha + bd \alpha^2<br />

Which is not of the form p + q \alpha.

Are you talking about the analogy of extending the real numbers into the complex numbers?

Yep. It turns out that this is an extremely useful thing to do with finite fields, or with the rational numbers.

Is this F₂ the short way of writing "the field of integers mod 2?"

Yes. Some other ways of writing it are GF(2) and \mathbb{Z}_2.

Is this just a random polynomial that you chose as an example that doesn't have roots in mod 2, or is there something special/conventional about it?

There are 4 polynomials of degree 2 over F_2. x^2 + x + 1 is the only one that is irreducible.



1: An irreducible polynomial is one whose only factors are multiples of itself and multiples of 1. The field in question is important; e.g. 2x^2 - 4 is irreducible over the rational numbers, but factors as (2x - 2\sqrt{2})(x + \sqrt{2}) over the real numbers.

 

[turin]

Thanks Matt and Hurkyl. I think I very well may have learned more math today than in all the 9251 other days of my life combined.

Originally posted by matt grime
The key here is that algebraically the real numbers are not complete - there is a polynomial with real coeffs that has no real root - x^2+1. We can declare that there is some element i, the
at behaves accoridng to the rule i.i=-1, and form C as R(i). Now it is an important result that you've now gone far enough - every polynomial with coeffs in C has roots in C, that is it is alg closed.

This is something I never before realized. So, basically, I never realized how phenomenal the field of complex numbers is until today. Again, thank you for this supurb enlightenment.

One question:
When you say, "it is alg closed," (I'm assuming "alg" means "algebraically") "what" is alg closed? The polynomial? The field?

Originally posted by Hurkyl
It could lead to a new number system that doesn't have nice properties. (e.g. maybe division isn't well-defined)

Isn't this already a "problem" with complex numbers:
x/y = z.
let y = 0 (as far as I understand, this is a perfectly valid member of C).
z = ?.

Originally posted by Hurkyl
(maybe we have to represent things like a + bi + ci^2) The definition might not be self-contradictory, but it might lead to a contradiction in the future!

Can you give an example of how this contradicts something.

Originally posted by Hurkyl
Here's an example of something that yields a system that has less nice properties (though this system is an interesting one):

Define h to be a root of x^2 - 1, but also require that h \neq 1.

But this, to me, seems like a self-contradictory definition. Do we not know that the root of this polynomial is 1? So, h = 1, but then we define h /= 1. So h /= h. How is this not a contradiction.

edit:
I just realized, I said "the" root. What I should have said was "a" root. (An advantage of specificity that the Polish language lacks) So, actually, this renders your example without a problem, because h = -1. Then, (a + bh) = (a - b) = 1/2. Leaving the expression generic for the time being, we must find the two values a & b. We have the equations:
a - b = 1/2
(a - b) + (b - a)(-1) = 1
Which become:
2a - 2b = 1
2a - 2b = 1
This system of equations is perfectly self-consistent.

Originally posted by Hurkyl
No, I just wanted to make another example before leaving the comfortable world of the real and complex numbers. Besides, IMHO, playing around with at least one alternate definition of \mathbb{C} is a good exercise for understanding things.

ABSOLUTELY! And again, thank you for posing it. I feel like my level of understanding has sky-rocketed.

Originally posted by Hurkyl
Well, if we foil, we get:

<br /> (a + b\alpha) (c + d\alpha) = ac + (ad + bc) \alpha + bd \alpha^2<br />

Which is not of the form p + q \alpha.

Are you demonstrating that it cannot be put into the desired form, or that puting this into the desired form is not trivial? Is this a demonstrated "future contradiction?"

 

[Hurkyl]

Isn't this already a "problem" with complex numbers:
x/y = z.
let y = 0 (as far as I understand, this is a perfectly valid member of C).
z = ?.

Well, division is only expected to work with nonzero divisors. An example of something that is not a field is the integers (what is 1/2?) or the integers mod 9 (what is 1/3?)

Can you give an example of how this contradicts something.

Nope! At least nothing very similar to what we're discussing here. Thanks to the theorem I mentioned, these constructions are perfectly well justified when working with fields, and I'm not familiar enough with rings to know how this stuff behaves with them.

But this, to me, seems like a self-contradictory definition. Do we not know that the root of this polynomial is 1? So, h = 1, but then we define h /= 1. So h /= h. How is this not a contradiction.

(P.S. I also meant to assert that h \neq - 1; I'm correcting my post to reflect that)

Ah, but how do you prove that h = 1? You know that 1 is a root of x^2 - 1...

The proof that x^2 - 1 has only two roots (1 and -1) depends on the fact that you're working over a field; that is division always works (for nonzero things). When I introduced this new thing, h, we are no longer working over a field, so this proof fails.

In this new structure (called the hyperbolic numbers), isn't always allowed and n-th degree polynomials can have more than n roots!

Are you demonstrating that it cannot be put into the desired form, or that puting this into the desired form is not trivial?

When you first learned complex numbers, you were probably motivated (or required) to practice arithmetic on them; add them a few times, multiply a few times, divide them a few times, and even square root them a few times!

Basically, I'm suggesting you do the same thing with these numbers. Just like you use the fact i^2 = -1 to simplify the expressions for ordinary complex numbers, you can use the fact \alpha^2 = 2\alpha - 2 to simplify expressions for complex numbers written in this new way.

(mainly this is just a warmup for doing the same kind of thing over finite fields; I don't know of any practical use of this exercise other than simply as a good exercise)

 

[matt grime]

Yes, alg means algebraically. Algebraic closure refers to the field. A field is algebraically closed when and only when every polynomial with coeffecients in that field has all its roots in that field.



And x/0 is not allowed in the complexes. The reason so many people think this is ok is that there is a well known and often misused object called the Riemann Sphere which extends the complex plane to include a point at infinity, but this is basic algebra here so we don't touch it.


The 'problems' Hurkyl alludes to might include lots of zero divisor issues, and there is a lot of the theory of ideals in there.


Here are two examples - take the integers mod 8, that is the numbers 0,1,2,3,4,5,6,7 with addition and multiplication taken remainder 8. here 4*2=0 and we say 4 and 2 are divisors of zero. This is not a good place to do arithmetic - we can't divide. Also note that x^2=1 has 4 solutions, 1,3,5,7.

All this behind the scenes stuff makes sure that there are no zero divisors in C and degree n polys have n roots.


The second. To give you a flavour of what the smoke and mirrors are:


Take R[x] to be the ring of all polys in on variable x with real coeffs. Let p=x^2+1, then {p} is the set of all multiples of p, that is all polynomials of the form p(x)q(x) for some omthe poly q(x).

Now p is irreducible - that is it has no real roots (that's not the general definition but for quadratics it is equivalent).

This irreducibility means that when we form the mod p analogue for polynomials - ie two polys r and s are defined to be equivalent if p divides r-s, or equivalently there is another poly h with r = s+h*p -- that we get a field.


we denote this R[x] / {p}


notice that we can define a map to C by sending x to i. This is acutally an isomorphism - that is R[x]/{p} and C are actually the same field.

Ian Stewart's book on Galois Thoery is a good place to learn about this - unlike most university level texts this emphasizes the examples and works inside C most of the time.