Abstract Algebra: Preliminaries

From Department of Mathematics at UTSA
Jump to navigation Jump to search

Natural numbers

The natural numbers are those numbers used for counting (as in "there are six coins on the table") and ordering (as in "this is the third largest city in the country"). In common mathematical terminology, words colloquially used for counting are "cardinal numbers", and words used for ordering are "ordinal numbers". The natural numbers can, at times, appear as a convenient set of codes (labels or "names"), that is, as what linguists call nominal numbers, forgoing many or all of the properties of being a number in a mathematical sense.

Some definitions begin the natural numbers with 0, corresponding to the non-negative integers {0, 1, 2, 3, ...}, whereas others start with 1, corresponding to the positive integers {1, 2, 3, ...}. Texts that exclude zero from the natural numbers sometimes refer to the natural numbers together with zero as the whole numbers, while in other writings, that term is used instead for the integers (including negative integers).

The natural numbers are a basis from which many other number sets may be built by extension: the integers, by including (if not yet in) the neutral element 0 and an additive inverse (n) for each nonzero natural number n; the rational numbers, by including a multiplicative inverse () for each nonzero integer n (and also the product of these inverses by integers); the real numbers by including with the rationals the limits of (converging) Cauchy sequences of rationals; the complex numbers, by including with the real numbers the unresolved square root of minus one (and also the sums and products thereof); and so on. This chain of extensions make the natural numbers canonically embedded (identified) in the other number systems.

In common language, particularly in primary school education, natural numbers may be called counting numbers to intuitively exclude the negative integers and zero, and also to contrast the discreteness of counting to the continuity of measurement — a hallmark characteristic of real numbers.

Well-ordering principle

Consider the following set which we define to be the set of natural numbers:

Now consider any subset of . For example, let us consider the subsets , , and . The subset describes a finite set containing two integers. The subset describes the infinite set of all odd natural numbers, and the subset describes the infinite set of all even natural numbers. Notice that in each of these cases we can identify a least element of the subset. For example, the least element in is , the least element in is , and the least element in is .

In fact, it is impossible to construct a nonempty subset of that does not contain a least element. We describe this very important result below in the following theorem.

Theorem 1 (The Well-Ordering Principle of the Natural Numbers): Let be a nonempty subset of the natural numbers . Then there exists a least element , that is, for all .

We do not have the tools to prove Theorem 1 although it is a rather intuitively obvious result. Nevertheless, we should note that while Theorem 1 holds true for the set of natural numbers, it does not hold true for all sets of real numbers. For example, consider the set of rational numbers :

Any subset of the rational numbers need not have a least element. For example, consider the following subset of rational numbers between and noninclusive, that is, . We claim that has no least element. To prove this, assume that does have a least element, say is such that for all . Since we have that where Since we must have that too since and so:

Consider the number in the middle of and . This number is . Since and we have that and , so indeed, and which is a contradiction to our assumption that a least element exists in .

It's important to note that while not every subset of the rational numbers contains a least element, there are still subsets of that do contain a least element.

Induction

Integers

Division algorithm

Congruence modulo m

Algebra on

GCD, LCM, and Bézout's identity

Primes

Euclid's Lemma

Fundamental Theorem of Arithmetic

Licensing

Content obtained and/or adapted from: