Number Theory/Axioms

From testwiki
Revision as of 00:18, 7 December 2022 by imported>DragonflySixtyseven (sp)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Axioms of the Integers

Axioms are the foundation of the integers. They provide the fundamental basis for proving the theorems that you will see through the rest of the book.

Here is a mostly complete list:

For a, b, and c integers:

Closure of × and +: a×b and a+b are integers

Commutativity of +: a+b=b+a

Associativity of +: (a+b)+c=a+(b+c)

Commutativity of ×: a×b=b×a

Associativity of ×: (a×b)×c=a×(b×c)

Distributivity: a×(b+c)=a×b+a×c

Trichotomy: Either a<0, a=0, or a>0.

Well-Ordered Principle: Every non-empty set of positive integers has a least element. (This is equivalent to induction.)

Non-Triviality: 01. *This is actually unnecessary to have as an axiom, since it can be easily be proven that 01. Proof: Assume 0=1. There exists a positive integer a such that a is a member of the positive integers. Then, a×0=a×1 Therefore, 0=a However, since trichotomy states that every integer is either equal to 0, positive, or negative, there is a contradiction such that a is both 0 and a positive integer. Therefore, 01. This simple proof provides a more powerful system since less has to be assumed.

Existence: 1 is an integer.

Template:BookCat