Skip to content

Commit

Permalink
Fix spacing
Browse files Browse the repository at this point in the history
Signed-off-by: zeramorphic <[email protected]>
  • Loading branch information
zeramorphic committed Feb 12, 2024
1 parent 6a63147 commit 99a4414
Showing 1 changed file with 2 additions and 2 deletions.
4 changes: 2 additions & 2 deletions iii/forcing/03_forcing.tex
Original file line number Diff line number Diff line change
Expand Up @@ -56,7 +56,7 @@ \subsection{Forcing posets}
\begin{definition}
A \emph{forcing poset} is a triple \( (\mathbb P, \leq_{\mathbb P}, \Bbbone_{\mathbb P}) \), where \( (\mathbb P, \leq_{\mathbb P}) \) is a preorder and \( \Bbbone_{\mathbb P} \) is a maximal element.
Elements of \( \mathbb P \) are called \emph{conditions}, and we say \( q \) is \emph{stronger} than \( p \) or an \emph{extension} of \( p \) if \( q \leq p \).
We say that \( p, q \) are \emph{compatible}, written \( p \|_{\mathbb P} q \), if there exists \( r \) such that \( r \leq_{\mathbb P} p, q \).
We say that \( p, q \) are \emph{compatible}, written \( p \mathrel{\|}_{\mathbb P} q \), if there exists \( r \) such that \( r \leq_{\mathbb P} p, q \).
Otherwise, we say they are \emph{incompatible}, written \( p \perp q \).
\end{definition}
\begin{remark}
Expand All @@ -74,7 +74,7 @@ \subsection{Forcing posets}
\begin{proposition}
Suppose that \( (\mathbb P, \leq) \) is a preorder.
Define \( p \sim q \) by
\[ p \sim q \leftrightarrow \forall r \in P.\, (r \| p \leftrightarrow r \| q) \]
\[ p \sim q \leftrightarrow \forall r \in P.\, (r \mathrel\| p \leftrightarrow r \mathrel\| q) \]
Then there is a separative preorder on \( \faktor{\mathbb P}{\sim} \) such that
\[ [p] \perp [q] \leftrightarrow p \perp q \]
and if \( \mathbb P \) has a maximal element, so does \( \faktor{\mathbb P}{\sim} \).
Expand Down

0 comments on commit 99a4414

Please sign in to comment.