In mathematics, near sets are either spatially close or descriptively close. Spatially close sets have nonempty intersection. In other words, spatially close sets are not disjoint sets, since they always have at least one element in common. Descriptively close sets contain elements that have matching descriptions. Such sets can be either disjoint or non-disjoint sets. Spatially near sets are also descriptively near sets.

The underlying assumption with descriptively close sets is that such sets contain elements that have location and measurable features such as colour and frequency of occurrence. The description of the element of a set is defined by a feature vector. Comparison of feature vectors provides a basis for measuring the closeness of descriptively near sets. Near set theory provides a formal basis for the observation, comparison, and classification of elements in sets based on their closeness, either spatially or descriptively. Near sets offer a framework for solving problems based on human perception that arise in areas such as image processing, computer vision as well as engineering and science problems.

Near sets have a variety of applications in areas such as topology^[37], pattern detection and classification^[50], abstract algebra^[51], mathematics in computer science^[38], and solving a variety of problems based on human perception^{[42][82][47][52][56]} that arise in areas such as image analysis^{[54][14][46][17][18]}, image processing^[40], face recognition^[13], ethology^[64], as well as engineering and science problems^{[55][64][42][19][17][18]}. From the beginning, descriptively near sets have proved to be useful in applications of topology^[37], and visual pattern recognition ^[50], spanning a broad spectrum of applications that include camouflage detection, micropaleontology, handwriting forgery detection, biomedical image analysis, content-based image retrieval, population dynamics, quotient topology, textile design, visual merchandising, and topological psychology.

As an illustration of the degree of descriptive nearness between two sets, consider an example of the Henry colour model for varying degrees of nearness between sets of picture elements in pictures (see, e.g.,^[17] §4.3). The two pairs of ovals in Fig. 1 and Fig. 2 contain coloured segments. Each segment in the figures corresponds to an equivalence class where all pixels in the class have similar descriptions, i.e., picture elements with similar colours. The ovals in Fig.1 are closer to each other descriptively than the ovals in Fig. 2.

History

It has been observed that the simple concept of nearness unifies various concepts of topological structures^[20] inasmuch as the category Near of all nearness spaces and nearness preserving maps contains categories sTop (symmetric topological spaces and continuous maps^[3]), Prox (proximity spaces and ${\displaystyle \delta }$-maps^[8][67]), Unif (uniform spaces and uniformly continuous maps^[81][77]) and Cont (contiguity spaces and contiguity maps^[24]) as embedded full subcategories^[20][59]. The categories ${\displaystyle {\boldsymbol {\varepsilon {ANear))))$ and ${\displaystyle {\boldsymbol {\varepsilon {AMer))))$ are shown to be full supercategories of various well-known categories, including the category ${\displaystyle {\boldsymbol {sTop))}$ of symmetric topological spaces and continuous maps, and the category ${\displaystyle {\boldsymbol {Met^{\infty ))))$ of extended metric spaces and nonexpansive maps. The notation ${\displaystyle {\boldsymbol {A))\hookrightarrow {\boldsymbol {B))}$ reads category ${\displaystyle {\boldsymbol {A))}$ is embedded in category ${\displaystyle {\boldsymbol {B))}$. The categories ${\displaystyle {\boldsymbol {\varepsilon AMer))}$ and ${\displaystyle {\boldsymbol {\varepsilon ANear))}$ are supercategories for a variety of familiar categories^[76] shown in Fig. 3. Let ${\displaystyle {\boldsymbol {\varepsilon {ANear))))$ denote the category of all ${\displaystyle \varepsilon }$-approach nearness spaces and contractions, and let ${\displaystyle {\boldsymbol {\varepsilon AMer))}$ denote the category of all ${\displaystyle \varepsilon }$-approach merotopic spaces and contractions.

Among these familiar categories is ${\displaystyle {\boldsymbol {sTop))}$, the symmetric form of ${\displaystyle {\boldsymbol {Top))}$ (see category of topological spaces), the category with objects that are topological spaces and morphisms that are continuous maps between them^[1][32]. ${\displaystyle {\boldsymbol {Met^{\infty ))))$ with objects that are extended metric spaces is a subcategory of ${\displaystyle {\boldsymbol {\varepsilon AP))}$ (having objects ${\displaystyle \varepsilon }$-approach spaces and contractions) (see also^[57][75]). Let ${\displaystyle \rho _{X},\rho _{Y))$ be extended pseudometrics on nonempty sets ${\displaystyle X,Y}$, respectively. The map ${\displaystyle f:(X,\rho _{X})\longrightarrow (Y,\rho _{Y})}$ is a contraction if and only if ${\displaystyle f:(X,\nu _{D_{\rho _{X))})\longrightarrow (Y,\nu _{D_{\rho _{Y))})}$ is a contraction. For nonempty subsets ${\displaystyle A,B\in 2^{X))$ , the distance function ${\displaystyle D_{\rho }:2^{X}\times 2^{X}\longrightarrow [0,\infty ]}$ is defined by

${\displaystyle D_{\rho }(A,B)={\begin{cases}\inf {\{\rho (a,b):a\in A,b\in B\)),&{\text{if ))A{\text{ and ))B{\text{ are not empty)),\\\infty ,&{\text{if ))A{\text{ or ))B{\text{ is empty)).\end{cases))}$

Thus ${\displaystyle {\boldsymbol {\varepsilon ))}$AP is embedded as a full subcategory in ${\displaystyle {\boldsymbol {\varepsilon {ANear))))$ by the functor ${\displaystyle F:{\boldsymbol {\varepsilon {AP))}\longrightarrow {\boldsymbol {\varepsilon {ANear))))$ defined by ${\displaystyle F((X,\rho ))=(X,\nu _{D_{\rho )))}$ and ${\displaystyle F(f)=f}$. Then ${\displaystyle f:(X,\rho _{X})\longrightarrow (Y,\rho _{Y})}$ is a contraction if and only if ${\displaystyle f:(X,\nu _{D_{\rho _{X))})\longrightarrow (Y,\nu _{D_{\rho _{Y))})}$ is a contraction. Thus ${\displaystyle {\boldsymbol {\varepsilon {AP))))$ is embedded as a full subcategory in ${\displaystyle {\boldsymbol {\varepsilon {ANear))))$ by the functor ${\displaystyle F:{\boldsymbol {\varepsilon {AP))}\longrightarrow {\boldsymbol {\varepsilon {ANear))))$ defined by ${\displaystyle F((X,\rho ))=(X,\nu _{D_{\rho )))}$ and ${\displaystyle F(f)=f.}$ Since the category ${\displaystyle {\boldsymbol {Met^{\infty ))))$ of extended metric spaces and nonexpansive maps is a full subcategory of ${\displaystyle {\boldsymbol {\varepsilon {AP))))$, therefore, ${\displaystyle {\boldsymbol {\varepsilon {ANear))))$ is also a full supercategory of ${\displaystyle {\boldsymbol {Met^{\infty ))))$. The category ${\displaystyle {\boldsymbol {\varepsilon {ANear))))$ is a topological construct^[76].

The notions of near and far^[A] in mathematics can be traced back to works by Johann Benedict Listing and Felix Hausdorff. The related notions of resemblance and similarity can be traced back to J.H. Poincaré, who introduced sets of similar sensations (nascent tolerance classes) to represent the results of G.T. Fechner's sensation sensitivity experiments^[10] and a framework for the study of resemblance in representative spaces as models of what he termed physical continua^[63][60][61]. The elements of a physical continuum (pc) are sets of sensations. The notion of a pc and various representative spaces (tactile, visual, motor spaces) were introduced by Poincaré in an 1894 article on the mathematical continuum^[63], an 1895 article on space and geometry^[60] and a compendious 1902 book on science and hypothesis^[61] followed by a number of elaborations, e.g.,^[62]. The 1893 and 1895 articles on continua (Pt. 1, ch. II) as well as representative spaces and geometry (Pt. 2, ch IV) are included as chapters in^[61]. Later, F. Riesz introduced the concept of proximity or nearness of pairs of sets at the International Congress of Mathematicians (ICM) in 1908^[65].

During the 1960s, E.C. Zeeman introduced tolerance spaces in modelling visual perception^[83]. A.B. Sossinsky observed in 1986^[71] that the main idea underlying tolerance space theory comes from Poincaré, especially^[60]. In 2002, Z. Pawlak and J. Peters^[B] considered an informal approach to the perception of the nearness of physical objects such as snowflakes that was not limited to spatial nearness. In 2006, a formal approach to the descriptive nearness of objects was considered by J. Peters, A. Skowron and J. Stepaniuk^[C] in the context of proximity spaces^{[39][33][35][21]}. In 2007, descriptively near sets were introduced by J. Peters^[D][E] followed by the introduction of tolerance near sets^[41][45]. Recently, the study of descriptively near sets has led to algebraic^[22][51], topological and proximity space^[37] foundations of such sets.

Nearness of sets

The adjective near in the context of near sets is used to denote the fact that observed feature value differences of distinct objects are small enough to be considered indistinguishable, i.e., within some tolerance.

The exact idea of closeness or 'resemblance' or of 'being within tolerance' is universal enough to appear, quite naturally, in almost any mathematical setting (see, e.g.,^[66]). It is especially natural in mathematical applications: practical problems, more often than not, deal with approximate input data and only require viable results with a tolerable level of error^[71].

The words near and far are used in daily life and it was an incisive suggestion of F. Riesz^[65] that these intuitive concepts be made rigorous. He introduced the concept of nearness of pairs of sets at the ICM in Rome in 1908. This concept is useful in simplifying teaching calculus and advanced calculus. For example, the passage from an intuitive definition of continuity of a function at a point to its rigorous epsilon-delta definition is sometime difficult for teachers to explain and for students to understand. Intuitively, continuity can be explained using nearness language, i.e., a function ${\displaystyle f:\mathbb {R} \rightarrow \mathbb {R} }$ is continuous at a point ${\displaystyle c}$, provided points ${\displaystyle \{x\))$ near ${\displaystyle c}$ go into points ${\displaystyle \{f(x)\))$ near ${\displaystyle f(c)}$. Using Riesz's idea, this definition can be made more precise and its contrapositive is the familiar definition^[4][36].

Generalization of set intersection

From a spatial point of view, nearness (a.k.a. proximity) is considered a generalization of set intersection. For disjoint sets, a form of nearness set intersection is defined in terms of a set of objects (extracted from disjoint sets) that have similar features within some tolerance (see, e.g., §3 in^[80]). For example, the ovals in Fig. 1 are considered near each other, since these ovals contain pairs of classes that display similar (visually indistinguishable) colours.

Efremovič proximity space

Let ${\displaystyle X}$ denote a metric topological space that is endowed with one or more proximity relations and let ${\displaystyle 2^{X))$ denote the collection of all subsets of ${\displaystyle X}$. The collection ${\displaystyle 2^{X))$ is called the power set of ${\displaystyle X}$.

There are many ways to define Efremovič proximities on topological spaces (discrete proximity, standard proximity, metric proximity, Čech proximity, Alexandroff proximity, and Freudenthal proximity), For details, see § 2, pp. 93–94 in^[6]. The focus here is on standard proximity on a topological space. For ${\displaystyle A,B\subset X}$, ${\displaystyle A}$ is near ${\displaystyle B}$ (denoted by ${\displaystyle A\ \delta \ B}$), provided their closures share a common point.

The closure of a subset ${\displaystyle A\in 2^{X))$ (denoted by ${\displaystyle {\mbox{cl))(A)}$) is the usual Kuratowski closure of a set^[F], introduced in § 4, p. 20^[27], is defined by

${\displaystyle {\begin{aligned}{\mbox{cl))(A)&=\left\{x\in X:D(x,A)=0\right\},\ {\mbox{where))\\D(x,A)&=\inf \left\{d(x,a):a\in A\right\}.\end{aligned))}$

I.e., ${\displaystyle {\mbox{cl))(A)}$ is the set of all points ${\displaystyle x}$ in ${\displaystyle X}$ that are close to ${\displaystyle A}$ (${\displaystyle D(x,A)}$ is the Hausdorff distance (see § 22, p. 128, in^[15]) between ${\displaystyle x}$ and the set ${\displaystyle A}$ and ${\displaystyle d(x,a)=\left|x-a\right|}$ (standard distance)). A standard proximity relation is defined by

${\displaystyle \delta =\left\{(A,B)\in 2^{X}\times 2^{X}:{\mbox{cl))(A)\ \cap \ {\mbox{cl))(B)\neq \emptyset \right\}.}$

Whenever sets ${\displaystyle A}$ and ${\displaystyle B}$ have no points in common, the sets are farfrom each other (denoted ${\displaystyle A\ {\underline {\delta ))\ B}$).

The following EF-proximity^[G] space axioms are given by Jurij Michailov Smirnov^[67] based on what Vadim Arsenyevič Efremovič introduced during the first half of the 1930s^[8]. Let ${\displaystyle A,B,E\in 2^{X))$.

EF.1

If the set ${\displaystyle A}$ is close to ${\displaystyle B}$, then ${\displaystyle B}$ is close to ${\displaystyle A}$.

EF.2

${\displaystyle A\cup B}$ is close to ${\displaystyle E}$, if and only if, at least one of the sets ${\displaystyle A}$ or ${\displaystyle B}$ is close to ${\displaystyle E}$.

EF.3

Two points are close, if and only if, they are the same point.

EF.4

All sets are far from the empty set ${\displaystyle \emptyset }$.

EF.5

For any two sets ${\displaystyle A}$ and ${\displaystyle B}$ which are far from each other, there exists ${\displaystyle C,D\in 2^{X))$, ${\displaystyle C\cup D=X}$, such that ${\displaystyle A}$ is far from ${\displaystyle C}$ and ${\displaystyle B}$ is far from ${\displaystyle D}$ (Efremovič-axiom).

The pair ${\displaystyle (X,\delta )}$ is called an EF-proximity space. In this context, a space is a set with some added structure. With a proximity space ${\displaystyle X}$, the structure of ${\displaystyle X}$ is induced by the EF-proximity relation ${\displaystyle \delta }$. In a proximity space ${\displaystyle X}$, the closure of ${\displaystyle A}$ in ${\displaystyle X}$ coincides with the intersection of all closed sets that contain ${\displaystyle A}$.

Theorem 1^[67]

The closure of any set ${\displaystyle A}$ in the proximity space ${\displaystyle X}$ is the set of points ${\displaystyle x\in X}$ that are close to ${\displaystyle A}$.

Visualization of EF-axiom

Let the set ${\displaystyle X}$ be represented by the points inside the rectangular region in Fig. 5. Also, let ${\displaystyle A,B}$ be any two non-intersection subsets (i.e. subsets spatially far from each other) in ${\displaystyle X}$, as shown in Fig. 5. Let ${\displaystyle C^{c}=X\backslash C}$ (complement of the set ${\displaystyle C}$). Then from the EF-axiom, observe the following:

${\displaystyle {\begin{aligned}A&{}\mathrel {\underline {\delta )) B,\\B&\subset C,\\D&=C^{c},\\X&=D\cup C,\\A&\subset D,\ {\mbox{hence, we can write))\\A\ {\underline {\delta ))\ B\ &\Rightarrow \ A\ {\underline {\delta ))\ C\ {\mbox{and))\ B\ {\underline {\delta ))\ D,\ {\mbox{for some))\ C,D\ {\mbox{in))\ X{\mbox{ so that ))C\cup D=X.\qquad \blacksquare \end{aligned))}$

Descriptive proximity space

Descriptively near sets were introduced as a means of solving classification and pattern recognition problems arising from disjoint sets that resemble each other.^[44][43] Recently, the connections between near sets in EF-spaces and near sets in descriptive EF-proximity spaces have been explored in.^[53][48]

Again, let ${\displaystyle X}$ be a metric topological space and let ${\displaystyle \Phi =\left\{\phi _{1},\dots ,\phi _{n}\right\))$ a set of probe functions that represent features of each ${\displaystyle x\in X}$. The assumption made here is ${\displaystyle X}$ contains non-abstract points that have measurable features such as gradient orientation. A non-abstract point has a location and features that can be measured (see § 3 in ^[26]).

A probe function ${\displaystyle \phi :X\rightarrow \mathbb {R} }$ represents a feature of a sample point in ${\displaystyle X}$. The mapping ${\displaystyle \Phi :X\longrightarrow \mathbb {R} ^{n))$ is defined by ${\displaystyle \Phi (x)=(\phi _{1}(x),\dots ,\phi _{n}(x))}$, where ${\displaystyle \mathbb {R} ^{n))$ is an n-dimensional real Euclidean vector space. ${\displaystyle \Phi (x)}$ is a feature vector for ${\displaystyle x}$, which provides a description of ${\displaystyle x\in X}$. For example, this leads to a proximal view of sets of picture points in digital images.^[48]

To obtain a descriptive proximity relation (denoted by ${\displaystyle \delta _{\Phi ))$), one first chooses a set of probe functions. Let ${\displaystyle {\mathcal {Q)):2^{X}\longrightarrow 2^{R^{n))}$ be a mapping on a subset of ${\displaystyle 2^{X))$ into a subset of ${\displaystyle 2^{R^{n))}$. For example, let ${\displaystyle A,B\in 2^{X))$ and ${\displaystyle {\mathcal {Q))(A),{\mathcal {Q))(B)}$ denote sets of descriptions of points in ${\displaystyle A,B}$, respectively. That is,

${\displaystyle {\begin{aligned}{\mathcal {Q))(A)&=\left\{\Phi (a):a\in A\right\},\\{\mathcal {Q))(B)&=\left\{\Phi (b):b\in B\right\}.\end{aligned))}$

The expression ${\displaystyle A\mathrel {\delta _{\Phi )) B}$ reads ${\displaystyle A}$ is descriptively near ${\displaystyle B}$. Similarly, ${\displaystyle A\mathrel ((\underline {\delta ))_{\Phi )) B}$ reads ${\displaystyle A}$ is descriptively far from ${\displaystyle B}$. The descriptive proximity of ${\displaystyle A}$ and ${\displaystyle B}$ is defined by

${\displaystyle A\mathrel {\delta _{\Phi )) B\Leftrightarrow {\mathcal {Q))({\mbox{cl))(A))\mathrel {\delta } {\mathcal {Q))({\mbox{cl))(B))\neq \emptyset .}$

The descriptive intersection ${\displaystyle \mathop {\cap } _{\Phi ))$ of ${\displaystyle A}$ and ${\displaystyle B}$ is defined by

${\displaystyle A\mathbin {\mathop {\cap } _{\Phi )) B=\left\{x\in A\cup B:{\mathcal {Q))(A)\mathrel {\delta } {\mathcal {Q))(B)\right\}.}$

That is, ${\displaystyle x\in A\cup B}$ is in ${\displaystyle A\mathbin {\mathop {\cap } _{\Phi )) B}$, provided ${\displaystyle \Phi (x)=\Phi (a)=\Phi (b)}$ for some ${\displaystyle a\in A,b\in B}$. Observe that ${\displaystyle A}$ and ${\displaystyle B}$ can be disjoint and yet ${\displaystyle A\mathbin {\mathop {\cap } _{\Phi )) B}$ can be nonempty.

The descriptive proximity relation ${\displaystyle \delta _{\Phi ))$ is defined by

${\displaystyle \delta _{\Phi }=\left\{(A,B)\in 2^{X}\times 2^{X}:{\mbox{cl))(A)\mathbin {\mathop {\cap } _{\Phi )) {\mbox{cl))(B)\neq \emptyset \right\}.}$

Whenever sets ${\displaystyle A}$ and ${\displaystyle B}$ have no points with matching descriptions, the sets are descriptively far from each other (denoted by ${\displaystyle A\ {\underline {\delta ))_{\Phi }\ B}$).

The binary relation ${\displaystyle \delta _{\Phi ))$ is a descriptive EF-proximity, provided the following axioms are satisfied for ${\displaystyle A,B,E\subset X}$.

dEF.1

If the set ${\displaystyle A}$ is descriptively close to ${\displaystyle B}$, then ${\displaystyle B}$ is descriptively close to ${\displaystyle A}$.

dEF.2

${\displaystyle A\cup B}$ is descriptively close to ${\displaystyle E}$, if and only if, at least one of the sets ${\displaystyle A}$ or ${\displaystyle B}$ is descriptively close to ${\displaystyle E}$.

dEF.3

Two points ${\displaystyle x,y\in X}$ are descriptively close, if and only if, the description of ${\displaystyle x}$ matches the description of ${\displaystyle y}$.

dEF.4

All nonempty sets are descriptively far from the empty set ${\displaystyle \emptyset }$.

dEF.5

For any two sets ${\displaystyle A}$ and ${\displaystyle B}$ which are descriptively far from each other, there exists ${\displaystyle C,D\in 2^{X))$, ${\displaystyle C\cup D=X}$, such that ${\displaystyle A}$ is descriptively far from ${\displaystyle C}$ and ${\displaystyle B}$ is descriptively far from ${\displaystyle D}$ (Descriptive Efremovič axiom).

The pair ${\displaystyle (X,\delta _{\Phi })}$ is called a descriptive proximity space.

Proximal relator spaces

A relator is a nonvoid family of relations ${\displaystyle {\mathcal {R))}$ on a nonempty set ${\displaystyle X}$^[72]. The pair ${\displaystyle (X,{\mathcal {R)))}$ (also denoted ${\displaystyle X({\mathcal {R)))}$) is called a relator space. Relator spaces are natural generalizations of ordered sets and uniform spaces.^[73][74] With the introduction of a family of proximity relations ${\displaystyle {\mathcal {R))_{\delta ))$ on ${\displaystyle X}$, we obtain a proximal relator space ${\displaystyle (X,{\mathcal {R))_{\delta })}$. For simplicity, we consider only two proximity relations, namely, the Efremovič proximity ${\displaystyle \delta }$^[8] and the descriptive proximity ${\displaystyle \delta _{\Phi ))$ in defining the descriptive relator ${\displaystyle {\mathcal {R))_{\delta _{\Phi ))}$.^[53][48] The pair ${\displaystyle (X,{\mathcal {R))_{\delta _{\Phi )))}$ is called a proximal relator space^[49]. In this work, ${\displaystyle X}$ denotes a metric topological space that is endowed with the relations in a proximal relator. With the introduction of ${\displaystyle (X,{\mathcal {R))_{\delta _{\Phi )))}$, the traditional closure of a subset (e.g., ^[9][7]) can be compared with the more recent descriptive closure of a subset.

In a proximal relator space ${\displaystyle X}$, the descriptive closure of a set ${\displaystyle A}$ (denoted by ${\displaystyle {\mbox{cl))_{\Phi }(A)}$) is defined by

${\displaystyle {\mbox{cl))_{\Phi }(A)=\left\{x\in X:{\Phi (x)}\mathrel {\delta } {\mathcal {Q))({\mbox{cl))(A))\right\}.}$

That is, ${\displaystyle x\in X}$ is in the descriptive closure of ${\displaystyle A}$, provided the closure of ${\displaystyle \Phi (x)}$ and the closure of ${\displaystyle {\mathcal {Q))({\mbox{cl))(A))}$ have at least one element in common.

Theorem 2 ^[50]

The descriptive closure of any set ${\displaystyle A}$ in the descriptive EF-proximity space ${\displaystyle (X,{\mathcal {R))_{\delta _{\Phi )))}$ is the set of points ${\displaystyle x\in X}$ that are descriptively close to ${\displaystyle A}$.

Theorem 3 ^[50]

Kuratowski closure of a set ${\displaystyle A}$ is a subset of the descriptive closure of ${\displaystyle A}$ in a descriptive EF-proximity space.

Theorem 4 ^[49]

Let ${\displaystyle (X,{\mathcal {R))_{\delta _{\Phi )))}$ be a proximal relator space, ${\displaystyle A\subset X}$. Then ${\displaystyle {\mbox{cl))(A)\subseteq {\mbox{cl))_{\Phi }(A)}$.

Proof

Let ${\displaystyle \Phi (x)\in {\mathcal {Q))(X\setminus {\mbox{cl))(A))}$ such that ${\displaystyle \Phi (x)=\Phi (a)}$ for some ${\displaystyle a\in {\mbox{cl))A}$. Consequently, ${\displaystyle \Phi (x)\in {\mathcal {Q))({\mbox{cl))_{\Phi }(A))}$. Hence, ${\displaystyle {\mbox{cl))(A)\subseteq {\mbox{cl))_{\Phi }(A)}$

In a proximal relator space, EF-proximity ${\displaystyle \delta }$ leads to the following results for descriptive proximity ${\displaystyle \delta _{\Phi ))$.

Theorem 5^[49]

Let ${\displaystyle (X,{\mathcal {R))_{\delta _{\Phi )))}$ be a proximal relator space, ${\displaystyle A,B,C\subset X}$. Then

1°

${\displaystyle A\ \delta \ B\ {\mbox{implies))\ A\ \delta _{\Phi }\ B}$.

2°

${\displaystyle (A\cup B)\ \delta \ C\ {\mbox{implies))\ (A\cup B)\ \delta _{\Phi }\ C}$.

3°

${\displaystyle {\mbox{cl))A\ \delta \ {\mbox{cl))B\ {\mbox{implies))\ {\mbox{cl))A\ \delta _{\Phi }\ {\mbox{cl))B}$.

Proof

1°

${\displaystyle A\ \delta \ B\Leftrightarrow A\cap B\neq \emptyset }$. For ${\displaystyle x\in A\cap B,\Phi (x)\in {\mathcal {Q))(A)}$ and ${\displaystyle \Phi (x)\in {\mathcal {Q))(B)}$. Consequently, ${\displaystyle A\ \delta _{\Phi }\ B}$.

1° ⇒ 2°

3°

${\displaystyle {\mbox{cl))A\ \delta \ {\mbox{cl))B}$ implies that ${\displaystyle {\mbox{cl))A}$ and ${\displaystyle {\mbox{cl))A}$ have at least one point in common. Hence, 1° ⇒ 3°.

${\displaystyle \qquad \blacksquare }$

Descriptive 𝛿-neighbourhoods

In a pseudometric proximal relator space ${\displaystyle X}$, the neighbourhood of a point ${\displaystyle x\in X}$ (denoted by ${\displaystyle N_{x,\varepsilon ))$), for ${\displaystyle \varepsilon >0}$, is defined by

${\displaystyle N_{x,\varepsilon }=\left\{y\in X:d(x,y)<\varepsilon \right\}.}$

The interior of a set ${\displaystyle A}$ (denoted by ${\displaystyle {\mbox{int))(A)}$) and boundary of ${\displaystyle A}$ (denoted by ${\displaystyle {\mbox{bdy))(A)}$) in a proximal relator space ${\displaystyle X}$ are defined by

${\displaystyle {\begin{aligned}{\mbox{int))(A)&=\left\{x\in X:N_{x,\varepsilon }\subseteq A\right\}.\\{\mbox{bdy))(A)&={\mbox{cl))(A)\setminus {\mbox{int))(A).\end{aligned))}$

A set ${\displaystyle A}$ has a natural strong inclusion in a set ${\displaystyle B}$ associated with ${\displaystyle \delta }$^[5][6]} (denoted by ${\displaystyle A\ll _{\delta }B}$), provided ${\displaystyle A\subset {\mbox{int))(B)}$; i.e., ${\displaystyle A\mathrel {\underline {\delta )) X\setminus {\mbox{int))(B)}$ (${\displaystyle A}$ is far from the complement of ${\displaystyle {\mbox{int))(B)}$). Correspondingly, a set ${\displaystyle A}$ has a descriptive strong inclusion in a set ${\displaystyle B}$ associated with ${\displaystyle \delta _{\Phi ))$ (denoted by ${\displaystyle A\mathrel {\mathop {\ll } _{\Phi )) B}$), provided ${\displaystyle {\mathcal {Q))(A)\subset \ {\mathcal {Q))({\mbox{int))(B))}$; i.e., ${\displaystyle A\ {\underline {\delta ))_{\Phi }\ X\setminus {\mbox{int))(B)}$ (${\displaystyle {\mathcal {Q))(A)}$ is far from the complement of ${\displaystyle {\mbox{int))B}$).

Let ${\displaystyle \mathop {\ll } _{\Phi ))$ be a descriptive ${\displaystyle \delta }$-neighbourhood relation defined by

${\displaystyle \mathop {\ll } _{\Phi }=\left\{(A,B)\in 2^{X}\times 2^{X}:{\mathcal {Q))(A)\subset {\mathcal {Q))({\mbox{int))(B))\right\}.}$

That is, ${\displaystyle A\mathrel {\mathop {\ll } _{\Phi )) B}$, provided the description of each ${\displaystyle a\in A}$ is contained in the set of descriptions of the points ${\displaystyle b\in {\mbox{int))(B)}$. Now observe that any ${\displaystyle A,B}$ in the proximal relator space ${\displaystyle X}$ such that ${\displaystyle A\mathrel ((\underline {\delta ))_{\Phi )) B}$ have disjoint ${\displaystyle \delta _{\Phi ))$-neighbourhoods; i.e.,

${\displaystyle A\mathrel ((\underline {\delta ))_{\Phi )) B\Leftrightarrow A\mathrel {\mathop {\ll } _{\Phi )) E1,B\mathrel {\mathop {\ll } _{\Phi )) E2,\ {\mbox{for some))\ E1,E2\subset X\ {\mbox{(See Fig. 6).))}$

Theorem 6 ^[50]

Any two sets descriptively far from each other belong to disjoint descriptive ${\displaystyle \delta _{\Phi ))$-neighbourhoods in a descriptive proximity space ${\displaystyle X}$.

A consideration of strong containment of a nonempty set in another set leads to the study of hit-and-miss topologies and the Wijsman topology.^[2]

Tolerance near sets

Let ${\displaystyle \varepsilon }$ be a real number greater than zero. In the study of sets that are proximally near within some tolerance, the set of proximity relations ${\displaystyle {\mathcal {R))_{\delta _{\Phi ))}$ is augmented with a pseudometric tolerance proximity relation (denoted by ${\displaystyle \delta _{\Phi ,\varepsilon ))$) defined by

${\displaystyle {\begin{aligned}D_{\Phi }(A,B)&=\inf \left\{d(\Phi (a),\Phi (a)):\Phi (a)\in {\mathcal {Q))(A),\Phi (a)\in {\mathcal {Q))(B)\right\},\\d(\Phi (a),\Phi (a))&=\mathop {\sum } _{i=1}^{n}|\phi _{i}(a)-\phi _{i}(b)|,\\\delta _{\Phi ,\varepsilon }&=\left\{(A,B)\in 2^{X}\times 2^{X}:|D({\mbox{cl))(A),{\mbox{cl))(B))|<\varepsilon \right\}.\end{aligned))}$

Let ${\displaystyle {\mathcal {R))_{\delta _{\Phi ,\varepsilon ))={\mathcal {R))_{\delta _{\Phi ))\cup \left\{\delta _{\Phi ,\varepsilon }\right\))$. In other words, a nonempty set equipped with the proximal relator ${\displaystyle {\mathcal {R))_{\delta _{\Phi ,\varepsilon ))}$ has underlying structure provided by the proximal relator ${\displaystyle {\mathcal {R))_{\delta _{\Phi ))}$ and provides a basis for the study of tolerance near sets in ${\displaystyle X}$ that are near within some tolerance. Sets ${\displaystyle A,B}$ in a descriptive pseudometric proximal relator space ${\displaystyle (X,{\mathcal {R))_{\delta _{\Phi ,\varepsilon )))}$ are tolerance near sets (i.e., ${\displaystyle A\ \delta _{\Phi ,\varepsilon }\ B}$), provided

${\displaystyle D_{\Phi }(A,B)<\varepsilon .}$

Tolerance classes and preclasses

Relations with the same formal properties as similarity relations of sensations considered by Poincaré^[62] are nowadays, after Zeeman^[83], called tolerance relations. A tolerance ${\displaystyle \tau }$ on a set ${\displaystyle O}$ is a relation ${\displaystyle \tau \subseteq O\times O}$ that is reflexive and symmetric. In algebra, the term tolerance relation is also used in a narrow sense to denote reflexive and symmetric relations defined on universes of algebras that are also compatible with operations of a given algebra, i.e., they are generalizations of congruence relations (see e.g.,^[12]). In referring to such relations, the term algebraic tolerance or the term algebraic tolerance relation is used. Transitive tolerance relations are equivalence relations. A set ${\displaystyle O}$ together with a tolerance ${\displaystyle \tau }$ is called a tolerance space (denoted ${\displaystyle (O,\tau )}$). A set ${\displaystyle A\subseteq O}$ is a ${\displaystyle \tau }$-preclass (or briefly preclass when ${\displaystyle \tau }$ is understood) if and only if for any ${\displaystyle x,y\in A}$, ${\displaystyle (x,y)\in \tau }$.

The family of all preclasses of a tolerance space is naturally ordered by set inclusion and preclasses that are maximal with respect to set inclusion are called ${\displaystyle \tau }$-classes or just classes, when ${\displaystyle \tau }$ is understood. The family of all classes of the space ${\displaystyle (O,\tau )}$ is particularly interesting and is denoted by ${\displaystyle H_{\tau }(O)}$. The family ${\displaystyle H_{\tau }(O)}$ is a covering of ${\displaystyle O}$^[58].

The work on similarity by Poincaré and Zeeman presage the introduction of near sets^[44][43] and research on similarity relations, e.g.,^[79]. In science and engineering, tolerance near sets are a practical application of the study of sets that are near within some tolerance. A tolerance ${\displaystyle \varepsilon \in (0,\infty ]}$ is directly related to the idea of closeness or resemblance (i.e., being within some tolerance) in comparing objects. By way of application of Poincaré's approach in defining visual spaces and Zeeman's approach to tolerance relations, the basic idea is to compare objects such as image patches in the interior of digital images.

Examples

Simple example

The following simple example demonstrates the construction of tolerance classes from real data. Consider the 20 objects in the table below with ${\displaystyle |\Phi |=1}$.

Sample perceptual system

${\displaystyle x_{i))$	${\displaystyle \phi (x)}$	${\displaystyle x_{i))$	${\displaystyle \phi (x)}$	${\displaystyle x_{i))$	${\displaystyle \phi (x)}$	${\displaystyle x_{i))$	${\displaystyle \phi (x)}$
${\displaystyle x_{1))$	.4518	${\displaystyle x_{6))$	.6943	${\displaystyle x_{11))$	.4002	${\displaystyle x_{16))$	.6079
${\displaystyle x_{2))$	.9166	${\displaystyle x_{7))$	.9246	${\displaystyle x_{12))$	.1910	${\displaystyle x_{17))$	.1869
${\displaystyle x_{3))$	.1398	${\displaystyle x_{8))$	.3537	${\displaystyle x_{13))$	.7476	${\displaystyle x_{18))$	.8489
${\displaystyle x_{4))$	.7972	${\displaystyle x_{9))$	.4722	${\displaystyle x_{14))$	.4990	${\displaystyle x_{19))$	.9170
${\displaystyle x_{5))$	.6281	${\displaystyle x_{10))$	.4523	${\displaystyle x_{15))$	.6289	${\displaystyle x_{20))$	.7143

Let a tolerance relation be defined as

${\displaystyle \cong _{\varepsilon }{}\Leftrightarrow \{(x,y)\in O\times O:\;\parallel \Phi (x)-\Phi (y)\parallel _{_{2))\leq \varepsilon \))$

Then, setting ${\displaystyle \varepsilon =0.1}$ gives the following tolerance classes:

${\displaystyle {\begin{aligned}H_{\cong _{\varepsilon ))(O)={}&\{\{x_{1},x_{8},x_{10},x_{11}\},\{x_{1},x_{9},x_{10},x_{11},x_{14}\},\\&\{x_{2},x_{7},x_{18},x_{19}\},\\&\{x_{3},x_{12},x_{17}\},\\&\{x_{4},x_{13},x_{20}\},\{x_{4},x_{18}\},\\&\{x_{5},x_{6},x_{15},x_{16}\},\{x_{5},x_{6},x_{15},x_{20}\},\\&\{x_{6},x_{13},x_{20}\}\}.\end{aligned))}$

Observe that each object in a tolerance class satisfies the condition ${\displaystyle \parallel \Phi (x)-\Phi (y)\parallel _{2}\leq \varepsilon }$, and that almost all of the objects appear in more than one class. Moreover, there would be twenty classes if the indiscernibility relation was used since there are no two objects with matching descriptions.

Image processing example

The following example provides an example based on digital images. Let a subimage be defined as a small subset of pixels belonging to a digital image such that the pixels contained in the subimage form a square. Then, let the sets ${\displaystyle X}$ and ${\displaystyle Y}$ respectively represent the subimages obtained from two different images, and let ${\displaystyle O=\{X\cup Y\))$. Finally, let the description of an object be given by the Green component in the RGB color model. The next step is to find all the tolerance classes using the tolerance relation defined in the previous example. Using this information, tolerance classes can be formed containing objects that have similar (within some small ${\displaystyle \varepsilon }$) values for the Green component in the RGB colour model. Furthermore, images that are near (similar) to each other should have tolerance classes divided among both images (instead of a tolerance classes contained solely in one of the images). For example, the figure accompanying this example shows a subset of the tolerance classes obtained from two leaf images. In this figure, each tolerance class is assigned a separate colour. As can be seen, the two leaves share similar tolerance classes. This example highlights a need to measure the degree of nearness of two sets.

Nearness measure

Let ${\displaystyle (U,{\mathcal {R))_{\delta _{\Phi ,\varepsilon )))}$ denote a particular descriptive pseudometric EF-proximal relator space equipped with the proximity relation ${\displaystyle \delta _{\Phi ,\varepsilon ))$ and with nonempty subsets ${\displaystyle X,Y\in 2^{U))$ and with the tolerance relation ${\displaystyle \cong _{\Phi ,\varepsilon ))$ defined in terms of a set of probes ${\displaystyle \Phi }$ and with ${\displaystyle \varepsilon \in (0,\infty ]}$, where

${\displaystyle \simeq _{\Phi ,\varepsilon }=\{(x,y)\in U\times U\mid \ |\Phi (x)-\Phi (y)|\leq \varepsilon \}.}$

Further, assume ${\displaystyle Z=X\cup Y}$ and let ${\displaystyle H_{\tau _{\Phi ,\varepsilon ))(Z)}$ denote the family of all classes in the space ${\displaystyle (Z,\simeq _{\Phi ,\varepsilon })}$.

Let ${\displaystyle A\subseteq X,B\subseteq Y}$. The distance ${\displaystyle D_{_{tNM)):2^{U}\times 2^{U}:\longrightarrow [0,\infty ]}$ is defined by

${\displaystyle D_{_{tNM))(X,Y)={\begin{cases}1-tNM(A,B),&{\mbox{if ))X{\mbox{ and ))Y{\mbox{ are not empty)),\\\infty ,&{\mbox{if ))X{\mbox{ or ))Y{\mbox{ is empty)),\end{cases))}$

where

${\displaystyle tNM(A,B)={\Biggl (}\sum _{C\in H_{\tau _{\Phi ,\varepsilon ))(Z)}|C|{\Biggr )}^{-1}\cdot \sum _{C\in H_{\tau _{\Phi ,\varepsilon ))(Z)}|C|{\frac {\min(|C\cap A|,|[C\cap B|)}{\max(|C\cap A|,|C\cap B|))).}$

The details concerning ${\displaystyle tNM}$ are given in^[14][16][17]. The idea behind ${\displaystyle tNM}$ is that sets that are similar should have a similar number of objects in each tolerance class. Thus, for each tolerance class obtained from the covering of ${\displaystyle Z=X\cup Y}$, ${\displaystyle tNM}$ counts the number of objects that belong to ${\displaystyle X}$ and ${\displaystyle Y}$ and takes the ratio (as a proper fraction) of their cardinalities. Furthermore, each ratio is weighted by the total size of the tolerance class (thus giving importance to the larger classes) and the final result is normalized by dividing by the sum of all the cardinalities. The range of ${\displaystyle tNM}$ is in the interval [0,1], where a value of 1 is obtained if the sets are equivalent (based on object descriptions) and a value of 0 is obtained if they have no descriptions in common.

As an example of the degree of nearness between two sets, consider figure below in which each image consists of two sets of objects, ${\displaystyle X}$ and ${\displaystyle Y}$. Each colour in the figures corresponds to a set where all the objects in the class share the same description. The idea behind ${\displaystyle tNM}$ is that the nearness of sets in a perceptual system is based on the cardinality of tolerance classes that they share. Thus, the sets in left side of the figure are closer (more near) to each other in terms of their descriptions than the sets in right side of the figure.

Near set evaluation and recognition (NEAR) system

The Near set Evaluation and Recognition (NEAR) system, is a system developed to demonstrate practical applications of near set theory to the problems of image segmentation evaluation and image correspondence. It was motivated by a need for a freely available software tool that can provide results for research and to generate interest in near set theory. The system implements a Multiple Document Interface (MDI) where each separate processing task is performed in its own child frame. The objects (in the near set sense) in this system are subimages of the images being processed and the probe functions (features) are image processing functions defined on the subimages. The system was written in C++ and was designed to facilitate the addition of new processing tasks and probe functions. Currently, the system performs six major tasks, namely, displaying equivalence and tolerance classes for an image, performing segmentation evaluation, measuring the nearness of two images, performing Content Based Image Retrieval (CBIR), and displaying the output of processing an image using a specific probe function.

Proximity System

The Proximity System is an application developed to demonstrate descriptive-based topological approaches to nearness and proximity within the context of digital image analysis. The Proximity System grew out of the work of S. Naimpally and J. Peters on Topological Spaces. The Proximity System was written in Java and is intended to run in two different operating environments, namely on Android smartphones and tablets, as well as desktop platforms running the Java Virtual Machine. With respect to the desktop environment, the Proximity System is a cross-platform Java application for Windows, OSX, and Linux systems, which has been tested on Windows 7 and Debian Linux using the Sun Java 6 Runtime. In terms of the implementation of the theoretical approaches, both the Android and the desktop based applications use the same back-end libraries to perform the description-based calculations, where the only differences are the user interface and the Android version has less available features due to restrictions on system resources.