Skip to content

MATH3020

Axiomatic Set Theory and Applications

Axiomatic foundations and well-founded structures, cardinality, ordinals and cofinality, choice principles and computability, with proofs and solved exercises.

5 chapters · 16 sectionsEN · 繁 · 简
My course notes

Your progress

0/ 16 sections marked complete

Next section: Axioms and safe set construction

Completion marks are saved in this browser.

This course in the web

In the MATH3020 notes

Theorem cards
63
Definitions
44
Counterexamples
17
Concept lenses
9
Histories of ideas
1
Proof X-rays
25

Sections with a history of an idea

None of these is on the timeline yet.

No concept lens from this course is recorded in the web yet.

Open this course in the knowledge map

Counts cover the 16 public sections of this course and what is written in them, not recorded connections. 0 of these sections are indexed into the web in detail so far.

In the webTheorem cards 63 · Definitions 44 · Counterexamples 17 · Concept lenses 9 · Histories of ideas 1 · Proof X-rays 25

None of these is on the timeline yet.

No concept lens from this course is recorded in the web yet.

Open this course in the knowledge map

Counts cover the 16 public sections of this course and what is written in them, not recorded connections. 0 of these sections are indexed into the web in detail so far.

Chapter 1 · 6 sections

Foundations and well-founded structures

Understand why unrestricted comprehension fails, distinguish separation from replacement, and construct relations and functions within ZF.

Theorems 24 · Definitions 20Counterexamples 6Lenses 4History 1Proof X-rays 8

Chapter outline →See this chapter on the web →Not yet indexed in the web

  1. 1.1

    Axioms and safe set construction

    Understand why unrestricted comprehension fails, distinguish separation from replacement, and construct relations and functions within ZF.

  2. 1.2

    Well-founded relations, collapse and the rank of a set

    Prove recursion on a well-founded set relation, derive the Mostowski collapse, and show exactly how the cumulative hierarchy contains every set.

  3. 1.3

    Collection, rank bounds and the selection of witnesses

    Derive Collection from Replacement in ZF, distinguish a witness bound from a selecting function, and identify the role of Choice.

  4. 1.4

    Generated equivalence relations and quotient maps

    Construct equivalence relations from finite paths, recover partitions, and prove precisely when a function descends to a quotient without choosing representatives.

  5. 1.5

    Constructing the natural, integer and rational numbers

    Build omega from Infinity and Separation, derive arithmetic by recursion, and construct ordered integers and rationals as explicit quotients in ZF.

  6. 1.6

    Real numbers from rational Cauchy sequences

    Construct the ordered real field without presupposing real limits, prove least-upper-bound and Cauchy completeness, and establish uniqueness of the complete ordered field.

Chapter 2 · 5 sections

Cardinality

Compare sets without choosing elements, prove Cantor–Schröder–Bernstein, and distinguish countable enumeration from arbitrary countable unions.

Theorems 16 · Definitions 7Counterexamples 5Lenses 2Proof X-rays 8

Chapter outline →See this chapter on the web →Not yet indexed in the web

  1. 2.1

    Injections, diagonalization and infinite size

    Compare sets without choosing elements, prove Cantor–Schröder–Bernstein, and distinguish countable enumeration from arbitrary countable unions.

  2. 2.2

    The Cantor set and binary sequences

    Connect a nested interval construction to uncountability, perfectness and measure zero.

  3. 2.3

    Finite sets, pigeonhole arguments and countable selection

    Prove finite cardinal uniqueness and elementary closure laws, then locate the countable-choice step in extracting a countable subset from an infinite set.

  4. 2.4

    Infinite cardinal arithmetic and König's diagonal

    Prove the square theorem for well-orderable infinite sets, derive arithmetic and exponent laws, and use a diagonal argument to restrict the cofinality of power sets.

  5. 2.5

    Aleph and beth hierarchies at transfinite limits

    Construct the cardinal hierarchies, prove successor regularity and limit cofinality formulas, and distinguish strong limits, fixed points and continuum hypotheses.

Chapter 3 · 2 sections

Ordinals and cofinality

Represent well-orders by transitive sets, prove ordinal comparison, and construct ordinal arithmetic by recursion.

Theorems 8 · Definitions 8Counterexamples 3Lenses 2Proof X-rays 4

Chapter outline →See this chapter on the web →Not yet indexed in the web

  1. 3.1

    Ordinals, induction and transfinite recursion

    Represent well-orders by transitive sets, prove ordinal comparison, and construct ordinal arithmetic by recursion.

  2. 3.2

    Ordinal exponentiation, Cantor normal form and cofinality

    Prove the finite normal-form expansion of an ordinal, distinguish ordinal powers from cardinal powers, and measure the length of an approach to a limit without hiding choice assumptions.

Chapter 4 · 2 sections

Choice principles

Prove Hartogs' theorem in ZF, establish the equivalence of choice, well-ordering and Zorn's lemma, and apply maximality carefully.

Theorems 8 · Definitions 7Counterexamples 2Proof X-rays 3

Chapter outline →See this chapter on the web →Not yet indexed in the web

  1. 4.1

    Choice, well-ordering and maximal objects

    Prove Hartogs' theorem in ZF, establish the equivalence of choice, well-ordering and Zorn's lemma, and apply maximality carefully.

  2. 4.2

    Countable choice, dependent choice and the Baire argument

    Separate simultaneous from dependent choices, prove the pruned-tree formulation of DC, and track exactly how nested-ball proofs use a choice principle.

Chapter 5 · 1 section

Computability

Define computability using finite machine descriptions, prove the halting obstruction, and transfer impossibility by effective reductions.

Theorems 7 · Definitions 2Counterexamples 1Lenses 1Proof X-rays 2

Chapter outline →See this chapter on the web →Not yet indexed in the web

  1. 5.1

    Programs, halting and undecidable properties

    Define computability using finite machine descriptions, prove the halting obstruction, and transfer impossibility by effective reductions.

Vercel visit statistics and public-page performance measurements each require separate consent. Neither is needed to use the website.

Website function storage (used when needed)

Security, sign-in and your chosen preferences use storage when needed. This is separate from optional statistics.

Withdrawing stops future statistics. The page reloads if analytics code needs unloading. It does not delete data already sent.

Read Cookie and storage details