Hi wtf,
I will start with the axiom of existence.
In the text book “Introduction To Set Theory” Third Edition, Revised and Expanded by Karel Hrbacek and Thomas Jech, the first axiom is The Axiom of Existence. This axiom states “There exists a set which has no elements”. Here I will use the notation φ for the empty set, though it is sometimes denoted as { }.
This is very important because 0 is defined as φ. 0 =φ. 1 = {φ}. 2 = {φ, {φ}} and 3 = {φ, {φ}, {φ, {φ}}}. In general n = {0, 1, 2, … n-1}. Roughly speaking numbers are sets of sets of sets … of nothing. I expect that Shakespeare might think that this is “Much ado about nothing”. You can find this axiom, it is the second axiom on ZFC, in the online Encyclopedia of Mathematics.
I think that Wiki realizes the problem with this axiom and goes out of its way to define the empty set in terms of other (hopefully) existing sets. This relisting of ZFC axioms (which should be independent, but in fact are not) ultimately makes the Natural numbers lose its uniqueness.
My opinion: Over 80% (some Algebraists use their own foundation) of all mathematicians would claim that ZFC is the foundation for mathematics. Yet, maybe 95% of all mathematicians have no idea of what ZFC is. There are extremely few schools in the country that teach foundational mathematics.
Bijections:
A bijection is a mapping from Set A to Set B such that, for every y in B, y = f(x) for some x in A. Furthermore f is a unique mapping. Formally f(a) = f(b) if and only if a = b.
These types of maps are very important in Cantor Theorems, they form the way that we measure the size (Cardinality) of various sets.
Examples of sets that have the same Cardinality are the Counting numbers (The Set = {1, 2, 3, …} and the Set ={0,1,2,…}. The Set = {1, 2, 3, …} and the even numbers. The Set = {1, 2, 3, …} and the odd numbers. The Set = {1, 2, 3, …} and the Cartesian product of the Counting numbers CXC. The Set = {1, 2, 3, …} and the Integrers. The Set = {1, 2, 3, …} and the Rational numbers and even The Set = {1, 2, 3, …} and the Rationals X Rationals X Rationals … . Two sets do not have the same Cardinallity are the Counting numbers and the Real numbers.
Homomorphisms:
A homomorphism is a bijection map from Set A to Set B such that, if x (think generalized multiplication) is a binary operation on Set A and there exists x’ ia binary operation on Set B, then f(a x b) = f(a) x’ f(b). Note x and x’ can be generalized to n-ary operations and the property that then f(a x b) = f(a) x’ f(b) does not need to be restricted to single operations.
This means that with respect to the operations x and x’ the sets A and B mimic each other. I used this type of mapping, in one of my posts, to show how some aspects of the empirical world can mimic the Natural numbers and vice versa.
On 0.000 … :
I think that this is at least an ambiguous expression and likely to have additional interpretations.
If we assume that the expression is a function f then we could write that f is a function from the set of Natural numbers to the set of Counting numbers given by the map (n, f(n)) where f(n) is defined as follows:
f(n) = 1 + 0(∑ from i =0 to i=n of (1/10)^i).
Since 0 times anything is 0, f(n) = 1. However, and this is where we differ, f(n) does not denote f. It is simply the y coordinate in the set of ordered pairs {(n, 1)} which describes f’s mapping.
A simple observation:
It is important that the indices in the summation be precise. E.g.:
∑ from n = a (where a is a Natural number) to n = ∞ of Exp(n) is defined to be a limit and not in itself a function.
However the following summation simply indicates that n is what L.E.J. Brouwer called an indefinite finite number:
∑ from i = a (where a is a Natural number) to i =n of Exp(i).
The above summation forms a proper map. (Assuming that Exp(i) is appropriate).
Thanks Ed