|
An axiom is an assumed property of a formal system. Generally, this means that it can't be proved that the axiom is true. Rather, it is assumed to be true, and may even be self-evident. You can think of it as a "rule of the game". A theorem is a statement within the formal system that can be proved by a series of correct logical deductions arising from axioms (or from theorems that have already been proved). Number theory (the study of integers) uses a very limited set of axioms (the fewer, the better, obviously). The following list is complete to the best of my knowledge and belief:
The idea is to build up theorems from axioms. Consider, for example, this proof (which I've pinched from Keith Devlin) that if k + m = k + n, then m = n.
That took more work than you might think was strictly necessary, but the point is this: now that we have proved the theorem (that if k + m = k + n then m = n), we don't ever have to prove it again. We can "take it as read", and use it as a fact in other proofs. All this work has already been done, with the upshot that you can generally be a little lazy with proofs. You don't have to prove everything from axioms. (But you can if you like!) |

















