fixed label
Some checks failed
Build latex and deploy / checkout (push) Failing after 13m17s

This commit is contained in:
Josia Pietsch 2023-10-24 10:48:41 +02:00
parent 4a27324442
commit fb2c5b2715
Signed by: josia
GPG key ID: E70B571D66986A2D
2 changed files with 7 additions and 10 deletions

View file

@ -26,7 +26,7 @@ Literature
\begin{definition}
Let $A \neq \emptyset$, $B$ be arbitrary sets.
We write $A \le B$ ($A$ is not bigger than $B$ )
We write $A \le B$ ($A$ is not bigger than $B$)
iff there is an injection $f\colon A \hookrightarrow B$.
\end{definition}
\begin{lemma}
@ -148,12 +148,12 @@ Literature
\end{proof}
\begin{definition}
The \vocab{continuum hypothesis} ($\CH$ )
The \vocab{continuum hypothesis} ($\CH$)
says that there is no set $A$ such that
$\N < A < \R$.
$\CH$ is equivalent to the statement that there is no set $A \subset \R$
which is uncountable ($\N < A$ )
which is uncountable ($\N < A$)
and there is no bijection $A \leftrightarrow \R$.
\end{definition}

View file

@ -1,7 +1,7 @@
\lecture{03}{2023-1023}{Cantor-Bendixson}
\begin{theorem}[Cantor-Bendixson]
\yalabel{thm:cantorbendixson}{Cantor-Bendixson}{Cantor-Bendixson}
\yalabel{Cantor-Bendixson}{Cantor-Bendixson}{thm:cantorbendixson}
If $A \subseteq \R$ is closed,
it is either at most countable or else
$A$ contains a perfect set.
@ -127,6 +127,3 @@ all condensation points are accumulation points.
% is at most countable.
% Also $A'$ is closed.
% \end{remark}