MATH2001 Foundation of Mathematics
MATH2001 Overview
- HKUST
- 2026-27 Fall Term
- Level 2 mathematics
- Closed-book examinations
- Cumulative final examination
What this course is building
Foundation of Mathematics is a bridge into proof-based university mathematics. The course begins from a practical observation: many students can calculate successfully but have had little opportunity to read a theorem closely, choose a proof method, or write a complete argument.
- Assessment Homework counts for 20%, the midterm examination for 30%, and the cumulative final examination for 50%.
- Core skill Translate a mathematical claim into the exact proof obligation before doing algebra.
- Marking focus Accuracy, method, logical completeness and coherent mathematical communication are assessed separately.
What you get in the full MATH2001 Exam Bible
- 5 chapters, 30 pages — every examinable topic, week by week
- 14 original practice questions, each with a model answer in the Final examination format
- 5 worked examples, solved the way MATH2001 marks
- 9 computed figures, redrawn from the course’s own numbers
- Exam-morning plan for the Final examination (50%) — what to revise last, where marks are lost
Free on this page: assessment table, chapter map, one worked example, key terms, FAQ. The rest is in the full exam bible.
How MATH2001 is assessed
| Component | Weight | Format |
|---|---|---|
| Homework | 20% | Regular problem sets submitted through Canvas |
| Midterm examination | 30% | One regular class meeting in Weeks 6 to 8 |
| Final examination | 50% | Cumulative, during the Fall examination period |
The published outline lists these three components and their numeric weights total 100%. It states that both examinations are closed-book, the final examination is cumulative, and detailed coverage and arrangements will be announced on Canvas.
Assessment structure
The segment widths match the published weights and total 100%.
What other students are asking about MATH2001
- Where can I find lecture notes or study guides for MATH2001 at HKUST?
- The MATH2001 study guide in AskSia Library covers Foundation of Mathematics in 5 chapters, with the assessment table, a chapter-by-chapter topic map, key terms and a worked example, free to read on this page.
- Is there a final exam in MATH2001, and how much is it worth?
- Yes. In the offering this AskSia Library guide is built from, Final examination carries 50% of the MATH2001 mark; the full split is Homework 20%, Midterm examination 30%, Final examination 50%.
- What does MATH2001 cover on sets, functions and relations?
- In AskSia Library's MATH2001 guide, the Sets, Functions and Relations chapter explains membership, set operations, images, preimages, fibres, equivalence classes and quotients.
- What does MATH2001 cover on number systems?
- In AskSia Library's MATH2001 guide, the Number Systems chapter explains recursive arithmetic, integer and rational classes, real construction and complex field operations.
- What does MATH2001 cover on integers and polynomials?
- In AskSia Library's MATH2001 guide, the Integers and Polynomials chapter explains division algorithms, greatest common divisors, Bezout identities, irreducibility and quotient fields.
What MATH2001 covers
Five chapters follow the primary course notes from proof language and set-based structures through number construction, Euclidean methods and completion.
Definitions, Theorems and Proofs
statements, implication, quantifiers, direct proof, contradiction and inductionStart with the sentence, not the symbols
Proof writing begins by deciding what kind of claim is on the page. A statement has a definite truth value; an expression with an unbound variable does not.
- Statements and free variables
- Implication and contraposition
- Quantifier order and negation
- Direct and contrapositive proof
- Contradiction and counterexamples
- Mathematical induction
Sets, Functions and Relations
membership, set operations, images, preimages, fibres, equivalence classes and quotientsTranslate set notation into membership
Set arguments become systematic when each operation is read as logic about an arbitrary element. Union uses inclusive or, intersection uses and, and difference combines membership with non-membership.
- Membership and inclusion
- Set operations and identities
- Power sets and products
- Domain, codomain and graph
- Images, preimages and fibres
- Injective and surjective maps
Number Systems
recursive arithmetic, integer and rational classes, real construction and complex field operationsBuild 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.
- Successor and induction
- Recursive addition and multiplication
- Integers as pair classes
- Rationals and order
- Reals as Cauchy classes
- Complex pair arithmetic
Integers and Polynomials
division algorithms, greatest common divisors, Bezout identities, irreducibility and quotient fieldsDivision creates a decreasing remainder
The integer division algorithm writes a as qb plus r with the remainder between zero and the positive divisor. Polynomial division over a field uses the same pattern, replacing numeric size by degree.
- Integer division algorithm
- Euclidean remainder descent
- Greatest common divisors
- Bezout back-substitution
- Polynomial division
- Irreducibility and factors
Completion and Cauchy Sequences
valuations, epsilon estimates, equivalent sequences, class arithmetic and completenessA valuation supplies the geometry
A valuation measures size in a field, preserves multiplication and satisfies a triangle inequality. It defines distance through the size of a difference.
- Valuations and induced distance
- Cauchy quantifier order
- Convergence versus Cauchy
- Equivalent approximation sequences
- Termwise class operations
- Embedding by constant sequences
Its central goal is therefore not a catalogue of isolated results. It is a disciplined way of turning definitions and logical form into mathematical obligations that another reader can verify.
The published learning outcomes cover foundational concepts, proof selection, critical reading of arguments, independent proof construction and precise mathematical communication.
Definitions, Theorems and Proofs
The opening chapter fixes the grammar used everywhere else. A statement must have a definite truth value, so free variables need values or quantifiers.
Implication separates hypothesis from conclusion and makes the contrapositive available. Quantifier order determines whether a witness may depend on an earlier choice.
From that grammar come the standard proof openings: take an arbitrary object for a universal statement, construct and check a witness for existence, assume the hypothesis for a direct implication, reverse the direction for a contrapositive, or assume the negation when contradiction is appropriate.
Mathematical induction is treated as a complete chain with a base case, an induction hypothesis at an arbitrary admissible index and a step to the successor.
Sets, Functions and Relations
Set notation is translated into elementwise logic. Membership differs from inclusion, union corresponds to or, intersection to and, and difference adds a negation.
Those translations turn set identities into reversible membership chains. Power sets, products and disjoint unions are compared by the kinds of objects they contain rather than by notation alone. Functions then introduce domain, codomain, image, preimage and fibre.
The chapter makes clear why direct images and preimages obey different laws, why a formula does not specify a function without its declared sets, and why a preimage set is available even when no inverse function exists.
Equivalence relations finish the chapter by partitioning a set into classes and creating the need to prove that a class-level rule is independent of its representative.
Number Systems
The familiar number systems are rebuilt to show where their laws come from. Natural-number operations are defined recursively and their properties are proved by induction.
Integers are equivalence classes of pairs of natural numbers, rationals are classes of numerator-denominator pairs, and reals are classes of rational Cauchy sequences. At every stage, an operation written on representatives must be proved well defined before it can be used on classes. Embeddings must preserve operations and must not collapse distinct elements.
Complex numbers then illustrate how ordered pairs of reals acquire multiplication and how the field checklist packages the required algebraic laws.
Integers and Polynomials
The division algorithm supplies a quotient and a strictly smaller remainder. Repeating that step gives the Euclidean algorithm.
Common divisors are preserved from one row to the next, while the remainder size or polynomial degree decreases, so the process terminates. Back-substitution converts the last nonzero remainder into a Bezout identity. Over integers, that identity produces modular inverses; over polynomials with coefficients in a field, it supports quotient-field constructions.
The chapter compares primality with irreducibility and explains why a monic convention is needed to make a polynomial gcd unique.
Completion and Cauchy Sequences
The final chapter abstracts closeness through a valuation. A Cauchy sequence is controlled internally: any two sufficiently late terms are close, even before a candidate limit is named.
Equivalent Cauchy sequences have a difference tending to zero and therefore represent the same completed element. Termwise arithmetic is transferred to equivalence classes only after independence from representatives is proved. Boundedness supplies the missing estimate for products.
The completion adds limits for all Cauchy processes visible to the chosen valuation, so changing the valuation can change which sequences are close and which completed field results.
How assessment changes the study plan
The course grade is divided among regular homework, a midterm examination and a cumulative final examination.
Both examinations are closed-book and the published course introduction says they do not require complicated numerical computation or decimal approximation. That makes retrieval of definitions and proof structures more valuable than memorising worked numbers.
Unless a question states another allocation, examination solutions are judged for accuracy and conceptual understanding, for the suitability and completeness of the method, and for coherent mathematical communication.
Revision should therefore include writing full proofs from a blank page and auditing the logical joins, not only recognising a solution after it is shown.
Where marks are won and lost
Marks are won by exposing the decisions that make an argument valid. State the domain of every variable. Name the proof method. Introduce the witness or arbitrary element. Explain the use of an induction hypothesis.
Check both compositions for an inverse. Prove representative independence before manipulating quotient objects. Announce the decreasing measure in a Euclidean algorithm. Choose an epsilon index before the late sequence indices. Marks are lost when these joins are replaced by a jump, even if the final expression happens to be correct.
The course solutions repeatedly favour concise justification over unexplained symbolic work.
How to use the guide
Read one chapter, close it, and write the definitions and proof skeletons from memory. Then attempt the two practice items before checking their answers. For each error, record the logical obligation that was missed.
The cumulative practice chapter joins early logic to later quotient, Euclidean and completion arguments. The closing checklist is designed for the morning of the final examination and stays within the published conditions: cumulative, closed-book, with detailed coverage and arrangements controlled by Canvas.
Worked example · free
Choose a proof method before calculating
- 2Select the contrapositive and state it precisely.
- 4Expand the definition of an odd integer and simplify the square.
- 2Return to the original implication with a complete conclusion.
Key terms
- Statement
- A sentence with a definite truth value, either true or false.
- Contrapositive
- The implication from the negation of a conclusion to the negation of its hypothesis, logically equivalent to the original implication.
- Witness
- A specific object supplied to establish an existence claim, together with checks that it belongs to the domain and has the required property.
- Power Set
- The set whose elements are all subsets of a given set.
- Fibre
- The set of all domain elements mapped by a function to one specified codomain value.
- Equivalence Class
- The collection of all elements related to a chosen representative under an equivalence relation.
- Well-defined Rule
- A rule on classes whose output does not change when a representative is replaced by an equivalent one.
- Recursive Definition
- A definition that gives an initial value and a rule for obtaining the next value from earlier ones.
- Embedding
- An injective structure-preserving map that identifies an earlier number system inside a larger one.
- Bezout Identity
- An expression of a greatest common divisor as a linear combination of the original inputs.
- Irreducible Polynomial
- A nonconstant polynomial that cannot be factored into polynomials of smaller positive degree over the stated coefficient field.
- Valuation
- A size function on a field that is positive, multiplicative and compatible with the triangle inequality.
- Cauchy Sequence
- A sequence whose terms become arbitrarily close to one another throughout a sufficiently late tail.
MATH2001 FAQ
How is the course grade divided?
The published outline assigns 20% to regular homework, 30% to the midterm examination and 50% to the cumulative final examination. These weights total 100%. Homework is submitted through Canvas, the midterm takes place in one regular class meeting in Weeks 6 to 8, and the final is scheduled in the Fall examination period.
What should I expect from the closed-book examinations?
Both examinations are closed-book, and electronic devices and generative AI tools are not permitted. The course introduction says the examinations do not require complicated numerical computation or decimal approximation. Detailed coverage and arrangements are announced on Canvas, so prepare proof structures and definitions while checking the live course page for operational details.
How do I choose a proof method quickly?
Read the outer logical form first. A universal claim starts with an arbitrary object, existence needs a witness, a false universal needs one valid counterexample, set equality needs two inclusions or reversible membership steps, and induction needs a base case, hypothesis and successor step. Expand the key definition before doing algebra.
Why does LaTeX matter for homework marks?
For each homework, 20% of its mark is assigned to LaTeX typesetting and presentation. That portion is available only to LaTeX-prepared work, so a handwritten submission can earn at most 80% of the homework marks. Readable layout, consistent notation and well-organised solutions are part of the published criterion.
What does well defined mean in a quotient problem?
A class may have many representatives, so a formula using one representative must give the same output for every equivalent choice. Begin with two equivalent representatives and prove their proposed outputs are equal or equivalent. Only after that check does the formula define a function or operation on the quotient set.
How should I revise for a cumulative final?
Rebuild one representative proof from each dependency block: logical form, arbitrary-element set arguments, function and quotient checks, recursive number construction, Euclidean descent and epsilon estimates. Mark each attempt for accuracy, completeness of method and communication. Use Canvas to confirm the detailed final coverage and arrangements for the offering.
Can generative AI be used on homework?
The published policy permits generative AI for ideas, explanations and hints on homework when the use is disclosed by naming the tool and briefly describing how it was used. Students must independently understand and write their solutions. Direct copying of generated proofs, calculations or text is prohibited, and generative AI tools are not permitted in examinations.
Questions students ask in each MATH2001 chapter
- Why is testing examples not a proof?
- Examples inspect only the chosen cases, while a universal statement covers every object in its domain. A single valid counterexample can disprove the statement, but many successful examples cannot rule out a later failure. Use examples to discover a pattern, then replace them with an arbitrary element, an exhaustive case split or induction. Chapter 01 · Definitions, Theorems and Proofs
- Why can image fail to preserve intersections?
- An output may belong to both f(A) and f(B) because one input from A and a different input from B share that output. Neither input need lie in A intersect B. Injectivity prevents this witness mismatch, so under an injective function the image of an intersection equals the intersection of the images. Chapter 02 · Sets, Functions and Relations
- 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. Chapter 03 · Number Systems
- Why does the Euclidean algorithm stop?
- Each nonzero integer remainder is smaller than the preceding positive divisor, so the process gives a strictly decreasing sequence of nonnegative integers. For polynomials, nonzero remainder degrees strictly decrease. Neither kind of sequence can continue indefinitely, so a zero remainder is eventually reached. Chapter 04 · Integers and Polynomials
- How is Cauchy different from convergent?
- Convergence compares each late term with one named limit, while Cauchy compares every pair of late terms. A convergent sequence is Cauchy by the triangle inequality. The converse holds in a complete space, but it can fail in an incomplete one when the approximation process points toward a missing element. Chapter 05 · Completion and Cauchy Sequences
How to study for the exam
Use a three-pass cycle. First, write each definition and its quantifier order from memory. Second, solve one original problem while labeling the method and every logical join. Third, compare the answer with the examination rubric: correct interpretation, suitable method, sufficient justification and coherent notation.
Keep a short error log organised by obligation rather than topic, such as reversed implication, incomplete cases, missing representative check, unproved termination or epsilon index chosen too late. Because the final examination is cumulative, revisit one earlier proof whenever a later chapter uses it.
Your AI Mathematics tutor for MATH2001
Stuck on a hard MATH2001 question? Sia is AskSia’s AI Mathematics tutor — ask any MATH2001 Foundation of Mathematics question and get a clear, step-by-step explanation grounded in how the course is actually taught and assessed. Read this whole study guide free, then take your hardest questions to Sia.