Introduction to mathematics 1000-111bWMAa
- https://moodle.mimuw.edu.pl/course/view.php?id=1970 (term 2023Z)
- https://moodle.mimuw.edu.pl/course/view.php?id=2195 (term 2024Z)
The concept of a set and the membership relation. Various ways of defining sets, the empty set. The set inclusion. The union and the intersection of two sets. The union and the intersection of a family of sets. The difference of two sets, the complement of a set. The de Morgan laws. Ordered pairs and the Cartesian product. The power set.
Basics of propositional logic: logical connectives, formulas, valuations, propositional tautologies. Basics of first-order logic: quantifiers, de Morgan laws. Connections between logical operations and set operations.
The notion of a function as a set of ordered pairs. The domain and the range of a function. The graph of a function. One-to-one functions, functions "onto", permutations. The composition of functions, the inverse function. Transformation groups. The image and the inverse image of a set under a function. Finite and infinite sequences. Indexed families of sets, their unions and intersections. Double indexed families of sets, double sequences, matrices.
Equipotency of sets. Countable and uncountable sets. Proofs of the existence of uncountable sets, examples of diagonalization arguments. Comparison of cardinalities of sets, the Cantor-Bernstein theorem. Properties of countable sets. Uncountability of the set of real numbers. Sets of cardinality continuum, examples and properties. The Cantor theorem. A remark on the Continuum Hypothesis.
The notion of a relation as a set of ordered pairs, examples of binary relations. The domain, the range and the field of a relation. The inverse of a relation. Functions as relations. General properties of relations.
Partial orders, linear orders, Hasse diagrams, elements with special properties. Order isomorphism, isomorphism invariants. The Kuratowski-Zorn Lemma, the existence of a basis in every vector space.
Equivalence relations. Equivalence classes, the quotient set. Partitions of a set, the correspondence between equivalence relations on a set and its partitions.
Natural numbers, the Peano axioms. Induction and recursion over the set of natural numbers. A remark on the Peano construction of natural numbers.
Sets of integers, rationals and reals -- constructions, definitions of arithmetical operations and orders.
Type of course
Course coordinators
Term 2024Z: | Term 2023Z: |
Learning outcomes
1. knows how to use symbolic logic notation (quantifiers, logical connectives);
2. knows how to use set operations (union, intersection, Cartesian product, power set, indexed family of sets);
3. recognizes basic properties of functions, can find the image/preimage of a set by a given function;
4. knows how to compare cardinality of two sets, can recognize countable and non-countable sets, knows properties of countable sets and sets with cardinality of the continuum;
5. recognizes equivalence relations, identifies equivalence classes;
6. recognizes partially, linearly and well ordered, can find special elements;
7. knows how to establish existence or non-existence of isomorphism between a pair of ordered sets;
8. knows Kuratowski-Zorn Lemma and some applications.
Bibliography
K. Hrbacek, T. Jech, Introduction to Set Theory.
Notes
Term 2023Z:
None |
Term 2024Z:
None |
Additional information
Information on level of this course, year of study and semester when the course unit is delivered, types and amount of class hours - can be found in course structure diagrams of apropriate study programmes. This course is related to the following study programmes:
Additional information (registration calendar, class conductors, localization and schedules of classes), might be available in the USOSweb system: