3.2. Best Proximity Point Theory in Triple Settings
Throughout this section, let denote a non-Archimedean generalized Menger space, and let , , and be three non-empty subsets of . We begin by introducing several key constructions.
Definition 7.
For the triple , we define the optimal proximity function byThis value represents the optimal probabilistic proximity achievable among elements of the sets , , and . Indeed, since evaluates the probability that the generalized distance among the points is less than p, a higher value inherently indicates a stronger degree of proximity. Consequently, the supremum over all such triplets mathematically quantifies the maximum attainable probability of closeness at the given threshold p. In the present study, for any nonempty subsets , , and of a non-Archimedean generalized Menger space , the following terminology is applied throughout.
Definition 8.
We associate to each set a subset of points that can attain this optimal value:The sets , , consist of those points that participate in a triple realizing the optimal proximity. To illustrate Definition 8, let us build upon the non-Archimedean generalized Menger space presented in Example (2).
Example 3.
Consider equipped with the mappingLet us define three closed subsets of :For any triplet , it is clear from the intervals that , which means . To find the optimal proximity function , we must take the supremum of over all such triplets. Since the function is strictly decreasing for , maximizing the probability is equivalent to minimizing . The minimum possible value for is . Therefore, the optimal proximity function is: Now, we determine the optimal subsets , and . A triplet achieves this optimal value if and only if . Because γ is the only variable that can reach this value (since all elements in and are strictly less than 0.7), we must strictly choose , which means . However, any choice of and , when paired with , still satisfies .
Consequently, all elements of and participate in realizing the optimal proximity, yielding: In the context of best proximity points, a standard geometric property often required to ensure the uniqueness or existence of solutions is the P-property. We adapt its definition to the context of triplets in non-Archimedean G-Menger spaces as follows:
Definition 9.
Let be a non-Archimedean generalized Menger space and let be nonempty subsets of . The triplet ) is said to satisfy the probabilistic P-property if, for any elements , and , the following implication holds:for all . To provide a clear, non-trivial geometric illustration of the probabilistic P-property, let us consider the following example involving parallel sets.
Example 4.
Let be equipped with the standard probabilistic G-metric induced by the Euclidean distance d, such that , and the distribution function is given byConsider three parallel horizontal lines in :Let , , and . The sum of the distances between these three points is strictly bounded below by the vertical distances between the lines:This minimal geometric distance is achieved if and only if the three points are perfectly vertically aligned, meaning . Consequently, the optimal proximity function is . Now, suppose we have three combinations of elements that achieve this optimal distance:Based on our previous observation, this implies that for each i, the points must be vertically aligned, so there exist real numbers such that , , and . We can now compute the G-distance between the elements of , between the elements of , and between the elements of : Because shifting the points vertically by 1 or 2 units does not change horizontal Euclidean distances, it trivially follows that:Therefore, substituting these equal G-distances into the probabilistic function yields:which proves that the probabilistic P-property is satisfied in this non trivial geometry. Definition 10.
Let be a non-Archimedean generalized Menger space and non-empty subsets of . Consider a mapping satisfyingA point is called a best proximity point of f if it fulfills the condition To illustrate this definition cohesively, let us return to the geometric setting of the three parallel lines introduced in the previous example (4).
Example 5.
Recall our space with the standard probabilistic G-metric, and the three parallel lines:We previously established that the optimal proximity function is , and this optimal value is achieved if and only if the three points share the same horizontal coordinate. Now, let us define a cyclic mapping as follows:It is trivial to verify that , , and , satisfying the cyclic condition. We want to find a best proximity point for f. Let . Applying the mapping twice yields:According to Definition 10, α is a best proximity point if and only if . As established, this requires the three points , and to be perfectly aligned vertically. Therefore, their horizontal coordinates must be strictly equal:The only real number satisfying this equation is . Thus, is a best proximity point in . Similarly, one can easily verify that and are also best proximity points for this cyclic mapping. We now introduce two families of auxiliary functions that will govern our contraction conditions.
Denote by the collection of all functions satisfying:
- 1.
is monotone decreasing: if then for all ;
- 2.
is continuous on ;
- 3.
if and only if .
Denote by the collection of all functions satisfying:
- 1.
is lower semi-continuous on ;
- 2.
if and only if .
To illustrate these definitions and avoid redundant verifications in subsequent applications, we present the following standard prototypes of functions belonging to these classes. Consider the mappings
defined by:
It is straightforward to verify that : it maps into , is strictly decreasing, continuous, and satisfies .
Similarly, because it is continuous and . These specific functions will serve as our primary models throughout the examples in this paper.
Definition 11.
Let be a non-Archimedean generalized Menger space and non-empty subsets with defined as above. A mapping such that , , and is called a -weak proximal contraction if there exist functions and with the following property:
For all , , , and every , whenever Remark 2.
For the -weak proximal contraction to be mathematically well posed, the left-hand side of the inequality, , is non-negative since . Consequently, this logically forces the right-hand side to be non-negative as well. Therefore, throughout this paper, we inherently assume that any valid pair of control functions satisfies the condition for all . Our prototype functions clearly satisfy this structural requirement since .
To explicitly demonstrate a mapping satisfying this contraction, let us provide the following example.
Example 6.
Let equipped with the standard probabilistic G-metric where and the distribution functionLet our subsets be . Since the sets intersect, the optimal proximity function is , which implies . Let us define the control functions and as follows:Define the mapping as the constant function . To verify the -weak proximal contraction, assume that for elements and , the antecedent holds:Since for all x, we have . The condition implies , which strictly forces . Following the same logic for the other sets, we necessarily obtain and . Therefore, their proximity is . Substituting these values into the required contraction inequality yields:Since probabilities are bounded by , the expression on the right side is always non-negative. Thus, the inequality unconditionally holds for any initial choice of , perfectly satisfying Definition 11. Before stating our main result, we introduce a geometric condition necessary to ensure the consistency of the iterative sequence within the proximal sets.
Definition 12.
Let be a non-Archimedean generalized Menger space and let be nonempty subsets of . A mapping such that , , and is said to be proximal admissible on if for every , there exists an element such that: To provide a tangible illustration of proximal admissibility, we rely once more on the geometric structure of three parallel lines.
Example 7.
Consider with the standard probabilistic G-metric, and let us reuse the three horizontal parallel lines:We know that the optimal proximity is , and this optimal value is reached if and only if three points chosen from , and are vertically aligned (i.e., they share the same horizontal coordinate). Let us define a mapping as follows:Clearly, , , and . To check if f is proximal admissible on , let be an arbitrary element in . Applying the mapping yields:According to Definition 10, we must find an element such that . Based on the vertical alignment requirement, this equation holds if and only if u shares the same horizontal coordinate as and , which is . Since contains all points on the line , the element is guaranteed to exist in . With this choice of u, the points , , and are perfectly aligned, yielding:Since such a u exists for every possible choice of α, the mapping f is proven to be proximal admissible on . Remark 3.
It is crucial to distinguish Definition 12 from the probabilistic P-property Definition 9. While the P-property imposes a rigid, global isometric structure on the proximal subsets, proximal admissibility is a much more flexible, local condition.
Geometrically and dynamically, proximal admissibility simply ensures that the mapping f respects the optimal proximity structure along its orbits. When an element is mapped forward to and , the admissibility hypothesis guarantees that these projected points do not “drift” into a region where the optimal distance cannot be formed. Instead, it ensures the existence of a base point that perfectly completes the optimal triangular configuration. Thus, admissibility only concerns the preservation of this optimal geometric configuration along the specific sequence generated by f, rather than demanding a global geometric constraint on the entire space.
Theorem 1.
Let be a complete non-Archimedean generalized Menger space with a 1-boundary continuous triangular norm ⊡
. Consider three non-empty closed subsets of for which the associated sets , , and are non-empty. Letbe a mapping proximal admissible on satisfying the following hypotheses: - (i)
, , and .
- (ii)
f is a -weak proximal contraction for some and .
- (iii)
If , , and are such thatthen necessarily . (Analogous statements hold for and .)
Then f possesses a unique best proximity point . Consequently, there exist corresponding points and such that forms a best proximity triplet.
Proof. Consider an arbitrary element
belonging to
. Since
and
, we have
and
. By the hypothesis that
f is proximal admissible, there exists
such that
By successive iteration, we produce a sequence
within
which fulfills
Suppose there exists
such that
for all
. Then we deduce that
Hence, the identity
holds trivially, and
constitutes a best proximity point of the mapping
f, forming a triple with
and
. Thus, it is sufficient to assume in the sequel that
which is equivalent to the requirement
, for every
. Since
f is a
-weak proximal contraction, the proximal relations at consecutive steps yield
Because
is monotone decreasing, it follows from (5) that
Thus, for any fixed
, the sequence
is increasing and bounded above by 1, hence it lies within
. Defining
We now show that
for every
. To see this, take the limit as
in inequality (5) and make use of the continuity of
along with the lower semi-continuity of
; this yields
which necessarily implies
and consequently
for all
.
Next, we establish that
is a Cauchy sequence. Assume, for the sake of contradiction, that
is not a Cauchy. Then one can choose numbers
and
with the property that for each positive integer
k there are indices
satisfying
and
Let
denote the least integer exceeding
that satisfies the inequality above,
So, for all
, we obtain using the rectangle inequality (
2):
Since
(as sequences of consecutive terms converge) and ⊡ is continuous at 1-boundary, we deduce that
Taking into account that by (6),
for every
. Applying Proposition 1, we deduce that
so that
Next, for all strictly positive natural number
k, using the rectangle inequality of the non-Archimedean generalized Menger (
2), we have
Clearly, from the convergence of consecutive terms,
and
as
. Also, by (7) we established that
, and
. Thus, from Proposition 1, we can obtain
As a consequence,
From relation (4) derived earlier, we know that
and
Next, by the
-weak proximal contraction condition of
f, we have
Taking the limit as
in the above inequality, and using the continuity of
and lower semi-continuity of
, we get
which contradicts the property of
(since
). Thus, our assumption was wrong, and
is a Cauchy sequence in
.
The completeness of
ensures that the sequence
converges to some
, i.e.,
Moreover,
This implies that
Passing to the limit as
in the inequality above, we obtain
that is
and so by condition (iii) of Theorem 1,
. Since
,
and
, then by the hypothesis that
f is proximal admissible, there exists
such that
From (4) and (8), together with the contraction property of
f, we deduce:
Passing to the limit as
, using the continuity of
and
, and the lower semi continuity of
, we obtain
which implies that
Since
, by the uniqueness of the limit, we conclude that
. Thus, substituting
with
in (8), we get:
This establishes that
is a best proximity point of
f.
Finally, to prove the uniqueness of the best proximity point, let us assume there exists another best proximity point . This means that for all . Since is also a best proximity point, we already know that .
Applying the
-weak proximal contraction property of
f to these two points, we obtain:
This inequality simplifies to
. Since
, we necessarily have
, which in turn implies that
for all
. By the properties of the generalized Menger space, this yields
. Thus, the best proximity point is unique, completing the proof. □
To demonstrate the applicability of Theorem 1, we provide the following concrete example.
Example 8.
Let be endowed with the sum metricWe define the non-Archimedean generalized Menger space using the standard probabilistic metricequipped with the continuous triangular norm . Consider the three closed, parallel subsets: The optimal proximity is achieved for vertically aligned points, yieldingNote that , , and . Let us define the mapping as: Condition (i) of Theorem 1 is obviously satisfied.
To verify that f is proximal admissible, let . Then and . By choosing , the triplet is vertically aligned, achieving the optimal distance .
To verify that f is -weak proximal contraction: Let and be in . The unique elements that satisfy the optimal distance relations with their respective forward orbits are and . First, we evaluate the probabilistic distances:Let us define the functions and bySubstituting our probabilistic distances into these functions, we obtain:Thus, the required inequality is satisfied as an exact identity:Hence, f is rigorously a -weak proximal contraction. Topological property: Let , , and . Assume that for all :This limit holds if and only if . By the definition of our metric:For the limit to equal 4, we must have , which forces and . Since is an element of , and we have previously established that , it trivially follows that . Therefore, condition (iii) is analytically verified. Thus, all conditions of Theorem 1 are satisfied, and consequently f admits a best proximity point. Indeed, one easily checks that (and similarly and ) is such a point, since , and the triplet achieves the optimal distance .
As a consequence of Theorem 1, we have the following. Building directly upon the framework established in Theorem 1, we derive a simplified version that imposes stronger topological assumptions on the proximal sets.
Remark 4.
In Theorem 1, Condition (iii) becomes superfluous if we assume that the proximal sets , and are closed.
To see this, consider the situation that arises in the proof: we have sequences and (constructed as and ) which are Cauchy and therefore converge in the complete space . By the closedness of and , their limits satisfy and . If is such thatthen the continuity of yieldsSince and , the very definition of forces α to belong to . Notice that this argument uses only the closedness of the proximal sets and ; the closedness of the original sets is not required. Consequently, in any version of Theorem 1 where are assumed to be closed, Condition (iii) can be omitted without affecting the validity of the proof.
Theorem 2.
Let be a complete generalized Menger space whose triangular norm ⊡ is 1-boundary continuous. Let be three non-empty subsets of and assume that the proximal sets are non-empty and closed. Suppose is a mapping proximal admissible satisfying:
- (i)
, , and ;
- (ii)
f is a -weak proximal contraction.
Then f admits a unique best proximity point .
To highlight the specific utility of Theorem 2 and the preceding Remark, we present an example where the original subsets are not necessarily closed, but their proximal counterparts are closed, non-empty, and perfectly admit a unique best proximity point without requiring Condition (iii).
Example 9.
Let be endowed with the G-metricWe define the generalized Menger space using the probabilistic metricand the continuous triangular norm . Consider the three subsets of :Notice that is strictly not closed. The optimal G-metric distance between these sets is achieved exclusively when the x-coordinates are identical. Because elements in and are restricted to , the optimal vertical alignment can only occur if the element in also has its x-coordinate in . Thus, the minimum distance is , yielding . Consequently, the proximal sets are:Remarkably, even though is not closed, the proximal set is completely closed and non-empty. This perfectly fits the topological framework of Theorem 2. Let us define the proximal admissible mapping such that:We verify the cyclic behavior on the proximal sets:For Condition (ii), we use the exact same rigorous analytical contraction established in the example of Theorem 1. By definingFor any and in alongside their optimal projection elements and in , we obtain the exact identity:Thus, f is a -weak proximal contraction. Since , and are closed, Theorem 2 guarantees the existence of a unique best proximity point without needing to check any sequence convergence limits (Condition iii of Theorem 1). Indeed, the unique best proximity point is .
3.3. Fixed Point Consequences
In this section, we demonstrate that the classical fixed point theorems are natural consequences of our main result. By specializing the geometric configuration to the case where the three subsets coincide with the entire space, i.e., , the concept of a best proximity point naturally reduces to that of a fixed point.
Indeed, in this setting, the probabilistic distance between the sets becomes maximal, satisfying
Consequently, the proximal sets are trivial, with
. Furthermore, the condition for a point
to be a best proximity point,
implies that
Thus,
is a fixed point. Finally, recall that condition (iii) of Theorem 1 requires that if a sequence converges to the optimal distance, the limit point must belong to the proximal set
. Specifically:
Since is an element of the universe , the conclusion is always true regardless of the sequence’s behavior. Thus, the implication holds as a tautology.
Therefore, the existence and uniqueness of a fixed point follow directly from Theorem 1 without the need for an independent proof.
We formally state the contraction condition and the resulting theorem below.
Definition 13.
Let be a non-Archimedean generalized Menger space. A self-mapping is called a -contraction if there exist functions and such that, for all and every , Theorem 3.
Let be a complete non-Archimedean generalized Menger space whose triangular norm ⊡ is 1-boundary continuous. If is a -contraction, then f possesses a unique fixed point .
To explicitly illustrate the concept of a -contraction introduced in Definition 13, and to concurrently demonstrate the practical applicability of Theorem 3, we provide the following concrete example.
Example 10.
Let be equipped with the standard G-metric defined byConsider the non-Archimedean generalized Menger space endowed with the probabilistic metricand the continuous triangular norm . Let the self-mapping be defined by the classic geometric contraction . For any , we compute the G-metric of the mapped points:Consequently, the probabilistic distance becomes: Let us define the functions and exactly as in our previous proximity model:Evaluating the components of the contraction condition (Equation (9)), we obtain the left-hand side:For the right-hand side, we have:Subtracting these yields exactly the left-hand side:Therefore, the inequalityis perfectly satisfied as an exact identity for all and . Thus, is rigorously proven to be a -contraction on this space, admitting the unique fixed point . 3.4. Application to the Computer Science
We now illustrate the applicability of our theoretical framework to theoretical computer science, specifically to the domain of finite and infinite words.
Let be a non-empty alphabet and denote by the set of all finite and infinite words over . The empty word is denoted by .
We equip
with the prefix order ⪯ defined by
For every non-empty word
, its length is denoted by
; we set
. If
is finite we write
otherwise we write
For
, the longest common prefix of the three words is written as
. Observe that
holds precisely when they are mutual prefixes of one another and have the same length. We define a generalized Menger structure on
by
Equipping this space with the product triangular norm , one verifies that becomes a complete non-Archimedean generalized Menger space.
The analysis of the Quicksort algorithm leads to the well-known recurrence (see, e.g., [
17])
To connect this recurrence with our fixed point framework, we take the alphabet
and define a mapping
as follows. For a word
, we set
where
The mapping
f preserves the prefix order:
if and only if
. Consequently,
which implies the inequality between lengths:
We now invoke Theorem 3 to demonstrate that
f admits a fixed point. Define auxiliary functions
and
by
Both functions are continuous on , strictly decreasing, and satisfy .
Two cases are considered.
Case 1: . Then for every , and the contraction inequality holds trivially.
Case 2:
are not all equal. Let
and
. From (10) we have
. Hence
Set
. Then
A direct computation shows that
Thus, for every
and every
,
Since
f satisfies the
-contraction condition (9), all hypotheses of Theorem 3 are satisfied. Consequently,
f possesses a unique fixed point
; translating the equality
letter-by-letter yields exactly the Quicksort recurrence. Hence, we obtain