2. Preliminaries
We adhere to the following convention throughout.
Let  with  and , we write  to mean . Let , then .
Throughout,  is a model of a weakly o-minimal theory T, and  is a sufficiently large saturated elementary extension of , the Latin letters denote elements of : , , , , while the Greek letters denote elements of : , , , .
For any , we write  if  whenever , . For , we write  if .
For any  set 
If  with , write . Note that .
We use  for inclusion, i.e., whenever  implies , and  for proper inclusion, i.e., if  if  and .
Whenever a set of parameters  is fixed, we assume that  is  -saturated.
Types  will always be non-algebraic complete 1-types over A. By an isolated type, we mean a non-algebraic isolated type.
 is the group of all automorphisms of  that fix A pointwise, that is,  for any  and any .
We use the following notations:
Definition 1. Let A be a linearly ordered set, and . We say that B is convex if, for all , and all ,
 Definition 2. We say that a formula , with , is convex to the right if
We say that a formula , with , is convex to the left if
 Definition 3 (Baizhanov B.S., Verbovskii V.V., [
11])
. 1. The convex closure of a formula  is the following formula:- 2. 
 The convex closure of a type
			 is the following type:
 Definition 4 (Baizhanov B.S., [
12])
. Let . We say that a formula , with , is p-stable (p-preserving) if Other recent studies explore formulas from different perspectives, including partial clones of linear formulas [
13] and superassociative structures [
14].
Definition 5 (Marker D. [
15])
. A cut  is uniquely realizable over  if and only if, for any c realizing , c is the only realization of  in the prime model . Following Marker’s notion of uniquely realizable types, we generalize this concept to the context of weakly o-minimal theories and refer to such types as solitary.
Definition 6 (Baizhanov B.S. [
10])
. Let  be a non-algebraic type.We say that p is semi-quasisolitary to the right if there exists the greatest p-preserving convex to the right 2-A-formula , where .
We say that p is semi-quasisolitary to the left if there exists the greatest p-preserving convex to the left 2-A-formula , where .
We say that p is quasisolitary if it is semi-quasisolitary to the right and to the left.
 Let 
 be the greatest convex to the right 
p-preserving formula, and 
 is the greatest convex to the left 
p-preserving formula. It was proved in [
16] that the formula 
 is an equivalence relation.
Let  be quasisolitary. We say that p is solitary if .
Definition 7 ([
16])
. A type  is social if there exists no greatest convex to the right (equivalently, convex to the left) on p formula. Definition 8 ([
17])
. A partition of  into two convex subsets C and D, such that , is said to be a cut in A. If C has a supremum or D has an infimum in , then the cut  is said to be rational. Definition 9 ([
10])
. Let  be non-isolated. We say that p is quasirational to the right if there exists a formula  with  such that, for any  the following is true:We say that p is quasirational to the left if there exists a formula  with  such that, for any  the following is true:
A non-isolated, non-quasirational type p is said to be irrational (
Figure 1).
  Remark 1 ([
16])
. 1. If T is o-minimal, then each quasisolitary type is solitary (uniquely realizable [Laskovski M., Steinhorn Ch., [18]).- 2. 
 There exist the following six essential kinds of non-algebraic 1-types over sets of models with a weakly o-minimal theory:
- (1–2) 
 isolated (quasisolitary, social);
- (3–4) 
 quasirational (quasisolitary, social);
- (5–6) 
 irrational (quasisolitary, social).
 Definition 10. Let ,  such that  is -saturated. Then a neighborhood of a set B in the type p is the following set:
 This definition adapts the notion of neighborhoods, which was introduced in the context of semi-isolation.
  3. Results
Proposition 1. Let .
- (i) 
 Let . Then  if and only if p is solitary.
- (ii) 
 p is quasisolitary if and only if there exists , and  is -definable set. (In fact 
 Proof.  (i) (⇒) Let p be a solitary type. It follows that, , which means that for every , the equivalence class under  contains only one element:  itself. Since  is defined as the equivalence class of  under , if p is solitary, then
-    (⇐)
 Suppose , then  identifies only trivial equivalences. Consequently, , and p is solitary.
- (ii)
 The neighborhood  is defined as the equivalence class of  under , i.e.,:
- (⇒)
 Let , then there exists a formula  such that . Let
Since  is convex . Notice that
Then  On the other hand, by definition, . Hence, .
- (⇐)
 Assume that for some , the set  is -definable. That is, there exists a formula  such that
Moreover, since  is an equivalence class under , it is convex and contained in . Define the formula  as follows:
Then  defines an equivalence relation on  with convex classes, and for the fixed , we have:
Therefore, p is quasisolitary.
□
 Lemma 1. 
 Proof.  Suppose . Then there exists a formula  and elements  such that:
We know that if 
 then for every formula 
 it holds that 
 Now consider an automorphism 
f of 
 fixing 
A such that 
, 
.
It is clear that 
, consequently 
. Therefore, there exists 
 such that 
.
If  then . Thus, the formula  serves as a witness to the fact that , since for any  the formula  fails at  (such that     □
 Theorem 1 (Compactness Theorem, Henkin L. [
19])
. If every finite subset of a set T of L-sentences is satisfiable, then T itself is satisfiable. Lemma 2. 1. Let  be non-algebraic, , and let , where , be such that  (that is, p isolates q).
- 2. 
 If q is irrational to the left, then there is no M-definable formula  with  and for any formula , where , with , there exists  such that 
- 3. 
 If q is irrational to the right, that is, there does not exist an M-definable formula  with  then for any formula , where , with , there exists  such that 
 Proof.  1. Let  be non-algebraic types, , and let  be a formula with parameters  such that  (p isolates q). Let
Fix any formula , and define the formula
Since  then
- 2.
 Let  be irrational to the left. We claim that there is no M-definable formula  such that  Suppose there is such formula , then  is consistent because for any finite set of formulas 
Thus, there is a realization  of  contradicting the assumption.
Let  be any formula with parameters . This implies that for every , there is an element  such that 
Otherwise  would be bounded below inside , contradicting the irrationality of q to the left. Thus, the set
is consistent, and therefore there exists some 
 such that 
- 3.
 Let  be irrational to the right. We claim that there is no -definable formula  such that 
Suppose such a formula  exists. Then the set  is consistent because for any finite set of formulas , we have
Thus, there is a realization  of , which contradicts the assumption that q is irrational to the right.
Let  be any formula with parameters . This implies that for every , there is an element  such that 
Otherwise,  would be bounded above inside , contradicting the irrationality of q to the right. Thus, the set
            is consistent, yielding some 
 such that 
 such that 
.
□
 Theorem 2. Let ,  such that M is -saturated. Then the following holds:
- (i) 
  is convex or empty.
- (ii) 
 Let p be irrational. Then , for any formula 
- (iii) 
 - (iv) 
 - (v) 
 
 Proof.  (i) By Definition 10.
- (ii)
 By Definition 10 and by Lemma 2 (ii), (iii).
- (iii)
 By Definition 10 and by Compactness Theorem (Theorem 1).
- (iv)
 Suppose that there exists  such that . Then there exists , with , and there is , with ,  such that
By Definition 10 there are  such that
Let , ,  be such that . Define , . Then
            and either 
 or 
. Now let
Then , while . Let  be a convex subformula of  such that  Thus
Then  and . Which is a contradiction.
- (v)
 Assume .
- Step 1.
 We are going to show that . Suppose for contradiction that  and  are not disjoint sets . Let  and
Pick some . Define
Since , with , and , it follows that .
This is a contradiction, because we assumed . Hence, we conclude that .
- Step 2.
 Now we will show that .
- (a)
  is definable.
- (a1)
  is definable.
Let  be the right border of the neighborhood .
Since , then .
- (a2)
 The neighborhood is
The set of formulas
                    is consistent, and consequently there is 
 that satisfies the set. Then
- (b)
  is non-definable. Since by Step 1 , then the lower bound of  is non-definable. The set of formulas
                    is consistent. Therefore, there is an element that satisfies the set.
□
 We will use notations analogous to those in Stability Theory [
20,
21].
Definition 11. Let . We say that p is weakly orthogonal to q () if for any , with , for any , the following holds:
If p is not weakly orthogonal to q, we will denote this fact by .  Lemma 3. (i) .
- (ii) 
  is a complete 2-A-type.
- (iii) 
 If p is algebraic, then for every , it follows that .
 Proof.  (i) Assume . Then there exist an A–formula , some , and there are  such that
Assume . Since  satisfies , then  Let us define the following set of formulas:
 satisfies . Then
            is consistent and closed over finite conjunction. Since for any finite 
            There is some 
 that satisfies the set
            Since 
, then 
. Therefore, 
.
In general the weak orthogonality relation  is symmetric.
- (ii)
 - (⇒)
 Assume , and let , . Then for any A-formula , for any  and any 
                If there exists a realization 
 of 
q such that 
 holds, then by weak orthogonality every realization of 
q also must satisfy 
. Consequently, for every pair 
 we have
                
                Therefore,
                Since 
 was arbitrary, 
 decides every 
A-formula in the variables 
. Thus 
 is a complete 2-
A-type.
- (⇐)
 Assume that  is a complete 2-A-type.
Let , and let  be any –formula. Suppose  Let  with . By completeness of  applied to the formula  we have
The second alternative cannot hold, since , , and . Hence
Therefore, for every  we have , i.e.,
Since  and  were arbitrary, this is exactly the definition of .
- (iii)
 Let p is algebraic over A. Then there is an A-formula  whose set of solutions is exactly . Then , and .
Let suppose there are  such that . Then
            isolates exactly one element.
Suppose there is  in p such that  in q.
Since x is singular then it is consistent that
Since the formulas are mutually contradictory, they cannot be used together. Therefore, .
□
 Definition 12. Let . We say that p is almost orthogonal to q (), if  (), and . If p is not almost orthogonal to q, then we denote this fact by .
 From this definition  if and only if . And  there is a formula  such that there are ,
Lemma 4. Let . Then the following propositions are true:
- (i) 
 .
- (ii) 
 There exists T — a weakly o-minimal theory such that , and .
- (iii) 
 Let T be o-minimal. Then .
 Proof.  (i) Assume 
. By the definition of weak orthogonality, for every 
A-definable formula 
 and every 
,
By the definition of the neighborhood , there exist  and an A-definable formula  such that
In particular, 
 but 
 (since 
 lie outside the convex set 
). This contradicts (
1).
Hence  for (some hence all) , which is exactly  by the definition of almost orthogonality.
- (ii)
 Let consider , and .
Let  is a binary relation such that
The theory of this structure has quantifier elimination. Let us define non-algebraic 1-types
Thus, , since for an arbitrary  the set  and the set  are both consistent.
Let consider an authomorphism f such that , and .
Since we do not have any formula in that type, then . Therefore, .
- (iii)
 - (⇒)
 Since by (i)  in any theory, then it is true for o-minimal theories.
- (⇐)
 Assume . We must show that . Let  be any A-definable formula and let . Suppose
Set . By o-minimality, S is a finite union of points and open intervals; Hence it is a finite union of convex sets. Since  is convex, the intersection  is again a finite union of convex subsets of .
We claim that . Suppose not. Then there exists a nonempty convex component  which is a proper subset of . Because  is convex, we can choose  with
But , so 
By the definition of the neighborhood , this implies , contradicting . Hence, the assumption was false, and we must have .
Since ,  and  were arbitrary, we have shown that for every A-definable  and every ,
                which is exactly 
 by definition.
□
 The following example illustrates that that the inverse of Lemma 4 (i) does not hold.
Example 1. Let , where U is a binary predicate, < is the standard relation of dense linear order without endpoints,  for all ,  from  and all  from , and
And let  if and only if . Define , and . The types p and q are distinct non-isolated types over the empty set. Let  be an arbitrary model of  realizing the type p. For each  the set  is a convex set such that , , and . Moreover, there is no ∅-definable formula  such that  is a proper subset of . Then , but .
 Theorem 3. Let . Then the following propositions are true:
- (1) 
 Let . If p is social, then q is social, and .
- (2) 
 .
- (3) 
  is a relation of equivalence on .
- (4) 
  is a relation of equivalence on .
 In proof of the theorem:
- (1)
 We will use Lemma 5, Remark 2, Lemmas 6 and 7, and Remark 3.
- (2)
 Follows from the Lemma 5.
- (3)
 We already know that  is reflexive and symmetric. We are going to show that  is transitive relation using Lemma 8, Remark 4, and Theorem 2.
- (4)
 We already know that  is reflexive and symmetric (Note 3). We are going to show that  is transitive relation using Lemma 7, Remark 3.
Proof.  (1) Consider two cases:
-    (a)
 ,
-    (b)
 , and .
Lemma 5  (Claim 37 in [
16])
. Let p isolate q by a formula , with , such that there exist  and there are , , such that , and . Then there exists a formula  such that for all  there exist ,  such thatand p is quasisolitary if and only if q is quasisolitary. If , then by Lemma 5, if p is social, then q is social.
 Consider the case , . We can construct the 2-A-formula , with  such that for any , both , and  are convex,
Remark 2. 
Let . Consider , such that . Then  Lemma 6. Let .
- (i) 
 If , , then  if and only if  if and only if  if and only if .
- (ii) 
 If  such that , , then  or .
 Proof of Lemma 6
- (i) 
 This is an immediate corollary of the proof of Theorem 2 (iv).
- (ii) 
 By Theorem 2 (iv), the following is true:
Then
Suppose there is  such that . Let , with  be a formula such that . Consider the following formula:
Then , while . Consequently, . Which is a contradiction. Consideration of other cases are the same. Hence, Lemma 6 is proved.
Lemma 7. If  (respectively, ) then for any  (respectively, ), with , . And there exists , with ,  (respectively, ) such that
 Proof of Lemma 7
We suppose that , a consideration of the case  is the same. Let , then 
Suppose there exists , with , and .
Consider three -definable sets:
Since T is weakly o-minimal, , , is a union of convex -separable subsets, there are ,  is the maximal convex -definable subset such that Consider three cases:
We have two possibilities for p:
- a. 
 p is irrational to the left. Then there exists , with , such that
- b. 
 p is quasirational to the left. Then there exists , with , such that
Thus, we obtain:
Consider the following formula: Then  and . Which is a contradiction.
Then there is  — maximal -definable subset of  such that
Let
It follows that,  If  such that , then . This contradicts . Thus
It follows from Lemma 2 (ii) that if q is quasirational to the left or isolated, then there exists a 1-A-formula , with  such that Notice that .
Consider an arbitrary , then  and  Then
This contradicts the fact that . i = 3.
Then there is  — maximal -definable subset of  such that
Let  So, 
If , then . Contradiction with .
Thus  It follows from Lemma 2 (ii) that if q is quasirational to the left or isolated. Then there is a 1-A-formula , with  such that 
Let
Consider arbitrary , then , For , there exists  such that . By Remark 2, we then have  This leads to a contradiction, since . Therefore, It follows that  is the maximal -definable subset of . Clearly,  is the required formula. Hence, Lemma 7 is proved.
Let . Then,  is maximal convex to the left p-stable 2-A-formula. This implies that p is quasisolitary. Consequently, if p is social and , then . By Lemma 5 it follows that q is social.
Remark 3. Let , and . Then the following hold:
- (i) 
 If  then .
- (ii) 
 If , and  then
- (iii) 
 If , and  such that  then
 - (2) 
 follows from Lemma 5.
- (3) 
  for any  by Definition 12. If  then  by Lemma 3 (ii). Suppose , and .
Lemma 8. Let , , ,  such that . Then for any , for any , with  such that  for the formula  the following is true:
 Proof of Lemma 8
By Lemma 6 (ii), for any 
Then suppose that for any  Hence, Lemma 8 is proved. Remark 4. Let , and , and  such that M is -saturated.
- (i) 
 If , with  then for  such that  the following is true:
- (ii) 
 For every , and for every type , with  the following is true: 
 Consider , then  because . By Remark 4 (i) and Theorem 2 (iii) . Then, .
- (4) 
  for any  by Definition 1. If  then  by Note 3 (i). Suppose , , and . Thus, by Theorem 3 (ii), p and q are quasisolitary. Let  be a formula from Lemma 7. Then from Remark 3 (ii), it follows:
Let . If there exists  such that , and
then for any  
Without loss of generality suppose that  is increasing on classes of equivalence  of elements from . Consider the following formula:
If p is quasirational to the left then there exists  such that .
If p is non-quasirational to the left, then there is  such that
By a similar consideration of the formula we obtain a formula  such that  and Let . Then there is the formula  such that
Suppose  and  with . Let  be the maximal convex subformula of  such that . Then, . For  there is  such that . Hence,  we have  Consider the formula Therefore, , because . Moreover, , since . Thus, . Hence, Theorem 3 is proved.    □
 Corollary 1. The equivalence relations  and  partition the set of non-algebraic types from  into the classes of equivalence as follows:
- (i) 
 Every -class contains -classes or it coincides with a -class.
- (ii) 
 Every -class contains types only of one kind from six basic kinds of Remark 1.
- (iii) 
 Every -class, which contains social types, is a -class.
 Lemma 9  ([
16])
. Let , and  is p-stable formula where . There is , with  and there are , such that  Then there are ,  from  such that for the formula Theorem 4. Let  such that M is -saturated, , and . Then the following hold:
- (i) 
 If , then  if and only if .
- (ii) 
 If , , , then there exists  such that
- (iii) 
 If , and there is  such that , then
 Proof.  (i) It follows from Lemma 8 and Remark 4 (ii).
(ii) Let  be a formula from Lemma 7, which was obtained from the fact , and , such that  the following hold:
Without loss of generality, as in the proof of Lemma 7, we suppose:
Suppose , for all .
Let . Then there are two formulas , and , with  such that  and there are  such that
Consider the formula .
Because  is p-stable, Lemma 9 guarantees the existence of of  such that . Moreover, for every , it follows that . Let
Then for any 
, we have
Thus, there exist 
 such that 
 Suppose 
. Let us define
Then there are 
 such that
because there are 
 such that
Thus, 
 since there is 
 such that
Then  by the same consideration as for . Thus, . Which is a contradiction.
Thus,  such that . For quasisolitary type q, . Hence, (ii) is proved.
(iii) By Theorem 2 (v), we have  where , , and
The existence of these 
 follows from proof of (ii). Let 
 be such that 
 and 
. Suppose 
. Then 
. If 
, then there is 
, with 
, and 
 such that 
. Consider the following formula:
Thus, , and .
Suppose . Then . If , then there is , with , and  such that . Consider the following formula:
Thus, if , then , and consequently . This yields a contradiction. Hence,
□