summaryrefslogtreecommitdiff
path: root/library/topology/urysohn2.tex
diff options
context:
space:
mode:
authorSimon-Kor <52245124+Simon-Kor@users.noreply.github.com>2024-08-27 20:20:46 +0200
committerSimon-Kor <52245124+Simon-Kor@users.noreply.github.com>2024-08-27 20:20:46 +0200
commitb8cc467735054bb3c38bf37b5e29877ba756c4b5 (patch)
tree1a95658984285f77200423af5767ebf35935598e /library/topology/urysohn2.tex
parent6acc5654f1702f2466006564a415546a3def16e3 (diff)
working commit
Diffstat (limited to 'library/topology/urysohn2.tex')
-rw-r--r--library/topology/urysohn2.tex19
1 files changed, 19 insertions, 0 deletions
diff --git a/library/topology/urysohn2.tex b/library/topology/urysohn2.tex
index ea49a6c..a64fa7e 100644
--- a/library/topology/urysohn2.tex
+++ b/library/topology/urysohn2.tex
@@ -16,6 +16,22 @@
\section{Urysohns Lemma}
+\begin{definition}\label{one_to_n_set}
+ $\seq{m}{n} = \{x \in \naturals \mid m \leq x \leq n\}$.
+\end{definition}
+
+\begin{struct}\label{sequence}
+ A sequence $X$ is a onesorted structure equipped with
+ \begin{enumerate}
+ \item $\index$
+ \item $\indexset$
+ \end{enumerate}
+ such that
+ \begin{enumerate}
+ \item\label{indexset_is_subset_naturals} $\indexset[X] \subseteq \naturals$.
+ \item\label{index_is_bijection} $\index[X]$ is a bijection from $\indexset[X]$ to $\carrier[X]$.
+ \end{enumerate}
+\end{struct}
\begin{abbreviation}\label{urysohnspace}
$X$ is a urysohn space iff
@@ -33,6 +49,7 @@
+
\begin{theorem}\label{urysohn}
Let $X$ be a urysohn space.
Suppose $A,B \in \closeds{X}$.
@@ -52,6 +69,8 @@
% & x ,x \in X <- will result in technicly ambigus parse
\end{cases}
+
+ $U_1$
Trivial.