diff options
| author | adelon <22380201+adelon@users.noreply.github.com> | 2024-02-10 02:22:14 +0100 |
|---|---|---|
| committer | adelon <22380201+adelon@users.noreply.github.com> | 2024-02-10 02:22:14 +0100 |
| commit | 442d732696ad431b84f6e5c72b6ee785be4fd968 (patch) | |
| tree | b476f395e7e91d67bacb6758bc84914b8711593f /library/relation/closure.tex | |
Initial commit
Diffstat (limited to 'library/relation/closure.tex')
| -rw-r--r-- | library/relation/closure.tex | 28 |
1 files changed, 28 insertions, 0 deletions
diff --git a/library/relation/closure.tex b/library/relation/closure.tex new file mode 100644 index 0000000..8eebf08 --- /dev/null +++ b/library/relation/closure.tex @@ -0,0 +1,28 @@ +\import{relation/properties.tex} +\import{relation/equivalence.tex} + +\subsection{Closure operations on relations} + +\begin{definition}\label{reflexive_closure} + $\reflexiveClosure{X}{R} = R\union\identity{X}$. +\end{definition} + +% reflexive closure of R is the smallest reflexive relation containing R +\begin{proposition}\label{reflexive_closure_is_reflexive} + $\reflexiveClosure{X}{R}$ is reflexive on $X$. +\end{proposition} + +\begin{definition}\label{reflexive_reduction} + $\reflexiveReduction{X}{R} = R\setminus\identity{X}$. +\end{definition} + +\begin{definition}\label{symmetric_closure} + $\symmetricClosure{R} = R\union\converse{R}$. +\end{definition} + + +% LATER transitive closure + +% LATER reflexive transitive closure + +% LATER equivalence closure |
