MATH2001 Chap.3 Number Systems
Number Systems
Build arithmetic from declared data
Natural numbers begin with zero, a successor map and induction. Addition and multiplication are introduced recursively, and their familiar laws are then proved rather than assumed. The variable used by the recursion usually indicates the efficient induction variable.
Auxiliary lemmas must be established in a dependency-safe order, because using commutativity to prove commutativity would be circular.
Quotients enlarge what can be solved
Integers are classes of natural-number pairs representing formal differences. Rationals are classes of pairs representing fractions with a nonzero denominator. Real numbers are classes of rational Cauchy sequences.
Each enlargement admits solutions that were missing before, but every formula on representatives creates a well-definedness obligation. Equal input classes must produce equal output classes.
Embeddings then show that the earlier arithmetic survives inside the new system.
Structure packages the laws
Complex numbers can be built from ordered pairs of reals with a multiplication rule encoding i squared equals minus one. Fields and commutative rings collect the laws satisfied by addition and multiplication. The critical field condition is that every nonzero element has a multiplicative inverse.
The chapter therefore links construction, representative checks, structural laws and embeddings into one repeatable workflow.
What this chapter covers
- 01
Successor and induction
- 02
Recursive addition and multiplication
- 03
Integers as pair classes
- 04
Rationals and order
- 05
Reals as Cauchy classes
- 06
Complex pair arithmetic
- 07
Fields, rings and embeddings
Worked example · free
Check rational addition on representatives
- 3Introduce equivalent replacement pairs and write both cross-product equalities.
- 6Compare the two proposed numerator-denominator outputs by cross multiplication.
- 3Verify the new denominator is nonzero and conclude independence.
Key terms
- Successor Map
- The operation sending a natural number to the next natural number in the axiomatic construction.
- Recursive Definition
- A definition fixed by an initial case and a rule relating a successor case to an earlier value.
- Representative
- One concrete object used to name an equivalence class containing many equivalent choices.
- Embedding
- An injective map that preserves the relevant operations and identifies one structure inside another.
- Field
- A commutative arithmetic structure in which every nonzero element has a multiplicative inverse.
- Commutative Ring
- A structure with compatible addition and multiplication in which multiplication is commutative but nonzero elements need not be invertible.
- Complex Conjugate
- The complex number obtained by reversing the sign of the imaginary component, used to derive multiplicative inverses.
Number Systems FAQ
Why define familiar numbers in such an abstract way?
The constructions show which properties are assumptions and which must be proved. They also explain why new number systems are needed: integers add subtraction solutions, rationals add division solutions, and real completion adds limits of rational approximation processes. The same quotient method later reappears in modular arithmetic and polynomial fields.
What must an embedding prove?
It must send earlier elements into the larger structure without identifying two distinct inputs, and it must preserve the operations under discussion. For a number-system embedding, show injectivity and compatibility with addition and multiplication. Those results justify reusing the same symbols after the enlargement.
Why is a nonzero condition important for inverses?
Zero cannot have a multiplicative inverse because zero times every element remains zero. In pair constructions, the condition also prevents illegal division. A complete inverse derivation identifies the denominator, proves it is nonzero for the given element, and then multiplies to verify the result is the multiplicative identity.
Exam move
Make a construction table with columns for underlying objects, equivalence, zero, one, addition, multiplication, inverse and embedding. Fill each row from natural numbers through complex numbers. For every class operation, rehearse the same proof skeleton: replace both representatives, compare the proposed outputs and conclude they belong to the same class.
When proving an arithmetic law recursively, list the earlier lemmas actually available so that an unproved familiar rule is not used silently. Keep a dependency list for each construction. Mark separately the facts needed for existence, well-definedness, preservation of operations and injectivity of the embedding. Test formulas first on convenient representatives, but never treat that test as a proof.
End each review session by explaining what new equation the enlarged number system can solve and what equivalence relation makes that enlargement possible.
Working through Number Systems in MATH2001? Sia is AskSia’s AI Mathematics tutor — ask any MATH2001 Number Systems question and get a clear, step-by-step explanation grounded in how MATH2001 is taught and assessed. Read this chapter free, then take your hardest questions to Sia.