The coinverse image function associated to $R$ is the function
defined by1
for each $V\in \mathcal{P}(Y)$.
- 1Further Terminology: The set $R_{-1}(V)$ is called the coinverse image of $V$ by $R$.
Let $X$ and $Y$ be sets and let $R\colon X\mathrel {\rightarrow \kern -9.5pt\mathrlap {|}\kern 6pt}Y$ be a relation.
The coinverse image function associated to $R$ is the function
defined by1
for each $V\in \mathcal{P}(Y)$.
Identifying $\mathcal{P}(Y)$ with $\mathrm{Rel}(\mathrm{pt},Y)$ via Chapter 4: Constructions With Sets, Item 3 of Proposition 4.4.1.1.4, we see that the inverse image function associated to $R$ is equivalently the function
defined by
Indeed, we have
This finishes the proof.
Let $V$ be a subset of $Y$.1
The domain part of the coinverse image $R_{-1}(V)$ of $V$ is the set $R^{\mathrm{dom}}_{-1}(U)$ defined by
The complement part of the coinverse image $R_{-1}(V)$ of $V$ is the set $R^{\mathrm{cp}}_{-1}(V)$ defined by
Let $R\colon X\mathrel {\rightarrow \kern -9.5pt\mathrlap {|}\kern 6pt}Y$ be a relation.
Functoriality. The assignment $V\mapsto R_{-1}(V)$ defines a functor
In particular, for each $U,V\in \mathcal{P}(Y)$, the following condition is satisfied:
Adjointness. We have an adjunction
Units and counits of the form
In particular:
For each $U\in \mathcal{P}(X)$, we have $U\subset R_{-1}(R_{!}(U))$.
For each $V\in \mathcal{P}(Y)$, we have $R_{!}(R_{-1}(V))\subset V$.
A bijections of sets
natural in $U\in \mathcal{P}(X)$ and $V\in \mathcal{P}(Y)$. In particular:
We have $R_{!}(U)\subset V$.
We have $U\subset R_{-1}(V)$.
Interaction With Unions of Families of Subsets. The diagram
for each $\mathcal{V}\in \mathcal{P}(Y)$, where $R_{-1}(\mathcal{V})\mathrel {\smash {\overset {\mathclap {\scriptscriptstyle \text{def}}}=}}(R_{-1})_{!}(\mathcal{V})$.
Interaction With Intersections of Families of Subsets. The diagram
for each $\mathcal{V}\in \mathcal{P}(Y)$, where $R_{-1}(\mathcal{V})\mathrel {\smash {\overset {\mathclap {\scriptscriptstyle \text{def}}}=}}(R_{-1})_{!}(\mathcal{V})$.
Interaction With Binary Unions. We have a natural transformation
indexed by $U,V\in \mathcal{P}(Y)$.
Interaction With Binary Intersections. The diagram
for each $U,V\in \mathcal{P}(Y)$.
Interaction With Differences. We have a natural transformation
indexed by $U,V\in \mathcal{P}(Y)$.
Interaction With Complements. The diagram
for each $U\in \mathcal{P}(X)$.
Interaction With Symmetric Differences. The diagram
in general, where $U,V\in \mathcal{P}(Y)$.
Interaction With Internal Homs of Powersets. We have a natural transformation
indexed by $U,V\in \mathcal{P}(Y)$.
Lax Preservation of Colimits. We have an inclusion of sets
natural in $\left\{ U_{i}\right\} _{i\in I}\in \mathcal{P}(Y)^{\times I}$. In particular, we have inclusions
natural in $U,V\in \mathcal{P}(Y)$.
Preservation of Limits. We have an equality of sets
natural in $\left\{ U_{i}\right\} _{i\in I}\in \mathcal{P}(Y)^{\times I}$. In particular, we have equalities
natural in $U,V\in \mathcal{P}(Y)$.
Symmetric Lax Monoidality With Respect to Unions. The codirect image function of Item 1 has a symmetric lax monoidal structure
being equipped with inclusions
natural in $U,V\in \mathcal{P}(Y)$.
Symmetric Strict Monoidality With Respect to Intersections. The direct image function of Item 1 has a symmetric strict monoidal structure
being equipped with equalities
natural in $U,V\in \mathcal{P}(Y)$.
Interaction With Coproducts. Let $R\colon X\mathrel {\rightarrow \kern -9.5pt\mathrlap {|}\kern 6pt}X'$ and $S\colon Y\mathrel {\rightarrow \kern -9.5pt\mathrlap {|}\kern 6pt}Y'$ be relations. The diagram
for each $U'\in \mathcal{P}(X')$ and each $V'\in \mathcal{P}(Y')$.
Interaction With Products. Let $f\colon X\mathrel {\rightarrow \kern -9.5pt\mathrlap {|}\kern 6pt}X'$ and $g\colon Y\mathrel {\rightarrow \kern -9.5pt\mathrlap {|}\kern 6pt}Y'$ be relations. The diagram
for each $U'\in \mathcal{P}(X')$ and each $V'\in \mathcal{P}(Y')$.
Relation to Inverse Images. We have
for each $V\in \mathcal{P}(Y)$.
Interaction With Functional Relations. If $R$ is functional, then we have
so
for each $V\in \mathcal{P}(Y)$.
Interaction With Total Relations. If $R$ is total, then we have
so
for each $V\in \mathcal{P}(Y)$.
Interaction With Functions I. If $R$ is a function, then we have
so $R_{-1}=R^{-1}$.
Interaction With Functions II. If $R_{-1}=R^{-1}$, then $R$ is a function.
This finishes the proof.
This finishes the proof.
Since $\mathcal{P}(X)$ is posetal, naturality is automatic (Chapter 11: Categories, Item 4 of Proposition 11.2.7.1.2). This finishes the proof.
This finishes the proof.
Since $\mathcal{P}(X)$ is posetal, naturality is automatic (Chapter 11: Categories, Item 4 of Proposition 11.2.7.1.2). This finishes the proof.
This finishes the proof.
Since $\mathcal{P}(X)$ is posetal, naturality is automatic (Chapter 11: Categories, Item 4 of Proposition 11.2.7.1.2). This finishes the proof.
Indeed, we have
Taking $V=Y\setminus V$ then implies the original statement.
Since $R(a)\subset V$ is a strictly stronger condition than $R(a)\cap V\neq \text{Ø}$ when $R(a)$ is nonempty, we have $R^{\mathrm{dom}}_{-1}(V)\subset R^{-1}(V)$. Thus $R_{-1}(V)\subset R^{-1}(V)$.
Let $R\colon X\mathrel {\rightarrow \kern -9.5pt\mathrlap {|}\kern 6pt}Y$ be a relation.
Functionality I. The assignment $R\mapsto R_{-1}$ defines a function
Functionality II. The assignment $R\mapsto R_{-1}$ defines a function
Interaction With Identities. For each $X\in \operatorname {\mathrm{Obj}}(\mathsf{Sets})$, we have
Interaction With Composition. For each pair of composable relations $R\colon X\mathrel {\rightarrow \kern -9.5pt\mathrlap {|}\kern 6pt}Y$ and $S\colon Y\mathrel {\rightarrow \kern -9.5pt\mathrlap {|}\kern 6pt}C$, we have
Interaction With Converses. We have
for each $U\in \mathcal{P}(X)$. Thus $(\Delta _{X})_{-1}=\operatorname {\mathrm{id}}_{\mathcal{P}(X)}$.
for each $U\in \mathcal{P}(C)$, where we used Item 2 of Proposition 8.7.2.1.4, which implies that the conditions
We have $S_{!}(R(a))\subset U$.
We have $R(a)\subset S_{-1}(U)$.
are equivalent. Thus $(S\mathbin {\diamond }R)_{-1}=R_{-1}\circ S_{-1}$.