| Line 13: | Line 13: | ||
a + 0 = a | a + 0 = a | ||
| − | Set theory on the other hand defines “0” so that defining “1” becomes easier. '''Peano axioms''', which states that a+0 =a, can be derived from set theory of natural numbers. These axioms are really helpful when it comes to defining the natural numbers as a whole, especially since a lot of mathematics is based off of this. The definition of “1” starts from the definition of zero, defined by John von Neumann, as an empty set (denoted as ∅), which can be written as 0 = ∅. What is interesting is that there is no formal proof/definition of "0" besides assuming that 0 = ∅, upon which the rest of this proof is based on and many other axioms are based on, including the previously mentioned '''Peano axioms'''. | + | Set theory on the other hand defines “0” so that defining “1” becomes easier. '''Peano axioms''', which states that a+0 =a, can be derived from set theory of natural numbers. These axioms are really helpful when it comes to defining the natural numbers as a whole, especially since a lot of mathematics is based off of this. The definition of “1” starts from the definition of zero, defined by John von Neumann, as an empty set (denoted as ∅), which can be written as 0 = ∅. What is interesting is that there is no formal proof/definition of "0" besides assuming that 0 = ∅, upon which the rest of this proof is based on and many other axioms are based on, including the previously mentioned '''Peano axioms'''. |
| − | By defining "1", we can then define the other numbers. Von Neumann also defines a function, s(a), where s is the successor function. The successor function is defined as s(a) = a+1. So if we use this idea of succession, we can define our successor function such that s(a) = a ∪ {a}. This successor function is especially useful in defining the natual numbers with respect to set theory because it allows us to cover the full set of natural numbers. | + | By defining "1", we can then define the other numbers. Von Neumann also defines a function, s(a), where s is the successor function. The successor function is defined as s(a) = a+1. So if we use this idea of succession, we can define our successor function such that s(a) = a ∪ {a}. This successor function is especially useful in defining the natual numbers with respect to set theory because it allows us to cover the full set of natural numbers. |
| − | '''Proof Using Set Theory''' | + | '''Proof Using Set Theory''' |
| − | Using Set Theory, we are able to construct a proof for defining the Natural numbers. The proof starts by defining zero in terms of sets and building from there.<br> We can let 0:={ } which indicates zero is denoted as the empty set.<br>From there we use something called the Successor function. This function is a recursive function that is used to help define the natural numbers. <br> S(n) = n+1 Is the base of this function. Also “n” is denoted as any natural number. For example: S(1)=2 , S(2)=3 etc.<br> | + | Using Set Theory, we are able to construct a proof for defining the Natural numbers. The proof starts by defining zero in terms of sets and building from there.<br> We can let 0:={ } which indicates zero is denoted as the empty set.<br>From there we use something called the Successor function. This function is a recursive function that is used to help define the natural numbers. <br> S(n) = n+1 Is the base of this function. Also “n” is denoted as any natural number. For example: S(1)=2 , S(2)=3 etc.<br> |
| + | |||
| + | [[Image:Emptyset.png]] | ||
| + | |||
| + | The easiest way to describe this is by saying that if you have nothing and and a collection of nothings, you still have a whole bunch of nothing, but at least have stated that you have a bunch of nothing, which in this case we defined as a set only containing 0. | ||
[[2014 Spring MA 375 Walther|Back to MA375 Spring 2014]] | [[2014 Spring MA 375 Walther|Back to MA375 Spring 2014]] | ||
[[Category:MA375Spring2014Walther]] [[Category:Math]] [[Category:Project]] | [[Category:MA375Spring2014Walther]] [[Category:Math]] [[Category:Project]] | ||
Revision as of 19:12, 26 April 2014
We all "understand" what the number 1 is. Right? How do you really explain what that is to a smart person that has never heard of it?
There is a mathematical way of doing it, through set theory. Discuss a little how that goes, how you define addition, and so on.
A Brief History on Natural Numbers
As most of us know, natural numbers are the numbers that we use to count (1, 2, 3, …). But, where did these numbers come from? Whether or not to include 0 has been debated throughout history. Zero was included to make the set more “complete.” This was because 0 represents an empty set. I said before that natural numbers are counting numbers. If you do not count any, you have 0 (an empty set). Whether or not 0 is included in the set of natural numbers depends on the field of mathematics, but most define the set starting at 1.
Defining Addition of Natural Numbers
There are many ways to define the addition of natural numbers: recursion, induction, set theory. However, for recursion and induction, we must look at the basic axiom of mathematics that a number, a, added to zero, is still a, or with the symbols:
a + 0 = a
Set theory on the other hand defines “0” so that defining “1” becomes easier. Peano axioms, which states that a+0 =a, can be derived from set theory of natural numbers. These axioms are really helpful when it comes to defining the natural numbers as a whole, especially since a lot of mathematics is based off of this. The definition of “1” starts from the definition of zero, defined by John von Neumann, as an empty set (denoted as ∅), which can be written as 0 = ∅. What is interesting is that there is no formal proof/definition of "0" besides assuming that 0 = ∅, upon which the rest of this proof is based on and many other axioms are based on, including the previously mentioned Peano axioms.
By defining "1", we can then define the other numbers. Von Neumann also defines a function, s(a), where s is the successor function. The successor function is defined as s(a) = a+1. So if we use this idea of succession, we can define our successor function such that s(a) = a ∪ {a}. This successor function is especially useful in defining the natual numbers with respect to set theory because it allows us to cover the full set of natural numbers.
Proof Using Set Theory
Using Set Theory, we are able to construct a proof for defining the Natural numbers. The proof starts by defining zero in terms of sets and building from there.
We can let 0:={ } which indicates zero is denoted as the empty set.
From there we use something called the Successor function. This function is a recursive function that is used to help define the natural numbers.
S(n) = n+1 Is the base of this function. Also “n” is denoted as any natural number. For example: S(1)=2 , S(2)=3 etc.
The easiest way to describe this is by saying that if you have nothing and and a collection of nothings, you still have a whole bunch of nothing, but at least have stated that you have a bunch of nothing, which in this case we defined as a set only containing 0.
