That’s very helpful, thank you. However, one of the reasons we’re working together is so you can do that sh*t.It has a few problems. The biggest are 1) the proof uses two numbers to suggest that one of them is "foundational", and 2) the statement "All computers can perform any computation using two numbers" does not imply that computers must use two numbers.
Friendly technical note: axioms aren't proved, they're assumed. Using a set of given axioms, we prove theorems. Once we have a few theorems, we can use them to make other theorems. The set of all theorems is a theory.
Humor me to lay out a simple example, so you can get a better feel for what these things look like. We'll use group theory, which is one of the simplest algebraic structures (few axioms) that nevertheless is very rich (in theorems).
A group is just a set of elements \( S \) and a single binary operator \( \star \). The elements can be anything -- numbers, geometric shapes, colors, types of monkeys -- and the operator can be anything that obeys the group axioms, which are the same for every group.
Suppose a, b, and c are elements in \(S\). Then, the group axioms are:
That's it. We don't have to prove any of the axioms, we just assume them. Using these axioms, we can prove theorems.
- \( S \) is closed under the operation: \( a \star b \in S \)
- There is an identity element \( e \), such that \( a \star e = a \)
- The operator is associative: \( a \star (b \star c) = (a \star b) \star c \)
- Every element has an inverse under the operation: \( a \star a^{-1} = e \)
For instance, we know that the following is a theorem of any group:
If \( a \star a = a \), then \( a \) is the identity element of the group.
Proof:
QED. We've proven the theorem. This means that, for any group we can think of, we know that \( a \star a = a\) implies that \( a \) is the identity element. For example, the integers under addition form a group, \((\mathbb{Z}, +)\). From elementary school, we know that 0 is the identity element of this group. Indeed, 0 is the only element of \( \mathbb{Z} \) for which \(a + a = a\).
- \( a \star a = a \)
- \( a \star a = a \star e \) (by identity axiom)
- \( a \star a = a \star (a \star a^{-1}) \) (by inverse axiom)
- \( a \star a = (a \star a) \star a^{-1} \) (by associativity axiom)
- \( a \star a = a \star a^{-1} \) (by step 1)
- \( a \star a = e \) (by inverse axiom)
What about the integers under multiplication? Is \((\mathbb{Z}, \times)\) a group? It is not, because axiom 4 (inverses) is not obeyed for every element. For example, the number 2 has no multiplicative inverse in the integers.
Group theory, being so simple, is quite general. We can add more structure -- and, hence, more power -- by adding stuff to it. We can introduce new axioms (e.g., adding the commutative property leads to the theory of Abelian groups), or, even better, introduce more operators, which leads to richer structures, such as the rings and fields we learn about in elementary school arithmetic. Using these structures, we can create even larger palaces, such as vector spaces, Banach spaces, Hilbert spaces, etc.
This is generally how theories build on one another.
You know what I’m tring to say above, right?
They “can” means they “don’t need more than that.” They are the H and the O of H2O and every other molecule involving them.
How about:
The number 1 ("one") and 0 (“zero”), are the foundational numbers from which all other numbers are conceptualized. All bases and computations can be done using just these 2 numbers.
Theorem: All modern computers are able to perform any computation of any kind using the number 1 (unary) or 1 and 0 (binary) as represented by classical bits, and yield results in any base. QED.
Last edited: