Set Theory

Set theory is the branch of mathematics that studies collections of mathematical objects and the relationships among them. WIIS provides systematic learning materials on fundamental concepts of modern mathematics, with a particular focus on sets, functions, relations, cardinality, and order relations. While developing the language needed to describe mathematical objects rigorously, learners acquire a structural way of thinking through definitions, theorems, and proofs, building a foundation for real analysis, mathematical analysis, and university-level mathematics more broadly.

Fields of Set Theory

Set

Set theory is the foundation of mathematics. Every mathematical concept can be described using sets. Here, we first define sets, then study set operations and their properties, and proceed to topics such as families of sets, Cartesian products, and relations.

Ordered Sets

An ordered set is a mathematical structure in which elements of a set can be compared with one another. Many areas of mathematics are built on the concept of order, ranging from the usual order relation on the natural numbers to inclusion relations between sets, the ordering of real numbers, and various structures that arise in linear algebra and topology.

New Materials

Review Test III (Ordered Sets)

This is a review test on ordered set.

Review Test II (Ordered Sets)

This is a review test on ordered set.

Review Test I (Ordered Sets)

This is a review test on ordered set.

Zorn’s Lemma

If every totally ordered subset of a partially ordered set has an upper bound, then the partially ordered set has a maximal element. This result is called Zorn's lemma.

The Principle of Transfinite Induction

For well-ordered sets, a proposition known as the principle of transfinite induction holds. This principle generalizes both the principle of mathematical induction and the principle of strong induction.

The Well-Ordering Principle

This section explains the well-ordering principle for the natural numbers. It covers least elements, well-ordered sets, the minimal counterexample method, and the relationship with mathematical induction, as well as applications to the Division Algorithm and the Euclidean algorithm.

Learning Guide

Latest Discussions