Foundations of Pure Mathematics A
|Unit level:||Level 1|
|Teaching period(s):||Semester 1|
|Offered by||School of Mathematics|
|Available as a free choice unit?:||N
The course unit unit aims to:
- address the problem of enumerating sets - both finite and infinite!
- to supply evidence that such problems are both intriguing and provocative, and require rigorous proof;
- to explain the fundamental ideas of sets, numbers and functions;
- to compare and contrast language and logic;
- to introduce a detailed study of the integers, including prime numbers and modular arithmetic;
- to show how mathematicians generalize ideas, so unique factorization of integers is shown to hold for permutations;
- to introduce the ideas of algebraic structures and so show, by examples throughout the course, how the same structure can arise in many different situations.
This course introduces students to the concept of proof, by studying sets, numbers and functions from a rigorous viewpoint. These topics underlie most areas of modern mathematics, and recur regularly in years 2, 3, and 4. The logical content of the material is more sophisticated than that of many A-level courses, and the aim of the lectures is to enhance students' understanding and enjoyment by providing a sequence of interesting short-term goals, and encouraging class participation.
On completion of this unit successful students will be able to:
- Analyse the meaning of mathematical statements involving quantifiers and logical connectives, and construct the negation of a given statement.
- Construct truth tables of simple mathematical statements and use these to determine whether two given statements are equivalent.
- Construct elementary proofs of mathematical statements using a range of fundamental proof techniques (direct argumentation, induction, contradiction, use of contrapositive).
- Use basic set theoretic language and constructions to prove results about finite, denumerable and uncountable sets.
- Use elementary counting arguments, such as the pigeonhole principle, the inclusion-exclusion formula and the binomial theorem to compute cardinalities of finite sets and simplify expressions involving binomial coefficients.
- Recall formal definitions and apply these to give examples and non-examples of functions, bijections, equivalence relations, binary operations and groups.
- Recall and justify basic number-theoretic methods, including the Euclidean algorithm, and use them to solve simple arithmetic problems such as linear Diophantine equations.
- Use modular arithmetic to solve linear and simple non-linear congruences.
- Recall the fundamental properties of prime numbers, prove their infinitude and solve elementary problems on primes and prime factorisation.
- State and prove Fermat's Little Theorem and Euler’s theorem and apply them to solving simple questions involving primality testing and Euler’s phi-function.
- Recognise the two-line notation and the cycle notation for permutations and use them to compose, invert and find the order of given permutations.
- Other - 25%
- Written exam - 75%
Assessment Further Information
Supervision attendance and participation: Weighting within unit 10%
Coursework: Weighting within unit 15%
Three hours end of semester examination: Weighting within unit 75%
1. The Language of Mathematics.
Mathematical statements, propositions and predicates, or, and, not; truth tables, implication, necessary and sufficient, iff; rules of arithmetic; quantifiers, proof and negation of statements with quantifiers.
Direct proof, proof by contradiction, contrapositives, the induction principle and proof by induction; changing the base case; strong induction.
Historical origins, natural numbers to complex numbers; notation, belongs to, definitions (by listing, by conditions, by construction); subsets, equality, operations on sets, union, intersection, identities, power set, Cartesian products; power sets.
Definition and examples, domain, codomain, image, formulae and examples, equality, restriction, composition, sequences and indexing, restriction, graphs, injections, surjections, bijections, their compositions, inverse functions.
5. Counting Sets.
Finite sets, cardinality, the Pigeonhole Principle, inclusion-exclusion, Counting infinite sets, countability, denumerability of the rationals uncountability of the reals; power sets and their cardinality, algebraic and transcendental numbers.
1. Counting Collections of Functions and Subsets.
Numbers of injections and bijections. Numbers of subsets and Binomial Numbers, Pascal's Triangle, Binomial Theorem.
2. Arithmetic - the study of the integers.
Division Theorem, greatest common divisor, Euclid 's Algorithm, linear Diophantine equations.
3. Congruence and Congruence Classes.
Congruences, modular arithmetic, solving linear congruences, Chinese remainder theorem, congruence classes, multiplication tables*, invertible elements, reduced systems of classes*.
4. Partitions and Relations.
Partitions, relations, generalizing congruence classes.
Bijections, two row notation, composition, cycles, the permutation group Sn, composition tables, factorization, order.
6. Prime Numbers.
Sieve of Erastosthenes, infinitude of primes, conjectures about primes, Fermat's Little Theorem, Euler's Theorem*.
7. Groups, Rings and Fields*.
Definitions and very simple properties. Examples from earlier in the course
Students will acquire a copy of
P.J. Eccles, An Introduction to Mathematical Reasoning: Numbers, Sets and Functions, Cambridge University Press, 1997
which will be available as an e-book in Blackboard.
Feedback seminars will provide an opportunity for students' work to be discussed and provide feedback on their understanding. Coursework or in-class tests (where applicable) also provide an opportunity for students to receive feedback. Students can also get feedback on their understanding directly from the lecturer, for example during the lecturer's office hour.
- Lectures - 44 hours
- Tutorials - 11 hours
- Independent study hours - 145 hours