Skip to main content Skip to navigation

MA132 Foundations

Lecturer: Oleg Kozlovski 

Term(s): Term 1

Status for Mathematics students: Core

Commitment: 30 lectures, 10 weekly assignments with 4 or 5 fortnightly tests based on them

Assessment: 15% from fortnightly tests and 85% from January exam

Formal registration prerequisites: None

Assumed knowledge: Grade A in A-level Maths or equivalent.

Useful background: Some elementary knowledge of modular arithmetic, induction principle, set notation.

Synergies: Most later pure mathematics modules specifically:

Leads to: The following modules have this module listed as assumed knowledge or useful background:

Aims: University mathematics introduces progressively more and more abstract ideas and structures, and demands more and more in the way of proof, until by the end of a mathematics degree most of the student's time is occupied with understanding proofs and creating his or her own. This is not because university mathematicians are more pedantic than schoolteachers, but because proof is how one knows things in mathematics, and it is in its proofs that the strength and richness of mathematics is to be found.

Learning to deal with abstraction and with proofs takes time. This module aims to bridge the gap between school and university mathematics, by beginning with some rather concrete techniques where the emphasis is on calculation, and gradually moving towards abstraction and proof.

Content:

  • Number Systems:
    Number systems: Natural numbers, integers. Rationals and real numbers. Existence of irrational numbers. Complex Numbers.
    Polar and exponential form of complex numbers. De Moivre's Theorem, $n$'th roots and roots of unity.
    Euclidean algorithm; greatest common divisor and least common multiple.
    Prime numbers, existence and uniqueness of prime factorisation. Infiniteness of the set of primes.
    Modular arithmetic. Congruence, addition and multiplication modulo $n$.

  • Language and Proof:
    Proof by induction.
    Well-ordering Principle.
    Proof by contradiction.
    Basic set theory:$\cap,\cup$ , Venn diagrams and de Morgan's Laws. Cartesian product of sets, power set.
    Logical connectives$\wedge$ , $\vee$ , $\Rightarrow$ and their relation with $\cap$ , $\cup$ and $\subseteq$. Quantifiers $\forall$ and $\exists$.
  • Sets, Functions and Relations:
    Injective, surjective and bijective functions.
    Inverse functions.
    Relations: equivalence relations, order relations.

  • Polynomials:
    Multiplication and long division of polynomials.
    Euclidean algorithm for polynomials.
    Remainder theorem; a degree $n$ polynomial has at most $n$ roots.
    Algebraic and transcendental numbers. Fundamental theorem of
    Algebra (statement only).

  • Counting:
    Cardinalities, including infinite cardinalities.
    Cardinality of the power set of X is greater than cardinality of X.
    Russell's paradox.
    Countability of the rational numbers, uncountability of the reals.
    Transcendental numbers exist!

Objectives: Students will work with number systems and develop fluency with their properties; they will learn the language of sets and quantifiers, of functions and relations and will become familiar with various methods and styles of proof.

Books:
None of these is the course text, but each would be useful, especially the first:
A.F.Beardon, Algebra and Geometry, CUP, 2005.
I.N. Stewart and D.O. Tall, Foundations of Mathematics, OUP, 1977.
J. A. Green, Sets and Groups; First Course in Algebra, Chapman and Hall, 1995.

Recommended Syllabus

 

Additional Resources