Contrary to the usual counterexample post, I shall describe something which originally inspired me to start this blog: an application of mathematical logic to mathematics. Eventually, I’d like to work towards describing some of the model theory in algebraic geometry, but for now I’ll be satisfied with set theory.
An early theorem proved in the theory of sets is that if
is an infinite cardinal, then
. One can prove this directly using transfinite induction or some variant, but I recently thought of a route through model theory that I find most interesting, if only because it’s indirect, and such proofs are my favourite.
We shall work with first-order logic. Consider the language
where
is a binary function symbol. We let
be the set of first-order axioms saying just that
is bijective (note that we can do this with a first-order sentence). We know that
, so that
has a countable model. Now by Löwenheim-Skolem, there is a model of cardinality
for every infinite cardinal
. This proves that there is a bijective map
, although we certainly don’t have any idea from this proof what the map might “look like”.
This is a short proof, and doesn’t use any advanced theorems from logic, but for instance, it does use Löwenheim-Skolem and thus the compactness theorem.