MATH11121 Mathematical Foundations and Analysis
MATH11121 Overview
- Semester 1, 2026/27
- Level 1
- January exam
- 12 teaching weeks
MATH11121 Mathematical Foundations and Analysis introduces the language and proof habits used across an undergraduate mathematics programme. The available teaching sequence begins with propositions, predicates and logical connectives, then develops implication, set notation and quantifiers.
- Parse first Mark domains, quantifiers, hypotheses and conclusions before calculating.
- Choose evidence Use a general proof, witness or counterexample according to the quantifier.
- Close definitions End algebra in the exact form required by the definition.
- Verify complex work Check by reversal, modulus, angle location or powering back.
- Use feedback Rewrite one weak proof completely after each returned task.
How MATH11121 is assessed
| Component | Weight | Format |
|---|---|---|
| Supervision homeworks | 10% | Weekly homework beginning in Week 2. Each submission is marked out of 2 for effort and receives feedback. |
| Week 5 formative in-class test | 0% | Formative supervision-class test with feedback. |
| Exam in January | 90% | Summative January examination. Follow the current University notice for operational instructions. |
Weights come from the captured University course information and total 100%.
Current MATH11121 dates
| Date | Item | Control |
|---|---|---|
| 28 September 2026 | Teaching Week 1 begins | The published teaching-week table begins on this date. |
| 2 November 2026 | Reading week begins | Week 6 is identified as reading week with no classes. |
| 14 December 2026 | Teaching Week 12 begins | The published teaching-week table ends with this week. |
Dates are as published in the Semester 1, 2026/27 course practicalities. Confirm exact deadlines and submission settings in the live LMS.
What MATH11121 covers
Ten connected chapters move from statement structure and set language through direct, indirect and inductive proof to complex arithmetic, polar form and complete root families.
Propositions, Predicates and Connectives
Statement types, truth values, connective tables and logical comparison.Propositions, Predicates and Connectives establishes the basic objects of mathematical logic. A proposition has a fixed truth value, while a predicate still contains a free variable. OR is inclusive, AND requires both inputs, and NOT reverses truth.
- Propositions and truth values
- Predicates and free variables
- Inclusive OR
- AND and negation
- Truth-table equivalence
- Statement classification
Implication and Logical Equivalence
Conditional language, converse, contrapositive, negation and biconditional reasoning.Implication and Logical Equivalence separates a conditional statement from its related forms. An implication fails only when its hypothesis is true and its conclusion false.
- Implication truth table
- Hypothesis and conclusion
- Converse
- Contrapositive
- Negation of implication
- Necessary and sufficient language
Sets and Operations
Membership, subsets, equality, union, intersection, complement and difference.Sets and Operations treats membership and inclusion as different logical levels. Union translates to OR, intersection to AND, and difference to membership together with non-membership. Complements depend on a universal set.
- Elements and membership
- Subsets
- Set equality
- Union and intersection
- Complement and difference
- Set-builder notation
Quantifiers and Negation
Universal and existential scope, witness dependency and systematic negation.Quantifiers and Negation controls how variables are fixed, chosen and allowed to depend on earlier information.
- Universal quantifier
- Existential quantifier
- Witness selection
- Quantifier order
- Negating quantifiers
- Nested dependency
Direct Proof and Counterexamples
Arbitrary elements, definitions, divisibility, parity and decisive refutations.Direct Proof and Counterexamples matches evidence to quantifier structure. A direct proof fixes an arbitrary object, unfolds definitions and reaches the stated conclusion.
- Arbitrary elements
- Direct implication
- Divisibility definitions
- Parity forms
- Biconditional directions
- Counterexample search
Contrapositive and Contradiction
Indirect proof choice, temporary assumptions and explicit logical closure.Contrapositive and Contradiction develops two indirect proof methods. Contrapositive replaces an implication by an equivalent reversed and negated form. Contradiction assumes the exact negation of the target and derives incompatible facts.
- Contrapositive proof
- Negated conclusion
- Contradiction assumption
- Parity contradictions
- Lowest-terms arguments
- Logical closure
Induction and Strong Induction
Base cases, inductive hypotheses, transitions and recursive dependence.Induction and Strong Induction proves statements across ordered integer cases. The base verifies the first permitted index, the hypothesis supplies established information, and the step derives the next case.
- Base case
- Inductive hypothesis
- Inductive step
- Target at k+1
- Strong induction
- Recursive sequences
Complex Arithmetic and Geometry
Standard form, conjugates, modulus, division and the Argand plane.Complex Arithmetic and Geometry connects standard form a+bi with coordinates on the Argand plane. Arithmetic follows polynomial rules with i squared equal to negative one.
- Imaginary unit
- Standard form
- Complex conjugate
- Complex division
- Modulus
- Argand plane and loci
Polar Form and De Moivre
Modulus and argument operations, conversion, products and integer powers.Polar Form and De Moivre rewrites a nonzero complex number using its modulus and argument. Products multiply moduli and add arguments, quotients divide moduli and subtract arguments, and integer powers follow De Moivre's theorem.
- Polar coordinates
- Principal argument
- Cartesian conversion
- Polar multiplication
- Polar division
- De Moivre powers
Complex Roots and Euler Form
Argument branches, equally spaced roots, exponential form and multiplicity.Complex Roots and Euler Form generates every solution of z to the n equals w. The roots share the nth-root modulus and have arguments formed from the full angle family divided by n.
- Argument families
- Nth-root modulus
- Equally spaced roots
- Euler formula
- Exponential form
- Polynomial multiplicity
These topics are not separate vocabulary lists. They specify exactly what a theorem says, what must be assumed, and what evidence is needed to establish or refute it.
The proof block turns that structure into action. Direct proof follows the stated implication from assumptions to conclusion. Counterexamples target a universal claim with one valid failure.
Contrapositive and contradiction reorganise the working assumption without changing the theorem, while induction links a verified base case to every later case. Course feedback emphasises complete mathematical sentences, accurate expressions, domains for introduced variables, explicit definitions and a precise final conclusion.
Complex numbers provide a setting where algebra and geometry reinforce each other.
Standard form separates real and imaginary components. Conjugation makes division real and reflects points across the real axis. Polar form turns multiplication into a rule for moduli and arguments, De Moivre controls powers, and the full argument family produces all roots at equal angular spacing.
Each method includes an independent check, such as multiplying back, comparing moduli or powering a root to the target.
The published assessment is supervision homework worth 10%, a Week 5 formative in-class test worth 0%, and a January exam worth 90%. Homework begins in Week 2 and is marked for effort, creating a regular feedback loop before the high-weight examination.
This guide therefore treats written reasoning as a repeatable process: parse the statement, choose the method, justify each transformation and verify the conclusion.
Worked example · free
Generate every cube root from one polar target
- 2Write negative eight with modulus 8 and arguments pi plus 2pi k.
- 2Take modulus 2 and divide the argument family by 3 for k equal to 0, 1 and 2.
- 2The roots have angles pi/3, pi and 5pi/3. Equal spacing and the count of three establish completeness.
Key terms
- Proposition
- A mathematical statement with a definite truth value.
- Predicate
- A statement containing free variables that becomes a proposition after assignment or quantification.
- Logical equivalence
- The relation between statements that share a truth value under every assignment.
- Contrapositive
- The implication formed by reversing and negating the original conclusion and hypothesis.
- Subset
- A set whose every element also belongs to another stated set.
- Quantifier
- A logical operator that declares a statement universal or existential over a domain.
- Counterexample
- A valid domain object that makes a universal claim fail.
- Direct proof
- An argument that derives the conclusion from the stated assumptions in the original direction.
- Contradiction
- An impossibility derived after temporarily assuming the target statement is false.
- Inductive hypothesis
- The temporary assumption that an induction claim holds at permitted earlier indices.
- Complex conjugate
- The complex number with the same real part and the opposite imaginary part.
- Modulus
- The distance from a complex number to the origin in the Argand plane.
- Argument
- An angle locating a nonzero complex number relative to the positive real axis.
- Polar form
- A complex-number representation using modulus and argument.
- Root multiplicity
- The number of times a root is repeated as a polynomial factor.
MATH11121 FAQ
How difficult is this module?
The source describes the module as heavily proof based and reports that students wanted more explanation of proof techniques and reasoning. The challenge is therefore evidenced as sustained proof construction and mathematical communication, not as a published difficulty rating. Regular written practice matters more than memorising finished arguments.
What is the assessment structure?
Supervision homeworks contribute 10%, the Week 5 formative in-class test contributes 0%, and the January exam contributes 90%. Weekly homework begins in Week 2, is marked out of 2 for effort, and is followed by feedback intended to improve mathematical writing and exam preparation.
What makes a complete proof answer?
State the domain and quantifiers, identify assumptions and the required conclusion, introduce new variables with their sets, justify each transformation with a definition or known result, and finish with a precise sentence naming what has been proved. A calculation without that logical bridge is incomplete.
How should I use the homework feedback?
Attempt the homework before reading any model solution, then compare the structure of your proof with the feedback. Rewrite one weak solution from a blank page and record the cause of the error, such as a reversed implication, missing quantifier, undefined variable or unsupported closing claim.
Are past examination papers included here?
No past examination paper is present in the captured folder used for this edition. The welcome materials say past papers and solutions are released later in the module. Every practice question in this guide is original and models documented question types without copying or lightly rewriting a proprietary stem.
How do I avoid missing complex roots?
Write the expected number of roots first. Use the full argument family theta plus 2pi k before dividing by the root degree, then list k from zero through n minus one. Confirm that the roots share one radius and are separated by equal angle gaps.
What should I revise first for January?
Begin with implication, quantified negation and set notation because they control the meaning of later proof tasks. Then drill direct proof, contrapositive, contradiction and induction. Finish by alternating complex arithmetic with polar powers and roots, using an independent check after every calculation.
Questions students ask in each MATH11121 chapter
- Can an unknown statement be a proposition?
- Yes. A proposition needs a definite truth value, but that value need not be easy or currently known. The issue is whether the sentence asserts something mathematically true or false, not whether the reader can decide it immediately. Chapter 01 · Propositions, Predicates and Connectives
- Is the converse automatically true?
- No. Reversing an implication creates a separate statement. It needs its own proof or counterexample unless the original theorem is explicitly a biconditional or a definition that supplies both directions. Chapter 02 · Implication and Logical Equivalence
- Why is the empty set a subset of every set?
- A subset claim requires every element of the first set to belong to the second. The empty set has no element that can violate this condition, so the inclusion holds for any target set. Chapter 03 · Sets and Operations
- Why does quantifier order matter?
- A variable chosen later may depend on variables fixed earlier. The claim that every x has some suitable y can allow a different y for each x, while one x working for every y requires a single fixed choice. Chapter 04 · Quantifiers and Negation
- Why are several examples not a proof?
- A finite collection of successful examples cannot establish a claim about every element of an infinite domain. Examples may suggest a pattern, while a general argument must explain why the conclusion follows for an arbitrary permitted object. Chapter 05 · Direct Proof and Counterexamples
- How is contradiction different from contrapositive?
- Contrapositive proves an equivalent implication by assuming the negation of the original conclusion. Contradiction assumes the whole target is false and derives an impossibility. Their opening assumptions therefore have different logical scopes. Chapter 06 · Contrapositive and Contradiction
- Why must the base match the stated range?
- The induction chain starts at the first index covered by the theorem. Checking an earlier unrelated value does not establish that first required case or connect it to later cases. Chapter 07 · Induction and Strong Induction
- Why use the conjugate in division?
- Multiplying a complex denominator by its conjugate produces the real value equal to its modulus squared. The quotient can then be written in standard form with separate real and imaginary parts. Chapter 08 · Complex Arithmetic and Geometry
- When should I use polar form?
- Polar form is efficient for multiplication, division, high integer powers and roots because it separates scale from direction. Standard form is usually simpler for addition and subtraction. Chapter 09 · Polar Form and De Moivre
- Why does k stop at n minus one?
- Those n consecutive values generate all distinct angles modulo 2pi after division by n. Increasing k by n repeats a previous root, so later values duplicate the completed set. Chapter 10 · Complex Roots and Euler Form
How to study for the exam
Study MATH11121 by alternating language, proof and calculation. First, translate every statement into a domain, quantifier pattern, hypothesis and conclusion. Second, maintain a method table for universal proof, existential witness, counterexample, contrapositive, contradiction and induction, including the opening and closing sentence for each.
Third, build a definition bank for parity, divisibility, subsets, set equality, rational numbers, complex conjugates, modulus and argument. Definitions should be used in fresh problems rather than copied in isolation. Fourth, attempt weekly exercise questions before viewing solutions, then rewrite one response using the returned feedback.
Classify each error by cause so the same logical mistake is not hidden under different topics. Fifth, verify complex calculations through a second route: multiply a quotient back, compare product moduli, locate the quadrant, or power every listed root to the target. In the final revision cycle, use short mixed sets that force a method choice before any algebra.
Finish each answer with a complete mathematical sentence and preserve exact radicals and angles until the requested final form.
Your AI Mathematics tutor for MATH11121
Stuck on a hard MATH11121 question? Sia is AskSia’s AI Mathematics tutor — ask any MATH11121 Mathematical Foundations and Analysis 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.