  \documentclass[oneside,final,11pt]{article}

\usepackage{amssymb}
\usepackage{amsmath}
\usepackage{xunicode}
  \usepackage{fancyhdr}
  \addtolength{\headheight}{5\baselineskip}
  \renewcommand{\headrulewidth}{0pt}
  \fancyhead[L,R]{}
  \fancyhead[C]{\includegraphics[scale=0.5]{bguhead.png}}
  \fancyfoot[L,C,R]{}
  \addtolength{\voffset}{-70pt}

\usepackage{hyperref}
\usepackage{xstring}
\def\rooturl{https://www.math.bgu.ac.il/}
\hyperbaseurl{\rooturl}
\let\hhref\href
\providecommand{\extrahref}[2][]{\LTRfootnote{\LR{\IfBeginWith*{#2}{http}{\nolinkurl{#2}}{\nolinkurl{\rooturl#2}}}}}
\renewcommand{\href}[2]{\IfBeginWith*{#1}{http}{\hhref{#1}{#2}}{\hhref{\rooturl#1}{#2}}\extrahref{#1}}

\usepackage{polyglossia}
\usepackage{longtable}
%% even in English, we sometimes have Hebrew (as in course hours), and we
%% can't add it in :preamble, since it comes after hyperref
%%\usepackage{bidi}
\setdefaultlanguage{english}
\setotherlanguage{hebrew}
%%\setmainfont[Ligatures=TeX]{Libertinus Serif}
\setmainfont[Script=Hebrew,Ligatures=TeX]{LibertinusSerif}[
  UprightFont = *-Regular,
  BoldFont = *-Bold,
  ItalicFont = *-Italic,
  BoldItalicFont = *-BoldItalic,
  Extension = .otf]

\SepMark{‭.}
\robustify\hebrewnumeral
\robustify\Hebrewnumeral
\robustify\Hebrewnumeralfinal

% vim: ft=eruby.tex:



\begin{document}
\pagestyle{empty}
\pagenumbering{gobble}


\pagestyle{fancy}
\begin{center}

  \huge{The Department of Mathematics}\\[0.1\baselineskip]
  \Large{2021--22--B term}\\[0.2\baselineskip]

\end{center}

\begin{description}
  \item[Course Name]
    Introduction to set theory

  \item[Course Number]
    \LRE{201‭.1‭.0171}

  \item[Course web page]\mbox{}\\
    \url{https://www.math.bgu.ac.il//en/teaching/spring2022/courses/intro-to-logic-and-sets}

  \item[Lecturer]
    Prof. Assaf Hasson,
    \nolinkurl{<hassonas@bgu.ac.il>},
    Office 204

\item[Office Hours]
  \url{https://www.math.bgu.ac.il/en/teaching/hours}
\end{description}

\section*{Abstract}

Ordered sets and well ordered sets. Ordinals. Linearly ordered sets. Uniqueness of countable linear orders without endpoints.

The set of finite ordinals, construction of the natural numbers, the induction principle and some of its equivalents.

Countable sets, construction of the rational numbers.

Construction of the real field.

Cardinality, cardinals, and the Cantor-Bernstein theorem.

Uncountable sets, Cantor's theorem, applications.

The axiom of choice and its equivalents (the well ordering principle, Zorn's lemma).

Applications of the axiom of choice. Transfinite induction.

Throughout the course we will see applications of the course' material in algebra, logic, graph theory, Euclidean spaces and infinite combinatorics.


\section*{Requirements and grading\footnote{Information may change during the first two weeks of the term. Please consult the webpage for updates}}

90\% final exam and 10\% HW assignments. A passing grade in 4/6 assignments is a prerequisite for obtaining a grade in the course.




\section*{Course topics}

\begin{enumerate}
\item{} Partially ordered sets. Chains and antichains. Examples. Erdos--Szekeres' theorem or a similar theorem. The construction of a poset over the quotient space of a quasi-ordered set.
\item{} Comparison of sets. The definition of cardinality as as an equivalence class over equinumerousity. The Cantor-Bernstein theorem. Cantor's theorem on the cardinality of the power-set.
\item{} Countable sets. The square of the natural numbers. Finite sequences over a countable set. Construction of the ordered set of rational numbers. Uniqueness of the rational ordering.
\item{} Ramsey's theorem. Applications.
\item{} The construction of the ordered real line as a quotient over Cauchy sequences of rationals.
\item{} Konig's lemma on countably infinite trees with finite levels. Applications. A countable graph is k-colorable iff every finite subgraph of it is k-colorable.
\item{} Well ordering. Isomorphisms between well-ordered sets. The axiom of choice formulated as the well-ordering principle. Example. Applications. An arbitrary graph is k--colorable iff every finite subgraph is k-colorable.
\item{} Zorn's lemma. Applications. Existence of a basis in a vector space. Existence of a spanning tree in an arbitrary graph.
\item{} Discussion of the axioms of set theory and the need for them. Russel's paradox. Ordinals.
\item{} Transfinite induction and recursion. Applications. Construction of a subset of the plane with exactly 2 point in every line.
\item{} Infinite cardinals as initial ordinals. Basic cardinal arithmetic. Cardinalities of well known sets. Continuous real functions, all real runctions, the automorphisms of the real field (with and without order).
\end{enumerate}

% vim: ft=eruby.tex:


\end{document}

% vim: ft=eruby.tex:
