Skip to Content
MathematicsMathematics
  • Article
  • Open Access

24 April 2026

Best Proximity Point for (ϰϝ)-Weak Proximal Contraction in Non-Archimedean Generalized Menger Space with Application to Computer Science

,
,
,
,
and
1
Department of Mathematics and Computer Science, Normal Higher School, Abdelmalek Essaadi University, P.O. Box 209, Tetouan 93000, Morocco
2
Department of Mathematics and Informatics, Faculty of Science, University of Kragujevac, Radoja Domanovića 12, 34000 Kragujevac, Serbia
3
Faculty of Mechanical Engineering, University of Belgrade, Kraljice Marije 16, 11120 Belgrade, Serbia
*
Author to whom correspondence should be addressed.
This article belongs to the Section C: Mathematical Analysis

Abstract

This paper introduces a novel framework by merging the concepts of non-Archimedean generalized Menger spaces and ( ϰ ϝ )-weak proximal contractions. Extending the best proximity point concept to a triple of sets, we establish new existence theorems for these contractions without requiring the probabilistic P-property, representing a meaningful advancement beyond prior findings, which is a significant generalization of existing results. The study leverages two control functions ( ϰ and ϝ ) within the contraction condition to derive optimal approximate solutions to fixed-point equations for non-self mappings. Consequently, our core results not only extend but also unify a range of established theorems within classical probabilistic and G-metric spaces. We present a significant application to theoretical computer science by proving that a self-mapping acting on infinite words possesses a unique fixed point.

1. Introduction

Fixed-point theory serves as a foundational pillar of nonlinear analysis, with profound applications across differential equations, optimization, computational mathematics, and integral equations. Among its key generalizations, the concept of best proximity points extends classical fixed point results to non-self mappings, providing solutions to equations of the form f ( x ) = x when the mapping does not preserve the domain. This theory has been extensively developed in various generalized metric spaces, particularly in probabilistic frameworks introduced by Menger [1] and formalized by Schweizer and Sklar [2,3]. These probabilistic metric spaces offer a robust structure for modeling uncertainty and approximation behavior, forming the basis for subsequent generalizations such as the generalized Menger (probabilistic G-metric) spaces introduced by Zhou et al. [4], which unify several prior approaches. Within this evolving landscape, best proximity point theory has seen significant advances through the work of researchers such as Saadati [5], Su and Zhang [6], Vetro and Salimi [7], and Basit et al. [8], who typically rely on structural conditions like the probabilistic P-property or metric convexity to guarantee existence and uniqueness, a common thread that our research shares in its core objective.
However, our work introduces several meaningful innovations that distinguish it from earlier studies while building upon this established foundation. To clearly delineate our contributions and explicitly connect them with the aforementioned literature, we propose a novel hybrid framework that merges the concepts of non-Archimedean generalized Menger spaces with ( ϰ ϝ ) -weak proximal contractions. Unlike the majority of existing results that are restricted to pairs of sets, we extend the best proximity point concept to a triple of sets ( A , B , C ) . This extension provides a more flexible tool for analyzing cyclic mappings and multi-set optimization problems, a direction relatively unexplored in the current literature. Furthermore, a major theoretical advantage of our approach is the complete elimination of the probabilistic P-property, while this restrictive condition is commonly assumed in earlier works to guarantee convergence, bypassing it offers a significant generalization that directly aligns with recent advances by Zhou et al. [9] in fuzzy metric spaces. Finally, inspired by the latest developments in weak contraction theory [10,11,12,13], we employ two families of auxiliary control functions ( ϰ and ϝ ) to govern the contraction condition. This dual-function strategy relaxes traditional continuity and completeness assumptions, enabling substantially weaker contraction hypotheses while rigorously ensuring the existence and uniqueness of the best proximity point.
Our results are presented in a coherent, integrated structure that progresses logically from foundations to applications. We begin by establishing the necessary preliminaries on non-Archimedean generalized Menger spaces, convergence, and topology. We then introduce the best proximity point theory for triples of sets, define ( ϰ ϝ ) -weak proximal contractions, and prove our main existence and uniqueness theorems (Theorems 1 and 2). To render our theoretical findings more concrete and to explicitly support these results, we have constructed detailed illustrative examples for both Theorems 1 and 2. These theorems are intrinsically linked: Theorem 2 emerges as a corollary under stronger topological assumptions, demonstrating the adaptability of our framework. Next, we show how these best proximity results naturally specialize to fixed point theorems when A = B = C , thereby unifying and extending classical fixed point theory in these spaces, as seen in prior works such as Choudhury and Maity [14]. Finally, we provide a concrete application to the domain of finite and infinite words, building on earlier constructions by Romaguera et al. [15] and Roldán López de Hierro et al. [16], and demonstrating how our abstract theory applies to algorithmic recurrences like that of Quicksort [17]. This progression ensures that each part of the paper builds upon the previous, culminating in a comprehensive theory that connects best proximity points, fixed points, and practical applications.
Scientifically, this research contributes significantly by generalizing and unifying a range of classical theorems in probabilistic metric, G-metric, and fuzzy metric spaces. It opens new avenues for research in fixed point theory, particularly in the study of cyclic mappings and multi-valued contractions in non-Archimedean settings, and invites exploration in other generalized spaces such as strong probabilistic b-metric spaces [18,19]. By bridging pure mathematical analysis with computational theory through rigorous applications, as in the recent work of Laakel et al. [20], we encourage further cross-disciplinary research and advance both the theoretical foundations and practical relevance of best proximity point theory.

2. Materials and Methods

We begin by recalling fundamental definitions, notations, and established results that serve as the foundation for our subsequent analysis.
Let R + denote the interval [ 0 , + ) , and by N the set of natural numbers. A central object in probabilistic metric theory is the set Δ + , which consists of all functions P : [ 0 , + ] [ 0 , 1 ] satisfying the following three properties:
1.
P is a monotone non-decreasing function.
2.
P is left-continuous on ( 0 , + ] .
3.
P ( 0 ) = 0 and P ( + ) = 1 .
Aparticularly important subset of Δ + is D + , defined by imposing a stricter limit condition at infinity:
D + = P Δ + : lim p + P ( p ) = 1 .
The elements of Δ + are known as distance distribution functions.
The set Δ + is endowed with a natural partial order, defined by the pointwise comparison of functions. Given two functions P and Q in Δ + , the relation P Q holds precisely when P ( p ) Q ( p ) for all p in the interval [ 0 , + ] . Within the ordered subset D + , the maximal element with respect to this order is the Heaviside distribution function ε 0 , defined as:
ε 0 ( p ) = 0 , p 0 , 1 , p > 0 .
Definition 1 
([2]). A triangular norm is a binary operation : [ 0 , 1 ] × [ 0 , 1 ] [ 0 , 1 ] that fulfills the following axioms for any x , y , z , w [ 0 , 1 ] :
1. 
( x , y ) = ( y , x ) .
2. 
x , ( y , z ) = ( x , y ) , z .
3. 
If x z and y w , then ( x , y ) ( z , w ) .
4. 
( x , 1 ) = x .
Example 1. 
Two basic examples of continuous triangular norms are:
  • M ( x , y ) = min { x , y } .
  • P ( x , y ) = x · y .
Definition 2 
([16]). A triangular norm is called 1-boundary continuous if it continuous at every point of the form ( 1 , q ) where q [ 0 , 1 ] . Formally, this means that for any convergent sequences { p n } 1 and { q n } q , we have
lim n + ( p n , q n ) = ( 1 , q ) = q .
It follows directly that any continuous triangular norm automatically possesses 1-boundary continuity.
Proposition 1 
([16]). Let be a 1-boundary continuous triangular norm, and consider five sequences { α n } , { β n } , { γ n } , { u n } , { v n } in [ 0 , 1 ] . Assume that:
  • α n L and v n L for some L [ 0 , 1 ] ,
  • β n 1 and u n 1 ,
  • the inequalities α n ( β n , ( γ n , u n ) ) v n hold for all n N .
Then the sequence { γ n } also converges to L.
Definition 3 
([1]). A Menger space is defined as a triple ( U , P , ) where is a triangular norm and P : U × U Δ + is a mapping (with P α , β denoting the value at ( α , β ) ) that satisfies the following axioms for all α , β , γ U and p , q 0 :
1. 
P α , β ( p ) = 1 for all p 0 is equivalent to α = β .
2. 
P α , β ( p ) = P β , α ( p ) .
3. 
P α , γ ( p + q ) P α , β ( p ) , P β , γ ( q ) .
As a natural generalization of the classical Menger space, the notion of a generalized Menger space was introduced by Zhou and collaborators [4].
Definition 4 
([4]). A generalized Menger space is a triple ( U , F , ) , where U is a non-empty set, and is a triangular norm. Let F : U × U × U D + be a mapping (and denote by F α , β , γ its value at the triple ( α , β , γ ) ). This mapping is required to satisfy the following properties for all α , β , γ U and all p > 0 :
1. 
F α , β , γ ( p ) = 1 is equivalent to α = β = γ .
2. 
F α , α , β ( p ) F α , β , γ ( p ) with β γ .
3. 
F α , β , γ ( p ) = F π ( α , β , γ ) ( p ) , where π ( α , β , γ ) is any permutation of α , β , γ .
4. 
For all a U and p , q 0 ,
F α , β , γ ( p + q ) F α , a , a ( p ) , F a , β , γ ( q ) .
Before diving into the formal definitions, it is essential to clarify the intuitive meaning of topology and convergence within the framework of generalized Menger spaces [4]. Unlike classical metric spaces where the topology is induced by a deterministic, real-valued distance between two points, the topology here is probabilistic and ternary. In this context, the “distance” is represented by a distribution function F α , β , γ ( t ) that measures the probability that the generalized distance between three points α , β , and γ is less than t. Consequently, the topology is generated by probabilistic ( ς , ϱ ) -neighborhood, and a sequence is said to converge to a limit if the probability of the generalized distance between the sequence terms and the limit being less than any t > 0 approaches 1 as the index goes to infinity. This establishes a robust framework for dealing with approximation and uncertainty.
Consider a generalized Menger space ( U , F , ) and fix a point a U . Given parameters ς > 0 and ϱ ( 0 , 1 ) , we define the ( ς , ϱ ) -neighborhood of a as the collection of all points b U satisfying both inequalities:
F a , b , b ( ς ) > 1 ϱ and F b , a , a ( ς ) > 1 ϱ .
This set is denoted by:
N a ( ς , ϱ ) = { b U : F a , b , b ( ς ) > 1 ϱ and F b , a , a ( ς ) > 1 ϱ } .
The family N = { N a ( ς , ϱ ) : a U , ς > 0 , ϱ > 0 } of all such neighborhoods generates a topology on U .
Building upon this topological framework, we now introduce fundamental convergence concepts for sequences, in generalized Menger spaces.
Definition 5 
([4]). Let ( U , F , ) be a generalized Menger space and { α n } n N a sequence in U .
1. 
The sequence { α n } is said to converge to a point γ U if, for every ς > 0 and ϱ ( 0 , 1 ) , there exists an integer M ς , ϱ > 0 such that
α n N γ ( ς , ϱ ) for all n > M ς , ϱ .
2. 
We say that { α n } is a Cauchy sequence when, for any given ς > 0 and ϱ ( 0 , 1 ) , one can find a positive integer M ς , ϱ such that
F α n , α m , α l ( ς ) > 1 ϱ holds for all n , m , l > M ς , ϱ .
3. 
In ( U , F , ) , completeness means that every Cauchy sequence possesses a limit in U .

3. Results

3.1. Non-Archimedean Generalized Menger Space

Definition 6. 
A generalized Menger space ( U , F , ) is said to be non-Archimedean if the inequality (1) in Definition 4 is replaced by the stronger inequality:
F α , γ , β ( max ( p , q ) ) F α , a , a ( p ) , F a , γ , β ( q )
which must hold for all α , γ , β , a U and p , q 0 . An equivalent formulation of this condition is:
F α , γ , β ( p ) F α , a , a ( p ) , F a , γ , β ( p ) for all α , γ , β , a U and p 0 .
To rigorously justify why Equation (2) is equivalent to the stronger inequality for all p , q 0 , notice that the case p = q is trivially given by Equation (2). For the case where p q , assume without loss of generality that p > q , meaning max ( p , q ) = p . Since the distribution function is non-decreasing, we have F a , γ , β ( p ) F a , γ , β ( q ) . Furthermore, because the triangular norm is non-decreasing in each of its arguments, applying Equation (2) yields:
F α , γ , β ( max ( p , q ) ) = F α , γ , β ( p ) F α , a , a ( p ) , F a , γ , β ( p ) F α , a , a ( p ) , F a , γ , β ( q )
which recovers the general non-Archimedean condition.
Example 2. 
Consider the interval U = [ 0 , 1 ) equipped with the triangular norm M . Define a mapping F : U 3 × [ 0 , + ) [ 0 , 1 ] by
F α , γ , β ( p ) = 0 , p = 0 , p p + max { α , γ , β } , p > 0 , for all α , γ , β U .
Then the triple ( U , F , M ) constitutes a non-Archimedean generalized Menger space.
Remark 1. 
For any non-Archimedean generalized Menger space ( U , F , ) , the following chain of inequalities holds for all α , γ , β , a U and p , q 0 :
F α , γ , β ( p + q ) F α , γ , β ( max ( p , q ) ) F α , a , a ( p ) , F a , γ , β ( q ) .
Consequently, every non-Archimedean generalized Menger space automatically satisfies the axioms of a generalized Menger space. The converse implication; however, does not generally hold.
Since every non-Archimedean generalized Menger space is a generalized Menger space, we adopt the natural topology introduced by Zhou et al. [4] for generalized Menger spaces.
Proposition 2. 
Let ( U , F , ) be a non-Archimedean generalized Menger space where is a 1-boundary continuous triangular norm. Then, the topology defined via the neighborhoods { N a ( ς , ϱ ) } is Hausdorff. Consequently, the limit of any convergent sequence in U is unique.
Proof. 
We need to show that for any two distinct points α , β U , there exist disjoint neighborhoods separating them. Since α β , by Definition 4 there exists some ς > 0 such that
a 1 = F α , β , β ( ς ) < 1 and a 2 = F β , α , α ( ς ) < 1 .
Set a = max { a 1 , a 2 } < 1 .
We can select numbers b 1 , b 2 ( 0 , 1 ) such that ( b 1 , b 2 ) > a . This is possible by the 1-boundary continuity of ⊡ and its monotonicity.
Now define two neighborhoods:
N α = { γ U : F α , γ , γ ( ς ) > b 1 and F γ , α , α ( ς ) > b 1 } , N β = { γ U : F β , γ , γ ( ς ) > b 2 and F γ , β , β ( ς ) > b 2 } .
Clearly α N α and β N β since F α , α , α ( ς ) = F β , β , β ( ς ) = 1 > b 1 , b 2 .
To establish the Hausdorff property, we show that N α N β = { } . Suppose, for contradiction, that there exists a point s N α N β . Then by definition:
F α , s , s ( ς ) > b 1 , F s , α , α ( ς ) > b 1 , F β , s , s ( ς ) > b 2 , F s , β , β ( ς ) > b 2 .
Applying the non-Archimedean inequality (2) with a = s , we obtain:
a 1 = F α , β , β ( ς ) F α , s , s ( ς ) , F s , β , β ( ς ) > ( b 1 , b 2 ) > a a 1 ,
which is impossible. Similarly,
a 2 = F β , α , α ( ς ) F β , s , s ( ς ) , F s , α , α ( ς ) > ( b 2 , b 1 ) > a a 2 ,
also a contradiction. Hence, no such s can exist, so N α and N β are disjoint neighborhoods of α and β , respectively. This proves that the ( ς , ϱ ) -topology is Hausdorff. □
Lemma 1. 
Let ( U , F , ) be a non-Archimedean generalized Menger space, where is a 1-boundary continuous triangular norm. For a sequence { α n } in U , the following conditions are equivalent:
1. 
{ α n } is a Cauchy sequence.
2. 
For any ς > 0 and ϱ ( 0 , 1 ) , one can find M N such that
F α n , α m , α m ( ς ) > 1 ϱ for every pair n , m > M .
Proof. 
We prove both implications separately.
  • 1 ⇒ 2: This can be easily obtained from 2 of Definition 4.
  • 2 ⇒ 1: Assume condition 2 holds. Since ⊡ is 1-boundary continuous, for given ς > 0 and ϱ > 0 , we can choose ϱ 0 ( 0 , ϱ ) such that
( 1 ϱ 0 , 1 ϱ 0 ) > 1 ϱ .
By Hypothesis 2 applied with ϱ 0 , there exists M N such that
F α n , α m , α m ( ς ) > 1 ϱ 0 and F α l , α m , α m ( ς ) > 1 ϱ 0
for all n , m , l M . Using the non-Archimedean property (2), we have:
F α n , α m , α l ( ς ) F α n , α m , α m ( ς ) , F α l , α m , α m ( ς ) ( 1 ϱ 0 , 1 ϱ 0 ) > 1 ϱ .
This verifies the Cauchy criterion. □
Lemma 2. 
Let ( U , F , ) be a non-Archimedean generalized Menger space, where is a 1-boundary continuous triangular norm. Let { α n } , { β n } , { γ n } be three sequences in in U converging, respectively, to points α , β , γ U . Then, for every p > 0 :
lim n + F α n , β n , γ n ( p ) = F α , β , γ ( p ) .
Proof. 
Let p > 0 be fixed. Since the sequences converge, for any sufficiently small ϵ > 0 (specifically, choose ϵ < p ), we have:
lim n + F α n , α , α ( ϵ ) = 1 , lim n + F β n , β , β ( ϵ ) = 1 , lim n + F γ n , γ , γ ( ϵ ) = 1 .
We first establish the lower bound for the limit. Using the non-Archimedean triangle inequality repeatedly with the pivot points α , β , γ :
F α n , β n , γ n ( p ) = F α n , β n , γ n ( max ( ϵ , p ) ) F α n , α , α ( ϵ ) , F α , β n , γ n ( p ) F α n , α , α ( ϵ ) , F β n , β , β ( ϵ ) , F α , β , γ n ( p ) F α n , α , α ( ϵ ) , F β n , β , β ( ϵ ) , ( F γ n , γ , γ ( ϵ ) , F α , β , γ ( p ) ) .
Taking the limit inferior as n + , and utilizing the continuity of ⊡ at ( 1 , 1 ) (where ( 1 , x ) = x ):
lim n + F α n , β n , γ n ( p ) ( 1 , ( 1 , ( 1 , F α , β , γ ( p ) ) ) ) = F α , β , γ ( p ) .
Next, we establish the upper bound by reversing the roles. We express the limit term F α , β , γ ( p ) using the sequence terms:
F α , β , γ ( p ) = F α , β , γ ( max ( ϵ , p ) ) F α , α n , α n ( ϵ ) , F β , β n , β n ( ϵ ) , ( F γ , γ n , γ n ( ϵ ) , F α n , β n , γ n ( p ) ) .
Taking the limit superior as n + , we get:
F α , β , γ ( p ) lim n + F α n , β n , γ n ( p ) .
Combining this with inequality (3), we obtain:
F α , β , γ ( p ) lim n + F α n , β n , γ n ( p ) lim n + F α n , β n , γ n ( p ) F α , β , γ ( p ) .
This forces equality:
lim n + F α n , β n , γ n ( p ) = F α , β , γ ( p ) .

3.2. Best Proximity Point Theory in Triple Settings

Throughout this section, let ( U , F , ) denote a non-Archimedean generalized Menger space, and let A , B , and C be three non-empty subsets of U . We begin by introducing several key constructions.
Definition 7. 
For the triple ( A , B , C ) , we define the optimal proximity function F A , B , C : ( 0 , + ) [ 0 , 1 ] by
F A , B , C ( p ) = sup { F α , β , γ ( p ) : α A , β B , γ C } , p > 0 .
This value represents the optimal probabilistic proximity achievable among elements of the sets A , B , and C . Indeed, since F α , β , γ ( p ) 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 A , B , and C of a non-Archimedean generalized Menger space ( U , F , ) , the following terminology is applied throughout.
Definition 8. 
We associate to each set a subset of points that can attain this optimal value:
A 0 = α A : β B , γ C satisfying F α , β , γ ( p ) = F A , B , C ( p ) for all p > 0 , B 0 = β B : α A , γ C satisfying F α , β , γ ( p ) = F A , B , C ( p ) for all p > 0 , C 0 = γ C : α A , β B satisfying F α , β , γ ( p ) = F A , B , C ( p ) for all p > 0 .
The sets A 0 , B 0 , C 0 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 U = [ 0 , 1 ) equipped with the mapping
F α , β , γ ( p ) = 0 , p = 0 , p p + max { α , β , γ } , p > 0 , α , γ , β U .
Let us define three closed subsets of U :
A = 1 10 , 2 10 , B = 4 10 , 5 10 , C = 7 10 , 8 10 .
For any triplet ( α , β , γ ) A × B × C , it is clear from the intervals that α < β < γ , which means max { α , β , γ } = γ . To find the optimal proximity function F A , B , C ( p ) , we must take the supremum of F α , β , γ ( p ) over all such triplets. Since the function f ( x ) = p p + x is strictly decreasing for x 0 , maximizing the probability is equivalent to minimizing max { α , β , γ } = γ .
The minimum possible value for γ C is 7 10 . Therefore, the optimal proximity function is:
F A , B , C ( p ) = p p + 0.7 .
Now, we determine the optimal subsets A 0 , B 0 , and C 0 . A triplet ( α , β , γ ) achieves this optimal value if and only if max { α , β , γ } = 0.7 . Because γ is the only variable that can reach this value (since all elements in A and B are strictly less than 0.7), we must strictly choose γ = 0.7 , which means C 0 = { 0.7 } . However, any choice of α A and β B , when paired with γ = 0.7 , still satisfies max { α , β , 0.7 } = 0.7 .
Consequently, all elements of A and B participate in realizing the optimal proximity, yielding:
A 0 = A = 1 10 , 2 10 , B 0 = B = 4 10 , 5 10 , C 0 = 7 10 .
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 ( U , F , ) be a non-Archimedean generalized Menger space and let A , B , C be nonempty subsets of U . The triplet ( A , B , C ) ) is said to satisfy the probabilistic P-property if, for any elements α 1 , α 2 , α 3 A , β 1 , β 2 , β 3 B and γ 1 , γ 2 , γ 3 C , the following implication holds:
F α 1 , β 1 , γ 1 ( p ) = F A , B , C ( p ) F α 2 , β 2 , γ 2 ( p ) = F A , B , C ( p ) F α 3 , β 3 , γ 3 ( p ) = F A , B , C ( p ) F α 1 , α 2 , α 3 ( p ) = F β 1 , β 2 , β 3 ( p ) = F γ 1 , γ 2 , γ 3 ( p ) ,
for all p > 0 .
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 U = R 2 be equipped with the standard probabilistic G-metric induced by the Euclidean distance d, such that G ( α , β , γ ) = d ( α , β ) + d ( β , γ ) + d ( γ , α ) , and the distribution function is given by
F α , β , γ ( p ) = 0 , p = 0 , p p + G ( α , β , γ ) , p > 0 , α , γ , β U .
Consider three parallel horizontal lines in R 2 :
A = { ( x , 0 ) : x R } , B = { ( x , 1 ) : x R } , C = { ( x , 2 ) : x R } .
Let α = ( x 1 , 0 ) A , β = ( x 2 , 1 ) B , and γ = ( x 3 , 2 ) C . The sum of the distances between these three points is strictly bounded below by the vertical distances between the lines:
G ( α , β , γ ) | 0 1 | + | 1 2 | + | 2 0 | = 1 + 1 + 2 = 4 .
This minimal geometric distance G = 4 is achieved if and only if the three points are perfectly vertically aligned, meaning x 1 = x 2 = x 3 . Consequently, the optimal proximity function is F A , B , C ( p ) = p p + 4 .
Now, suppose we have three combinations of elements that achieve this optimal distance:
F α i , β i , γ i ( p ) = F A , B , C ( p ) for i { 1 , 2 , 3 } .
Based on our previous observation, this implies that for each i, the points must be vertically aligned, so there exist real numbers x 1 , x 2 , x 3 such that α i = ( x i , 0 ) , β i = ( x i , 1 ) , and γ i = ( x i , 2 ) .
We can now compute the G-distance between the elements of A , between the elements of B , and between the elements of C :
G ( α 1 , α 2 , α 3 ) = d ( ( x 1 , 0 ) , ( x 2 , 0 ) ) + d ( ( x 2 , 0 ) , ( x 3 , 0 ) ) + d ( ( x 3 , 0 ) , ( x 1 , 0 ) ) = | x 1 x 2 | + | x 2 x 3 | + | x 3 x 1 | .
Because shifting the points vertically by 1 or 2 units does not change horizontal Euclidean distances, it trivially follows that:
G ( α 1 , α 2 , α 3 ) = G ( β 1 , β 2 , β 3 ) = G ( γ 1 , γ 2 , γ 3 ) .
Therefore, substituting these equal G-distances into the probabilistic function yields:
F α 1 , α 2 , α 3 ( p ) = F β 1 , β 2 , β 3 ( p ) = F γ 1 , γ 2 , γ 3 ( p ) ,
which proves that the probabilistic P-property is satisfied in this non trivial geometry.
Definition 10. 
Let ( U , F , ) be a non-Archimedean generalized Menger space and A , B , C non-empty subsets of U . Consider a mapping f : A B C A B C satisfying
f ( A ) B , f ( B ) C , f ( C ) A .
A point α A B C is called a best proximity point of f if it fulfills the condition
F α , f α , f 2 α ( p ) = F A , B , C ( p ) for every p > 0 .
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 U = R 2 with the standard probabilistic G-metric, and the three parallel lines:
A = { ( x , 0 ) : x R } , B = { ( x , 1 ) : x R } , C = { ( x , 2 ) : x R } .
We previously established that the optimal proximity function is F A , B , C ( p ) = p p + 4 , 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 f : A B C A B C as follows:
f ( x , 0 ) = x 2 , 1 , f ( x , 1 ) = x 2 , 2 , f ( x , 2 ) = x 2 , 0 .
It is trivial to verify that f ( A ) B , f ( B ) C , and f ( C ) A , satisfying the cyclic condition.
We want to find a best proximity point for f. Let α = ( x , 0 ) A . Applying the mapping twice yields:
f α = x 2 , 1 B and f 2 α = f x 2 , 1 = x 4 , 2 C .
According to Definition 10, α is a best proximity point if and only if F α , f α , f 2 α ( p ) = p p + 4 . As established, this requires the three points α ,   f α , and f 2 α to be perfectly aligned vertically. Therefore, their horizontal coordinates must be strictly equal:
x = x 2 = x 4 .
The only real number satisfying this equation is x = 0 . Thus, α = ( 0 , 0 ) is a best proximity point in A . Similarly, one can easily verify that ( 0 , 1 ) B and ( 0 , 2 ) C 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 ϰ : ( 0 , 1 ] [ 0 , + ) satisfying:
1.
ϰ is monotone decreasing: if p q then ϰ ( p ) ϰ ( q ) for all p , q ( 0 , 1 ] ;
2.
ϰ is continuous on ( 0 , 1 ] ;
3.
ϰ ( p ) = 0 if and only if p = 1 .
Denote by Θ the collection of all functions ϝ : ( 0 , 1 ] [ 0 , + ) satisfying:
1.
ϝ is lower semi-continuous on ( 0 , 1 ] ;
2.
ϝ ( p ) = 0 if and only if p = 1 .
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 ϰ , ϝ : ( 0 , 1 ] [ 0 , + ) defined by:
ϰ ( t ) = 1 t 1 and ϝ ( t ) = 1 2 1 t 1 .
It is straightforward to verify that ϰ Ξ : it maps ( 0 , 1 ] into [ 0 , + ) , is strictly decreasing, continuous, and satisfies ϰ ( t ) = 0 t = 1 .
Similarly, ϝ Θ because it is continuous and ϝ ( t ) = 0 t = 1 . These specific functions will serve as our primary models throughout the examples in this paper.
Definition 11. 
Let ( U , F , ) be a non-Archimedean generalized Menger space and A , B , C non-empty subsets with A 0 , B 0 , C 0 defined as above. A mapping f : A B C A B C such that f ( A 0 ) B 0 , f ( B 0 ) C 0 , and f ( C 0 ) A 0 is called a ( ϰ ϝ ) -weak proximal contraction if there exist functions ϰ Ξ and ϝ Θ with the following property:
For all α , u A 0 , β , v B 0 , γ , w C 0 , and every p > 0 , whenever
F u , f α , f 2 α ( p ) = F A , B , C ( p ) F v , f β , f 2 β ( p ) = F A , B , C ( p ) F w , f γ , f 2 γ ( p ) = F A , B , C ( p ) implies ϰ ( F u , v , w ( p ) ) ϰ ( F α , β , γ ( p ) ) ϝ ( F α , β , γ ( p ) ) .
Remark 2. 
For the ( ϰ ϝ ) -weak proximal contraction to be mathematically well posed, the left-hand side of the inequality, ϰ ( F α , β , γ ( p ) ) , is non-negative since ϰ ( p ) 0 . 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 ϝ ( p ) ϰ ( p ) for all p ( 0 , 1 ] . Our prototype functions clearly satisfy this structural requirement since ϝ ( p ) = 1 2 ϰ ( p ) ϰ ( p ) .
To explicitly demonstrate a mapping satisfying this contraction, let us provide the following example.
Example 6. 
Let U = [ 0 , 1 ] equipped with the standard probabilistic G-metric where G ( α , β , γ ) = d ( α , β ) + d ( β , γ ) + d ( γ , α ) and the distribution function
F α , β , γ ( p ) = 0 , p = 0 , p p + G ( α , β , γ ) , p > 0 , α , γ , β U .
Let our subsets be A = B = C = [ 0 , 1 ] . Since the sets intersect, the optimal proximity function is F A , B , C ( p ) = 1 , which implies A 0 = B 0 = C 0 = [ 0 , 1 ] .
Let us define the control functions ϰ Ξ and ϝ Θ as follows:
ϰ ( t ) = 1 t 1 and ϝ ( t ) = 1 2 1 t 1 .
Define the mapping f : U U as the constant function f ( x ) = 0 .
To verify the ( ϰ ϝ ) -weak proximal contraction, assume that for elements α , β , γ U and u , v , w U , the antecedent holds:
F u , f α , f 2 α ( p ) = 1 , F v , f β , f 2 β ( p ) = 1 , F w , f γ , f 2 γ ( p ) = 1 .
Since f ( x ) = 0 for all x, we have f α = f 2 α = 0 . The condition F u , 0 , 0 ( p ) = 1 implies G ( u , 0 , 0 ) = 0 , which strictly forces u = 0 . Following the same logic for the other sets, we necessarily obtain v = 0 and w = 0 . Therefore, their proximity is F u , v , w ( p ) = F 0 , 0 , 0 ( p ) = 1 .
Substituting these values into the required contraction inequality yields:
ϰ ( F u , v , w ( p ) ) ϰ ( F α , β , γ ( p ) ) ϝ ( F α , β , γ ( p ) )
ϰ ( 1 ) 1 F α , β , γ ( p ) 1 1 2 1 F α , β , γ ( p ) 1
0 1 2 1 F α , β , γ ( p ) 1 .
Since probabilities are bounded by F α , β , γ ( p ) 1 , 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 ( U , F , ) be a non-Archimedean generalized Menger space and let A , B , C be nonempty subsets of U . A mapping f : A B C A B C such that f ( A 0 ) B 0 , f ( B 0 ) C 0 , and f ( C 0 ) A 0 is said to be proximal admissible on A 0 if for every α A 0 , there exists an element u A 0 such that:
F u , f α , f 2 α ( p ) = F A , B , C ( p ) , p > 0 .
To provide a tangible illustration of proximal admissibility, we rely once more on the geometric structure of three parallel lines.
Example 7. 
Consider U = R 2 with the standard probabilistic G-metric, and let us reuse the three horizontal parallel lines:
A 0 = A = { ( x , 0 ) : x R } , B 0 = B = { ( x , 1 ) : x R } , C 0 = C = { ( x , 2 ) : x R } .
We know that the optimal proximity is F A , B , C ( p ) = p p + 4 , and this optimal value is reached if and only if three points chosen from A , B , and C are vertically aligned (i.e., they share the same horizontal coordinate).
Let us define a mapping f : A B C A B C as follows:
f ( x , 0 ) = ( x 2 , 1 ) , f ( x , 1 ) = ( x , 2 ) , f ( x , 2 ) = ( 0 , 0 ) .
Clearly, f ( A 0 ) B 0 , f ( B 0 ) C 0 , and f ( C 0 ) A 0 .
To check if f is proximal admissible on A 0 , let α = ( x , 0 ) be an arbitrary element in A 0 . Applying the mapping yields:
f α = ( x 2 , 1 ) B 0 and f 2 α = f ( x 2 , 1 ) = ( x 2 , 2 ) C 0 .
According to Definition 10, we must find an element u A 0 such that F u , f α , f 2 α ( p ) = p p + 4 . Based on the vertical alignment requirement, this equation holds if and only if u shares the same horizontal coordinate as f α and f 2 α , which is x 2 .
Since A 0 contains all points on the line y = 0 , the element u = ( x 2 , 0 ) is guaranteed to exist in A 0 . With this choice of u, the points u = ( x 2 , 0 ) , f α = ( x 2 , 1 ) , and f 2 α = ( x 2 , 2 ) are perfectly aligned, yielding:
G ( u , f α , f 2 α ) = | x 2 x 2 | + | 1 2 | + | 2 0 | = 4 F u , f α , f 2 α ( p ) = p p + 4 .
Since such a u exists for every possible choice of α, the mapping f is proven to be proximal admissible on A 0 .
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 α A 0 is mapped forward to f α and f 2 α , 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 u A 0 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 ( U , F , ) be a complete non-Archimedean generalized Menger space with a 1-boundary continuous triangular norm . Consider three non-empty closed subsets A , B , C of U for which the associated sets A 0 , B 0 , and C 0 are non-empty. Let
f : A B C A B C
be a mapping proximal admissible on A 0 satisfying the following hypotheses:
(i) 
f ( A 0 ) B 0 , f ( B 0 ) C 0 , and f ( C 0 ) A 0 .
(ii) 
f is a ( ϰ ϝ ) -weak proximal contraction for some ϰ Ξ and ϝ Θ .
(iii) 
If { β n } B 0 , { γ n } C 0 , and α A are such that
lim n + F α , β n , γ n ( p ) = F A , B , C ( p ) for every p > 0 ,
then necessarily α A 0 . (Analogous statements hold for β B 0 and γ C 0 .)
Then f possesses a unique best proximity point α A 0 . Consequently, there exist corresponding points β = f α B 0 and γ = f 2 α C 0 such that ( α , β , γ ) forms a best proximity triplet.
Proof. 
Consider an arbitrary element α 0 belonging to A 0 . Since f ( A 0 ) B 0 and f ( B 0 ) C 0 , we have f α 0 B 0 and f 2 α 0 C 0 . By the hypothesis that f is proximal admissible, there exists α 1 A 0 such that
F α 1 , f α 0 , f 2 α 0 ( p ) = F A , B , C ( p ) p > 0 .
By successive iteration, we produce a sequence { α n } within A 0 which fulfills
F α n + 1 , f α n , f 2 α n ( p ) = F A , B , C ( p ) for all n N , and for all p > 0 .
Suppose there exists n 0 N such that F α n 0 , α n 0 + 1 , α n 0 + 1 ( p ) = 1 for all p > 0 . Then we deduce that
F A , B , C ( p ) F α n 0 , f α n 0 , f 2 α n 0 ( p ) ( F α n 0 , α n 0 + 1 , α n 0 + 1 ( p ) ; F α n 0 + 1 , f α n 0 , f 2 α n 0 ( p ) ) = ( 1 ; F α n 0 + 1 , f α n 0 , f 2 α n 0 ( p ) ) = F A , B , C ( p ) p > 0 .
Hence, the identity
F α n 0 , f α n 0 , f 2 α n 0 ( p ) = F A , B , C ( p ) p > 0 ,
holds trivially, and α n 0 constitutes a best proximity point of the mapping f, forming a triple with f α n 0 and f 2 α n 0 . Thus, it is sufficient to assume in the sequel that
0 < F α n , α n + 1 , α n + 1 ( p ) < 1 for every n N ,
which is equivalent to the requirement α n α n + 1 , for every n N . Since f is a ( ϰ ϝ ) -weak proximal contraction, the proximal relations at consecutive steps yield
ϰ F α n + 1 , α n + 2 , α n + 2 ( p ) ϰ F α n , α n + 1 , α n + 1 ( p ) ϝ F α n , α n + 1 , α n + 1 ( p ) ϰ F α n , α n + 1 , α n + 1 ( p ) .
Because ϰ is monotone decreasing, it follows from (5) that
F α n + 1 , α n + 2 , α n + 2 ( p ) F α n , α n + 1 , α n + 1 ( p ) p > 0 .
Thus, for any fixed p > 0 , the sequence { F α n , α n + 1 , α n + 1 ( p ) } is increasing and bounded above by 1, hence it lies within [ 0 , 1 ] . Defining
r ( p ) = lim n + F α n , α n + 1 , α n + 1 ( p ) p > 0 .
We now show that r ( p ) = 1 for every p > 0 . To see this, take the limit as n + in inequality (5) and make use of the continuity of ϰ along with the lower semi-continuity of ϝ ; this yields
ϰ ( r ( p ) ) ϰ ( r ( p ) ) ϝ ( r ( p ) ) ,
which necessarily implies ϝ r ( p ) = 0 and consequently r ( p ) = 1 for all p > 0 .
Next, we establish that { α n } is a Cauchy sequence. Assume, for the sake of contradiction, that { α n } is not a Cauchy. Then one can choose numbers ς > 0 and ϱ ( 0 , 1 ) with the property that for each positive integer k there are indices n k , m k N satisfying n k > m k > k and
F α m k , α n k , α n k ( ς ) 1 ϱ .
Let n k denote the least integer exceeding m k that satisfies the inequality above,
F α m k , α n k 1 , α n k 1 ( ς ) > 1 ϱ .
So, for all k N , we obtain using the rectangle inequality (2):
1 ϱ F α m k , α n k , α n k ( ς ) ( F α m k , α n k 1 , α n k 1 ( ς ) ; F α n k 1 , α n k , α n k ( ς ) ) > ( 1 ϱ ; F α n k 1 , α n k , α n k ( ς ) ) .
Since lim k + F α n k 1 , α n k , α n k ( ς ) = 1 (as sequences of consecutive terms converge) and ⊡ is continuous at 1-boundary, we deduce that
lim k + F α m k , α n k , α n k ( ς ) = 1 ϱ .
Taking into account that by (6),
1 ϱ ( F α m k , α n k 1 , α n k 1 ( ς ) ; F α n k 1 , α n k , α n k ( ς ) ) ( 1 ϱ ; F α n k 1 , α n k , α n k ( ς ) ) ,
for every k N . Applying Proposition 1, we deduce that
lim k + F α m k , α n k 1 , α n k 1 ( ς ) = 1 ϱ ,
so that
lim k + F α m k , α n k , α n k ( ς ) = lim k + F α m k , α n k 1 , α n k 1 ( ς ) = 1 ϱ .
Next, for all strictly positive natural number k, using the rectangle inequality of the non-Archimedean generalized Menger (2), we have
F α m k , α n k , α n k ( ς ) ( F α m k , α m k 1 , α m k 1 ( ς ) ; ( F α m k 1 , α n k 1 , α n k 1 ( ς ) ; F α n k 1 , α n k , α n k ( ς ) ) ) ( F α m k 1 , α m k , α m k ( ς ) ; ( F α m k 1 , α m k , α m k ( ς ) ; ( F α m k 1 , α n k 1 , α n k 1 ( ς ) ; F α n k 1 , α n k , α n k ( ς ) ) ) ) ( F α m k 1 , α m k , α m k ( ς ) ; ( F α m k 1 , α m k , α m k ( ς ) ; ( F α m k 1 , α m k , α m k ( ς ) , ( F α m k , α n k 1 , α n k 1 ( ς ) ; F α n k 1 , α n k , α n k ( ς ) ) ) ) ) .
Clearly, from the convergence of consecutive terms, F α m k 1 , α m k , α m k ( ς ) 1 and F α n k 1 , α n k , α n k ( ς ) 1 as k + . Also, by (7) we established that F α m k , α n k , α n k ( ς ) 1 ϱ , and F α m k , α n k 1 , α n k 1 ( ς ) 1 ϱ . Thus, from Proposition 1, we can obtain
lim k + F α m k 1 , α n k 1 , α n k 1 ( ς ) = 1 ϱ .
As a consequence,
lim k + F α m k , α n k , α n k ( ς ) = lim k + F α m k 1 , α n k 1 , α n k 1 ( ς ) = 1 ϱ .
From relation (4) derived earlier, we know that
F α m k , f α m k 1 , f 2 α m k 1 ( ς ) = F A , B , C ( ς )
and
F α n k , f α n k 1 , f 2 α n k 1 ( ς ) = F A , B , C ( ς ) .
Next, by the ( ϰ ϝ ) -weak proximal contraction condition of f, we have
ϰ ( F α m k , α n k , α n k ( ς ) ) ϰ ( F α m k 1 , α n k 1 , α n k 1 ( ς ) ) ϝ ( F α m k 1 , α n k 1 , α n k 1 ( ς ) ) .
Taking the limit as k + in the above inequality, and using the continuity of ϰ and lower semi-continuity of ϝ , we get
ϰ ( 1 ϱ ) ϰ ( 1 ϱ ) ϝ ( 1 ϱ ) ϝ ( 1 ϱ ) = 0 ,
which contradicts the property of ϝ (since 1 ϱ < 1 ). Thus, our assumption was wrong, and { α n } is a Cauchy sequence in A 0 .
The completeness of ( U , F , ) ensures that the sequence { α n } converges to some α U , i.e.,
lim n + F α n , α , α ( p ) = 1 p > 0 .
Moreover,
F A , B , C ( p ) = F α n , f α n 1 , f 2 α n 1 ( p ) ( F α n , α , α ( p ) ; F α , f α n 1 , f 2 α n 1 ( p ) ) = ( F α n , α , α ( p ) ; ( F α , f α n 1 , f 2 α n 1 ( p ) ; 1 ) ) ( F α n , α , α ( p ) ; ( F α , f α n 1 , f 2 α n 1 ( p ) ; F A , B , C ( p ) ) ) .
This implies that
F A , B , C ( p ) ( F α n , α , α ( p ) ; F α , f α n 1 , f 2 α n 1 ( p ) ) ( F α n , α , α ( p ) ; ( F α , α n , α n ( p ) ; F A , B , C ( p ) ) ) .
Passing to the limit as n + in the inequality above, we obtain
F A , B , C ( p ) ( 1 ; lim n + F α , f α n 1 , f 2 α n 1 ( p ) ) ( 1 ; ( 1 ; F A , B , C ( p ) ) ) ,
that is
lim n + F α , f α n 1 , f 2 α n 1 ( p ) = F A , B , C ( p ) ,
and so by condition (iii) of Theorem 1, α A 0 . Since α A 0 , f α B 0 and f 2 α C 0 , then by the hypothesis that f is proximal admissible, there exists α A 0 such that
F α , f α , f 2 α ( p ) = F A , B , C ( p ) for all p > 0 .
From (4) and (8), together with the contraction property of f, we deduce:
ϰ ( F α , α n , α n ( p ) ) ϰ ( F α , α n 1 , α n 1 ( p ) ) ϝ ( F α , α n 1 , α n 1 ( p ) ) .
Passing to the limit as n + , using the continuity of ϰ and F , and the lower semi continuity of ϝ , we obtain
lim n + ϰ ( F α , α n , α n ( p ) ) ϰ ( 1 ) ϝ ( 1 ) = 0 ,
which implies that
lim n + F α , α n , α n ( p ) = 1 p > 0 .
Since α n α , by the uniqueness of the limit, we conclude that α = α . Thus, substituting α with α in (8), we get:
F α , f α , f 2 α ( p ) = F A , B , C ( p ) , p > 0 .
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 y A 0 . This means that F y , f y , f 2 y ( p ) = F A , B , C ( p ) for all p > 0 . Since α is also a best proximity point, we already know that F α , f α , f 2 α ( p ) = F A , B , C ( p ) .
Applying the ( ϰ ϝ ) -weak proximal contraction property of f to these two points, we obtain:
ϰ ( F α , y , y ( p ) ) ϰ ( F α , y , y ( p ) ) ϝ ( F α , y , y ( p ) ) .
This inequality simplifies to ϝ ( F α , y , y ( p ) ) 0 . Since ϝ Θ , we necessarily have ϝ ( F α , y , y ( p ) ) = 0 , which in turn implies that F α , y , y ( p ) = 1 for all p > 0 . By the properties of the generalized Menger space, this yields α = y . 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 U = R 2 be endowed with the sum metric
G ( ( x 1 , y 1 ) , ( x 2 , y 2 ) , ( x 3 , y 3 ) ) = 1 i < j 3 ( | x i x j | + | y i y j | ) .
We define the non-Archimedean generalized Menger space using the standard probabilistic metric
F α , β , γ ( p ) = 0 , p = 0 , p p + G ( α , β , γ ) , p > 0 , α , γ , β U .
equipped with the continuous triangular norm M .
Consider the three closed, parallel subsets:
A = { ( x , 0 ) : x R } , B = { ( x , 1 ) : x R } , C = { ( x , 2 ) : x R } .
The optimal proximity is achieved for vertically aligned points, yielding
F A , B , C ( p ) = p p + 4 .
Note that A 0 = A , B 0 = B , and C 0 = C .
Let us define the mapping f : A B C A B C as:
f ( x , 0 ) = x 2 , 1 , f ( x , 1 ) = ( x , 2 ) , f ( x , 2 ) = x 2 , 0 .
Condition (i) of Theorem 1 is obviously satisfied.
To verify that f is proximal admissible, let α = ( x , 0 ) A 0 . Then f α = ( x 2 , 1 ) and f 2 α = f ( x 2 , 1 ) = ( x 2 , 2 ) . By choosing u = ( x 2 , 0 ) A 0 , the triplet ( u , f α , f 2 α ) is vertically aligned, achieving the optimal distance p p + 4 .
To verify that f is ( ϰ ϝ ) -weak proximal contraction: Let α 1 = ( x , 0 ) and α 2 = ( y , 0 ) be in A 0 . The unique elements u 1 , u 2 A 0 that satisfy the optimal distance relations with their respective forward orbits are u 1 = x 2 , 0 and u 2 = y 2 , 0 . First, we evaluate the probabilistic distances:
G ( u 1 , u 2 , u 2 ) = 2 x 2 y 2 = | x y | F u 1 , u 2 , u 2 ( p ) = p p + | x y | .
G ( α 1 , α 2 , α 2 ) = 2 | x y | F α 1 , α 2 , α 2 ( p ) = p p + 2 | x y | .
Let us define the functions ϰ : ( 0 , 1 ] [ 0 , + ) and ϝ : ( 0 , 1 ] [ 0 , + ) by
ϰ ( t ) = 1 t 1 and ϝ ( t ) = 1 2 1 t 1 .
Substituting our probabilistic distances into these functions, we obtain:
ϰ ( F u 1 , u 2 , u 2 ( p ) ) = p + | x y | p 1 = | x y | p .
ϰ ( F α 1 , α 2 , α 2 ( p ) ) = p + 2 | x y | p 1 = 2 | x y | p .
ϝ ( F α 1 , α 2 , α 2 ( p ) ) = 1 2 2 | x y | p = | x y | p .
Thus, the required inequality is satisfied as an exact identity:
ϰ ( F u 1 , u 2 , u 2 ( p ) ) = ϰ ( F α 1 , α 2 , α 2 ( p ) ) ϝ ( F α 1 , α 2 , α 2 ( p ) ) .
Hence, f is rigorously a ( ϰ ϝ ) -weak proximal contraction.
Topological property: Let { β n } = { ( y n , 1 ) } B 0 , { γ n } = { ( z n , 2 ) } C 0 , and α = ( x , 0 ) A . Assume that for all p > 0 :
lim n + F α , β n , γ n ( p ) = F A , B , C ( p ) = p p + 4 .
This limit holds if and only if lim n + G ( α , β n , γ n ) = 4 . By the definition of our metric:
G ( α , β n , γ n ) = ( | x y n | + | y n z n | + | z n x | ) + ( | 0 1 | + | 1 2 | + | 2 0 | ) .
G ( α , β n , γ n ) = | x y n | + | y n z n | + | z n x | + 4 .
For the limit to equal 4, we must have lim n + ( | x y n | + | y n z n | + | z n x | ) = 0 , which forces y n x and z n x . Since α = ( x , 0 ) is an element of A , and we have previously established that A = A 0 , it trivially follows that α A 0 . 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 ( 0 , 0 ) A (and similarly ( 0 , 1 ) B and ( 0 , 2 ) C ) is such a point, since f ( 0 , 0 ) = ( 0 , 1 ) , f 2 ( 0 , 0 ) = ( 0 , 2 ) and the triplet ( ( 0 , 0 ) , ( 0 , 1 ) , ( 0 , 2 ) ) achieves the optimal distance p p + 4 .
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 A 0 , B 0 , and C 0 are closed.
To see this, consider the situation that arises in the proof: we have sequences { β n } B 0 and { γ n } C 0 (constructed as f α n 1 and f 2 α n 1 ) which are Cauchy and therefore converge in the complete space U . By the closedness of B 0 and C 0 , their limits satisfy β B 0 and γ C 0 . If α A is such that
lim n + F α , β n , γ n ( p ) = F A , B , C ( p ) p > 0 ,
then the continuity of F yields
F α , β , γ ( p ) = F A , B , C ( p ) p > 0 .
Since β B 0 and γ C 0 , the very definition of A 0 forces α to belong to A 0 .
Notice that this argument uses only the closedness of the proximal sets B 0 and C 0 ; the closedness of the original sets A , B , C is not required. Consequently, in any version of Theorem 1 where A 0 , B 0 , C 0 are assumed to be closed, Condition (iii) can be omitted without affecting the validity of the proof.
Theorem 2. 
Let ( U , F , ) be a complete generalized Menger space whose triangular norm is 1-boundary continuous. Let A , B , C be three non-empty subsets of U and assume that the proximal sets A 0 , B 0 , C 0 are non-empty and closed. Suppose f : A B C A B C is a mapping proximal admissible satisfying:
(i) 
f ( A 0 ) B 0 , f ( B 0 ) C 0 , and f ( C 0 ) A 0 ;
(ii) 
f is a ( ϰ ϝ ) -weak proximal contraction.
Then f admits a unique best proximity point α A 0 .
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 U = R 2 be endowed with the G-metric
G ( ( x 1 , y 1 ) , ( x 2 , y 2 ) , ( x 3 , y 3 ) ) = 1 i < j 3 | x i x j | + | y i y j | .
We define the generalized Menger space using the probabilistic metric
F α , β , γ ( p ) = 0 , p = 0 , p p + G ( α , β , γ ) , p > 0 , α , γ , β U ,
and the continuous triangular norm ( a , b ) = min ( a , b ) .
Consider the three subsets of U :
A = [ 1 , 1 ] × { 0 } ( 2 , 3 ) × { 0 } , B = [ 1 , 1 ] × { 1 } , C = [ 1 , 1 ] × { 2 } .
Notice that A is strictly not closed. The optimal G-metric distance between these sets is achieved exclusively when the x-coordinates are identical. Because elements in B and C are restricted to x [ 1 , 1 ] , the optimal vertical alignment can only occur if the element in A also has its x-coordinate in [ 1 , 1 ] . Thus, the minimum distance is G ( A , B , C ) = 4 , yielding F A , B , C ( p ) = p p + 4 .
Consequently, the proximal sets are:
A 0 = [ 1 , 1 ] × { 0 } , B 0 = B , C 0 = C .
Remarkably, even though A is not closed, the proximal set A 0 is completely closed and non-empty. This perfectly fits the topological framework of Theorem 2.
Let us define the proximal admissible mapping f : A B C A B C such that:
f ( x , 0 ) = x 2 , 1 if x [ 1 , 1 ] ( 0 , 1 ) if x ( 2 , 3 ) , f ( x , 1 ) = ( x , 2 ) , f ( x , 2 ) = x 2 , 0 .
We verify the cyclic behavior on the proximal sets:
f ( A 0 ) = [ 1 2 , 1 2 ] × { 1 } B 0 , f ( B 0 ) = C 0 , and f ( C 0 ) = [ 1 2 , 1 2 ] × { 0 } A 0 .
For Condition (ii), we use the exact same rigorous analytical contraction established in the example of Theorem 1. By defining
ϰ ( t ) = 1 t 1 Ξ and ϝ ( t ) = 1 2 1 t 1 Θ .
For any α 1 = ( x , 0 ) and α 2 = ( y , 0 ) in A 0 alongside their optimal projection elements u 1 = ( x 2 , 0 ) and u 2 = ( y 2 , 0 ) in A 0 , we obtain the exact identity:
ϰ ( F u 1 , u 2 , u 2 ( p ) ) = ϰ ( F α 1 , α 2 , α 2 ( p ) ) ϝ ( F α 1 , α 2 , α 2 ( p ) ) = | x y | p .
Thus, f is a ( ϰ ϝ ) -weak proximal contraction.
Since A 0 , B 0 , and C 0 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 α = ( 0 , 0 ) .

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., A = B = C = U , 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
F U , U , U ( p ) = 1 , for all p > 0 .
Consequently, the proximal sets are trivial, with A 0 = B 0 = C 0 = U . Furthermore, the condition for a point α to be a best proximity point,
F α , f α , f 2 α ( p ) = F A , B , C ( p ) = 1 , for all p > 0 ,
implies that
α = f α = f 2 α .
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 A 0 . Specifically:
lim n + F α , β n , γ n ( p ) = F A , B , C ( p ) α A 0 .
In our case,
F A , B , C ( p ) = 1 , for all p > 0 and A 0 = U .
Since α is an element of the universe U , the conclusion α A 0 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 ( U , F , ) be a non-Archimedean generalized Menger space. A self-mapping f : U U is called a ( ϰ ϝ ) -contraction if there exist functions ϰ Ξ and ϝ Θ such that, for all α , β , γ U and every p > 0 ,
ϰ F f α , f β , f γ ( p ) ϰ F α , β , γ ( p ) ϝ F α , β , γ ( p ) .
Theorem 3. 
Let ( U , F , ) be a complete non-Archimedean generalized Menger space whose triangular norm is 1-boundary continuous. If f : U U is a ( ϰ ϝ ) -contraction, then f possesses a unique fixed point α U .
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 U = R be equipped with the standard G-metric defined by
G ( α , β , γ ) = | α β | + | β γ | + | γ α | .
Consider the non-Archimedean generalized Menger space endowed with the probabilistic metric
F α , β , γ ( p ) = 0 , p = 0 , p p + G ( α , β , γ ) , p > 0 , α , γ , β U ,
and the continuous triangular norm ( a , b ) = min ( a , b ) .
Let the self-mapping f : U U be defined by the classic geometric contraction f ( α ) = α 2 . For any α , β , γ U , we compute the G-metric of the mapped points:
G ( f α , f β , f γ ) = α 2 β 2 + β 2 γ 2 + γ 2 α 2 = 1 2 G ( α , β , γ ) .
Consequently, the probabilistic distance becomes:
F f α , f β , f γ ( p ) = p p + 1 2 G ( α , β , γ ) = 2 p 2 p + G ( α , β , γ ) .
Let us define the functions ϰ : ( 0 , 1 ] [ 0 , + ) and ϝ : ( 0 , 1 ] [ 0 , + ) exactly as in our previous proximity model:
ϰ ( t ) = 1 t 1 and ϝ ( t ) = 1 2 1 t 1 .
Evaluating the components of the contraction condition (Equation (9)), we obtain the left-hand side:
ϰ ( F f α , f β , f γ ( p ) ) = 2 p + G ( α , β , γ ) 2 p 1 = G ( α , β , γ ) 2 p .
For the right-hand side, we have:
ϰ ( F α , β , γ ( p ) ) = p + G ( α , β , γ ) p 1 = G ( α , β , γ ) p ,
ϝ ( F α , β , γ ( p ) ) = 1 2 p + G ( α , β , γ ) p 1 = G ( α , β , γ ) 2 p .
Subtracting these yields exactly the left-hand side:
ϰ ( F α , β , γ ( p ) ) ϝ ( F α , β , γ ( p ) ) = G ( α , β , γ ) p G ( α , β , γ ) 2 p = G ( α , β , γ ) 2 p .
Therefore, the inequality
ϰ ( F f α , f β , f γ ( p ) ) ϰ ( F α , β , γ ( p ) ) ϝ ( F α , β , γ ( p ) )
is perfectly satisfied as an exact identity for all α , β , γ U and p > 0 . Thus, f ( α ) = α 2 is rigorously proven to be a ( ϰ ϝ ) -contraction on this space, admitting the unique fixed point α = 0 .

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
α β if and only if α is a prefix of β .
For every non-empty word α Σ , its length is denoted by l ( α ) [ 1 , + ) ; we set l ( ε ) = 0 . If α is finite we write
α = α 1 α 2 α n with n = l ( α ) ;
otherwise we write
α = α 1 α 2 .
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
F α , β , γ ( p ) = 0 , if p = 0 , exp 2 l ( α β γ ) p , if p > 0 and α , β , γ are not all equal , 1 , if p > 0 and α = β = γ .
Equipping this space with the product triangular norm P , one verifies that ( Σ , F , P ) becomes a complete non-Archimedean generalized Menger space.
The analysis of the Quicksort algorithm leads to the well-known recurrence (see, e.g., [17])
α 1 = 0 , α m = 2 ( m 1 ) m + m + 1 m α m 1 , m 2 .
To connect this recurrence with our fixed point framework, we take the alphabet Σ = [ 0 , + ) and define a mapping f : Σ Σ as follows. For a word α = α 1 α 2 , we set f ( α ) = f ( α ) 1 f ( α ) 2 where
f ( α ) 1 = 0 , f ( α ) m = 2 ( m 1 ) m + m + 1 m f ( α ) m 1 ,         m 2 .
The mapping f preserves the prefix order: α β if and only if f ( α ) f ( β ) . Consequently,
f ( α β γ ) f ( α ) f ( β ) f ( γ ) ( for all α , β , γ Σ ) ,
which implies the inequality between lengths:
l f ( α β γ ) l f ( α ) f ( β ) f ( γ ) ( for all α , β , γ Σ ) .
We now invoke Theorem 3 to demonstrate that f admits a fixed point. Define auxiliary functions ϰ Ξ and ϝ Θ by
ϰ ( p ) = 1 p p , ϝ ( p ) = 1 2 · 1 p p ( 0 < p 1 ) .
Both functions are continuous on ( 0 , 1 ] , strictly decreasing, and satisfy ϰ ( 1 ) = ϝ ( 1 ) = 0 .
Two cases are considered.
Case 1: α = β = γ . Then F f ( α ) , f ( β ) , f ( γ ) ( p ) = 1 = F α , β , γ ( p ) for every p > 0 , and the contraction inequality holds trivially.
Case 2: α , β , γ are not all equal. Let L = l ( α β γ ) and L = l ( f ( α ) f ( β ) f ( γ ) ) . From (10) we have L L + 1 . Hence
F f ( α ) , f ( β ) , f ( γ ) ( p ) = exp 2 L p exp 2 ( L + 1 ) p = F α , β , γ ( p ) 1 / 2 .
Set x = F α , β , γ ( p ) ( 0 , 1 ) . Then
ϰ F f ( α ) , f ( β ) , f ( γ ) ( p ) = 1 F f ( α ) , f ( β ) , f ( γ ) ( p ) F f ( α ) , f ( β ) , f ( γ ) ( p ) 1 x 1 / 2 x 1 / 2 .
A direct computation shows that
1 x 1 / 2 x 1 / 2 1 2 · 1 x x = ϰ ( x ) ϝ ( x ) .
Thus, for every α , β , γ Σ and every p > 0 ,
ϰ F f ( α ) , f ( β ) , f ( γ ) ( p ) ϰ F α , β , γ ( p ) ϝ F α , β , γ ( p ) .
Since f satisfies the ( ϰ ϝ ) -contraction condition (9), all hypotheses of Theorem 3 are satisfied. Consequently, f possesses a unique fixed point α Σ ; translating the equality f ( α ) = α letter-by-letter yields exactly the Quicksort recurrence. Hence, we obtain
α 1 = 0 , α n = 2 ( n 1 ) n + n + 1 n α n 1 ( n 2 ) .

4. Conclusions

This study is built upon the hypothesis that by merging the frameworks of non-Archimedean generalized Menger spaces with ( ϰ ϝ ) -weak proximal contractions, one could establish best proximity point results for cyclic mappings on a triple of sets without relying on the restrictive probabilistic P-property. Our findings confirm this hypothesis, providing new existence and uniqueness theorems that significantly generalize prior work in probabilistic metric spaces. These results matter profoundly to the field as they extend the applicable range of fixed point theory to more irregular, non-convex structures and establish a unified framework that bridges classical results in probabilistic, G-metric, and fuzzy metric spaces. Looking ahead, specific and actionable research directions emerge: extending the triple-set framework to an arbitrary finite number of sets ( A 1 , , A n ) ; investigating the stability and data dependence of best proximity points in this setting using quantitative convergence bounds; and applying the established theorems to solve concrete problems in nonlinear programming and distributed algorithm analysis on network spaces. In essence, this work transforms structural limitations into opportunities for exploration, providing a flexible and powerful tool set for solving proximity problems where traditional assumptions fail.

Author Contributions

Conceptualization, L.O. and Y.A.; Methodology, L.O., Y.A., M.P., M.L.S., and S.R.; Software, L.O. and Y.A.; Validation, Y.A., M.P., I.T., M.L.S., and S.R.; Formal analysis, L.O., I.T. and S.R.; Investigation, L.O.; Writing—original draft, L.O. and Y.A.; Writing—review and editing, Y.A., M.P., I.T., M.L.S., and S.R.; Visualization, Y.A.; Supervision, M.L.S. and S.R.; Funding acquisition, M.P. All authors have read and agreed to the published version of the manuscript.

Funding

This research was funded by Serbian Ministry of Science, Technological Development and Innovation grant number 451-03-34/2026-03/200122.

Data Availability Statement

No new data were created or analyzed in this study.

Conflicts of Interest

The authors declare no conflicts of interest.

References

  1. Menger, K. Statistical metrics. In Selecta Mathematica; Springer: Vienna, Austria, 2011; Volume 2, pp. 433–435. [Google Scholar]
  2. Schweizer, B.; Sklar, A. Statistical metric spaces. Pac. J. Math. 1960, 10, 313–334. [Google Scholar] [CrossRef] [Scilit]
  3. Schweizer, B.; Sklar, A. Probabilistic Metric Spaces; Courier Corporation: North Chelmsford, MA, USA, 2011. [Google Scholar]
  4. Zhou, C.; Wang, S.; Ćirić, L.; Alsulami, S.M. Generalized probabilistic metric spaces and fixed point theorems. Fixed Point Theory Appl. 2014, 2014, 91. [Google Scholar] [CrossRef] [Scilit]
  5. Saadati, R. Best proximity point theorems for probabilistic proximal cyclic contraction with applications in nonlinear programming. Fixed Point Theory Appl. 2015, 2015, 79. [Google Scholar] [CrossRef] [Scilit]
  6. Su, Y.; Zhang, J. Fixed point and best proximity point theorems for contractions in new class of probabilistic metric spaces. Fixed Point Theory Appl. 2014, 2014, 170. [Google Scholar] [CrossRef] [Scilit]
  7. Vetro, C.; Salimi, P. Best Proximity Point Results in Non-Archimedean Fuzzy Metric Spaces. Fuzzy Inf. Eng. 2013, 5, 417–429. [Google Scholar] [CrossRef] [Scilit]
  8. Ali, B.; Ali, M.; Hussain, A.; George, R.; Nazir, T. Best proximity points in non-Archimedean fuzzy metric spaces with application to domain of words. AIMS Math. 2022, 7, 16590–16611. [Google Scholar] [CrossRef] [Scilit]
  9. Zhou, M.; Saleem, N.; Roldán López de Hierro, A.F.; Liu, X. Best Proximity Point Theorems without Fuzzy P-Property for Several (ψ-ϕ)-Weak Contractions in Non-Archimedean Fuzzy Metric Spaces. Mathematics 2022, 10, 4031. [Google Scholar] [CrossRef] [Scilit]
  10. Achtoun, Y.; Gardašević-Filipović, M.; Mitrović, S.; Radenović, S. On Prešić-Type Mappings: Survey. Symmetry 2024, 16, 415. [Google Scholar] [CrossRef] [Scilit]
  11. Gabeleh, M.; Uyanık Ekici, E.; Aphane, M. Best Proximity Theory in Metrically Convex Menger PM-Spaces via Cyclic Kannan Maps. Symmetry 2025, 17, 1549. [Google Scholar] [CrossRef] [Scilit]
  12. Tahiri, I.; Achtoun, Y.; Lamarti Sefian, L.M.; Radenović, S. Solving Fredholm Integral Equations Using Probabilistic F-Contractions. Axioms 2025, 14, 119. [Google Scholar] [CrossRef] [Scilit]
  13. Oumertou, L.; Sefian, L.M.; Tahiri, I. Orbital Fixed Point Theorem in G-Menger Spaces. Nonlinear Funct. Anal. Appl. 2025, 30, 865–880. [Google Scholar]
  14. Choudhury, B.S.; Maity, P. Best proximity point results in generalized metric spaces. Vietnam J. Math. 2016, 44, 339–349. [Google Scholar] [CrossRef] [Scilit]
  15. Romaguera, S.; Sapena, A.; Tirado, P. The Banach fixed point theorem in fuzzy quasi-metric spaces with application to the domain of words. Topol. Appl. 2007, 154, 2196–2203. [Google Scholar] [CrossRef] [Scilit]
  16. Roldán López de Hierro, A.F.; Karapınar, E.; Shahzad, N. Fuzzy ample spectrum contractions in (more general than) non-Archimedean fuzzy metric spaces. arXiv 2021, arXiv:2104.09155. [Google Scholar] [CrossRef] [Scilit]
  17. Flajolet, P. Analytic analysis of algorithms. In Automata, Languages and Programming; Lecture Notes in Computer Science; Springer: Berlin/Heidelberg, Germany, 1992. [Google Scholar]
  18. Achtoun, Y.; Mbarki, A.; Tahiri, I.; Sefian, M.L. A Novel Generalization of Strong Probabilistic b-Metric Spaces and Fixed Point Theorems. Sahand Commun. Math. Anal. 2024, 21, 93–108. [Google Scholar]
  19. Achtoun, Y.; Radenović, S.; Tahiri, I.; Sefian, M.L. The nonlinear contraction in probabilistic cone b-metric spaces with application to integral equation. Nonlinear Anal. Model. Control 2024, 29, 658–669. [Google Scholar] [CrossRef] [Scilit]
  20. Laakel Hemdanou, A.; Achtoun, Y.; Mouali, S.; Lamarti Sefian, M.; Šešum Čavić, V.; Radenović, S. Cover Tree-Optimized Spectral Clustering: Efficient Nearest Neighbor Search for Large-Scale Data Partitioning. Mach. Learn. Knowl. Extr. 2025, 1, 1–43. [Google Scholar]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Article Metrics

Citations

Article Access Statistics

Multiple requests from the same IP address are counted as one view.