Course detail

(Ordered Sets and Lattices

FSI-9UMSAcad. year: 2018/2019

Students will get acquainted with basic concepts and results of the theory of ordered sets and lattices used in many branches of mathematics and in other disciplines, e.g., in informatics.

Language of instruction

Czech

Number of ECTS credits

2

Guarantor

prof. RNDr. Josef Šlapal, CSc.

Department

Institute of Mathematics (ÚM)

Learning outcomes of the course unit

The students will learn basic concepts and results of the theory of orderd sets and lattices including their applications.

Prerequisites

The knowledge of the subject Methods of Discrete Mathematics taught within the Bachelor's study programme is ecpected.

Co-requisites

None

Planned learning activities and teaching methods

Regular lectures.

Assesment methods and criteria linked to learning outcomes

The students will be assessed by means of a written and oral exam at the end of the semester.

Course curriculum

Not applicable.

Work placements

None

Aims

The goal of the subject is to get students acquainted with the theory of ordered sets with a stress to the lattice theory.

Specification of controlled education, way of implementation and compensation for absences

The presence at lectures is not compulsory, it will therefore not be checked.

Recommended optional programme components

None

Prerequisites and corequisites

Not applicable.

Basic literature

Steve Roman, Lattices and ordered sets, Springer, New York 2008. (EN)
Jan Kopka, Svazy a Booleovy algebry, Univerzita J.E. Purkyně v Ústaí nad Labem, 1991 (CS)
T.S. Blyth, Lattices and Ordered Algebraic Structures, Springer, 2005 (EN)

Recommended reading

Not applicable.

Type of course unit

 

Lecture

20 hours, optionally

Teacher / Lecturer

prof. RNDr. Josef Šlapal, CSc.

Syllabus

1. Basic concepts of the theory of ordered sets
2. Axiom of Choice and equivalent theorems
3. Duality and monotonne maps
4. Down-sets and up-sets, ascending and descending chain conditions
5. Well ordered sets and ordinal numbers
6. Cardinal numbers, cardinal and ordinal arithmetic
7. Closure operators on ordered sets
8. Ideals and filters
9. Modular and distributive lattices
10. Boolean lattices