PEI Math 521K
More study resources
Cheat sheet
Keep the key ideas within reach.
ExploreKey terms
Get comfortable with the vocabulary.
ExploreStudy plan
Give each week a clear focus.
ExploreCommon mistakes
Understand the traps and how to avoid them.
ExploreCase studies
Put your knowledge to work in context.
ExploreExam-day guide
Prepare for the day ahead.
ExploreAbout this exam
Math 521K is a University of Prince Edward Island course in real analysis, and this page prepares you for its final assessment. It is aimed at mathematics majors and others who need a rigorous, proof-based grounding in single-variable analysis with a first look at metric spaces and multivariable differentiability. The exam tests definitions, theorem statements and, above all, your ability to build valid proofs: epsilon-delta arguments, compactness, uniform convergence, and the inverse and implicit function theorems. Expect to justify every step rather than compute answers. Because the assessment is proof-heavy, preparation should be active. Rewrite key definitions from memory, then reconstruct major theorem proofs without notes and compare against your text. Work through problem sets on limits and uniform convergence, since these are the most common sources of lost marks. Practise stating counterexamples precisely, and time yourself writing full solutions by hand. Confirm the current assessment format, scheduling, and any administrative details with the Department of Mathematics and Statistics at UPEI or the course instructor, as these are set by the institution and change between terms. This page is an independent study resource and is not affiliated with or endorsed by UPEI.
What you'll study
About PEI Math 521K preparation
What does the Math 521K assessment actually test?
It tests rigorous real analysis: constructing epsilon-delta proofs, applying the mean value theorems, judging convergence of series and function sequences, reasoning about compactness in metric spaces, and using the inverse and implicit function theorems. Computation alone earns little; the marks come from correct definitions, valid logic, and complete justifications.
How hard is it compared with a computational calculus exam?
Substantially harder for most candidates. Computational exams reward procedure; this one rewards precision of language. A single misquantified variable or an unjustified interchange of limits can void a proof. Students who memorise theorem statements but cannot reproduce proofs usually find the exam difficult.
What is the format and how long do I have?
The official body sets the current format, duration, and any permitted materials, and these can change between terms. Check with the UPEI Department of Mathematics and Statistics or your course instructor for the authoritative details before you plan your preparation.
Can I retake it, and what is the passing score?
Retake rules and the passing threshold are institutional policies, not fixed facts. The university publishes the current regulations, so consult UPEI directly rather than relying on secondhand accounts. Plan on passing first time; retake windows may not align with your programme requirements.
In what order should I study the topics?
Start with the real number system, supremum and infimum, and logic, because every later proof depends on them. Then sequences and series, continuity and uniform continuity, differentiation, and integration. Leave function sequences, metric spaces, and multivariable theorems for last, since they reuse all the earlier machinery.
What are the most common ways candidates lose marks?
Using a theorem without checking its hypotheses, confusing pointwise with uniform convergence, treating compactness as a synonym for closed and bounded outside R^n, and writing prose where a quantified statement is needed. Another frequent error is proving a converse that was never asked for while omitting the direction requested.
How should I practise proofs effectively?
Close the book and write definitions and major theorem proofs from memory, then compare word by word with your text. For problem sets, write full solutions under time pressure, and afterwards mark your own work against the rubric: hypotheses stated, quantifiers correct, conclusion reached. Keep an error log of recurring mistakes.
Do I need to memorise every proof in the course?
Not all of them, but you should be able to reproduce the central results, including completeness arguments, the mean value theorems, uniform convergence tests, and the inverse and implicit function theorems. For the rest, know precise statements and hypotheses, and be able to reconstruct the main idea when asked.
Is this page affiliated with the course?
No. This is an independent study resource written for candidates searching for the exam. It is not produced, endorsed, or approved by UPEI or the course instructor. Always treat the university's official documentation as authoritative for content, scheduling, and policy.