Next Article in Journal
On n-Derivations and n-Homomorphisms in Perfect Lie Superalgebras
Previous Article in Journal
Statistics of Global Stochastic Optimisation: How Many Steps to Hit the Target?
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Orthogonality of 1-Types over Sets, Neighborhoods of Sets in 1-Types in Weakly Ordered Minimal Theories

by
Bektur Baizhanov
1,2,
Nargiza Tazabekova
1,2,3,* and
Tatyana Zambarnaya
1
1
Institute of Mathematics and Mathematical Modeling, Almaty 050010, Kazakhstan
2
School of Applied Mathematics, Kazakh-British Technical University, Almaty 050000, Kazakhstan
3
Faculty of Engineering and Natural Sciences, Department of Mathematics, SDU University, Kaskelen 040900, Kazakhstan
*
Author to whom correspondence should be addressed.
Mathematics 2025, 13(20), 3271; https://doi.org/10.3390/math13203271
Submission received: 26 August 2025 / Revised: 7 October 2025 / Accepted: 10 October 2025 / Published: 13 October 2025
(This article belongs to the Section A: Algebra and Logic)

Abstract

This paper examines the relationship between weak orthogonality and almost orthogonality for complete non-algebraic 1-types in weakly ordered minimal theories. A central element of our approach is the concept of neighborhoods, which encapsulate local properties of type realizations. This work contributes to a deeper understanding of the geometry of types in weakly ordered minimal theories and provides tools that may be applied in related model-theoretic contexts.

1. Introduction

This paper investigates weak orthogonality and almost orthogonality in the context of weakly ordered minimal structures. Recall that ordered minimality, introduced in Van den Dries’ work [1], provides a setting in which every definable subset of the domain is a finite union of points and intervals. Weak ordered minimality relaxes this condition by allowing definable subsets to be finite unions of convex sets, a concept introduced by Dickmann [2]. In the study of weak o-minimality, the work of Macpherson, Marker, and Steinhorn [3] was especially important, as it laid the basis for later research on minimality and its applications.
Our focus is on the interaction between non-algebraic complete 1-types. A key tool in our analysis is the study of neighborhoods, which capture local information about realizations of types.
The techniques used in this paper have also been applied in related contexts, such as expansion by unary externally definable predicates, and in the study of conservative extensions and type definability in weakly o-minimal theories.
The notions of orthogonality and almost orthogonality played a significant role in [4]. Furthermore, orthogonality plays an important role in counting countable models, as shown in the work of L. Mayer [5] and in later contributions in [6,7,8].
Our main results characterize the precise relationship between weak and almost orthogonality in S 1 ( A ) for weakly ordered minimal theories, and provide criteria for their equivalence. We also describe how these notions behave for specific classes of types, such as rational, irrational, solitary, and quasisolitary.
In contrast to the study of expansions, where quasi-neighborhoods play the central role, the investigation of orthogonality focuses on neighborhoods. Orthogonality has been extended to convex orthogonality for incomplete 1-types. In [9], convex orthogonality is considered for the convex closure of a complete type. The results obtained here complement those of [10].
Our results expand upon the framework introduced in an unpublished preprint, completing and extending several of its central arguments.

2. Preliminaries

We adhere to the following convention throughout.
Let a ¯ M l ( a ¯ ) with l ( a ¯ ) = l and a ¯ = a 1 , , a l , we write a ¯ M to mean { a 1 , , a l } M . Let 1 m < l , then a ¯ m : = a 1 , , a m .
Throughout, M is a model of a weakly o-minimal theory T, and M is a sufficiently large saturated elementary extension of M , the Latin letters denote elements of M : a ¯ , b ¯ , c ¯ , d ¯ M , while the Greek letters denote elements of M M : α ¯ , β ¯ , γ ¯ , μ ¯ M M .
For any C , D M , we write C < D if c < d whenever c C , d D . For c M , we write c < D if { c } < D .
For any D M set D : = { β M : β < D } and D + : = { β M : β > D } .
If A , B M with A < B , write ( A , B ) : = { γ M A < γ < B } . Note that ( A , B ) = A + B .
We use A B for inclusion, i.e., whenever a A implies a B , and A B for proper inclusion, i.e., if A B if A B and A B .
Whenever a set of parameters A M is fixed, we assume that M is | A | + -saturated.
Types p , q , r S 1 ( A ) will always be non-algebraic complete 1-types over A. By an isolated type, we mean a non-algebraic isolated type.
Aut A ( M ) is the group of all automorphisms of M that fix A pointwise, that is, f ( a ) = a for any f Aut A ( M ) and any a A .
We use the following notations:
  • x > F ( M , y ¯ ) z [ F ( z , y ¯ ) z < x ]
  • Ψ ( M , x ¯ ) > F ( M , y ¯ ) z t [ F ( z , y ¯ ) Ψ ( t , x ¯ ) z < t ]
  • p ( M ) = { γ M for any φ ( x ) p , M φ ( γ ) } , α p α p ( M )
Definition 1.
Let A be a linearly ordered set, and B A . We say that B is convex if, for all a , b B , and all x A ,
a < x < b x B .
Definition 2.
We say that a formula F ( x , y , a ¯ ) , with a ¯ A , is convex to the right if
M y x [ ( F ( x , y , a ¯ ) ( y x z ( y z x F ( z , y , a ¯ ) ) ) ) ] .
We say that a formula G ( x , y , a ¯ ) , with a ¯ A , is convex to the left if
M y x [ ( G ( x , y , a ¯ ) ( y x z ( x z y G ( z , y , a ¯ ) ) ) ] .
Definition 3
(Baizhanov B.S., Verbovskii V.V., [11]). 1. The convex closure of a formula φ ( x , a ¯ ) is the following formula:
φ c ( x , a ¯ ) : = y 1 y 2 φ ( y 1 , a ¯ ) φ ( y 2 , a ¯ ) ( y 1 x y 2 ) .
2. 
The convex closure of a type p ( x ) S 1 ( A ) is the following type:
p c ( x ) : = φ c ( x , a ¯ ) φ ( x , a ¯ ) p .
Definition 4
(Baizhanov B.S., [12]). Let p S 1 ( A ) . We say that a formula Φ ( x , y , a ¯ ) , with a ¯ A , is p-stable (p-preserving) if
for any α p , there exist γ 1 , γ 2 p such that γ 1 < Φ ( M , α , a ¯ ) < γ 2 .
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 γ ( v ) S 1 ( M ) is uniquely realizable over M if and only if, for any c realizing γ ( v ) , c is the only realization of γ ( v ) in the prime model P r ( M { c } ) .
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 p S 1 ( A ) 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 F ( x , y , a ¯ ) , where a ¯ A .
We say that p is semi-quasisolitary to the left if there exists the greatest p-preserving convex to the left 2-A-formula G ( x , y , a ¯ ) , where a ¯ A .
We say that p is quasisolitary if it is semi-quasisolitary to the right and to the left.
Let F ( y , x , a ¯ ) be the greatest convex to the right p-preserving formula, and G ( y , x , a ¯ ) is the greatest convex to the left p-preserving formula. It was proved in [16] that the formula E p ( x , y , a ¯ ) : = F ( x , y , a ¯ ) G ( x , y , a ¯ ) is an equivalence relation.
Let p S 1 ( A ) be quasisolitary. We say that p is solitary if E p ( x , y , a ¯ ) ( x = y ) .
Definition 7
([16]). A type p S 1 ( A ) 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 A M into two convex subsets C and D, such that C < D , is said to be a cut in A. If C has a supremum or D has an infimum in A { , } , then the cut ( C , D ) is said to be rational.
Definition 9
([10]). Let p S 1 ( A ) be non-isolated. We say that p is quasirational to the right if there exists a formula U ( x , a ¯ ) with a ¯ A such that, for any α p the following is true:
β [ α < β M U ( β , a ¯ ) t p ( β / A ) = p ] .
We say that p is quasirational to the left if there exists a formula U ( x , a ¯ ) with a ¯ A such that, for any α p the following is true:
β [ β < α M U ( β , a ¯ ) t p ( β / A ) = p ] .
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 p S 1 ( A ) , B M such that M is | B A | + -saturated. Then a neighborhood of a set B in the type p is the following set:
V p ( B ) : = { γ M γ 1 , γ 2 p ( M ) , there is H ( x , b ¯ , c ¯ ) , b ¯ B , c ¯ A , γ 1 < H ( M , b ¯ , c ¯ ) < γ 2 , γ H ( M , b ¯ , c ¯ ) } .
Let a ¯ = α 1 , α 2 , , α k then V p ( a ¯ ) : = V p ( { α 1 , α 2 , , α k } ) .
This definition adapts the notion of neighborhoods, which was introduced in the context of semi-isolation.

3. Results

Proposition 1.
Let p S 1 ( A ) .
(i) 
Let β p ( M ) . Then | V p ( β ) | = 1 if and only if p is solitary.
(ii) 
p is quasisolitary if and only if there exists β p ( M ) , and V p ( β ) is ( A β ) -definable set. (In fact E p ( M , β , c ¯ p ) = V p ( β ) )
Proof. 
(i) (⇒) Let p be a solitary type. It follows that, E p ( x , y , a ¯ ) ( x = y ) , which means that for every β p ( M ) , the equivalence class under E p contains only one element: β itself. Since V p ( β ) is defined as the equivalence class of β under E p , if p is solitary, then
V p ( β ) = { β } | V p ( β ) | = 1
  •    (⇐)
    Suppose | V p ( β ) | = 1 , then E p ( x , y ) identifies only trivial equivalences. Consequently, E p ( x , y ) ( x = y ) , and p is solitary.
(ii)
The neighborhood V p ( β ) is defined as the equivalence class of β under E p , i.e.,:
V p ( β ) = { x M | E p ( x , β , a ¯ ) } .
(⇒)
Let γ V p ( β ) , then there exists a formula H ( x , β ) such that γ H ( M , β ) p ( M ) . Let
H c ( x , β ) : = x 1 x 2 ( H ( x 1 , β ) H ( x 2 , β ) x 1 x x 2 ) .
Since p ( M ) is convex H c ( M , β ) p ( M ) . Notice that
H c ( x , β ) ( H c ( x , β ) x < β ) ( x = β ) ( H c ( x , β ) β < x ) .
Then V p ( β ) E ( M , β ) . On the other hand, by definition, E ( M , β ) V p ( β ) . Hence, E ( M , β ) = V p ( β ) .
(⇐)
Assume that for some β p ( M ) , the set V p ( β ) is ( A { β } ) -definable. That is, there exists a formula ψ ( x , β ) such that
V p ( β ) = { x M ψ ( x , β ) } .
Moreover, since V p ( β ) is an equivalence class under E p , it is convex and contained in p ( M ) . Define the formula E p ( x , y , c ¯ ) as follows:
E p ( x , y , c ¯ ) β ψ ( x , β ) ψ ( y , β ) .
Then E p ( x , y , c ¯ ) defines an equivalence relation on p ( M ) with convex classes, and for the fixed β , we have:
E p ( M , β , c ¯ ) = V p ( β ) .
Therefore, p is quasisolitary.
Lemma 1.
α V p ( β ) β V p ( α )
Proof. 
Suppose α V p ( β ) . Then there exists a formula θ ( x , β ) and elements γ 1 , γ 2 p ( M ) such that:
γ 1 < θ ( M , β ) < γ 2 , α θ ( M , β ) and y ( θ ( α , y ) y < α ) . θ c ( x , β ) : = x 1 , x 2 ( ( x 1 x x 2 ) i = 1 2 θ ( x i , β ) ) .
We know that if f A u t A ( M ) then for every formula H ( x 1 , x n ) it holds that M H ( c 1 , c n ) M H ( f ( c 1 ) , f ( c n ) ) . Now consider an automorphism f of M fixing A such that f ( γ 2 ) = γ 1 , f ( β ) = β , f ( γ 1 ) = γ 2 .
γ 1 < θ c ( M , β ) < γ 2 = γ 1 < θ c ( M , β ) < γ 2
It is clear that α θ c ( M , β ) , consequently θ c ( α , β ) . Therefore, there exists μ such that μ < θ c ( α , M ) < γ 2 .
If K ( γ 1 , β , γ 2 ) then K ( γ 1 , β , γ 2 ) . Thus, the formula θ c ( α , y ) serves as a witness to the fact that β V p ( α ) , since for any n < ω the formula θ ( x , f n ( β ) ) fails at x = α (such that θ ( α , f n ( β ) ) ) .
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 p , q S 1 ( A ) be non-algebraic, α p ( M ) , and let Φ ( x , y , a ¯ ) , where a ¯ A , be such that Φ ( M , α , a ¯ ) q ( M ) (that is, p isolates q).
Φ ( M , β , a ¯ ) q ( M ) for each β p .
2. 
If q is irrational to the left, then there is no M-definable formula C ( x ) with C ( M ) = q ( M ) , and for any formula Φ ( x , β ¯ ) , where β ¯ M , with Φ ( M , β ¯ ) q ( M ) , there exists γ q ( M ) such that γ < Φ ( M , β ¯ ) .
3. 
If q is irrational to the right, that is, there does not exist an M-definable formula C ( x ) with C ( M ) = q ( M ) + , then for any formula Φ ( x , β ¯ ) , where β ¯ M , with Φ ( M , β ¯ ) q ( M ) , there exists γ q ( M ) such that γ > Φ ( M , β ¯ ) .
Proof. 
1. Let p , q S 1 ( A ) be non-algebraic types, α p , and let Φ ( x , y , a ¯ ) be a formula with parameters a ¯ A such that Φ ( M , α , a ¯ ) q ( M ) (p isolates q). Let
q ( M ) = L q L ( M ) .
Fix any formula L ( x ) q , and define the formula
K L ( α ) : = x ( Φ ( x , α , a ¯ ) L ( x ) ) . K L ( y ) t p ( α A ) = p
Since β p ( M ) then
α q ( M ) K L ( β ) Φ ( M , β , a ¯ ) L ( M ) = q ( M ) β q ( M ) .
2.
Let q S 1 ( A ) be irrational to the left. We claim that there is no M-definable formula C ( x ) such that C ( M ) = q ( M ) . Suppose there is such formula C ( x ) , then ( C ( x ) q ( x ) ) is consistent because for any finite set of formulas { Φ i ( x ) | Φ i ( x ) q }
x ( Φ i ( x ) C ( x ) ) .
Thus, there is a realization μ of ( C ( x ) q ( x ) ) contradicting the assumption.
Let Φ ( x , β ¯ ) q ( M ) be any formula with parameters β ¯ M . This implies that for every Φ ( x , β ¯ ) q ( M ) , there is an element γ q ( M ) such that γ < Φ ( M , β ¯ ) .
Otherwise Φ ( x , β ¯ ) would be bounded below inside q ( M ) , contradicting the irrationality of q to the left. Thus, the set
{ y ( Φ ( y , β ¯ ) x < y ) } q ( x )
is consistent, and therefore there exists some γ such that γ < Φ ( M , β ¯ ) .
3.
Let q S 1 ( A ) be irrational to the right. We claim that there is no M -definable formula C ( x ) such that C ( M ) = q ( M ) + .
Suppose such a formula C ( x ) exists. Then the set C ( x ) q ( x ) is consistent because for any finite set of formulas { Φ i ( x ) Φ i ( x ) q } , we have
x Φ i ( x ) C ( x ) .
Thus, there is a realization μ of C ( x ) q ( x ) , which contradicts the assumption that q is irrational to the right.
Let Φ ( x , β ¯ ) q ( M ) be any formula with parameters β ¯ M . This implies that for every Φ ( x , β ¯ ) q ( M ) , there is an element γ q ( M ) such that γ > Φ ( M , β ¯ ) .
Otherwise, Φ ( x , β ¯ ) would be bounded above inside q ( M ) , contradicting the irrationality of q to the right. Thus, the set
y Φ ( y , β ¯ ) y < x q ( x )
is consistent, yielding some γ such that γ > Φ ( M , β ¯ ) such that γ q ( M ) .
Theorem 2.
Let p S 1 ( A ) , B M such that M is | A B | + -saturated. Then the following holds:
(i) 
V p ( B ) is convex or empty.
(ii) 
Let p be irrational. Then a ¯ M M , for any formula H ( x , α ¯ , a ¯ ) , a ¯ A
[ H ( M , a ¯ , a ¯ ) , H ( M , α ¯ , a ¯ ) p ( M ) H ( M , α ¯ , a ¯ ) V p ( a ¯ ) ] .
(iii) 
V p ( B ) γ 1 , γ 2 p ( M ) , γ 1 < V p ( B ) < γ 2 .
(iv) 
β p ( M ) [ V p ( B ) , β V p ( B ) q S 1 ( A ) , V q ( β ) V q ( B ) = ] .
(v) 
α p ( M ) : V p ( B ) < α α 0 p ( M ) [ V p ( B ) < α 0 < V p ( α ) ] .
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 q S 1 ( A ) such that V q ( β ) V q ( B ) . Then there exists Φ ( x , β , b ¯ ) , with b ¯ A , and there is H ( x , a ¯ , c ¯ ) , with a ¯ B , c ¯ A such that
γ Φ ( M , β , b ¯ ) H ( M , a ¯ , c ¯ ) , Φ ( M , β , b ¯ ) V q ( β ) , H ( M , a ¯ , c ¯ ) V q ( B ) .
By Definition 10 there are γ 1 , γ 2 , γ 3 , γ 4 q ( M ) such that
γ 1 < Φ ( M , β , b ¯ ) < γ 2 , γ 3 < H ( M , a ¯ , c ¯ ) < γ 4 .
Let μ 1 = min { γ 1 , γ 3 } , μ 2 = max { γ 2 , γ 4 } , f Aut A ( M ) be such that f ( μ 2 ) = μ 1 . Define β 1 : = f ( β ) , β 2 : = f 1 ( β ) . Then
Φ ( M , β 1 , b ¯ ) < μ 1 < H ( M , a ¯ , c ¯ ) < μ 2 < Φ ( M , β 2 , b ¯ ) ,
and either β 1 < β < β 2 or β 2 < β < β 1 . Now let
K ( y , a ¯ , b ¯ , c ¯ ) : = x ( H ( x , a ¯ , c ¯ ) Φ ( x , y , b ¯ ) ) .
Then β K ( M , a ¯ , b ¯ , c ¯ ) , while β 1 , β 2 K ( M , a ¯ , b ¯ , c ¯ ) . Let K 1 ( x , a ¯ , b ¯ , c ¯ ) be a convex subformula of K ( x , a ¯ , b ¯ , c ¯ ) such that β K 1 ( M , a ¯ , b ¯ , c ¯ ) . Thus
β 1 < K 1 ( M , a ¯ , b ¯ , c ¯ ) < β 2   or   β 2 < K 1 ( M , a ¯ , b ¯ , c ¯ ) < β 1 .
Then β V p ( a ¯ ) and β V p ( B ) . Which is a contradiction.
(v)
Assume V p ( B ) < α .
Step 1.
We are going to show that V p ( B ) < V p ( α ) . Suppose for contradiction that V p ( B ) and V p ( α ) are not disjoint sets V p ( B ) V p ( α ) . Let V p ( B ) = H i ( M , b ¯ , c ¯ ) and
V p ( α ) = { δ δ Φ ( M , α , a ¯ ) , γ 1 , γ 2 ( γ 1 < Φ ( M , α , a ¯ ) < γ 2 } .
Pick some γ H ( M , b ¯ , c ¯ ) Φ ( M , α , a ¯ ) . Define
K ( y , b ¯ , c ¯ ) : = x H ( x , b ¯ , c ¯ ) Φ ( x , y , a ¯ ) .
Since α K ( y , b ¯ , c ¯ , a ¯ ) , with b ¯ B , and a ¯ , c ¯ A , it follows that α V p ( B ) .
This is a contradiction, because we assumed V p ( B ) < α . Hence, we conclude that V p ( B ) < V p ( α ) .
Step 2.
Now we will show that α 0 p ( M ) [ V p ( B ) < α 0 < V p ( α ) ] .
(a)
V p ( α ) is definable.
(a1)
V p ( B ) is definable.
Let U ( M ) = V p ( B ) + be the right border of the neighborhood V p ( B ) .
F ( y , b ¯ 0 , c ) : = U ( x , b ¯ 0 , c ¯ ) x < y x [ ( U ( M , b 0 , c ) < z ( E p ( z , y ) E p ( M , y ) < z ) ]
Since α F ( M , b ¯ 0 , c ¯ ) , then α V p ( B ) .
(a2)
The neighborhood is
V p ( B ) = i I H i ( M , b ¯ 0 , c ¯ ) .
The set of formulas
{ ( H i 1 ( M , b ¯ , c ) H i n ( M , b ¯ , c ) ) < x < E p ( M , α ) i , i n I }
is consistent, and consequently there is α 0 that satisfies the set. Then
V p ( B ) < α 0 < V p ( α ) .
(b)
V p ( α ) is non-definable. Since by Step 1 V p ( B ) < V p ( α ) , then the lower bound of V p ( α ) is non-definable. The set of formulas
{ H ( M , b ¯ , c ¯ ) < x < Φ ( M , α , a ¯ ) H ( M , b ¯ , c ¯ ) V p ( B ) , Φ ( M , α , a ¯ ) V p ( B ) }
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 p , q S 1 ( A ) . We say that p is weakly orthogonal to q ( p w q ) if for any H ( x , y , a ¯ ) , with a ¯ A , for any α p ( M ) , the following holds:
[ H ( M , α , a ¯ ) q ( M ) q ( M ) H ( M , α , a ¯ ) ] .
If p is not weakly orthogonal to q, we will denote this fact by p ̸ w q .
Lemma 3.
(i) p ̸ w q q ̸ w p .
(ii) 
p w q p ( x ) q ( y ) is a complete 2-A-type.
(iii) 
If p is algebraic, then for every q S 1 ( A ) , it follows that p w q .
Proof. 
(i) Assume p ̸ w q . Then there exist an A–formula H ( x , y , a ¯ ) , some α p ( M ) , and there are β 1 , β 2 q ( M ) such that
M H ( α , β 1 , a ¯ ) and M ¬ H ( α , β 2 , a ¯ ) .
  • Assume q w p . Since α satisfies H ( β 1 , x , a ¯ ) , then H ( β 1 , M , a ¯ ) p ( M ) . Let us define the following set of formulas:
    Γ : = { y H ( x , y , a ¯ ) ψ i ( y ) ψ 1 p ( y ) } q ( x ) ,
    β 2 satisfies Γ . Then
    { H ( β 2 , y , a ¯ ) ψ i ( y ) ψ i ( y ) p ( y ) }
    is consistent and closed over finite conjunction. Since for any finite I 0
    ψ ( y ) : = i I 0 ψ i ( y ) p ( y ) .
    There is some α p that satisfies the set
    { H ( β 2 , y , a ¯ ) ψ i ( y ) ψ i ( y ) p ( y ) } .
    Since ¬ H ( β 2 , α , a ¯ ) , then p ( M ) H ( β 2 , y , a ¯ ) . Therefore, q ̸ w p .
    In general the weak orthogonality relation ̸ w is symmetric.
(ii)
(⇒)
Assume p w q , and let α p ( M ) , β q ( M ) . Then for any A-formula H ( y , x , a ¯ ) , for any α and any β
H ( M , α , a ¯ ) q ( M ) q ( M ) H ( M , α , a ¯ ) .
If there exists a realization β of q such that H ( y , α , a ¯ ) holds, then by weak orthogonality every realization of q also must satisfy H ( y , α , a ¯ ) . Consequently, for every pair α p ( M ) , β q ( M ) we have
either M H ( β , α , a ¯ ) if H ( M , α , a ¯ ) q ( M ) or M ¬ H ( β , α , a ¯ ) if H ( M , α , a ¯ ) q ( M ) = .
Therefore,
p ( x ) q ( y ) H ( y , x , a ¯ ) or p ( x ) q ( y ) ¬ H ( y , x , a ¯ ) .
Since H ( y , x , a ¯ ) was arbitrary, p ( x ) q ( y ) decides every A-formula in the variables x , y . Thus p ( x ) q ( y ) is a complete 2-A-type.
(⇐)
Assume that p ( x ) q ( y ) is a complete 2-A-type.
Let α p , and let H ( y , x , a ¯ ) be any L ( A ) –formula. Suppose H ( M , α , a ¯ ) q ( M ) . Let β q with M H ( β , α , a ¯ ) . By completeness of p ( x ) q ( y ) applied to the formula H ( y , x , a ¯ ) we have
p ( x ) q ( y ) H ( y , x , a ¯ ) or p ( x ) q ( y ) ¬ H ( y , x , a ¯ ) .
The second alternative cannot hold, since α p , β q , and M H ( β , α , a ¯ ) . Hence
p ( x ) q ( y ) H ( y , x , a ¯ ) .
Therefore, for every β q we have M H ( β , α , a ¯ ) , i.e.,
q ( M ) H ( M , α , a ¯ ) .
Since H ( y , x , a ¯ ) and α were arbitrary, this is exactly the definition of p w q .
(iii)
Let p is algebraic over A. Then there is an A-formula ϕ ( x ) whose set of solutions is exactly p ( M ) . Then ! n x ϕ ( x ) , and n = 1 .
Let suppose there are α 1 , , α n p ( M ) such that α 1 < α 2 < < α n . Then
ϕ ( x ) x ( ϕ ( x ) ¬ ( x = x ) ) ( x < x )
isolates exactly one element.
Suppose there is H ( y , x , a ¯ ) in p such that ¬ H ( y , α , a ¯ ) in q.
q ( y ) { H ( y , α , a ¯ ) } q ( y ) { H ( y , α , a ¯ ) }
Since x is singular then it is consistent that
q ( y ) { x ( H ( y , x , a ¯ ) ϕ ( x ) ) } q ( y ) { x ( ¬ H ( y , x , a ¯ ) ϕ ( x ) ) } .
Since the formulas are mutually contradictory, they cannot be used together. Therefore, p w q .
Definition 12.
Let p , q S 1 ( A ) . We say that p is almost orthogonal to q ( p a q ), if α p ( M ) ( α p ( M ) ), and V q ( α ) = . If p is not almost orthogonal to q, then we denote this fact by p ̸ a q .
From this definition p a q if and only if V p ( α ) . And V p ( α ) there is a formula Φ ( x , α , a ¯ ) such that there are γ 1 , γ 2 q ( M ) ,
γ 1 < Φ ( M , α , a ¯ ) < γ 2 .
Lemma 4.
Let p , q S 1 ( A ) . Then the following propositions are true:
(i) 
p w q p a q .
(ii) 
There exists T — a weakly o-minimal theory such that p ̸ w q , and p a q .
(iii) 
Let T be o-minimal. Then p a q p w q .
Proof. 
(i) Assume p w q . By the definition of weak orthogonality, for every A-definable formula H ( x , y , a ¯ ) and every α p ,
H ( M , α , a ¯ ) q ( M ) q ( M ) H ( M , α , a ¯ ) .
  • By the definition of the neighborhood V q ( α ) , there exist γ 1 , γ 2 q ( M ) and an A-definable formula H ( x , y , a ¯ ) such that
    γ 1 < H ( M , α , a ¯ ) < γ 2 and H ( M , α , a ¯ ) q ( M ) .
    In particular, H ( M , α , a ¯ ) q ( M ) but q ( M ) H ( M , α , a ¯ ) (since γ 1 , γ 2 q ( M ) lie outside the convex set H ( M , α , a ¯ ) ). This contradicts (1).
    Hence V q ( α ) = for (some hence all) α p , which is exactly p a q by the definition of almost orthogonality.
(ii)
Let consider Σ = < = , < , P 1 , U 2 , c 1 , , c n > n < ω , and M = < M , Σ > .
M = Q Q + 2 , Q + 2 = { a + 2 a Q } P ( M ) = Q , ¬ P ( M ) = Q + 2 P ( M ) < ¬ P ( M ) elements of both P ( M ) and ¬ P ( M ) are densely ordered .
Let U 2 ( x , y ) is a binary relation such that
M x y [ U 2 ( x , y ) ( P ( x ) ¬ P ( y ) ) ] . M U 2 ( a , b ) a Q , b Q + 2 , R a < b M ( c n < c n + 1 ) P ( c n ) , n < ω .
The theory of this structure has quantifier elimination. Let us define non-algebraic 1-types
p ( x ) = { P ( x ) } { c n < x n < w } q ( y ) = { ¬ P ( y ) } { U 2 ( c n , y ) n < ω } .
Thus, p ̸ w q , since for an arbitrary α p the set q ( y ) { U ( α , y ) } and the set q ( y ) { ¬ U ( α , y ) } are both consistent.
Let consider an authomorphism f such that f ( γ 1 ) = γ 2 , and f ( α ) = α .
t p ( γ 1 / α ) = t p ( γ 2 / α ) β 1 < β 2 , t p ( β 1 / α ) = t p ( β 2 / α )
Since we do not have any formula in that type, then V q ( α ) = . Therefore, p a q .
(iii)
(⇒)
Since by (i) p w q p a q in any theory, then it is true for o-minimal theories.
(⇐)
Assume p a q . We must show that p w q . Let H ( x , y , a ¯ ) be any A-definable formula and let α p . Suppose
H ( M , α , a ¯ ) q ( M ) .
Set S : = H ( M , α , a ¯ ) M . By o-minimality, S is a finite union of points and open intervals; Hence it is a finite union of convex sets. Since q ( M ) is convex, the intersection S q ( M ) is again a finite union of convex subsets of q ( M ) .
We claim that S q ( M ) = q ( M ) . Suppose not. Then there exists a nonempty convex component C S q ( M ) which is a proper subset of q ( M ) . Because q ( M ) is convex, we can choose γ 1 , γ 2 q ( M ) with
γ 1 < C < γ 2 ( i . e . , y C ( γ 1 < y < γ 2 ) ) .
But C S = H ( M , α , a ¯ ) , so γ 1 < H ( M , α , a ¯ ) < γ 2 .
By the definition of the neighborhood V q ( α ) , this implies V q ( α ) , contradicting p a q . Hence, the assumption was false, and we must have q ( M ) S .
Since H ( x , y , a ¯ ) , α and a ¯ were arbitrary, we have shown that for every A-definable H ( x , y , a ¯ ) and every α p ,
H ( M , α , a ¯ ) q ( M ) q ( M ) H ( M , α , a ¯ ) ,
which is exactly p w q by definition.
The following example illustrates that that the inverse of Lemma 4 (i) does not hold.
Example 1.
Let M = Q ; = , < , U , a i , b j , c i i N , j Z , where U is a binary predicate, < is the standard relation of dense linear order without endpoints, a i 1 < a i 2 < b j 1 < b j 2 < c k 2 < c k 1 for all i 1 < i 2 , k 1 < k 2 from N and all j 1 < j 2 from Z , and
lim i a i = lim i b j = e , lim i b i = lim i c i = π
And let M U ( a , b ) if and only if R b > a e + π .
Define p ( x ) : = { a i < x < b j | i N , j N } , and q ( y ) : = { b j < y < c k | j , k N } . The types p and q are distinct non-isolated types over the empty set. Let M be an arbitrary model of T h ( M ) realizing the type p. For each α p ( M ) the set U ( α , M ) is a convex set such that U ( α , M ) ¬ q ( M ) , U ( α , M ) q ( M ) , and q ( M ) + U ( α , M ) . Moreover, there is no ∅-definable formula K ( x , y ) such that K ( α , M ) is a proper subset of q ( M ) . Then p ̸ w q , but p a q .
Theorem 3.
Let p , q S 1 ( A ) . Then the following propositions are true:
(1) 
Let p ̸ w q . If p is social, then q is social, and p ̸ a q .
(2) 
p ̸ a q q ̸ a p .
(3) 
̸ a is a relation of equivalence on S 1 ( A ) .
(4) 
̸ w is a relation of equivalence on S 1 ( A ) .
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 ̸ a is reflexive and symmetric. We are going to show that ̸ a is transitive relation using Lemma 8, Remark 4, and Theorem 2.
(4)
We already know that ̸ w is reflexive and symmetric (Note 3). We are going to show that ̸ w is transitive relation using Lemma 7, Remark 3.
Proof. 
(1) Consider two cases:
  •    (a)
    p ̸ a q ,
       (b)
    p ̸ w q , and p ̸ a q .
    Lemma 5 
    (Claim 37 in [16]). Let p isolate q by a formula Φ ( x , y , a ¯ ) , with a ¯ A , such that there exist α p ( M ) and there are γ 1 , γ 2 q ( M ) , such that γ 1 < Φ ( M , α , a ¯ ) < γ 2 , and Φ ( M , α , a ¯ ) . Then there exists a formula Φ 0 ( x , y , a ¯ ) such that for all β q ( M ) there exist μ 1 , μ 2 p ( M ) such that
    Φ 0 ( β , M , a ¯ ) , μ 1 < Φ 0 ( β , M , a ¯ ) < μ 2
    and p is quasisolitary if and only if q is quasisolitary.
    If p ̸ a q , then by Lemma 5, if p is social, then q is social.
    Consider the case p ̸ w q , p a q . We can construct the 2-A-formula H ( x , y , a ¯ ) , with a ¯ A such that for any α p ( M ) , both H ( M , α , a ¯ ) , and ¬ H ( M , α , a ¯ ) are convex,
    H ( M , α , a ¯ ) ¬ H ( M , α , a ¯ ) = M , β 1 H ( M , α , a ¯ ) q ( M ) , β 2 ¬ H ( M , α , a ¯ ) q ( M ) , H ( M , α , a ¯ ) < ¬ H ( M , α , a ¯ ) .
Remark 2.
α , β p ( M )
[ γ H ( M , α , a ¯ ) H ( M , β , a ¯ ) H ( M , β , a ¯ ) H ( M , α , a ¯ ) ] .
Let α p ( M ) . Consider f Aut A ( M ) , such that f ( β 1 ) = β 2 . Then
H ( M , α , a ¯ ) H ( M , f ( α ) , a ¯ ) .
Lemma 6.
Let p , q S 1 ( A ) .
(i) 
If α p ( M ) , β q ( M ) , then α V p ( β ) if and only if β V q ( α ) if and only if V p ( α ) = V p ( β ) if and only if V q ( α ) = V q ( β ) .
(ii) 
If α 1 , α 2 , α 3 p ( M ) such that α 1 < V p ( α 2 ) < α 3 , V q ( α 1 ) , then V q ( α 1 ) < V q ( α 2 ) < V q ( α 3 ) or V q ( α 3 ) < V q ( α 2 ) < V q ( α 1 ) .
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:
q S 1 ( A ) , V q ( α i ) V q ( α j ) = , i j { 1 , 2 , 3 } , and V p ( α 1 ) < V p ( α 2 ) < V p ( α 3 ) .
Then
t p ( α 1 / A α 3 ) = t p ( α 2 / A α 3 ) , t p ( α 2 / A α 1 ) = t p ( α 3 / A α 1 ) .
Suppose there is q S 1 ( A ) such that V q ( α 1 ) < V q ( α 3 ) < V q ( α 2 ) . Let H ( x , y , a ¯ ) , with a ¯ A be a formula such that H ( M , α 1 , a ¯ ) V q ( α 1 ) . Consider the following formula:
G ( y , α 3 , a ¯ ) : = y < α 3 x z ( ( H ( x , y , a ¯ ) H ( z , α 3 , a ¯ ) ) z < x ) .
Then α 1 G ( M , α 3 , a ¯ ) , while α 2 G ( M , α 3 , a ¯ ) . Consequently, α 2 V p ( α 3 ) . Which is a contradiction. Consideration of other cases are the same. Hence, Lemma 6 is proved.
Lemma 7.
If f ( α ) > α (respectively, f ( α ) < α ) then for any β < α (respectively, β > α ), with β p ( M ) , H ( M , β , a ¯ ) H ( M , α , a ¯ ) . And there exists U ( x , α , c ¯ ) , with c ¯ A , U ( M , α , c ¯ ) < α (respectively, U ( M , α , c ¯ ) > α ) such that
β < α , β p ( M ) [ H ( M , β , a ¯ ) H ( M , α , a ¯ ) β U ( M , α , c ¯ ) ] .
Proof of Lemma 7
We suppose that f ( α ) > α , a consideration of the case f ( α ) < α is the same. Let α 0 = f 1 ( α ) , then H ( M , α 0 , a ¯ ) H ( M , α , a ¯ ) .
Suppose there exists β p ( M ) , with β < α , and H ( M , α , a ¯ ) H ( M , β , a ¯ ) .
Consider three < α , a ¯ > -definable sets:
K 1 ( M , α , a ¯ ) : = { γ M : γ < α , H ( M , α , a ¯ ) = H ( M , γ , a ¯ ) } , K 2 ( M , α , a ¯ ) : = { γ M : γ < α , H ( M , α , a ¯ ) H ( M , γ , a ¯ ) } , K 3 ( M , α , a ¯ ) : = { γ M : γ < α , H ( M , γ , a ¯ ) H ( M , α , a ¯ ) } .
Clearly,
α 0 K 3 ( M , α , a ¯ ) p ( M ) , β K 2 ( M , α , a ¯ ) p ( M ) .
Since T is weakly o-minimal, K i ( M , α , a ¯ ) , i = 1 , 2 , 3 , is a union of convex ¬ K i ( M , α , a ¯ ) -separable subsets, there are i { 1 , 2 , 3 } , K i j ( M , α , a ¯ ) is the maximal convex < α , a ¯ > -definable subset such that
γ K i j ( M , α , a ¯ ) p ( M ) μ [ p ( M ) < μ < γ μ K i j ( M , α , a ¯ ) ] .
Consider three cases:
i = 1 .
We have two possibilities for p:
a. 
p is irrational to the left. Then there exists C ( x , c ¯ ) , with c ¯ A , such that
C ( M , c ¯ ) K i j ( M , α , a ¯ ) , C ( M , c ¯ ) < p ( M ) .
b. 
p is quasirational to the left. Then there exists C ( x , c ¯ ) , with c ¯ A , such that
C ( M , c ¯ ) C ( M , c ¯ ) = p ( M ) .
Thus, we obtain:
M z ( C ( M , c ¯ ) < z < α x [ C ( M , c ¯ ) < x < z H ( M , α , a ¯ ) H ( M , x , a ¯ ) ] ) .
Consider the following formula:
Φ ( y , c ¯ , a ¯ ) : = z ( C ( M , c ¯ ) < z x [ C ( M , c ¯ ) < x < z ¬ H ( y , x , a ¯ ) ] ) .
Then β 2 Φ ( M , c ¯ , a ¯ ) and β 1 Φ ( M , c ¯ , a ¯ ) . Which is a contradiction.
i = 2 .
Then there is K 3 m ( M , α , a ¯ ) — maximal < α , a ¯ > -definable subset of K 3 ( M , α , a ¯ ) such that
K 3 m ( M , α , a ¯ ) p ( M ) , K 2 j ( M , α , a ¯ ) < K 3 m ( M , α , a ¯ ) .
Let
L ( x , α , a ¯ ) : = y ( K 3 m ( y , α , a ¯ ) ¬ H ( x , y , a ¯ ) H ( x , α , a ¯ ) ) .
It follows that, L ( M , α , a ¯ ) q ( M ) .
If μ q ( M ) such that μ < L ( M , α , a ¯ ) , then μ < β 2 . This contradicts p a q . Thus
L ( M , α , a ¯ ) = q ( M ) .
It follows from Lemma 2 (ii) that if q is quasirational to the left or isolated, then there exists a 1-A-formula G ( x , g ¯ ) , with g ¯ A such that
G ( M , g ¯ ) ¬ G ( M , g ¯ ) = q ( M ) .
Let
Θ 1 ( α , a ¯ , g ¯ ) : = z ( G ( M , g ¯ ) < z H ( z , α , a ¯ ) x ( G ( M , g ¯ ) < x < z y [ K 3 m ( y , α , a ¯ ) ¬ H ( x , y , a ¯ ) ] ) ) .
It is clear that
M Θ 1 ( α , a ¯ , g ¯ ) .
Notice that δ p ( M ) M Θ 1 ( δ , a ¯ , g ¯ ) .
Consider an arbitrary δ K 3 j ( M , α , a ¯ ) p ( M ) , then H ( M , α , a ¯ ) H ( M , δ , a ¯ ) and K 3 m ( M , δ , a ¯ ) K 2 j ( M , α , a ¯ ) . Then
α 1 K 3 m ( M , δ , a ¯ ) , a n d H ( M , α 1 , a ¯ ) H ( M , α , a ¯ ) .
This contradicts the fact that M Θ 1 ( δ , a ¯ , g ¯ ) .
i = 3.
Then there is K 2 m ( M , α , a ¯ ) — maximal < α , a ¯ > -definable subset of K 2 ( M , α , a ¯ ) such that
K 2 m ( M , α , a ¯ ) p ( M ) , K 3 j ( M , α , a ¯ ) < K 2 m ( M , α , a ¯ ) .
Let R ( x , α , a ¯ ) : = y ( K 2 m ( y , α , a ¯ ) H ( x , y , a ¯ ) ¬ H ( x , α , a ¯ ) ) . So, R ( M , α , a ¯ ) q ( M ) .
If μ q ( M ) ( R ( M , α , a ¯ ) < μ ) , then β 1 < R ( M , α , a ¯ ) < μ . Contradiction with p a q .
Thus R ( M , α , a ¯ ) + = q ( M ) + . It follows from Lemma 2 (ii) that if q is quasirational to the left or isolated. Then there is a 1-A-formula D ( x , d ¯ ) , with d ¯ A such that D ( M , d ¯ ) + = q ( M ) + .
Let
Θ 2 ( α , a ¯ , d ¯ ) : = x ( D ( x , d ¯ ) ¬ H ( x , α , a ¯ ) y ( K 2 m ( y , α , a ¯ ) ¬ H ( x , y , a ¯ ) ) ) .
Consider arbitrary δ K 3 j ( M , α , a ¯ ) p ( M ) , then M Θ 2 ( δ , a ¯ , d ¯ ) ,
K 2 m ( M , δ , a ¯ ) K 3 j ( M , α , a ¯ ) p ( M ) .
For β 2 , there exists α 1 K 2 m ( M , δ , a ¯ ) such that β 2 H ( M , α 1 , a ¯ ) . By Remark 2, we then have H ( M , α , a ¯ ) H ( M , α 1 , a ¯ ) . This leads to a contradiction, since α 1 K 3 j ( M , α , a ¯ ) . Therefore,
p ( M ) K 2 ( M , α , a ¯ ) = and K 1 ( M , α , a ¯ ) p ( M ) > K 3 ( M , α , a ¯ ) .
It follows that U ( M , α , a ¯ ) is the maximal < α , a ¯ > -definable subset of K 3 ( M , α , a ¯ ) . Clearly, U ( x , α , a ¯ ) is the required formula. Hence, Lemma 7 is proved.
Let G ( x , α , a ¯ ) : = U ( M , α , a ¯ ) < x α . Then, G ( x , y , a ¯ ) is maximal convex to the left p-stable 2-A-formula. This implies that p is quasisolitary. Consequently, if p is social and p ̸ w q , then p ̸ a q . By Lemma 5 it follows that q is social.
Remark 3.
Let p , q S 1 ( A ) , and p ̸ w q . Then the following hold:
(i) 
If α p ( M ) then [ p a q V q ( α ) = ] .
(ii) 
If p a q , and α , β p ( M ) then
[ H ( M , α , a ¯ ) = H ( M , β , a ¯ ) E p ( α , β , c ¯ p ) ] .
(iii) 
If p a q , and B M such that V p ( B ) then
[ V q ( B ) = α p ( M ) , V p ( B ) = E p ( M , α , c ¯ p ) ] .
(2) 
follows from Lemma 5.
(3) 
p ̸ a p for any p S 1 ( A ) by Definition 12. If p ̸ a q then q ̸ a p by Lemma 3 (ii). Suppose r ̸ a p , and p ̸ a q .
Lemma 8.
Let p S 1 ( A ) , α 1 , α 2 p ( M ) , Φ ( x , β ¯ ) , β ¯ M such that V p ( α 1 ) < Φ ( M , β ¯ ) < V p ( α 2 ) . Then for any q S 1 ( A ) ( p ¬ a q ) , for any Ψ ( x , y , a ¯ ) , with a ¯ A such that Ψ ( M , α 1 , a ¯ ) V q ( α 1 ) for the formula K Φ , Ψ ( y , β ¯ , a ¯ ) : = x ( Φ ( x , β ¯ , a ¯ ) Ψ ( y , x , a ¯ ) ) the following is true:
V q ( α 1 ) < K Φ , Ψ ( M , β ¯ , a ¯ ) < V q ( α 2 ) .
Proof of Lemma 8
By Lemma 6 (ii), for any α 0 , α 0 Φ ( M , β ¯ )
V q ( α 1 ) < V q ( α 0 ) < V q ( α 2 ) V q ( α 1 ) < V q ( α 0 ) < V q ( α 2 ) .
Then suppose that for any α 0 Φ ( M , β ¯ )
V q ( α 1 ) < Ψ ( M , α 0 , a ¯ ) < V q ( α 2 ) .
Thus,
V q ( α 1 ) < α 0 Φ ( M , β ¯ ) Ψ ( M , α 0 , a ¯ ) < V q ( α 2 ) .
Then
V q ( α 1 ) < K Φ , Ψ ( M , β ¯ , a ¯ ) < V q ( α 2 ) .
Hence, Lemma 8 is proved.
Remark 4.
Let p S 1 ( A ) , and B M , and V p ( B ) such that M is | A B | + -saturated.
(i) 
If α 1 < V p ( B ) < α 2 , with α 1 , α 2 p ( M ) then for q S 1 ( A ) such that q ̸ a p the following is true:
V q ( B ) and V q ( α 1 ) < V q ( B ) < V q ( α 2 ) or V q ( α 2 ) < V q ( B ) < V q ( α 1 ) .
(ii) 
For every α 0 V p ( B ) , and for every type q S 1 ( A ) , with q ̸ a p the following is true: V q ( α 0 ) V q ( B ) .
Consider β r ( M ) , then V p ( β ) because r ̸ a p . By Remark 4 (i) and Theorem 2 (iii) V q ( β ) . Then, r ̸ a q .
(4) 
p ̸ a p for any p S 1 ( A ) by Definition 1. If p ̸ w q then q ̸ w p by Note 3 (i). Suppose r ̸ w p , p ̸ w q , and p ̸ a q . Thus, by Theorem 3 (ii), p and q are quasisolitary. Let H ( x , y , a ¯ ) be a formula from Lemma 7. Then from Remark 3 (ii), it follows:
α 1 , α 2 p ( M ) [ ¬ E p ( α 1 , α 2 , c ¯ p ) H ( M , α 1 , a ¯ ) H ( M , α 2 , a ¯ ) or H ( M , α 2 , a ¯ ) H ( M , α 1 , a ¯ ) ] .
Let α p ( M ) . If there exists α 1 p ( M ) such that α 1 < α , and
M ¬ E p ( α 1 , α , c ¯ p ) , H ( M , α 1 , a ¯ ) H ( M , α , a ¯ ) ,
then for any α 2 , α 3 p ( M )
M ¬ E p ( α 2 , α 3 , c ¯ p ) α 2 α 3 H ( M , α 2 , a ¯ ) H ( M , α 3 , a ¯ ) .
Without loss of generality suppose that H ( x , y , a ¯ ) is increasing on classes of equivalence E p ( x , y , c ¯ p ) of elements from p ( M ) . Consider the following formula:
K ( x , α , c ¯ p , b ¯ ) : = y [ x < y < α ¬ E p ( x , y , c ¯ p ) ¬ E p ( y , α , c ¯ p ) H ( M , x , a ¯ ) H ( M , y , a ¯ ) H ( M , α , a ¯ ) ] .
If p is quasirational to the left then there exists U p ( x , b ¯ ) such that U p ( M , b ¯ ) = p ( M ) .
M x [ U p ( M , b ¯ ) < x < α K ( x , α , c ¯ p , b ¯ ) ] .
If p is non-quasirational to the left, then there is C ( M , e ¯ ) such that
C ( M , e ¯ ) K ( M , α , c ¯ p , a ¯ ) , C ( M , e ¯ ) < p ( M ) .
It follows that:
M x [ C ( M , e ¯ ) < x < α K ( x , α , c ¯ p , a ¯ ) ] .
By a similar consideration of the formula
K 1 ( x , α , c ¯ p , a ¯ ) : = y [ ( α < y < x ¬ E p ( x , y , c ¯ p ) ¬ E p ( y , α , c ¯ p ) ) H ( M , α , a ¯ ) H ( M , y , a ¯ ) H ( M , x , a ¯ ) ] .
we obtain a formula D ( x , d ¯ ) such that C ( M , e ¯ ) < p ( M ) < D ( M , d ¯ ) and
M x y [ C ( M , e ¯ ) < x < y < D ( M , d ¯ ) ¬ E p ( x , y , c ¯ p ) H ( M , x , a ¯ ) H ( M , y , a ¯ ) ] .
Let β r ( M ) . Then there is the formula Φ ( x , y , b ¯ ) such that
Φ ( M , β , b ¯ ) p ( M ) and ¬ Φ ( M , β , b ¯ ) p ( M ) .
Suppose γ 1 Φ ( M , β , b ¯ ) p ( M ) and γ 2 ¬ Φ ( M , β , b ¯ ) p ( M ) with γ 1 < γ 2 . Let H 1 ( x , β , b ¯ ) be the maximal convex subformula of Φ ( x , β , b ¯ ) such that γ 1 H 1 ( M , β , b ¯ ) . Then, γ 2 > H 1 ( M , β , b ¯ ) . For γ 2 p ( M ) there is μ q ( M ) such that μ > H ( M , γ 2 , a ¯ ) . Hence, α H ( M , β , a ¯ ) C ( M , e ¯ ) + D ( M , d ¯ ) we have H ( M , α , a ¯ ) < μ . Consider the formula
H 2 ( x , β , a ¯ , e ¯ , b ¯ ) : = y [ H 1 ( y , β , b ¯ ) C ( M , e ¯ ) < y H ( x , y , a ¯ ) ] .
Therefore, H 2 ( M , β , b ¯ , d ¯ , e ¯ , a ¯ ) q ( M ) , because H ( M , γ 1 , a ¯ ) q ( M ) . Moreover, ¬ H 2 ( M , β , b ¯ , d ¯ , e ¯ , a ¯ ) q ( M ) , since μ > H 2 ( M , β , b ¯ , d ¯ , e ¯ , a ¯ ) . Thus, r ̸ w q . Hence, Theorem 3 is proved. □
Corollary 1.
The equivalence relations ̸ a and ̸ w partition the set of non-algebraic types from S 1 ( A ) into the classes of equivalence as follows:
(i) 
Every ̸ w -class contains ̸ a -classes or it coincides with a ̸ a -class.
(ii) 
Every ̸ w -class contains types only of one kind from six basic kinds of Remark 1.
(iii) 
Every ̸ w -class, which contains social types, is a ̸ a -class.
Lemma 9 
([16]). Let p S 1 ( A ) , and ψ ( x , y , b ¯ ) is p-stable formula where b ¯ A . There is ϕ ( x , α ¯ ) , with α ¯ M and there are μ 1 , μ 2 p ( M ) , such that μ 1 < ϕ ( M , a ¯ ) < μ 2 . Then there are μ 1 , μ 2 from p ( M ) such that for the formula
H ϕ , ψ ( x , α ¯ , b ¯ ) : = y ( ϕ ( y , α ¯ ) ψ ( x , y , b ¯ ) )
the following is true
μ 1 < H ϕ , ψ ( M , α ¯ , b ¯ ) < μ 2 .
Theorem 4.
Let A , B , C M such that M is | A B C | + -saturated, p , q S 1 ( A ) , and p ̸ w q . Then the following hold:
(i) 
If p ̸ a q , then V p ( B ) V p ( C ) = if and only if V q ( B ) V q ( C ) = .
(ii) 
If p ̸ a q , V p ( B ) V p ( C ) = , V q ( B ) V q ( C ) , then there exists δ q ( M ) such that
V q ( B ) V q ( C ) = V q ( δ ) = E q ( M , δ , c ¯ q ) , ( V p ( B ) , V p ( C ) ) = or ( V p ( C ) , V p ( B ) ) = .
(iii) 
If p ̸ a q , and there is α p ( M ) such that V p ( B ) < V p ( α ) < V p ( C ) , then
V q ( B ) V q ( C ) = .
Proof. 
(i) It follows from Lemma 8 and Remark 4 (ii).
(ii) Let H ( x , y , b ¯ ) be a formula from Lemma 7, which was obtained from the fact q ̸ w p , and q ̸ a p , such that α 1 , α 2 q ( M ) the following hold:
  • H ( M , α 1 , b ¯ ) < ¬ H ( M , α 1 , b ¯ )
  • β 1 , β 2 p ( M ) , β 1 H ( M , α 1 , b ¯ ) , β 2 ¬ H ( M , α 2 , b ¯ )
  • H ( M , α 1 , b ¯ ) H ( M , α 2 , b ¯ ) ¬ E q ( α 1 , α 2 , c ¯ q )
Without loss of generality, as in the proof of Lemma 7, we suppose:
H ( M , α 1 , b ¯ ) H ( M , α 2 , b ¯ ) α 1 < α 2 ¬ E q ( α 1 , α 2 , c ¯ q ) .
Suppose V q ( B ) V q ( C ) E q ( M , δ , c ¯ q ) , for all δ q ( M ) .
Let δ V q ( B ) V q ( C ) . Then there are two formulas ϕ ( x , β ¯ ) , and ψ ( x , γ ¯ ) , with β ¯ B A , γ ¯ C A such that δ ϕ ( M , β ¯ ) ψ ( M , γ ¯ ) and there are μ 1 , μ 2 , μ 3 , μ 4 q ( M ) such that
μ 1 < ϕ ( M , β ¯ ) < μ 2 , μ 3 < ψ ( M , γ ¯ ) < μ 4 .
Consider the formula ϕ 1 ( x , β ¯ , c ¯ q ) : = y ( ϕ ( y , β ) E q ( x , y , c ¯ q ) ) .
Because E q ( x , y , c ¯ q ) is p-stable, Lemma 9 guarantees the existence of of μ 1 , μ 2 such that μ 1 < ϕ 1 ( M , β ¯ , c ¯ q ) < μ 2 . Moreover, for every δ ϕ 1 ( M , β ¯ , c ¯ q ) , it follows that E q ( M , δ , b ¯ ) ϕ 1 ( M , β ¯ , c ¯ q ) . Let
ψ 1 ( x , γ ¯ , c ¯ q ) : = y ( ψ ( y , γ ¯ ) E q ( x , y , c ¯ q ) ) .
Then for any δ ϕ 1 ( M , β ¯ , c ¯ q ) ψ 1 ( M , γ ¯ , c ¯ q ) , we have
E q ( M , δ , c ¯ q ) ϕ 1 ( M , β ¯ , c ¯ q ) ψ 1 ( M , γ ¯ , c ¯ q ) .
Thus, there exist α 1 , α 2 ϕ 1 ( M , β ¯ , c ¯ q ) ψ 1 ( M , γ ¯ , c ¯ q ) such that ¬ E q ( α 1 , α 2 , c ¯ q ) . Suppose α 1 < α 2 . Let us define
K ϕ ( y , β ¯ , b ¯ , c ¯ q ) : = x 1 x 2 ( ϕ 1 ( x 1 , β ¯ , c ¯ q ) ϕ 1 ( x 2 , β ¯ , c ¯ q ) ¬ E q ( x 1 , x 2 , c ¯ q ) x 1 < x 2 ¬ H ( y , x 1 , b ¯ ) ¬ H ( y , x 2 , b ¯ ) ) .
Then there are β 1 , β 2 p ( M ) such that
p ( M ) < β 1 < K ϕ ( M , β ¯ , b ¯ , c ¯ q ) < β 2 < p ( M ) +
because there are α 3 , α 4 q ( M ) such that
α 3 < V p ( B ) < α 4 and ¬ E q ( α 3 , α 1 , c ¯ q ) ¬ E q ( α 2 , α 4 , c ¯ q ) .
Thus, K ϕ ( M , β ¯ , b ¯ , c ¯ q ) since there is μ 0 such that
μ 0 H ( M , α 2 , b ¯ ) H ( M , α 1 , b ¯ ) , and μ 0 K ϕ ( M , β ¯ , b ¯ , c ¯ q ) .
Consider the formula
K ψ ( y ¯ , γ ¯ , b ¯ , c ¯ q ) : = x 1 x 2 ( ψ 1 ( x 1 , γ ¯ , c ¯ q ) ψ 1 ( x 2 , γ ¯ , c ¯ q ) ¬ E q ( x 1 , x 2 , c ¯ q ) x 1 < x 2 ¬ H ( y , x 1 , b ¯ ) ¬ H ( y , x 2 , b ¯ ) ) .
Then μ 0 K ψ ( M , γ ¯ , b ¯ , c ¯ q ) by the same consideration as for K ϕ ( M , β ¯ , b ¯ , c ¯ q ) . Thus, μ 0 V p ( B ) V p ( C ) . Which is a contradiction.
Thus, δ q ( M ) such that V q ( B ) V q ( C ) = E q ( M , δ , c ¯ q ) . For quasisolitary type q, E q ( M , δ , c ¯ q ) = V q ( B ) . Hence, (ii) is proved.
(iii) By Theorem 2 (v), we have V p ( B ) < V p ( α ) < V p ( C ) where ϕ ( M , β ¯ ) V q ( B ) , ψ ( M , γ ¯ ) ( C ) , and
ϕ ( M , β ¯ ) ψ ( M , γ ¯ ) = E q ( M , δ , c ¯ q ) .
The existence of these ϕ , ψ , δ follows from proof of (ii). Let β ¯ 1 B be such that Θ ( M , β ¯ 1 ) V p ( B ) and V p ( B ) H ( M , δ , b ¯ ) . Suppose V p ( B ) H ( M , δ , b ¯ ) . Then V p ( B ) + = H ( M , δ , β ¯ ) + . If V p ( B ) + H ( M , δ , β ¯ ) + , then there is θ ( M , β ¯ 1 ) , with β ¯ 1 B , and ϵ ¯ H ( M , δ , b ¯ ) such that θ ( M , β ¯ 1 ) < μ . Consider the following formula:
R ( x , β ¯ , β ¯ 1 , b ¯ ) : = y ( ϕ ( y , β ¯ ) H ( x , y , b ¯ ) θ ( M , β ¯ 1 ) < x ) .
Thus, R ( M , β ¯ , β ¯ 1 , b ¯ ) V p ( B ) , and R ( M , β ¯ , β ¯ 1 , b ¯ ) + = H ( M , δ , b ¯ ) + .
Suppose V p ( C ) = ¬ H ( M , δ , b ¯ ) . Then V p ( C ) = ¬ H ( M , δ , b ¯ ) . If V p ( C ) = ¬ H ( M , δ , b ¯ ) , then there is θ 1 ( M , γ 1 ) , with γ 1 C , and μ 1 ¬ H ( M , δ , b ¯ ) such that θ 1 ( M , γ 1 ) < μ 1 . Consider the following formula:
L ( x , γ ¯ , γ 1 , b ¯ ) : = y ( ψ ( y , γ ¯ ) ¬ H ( x , y , b ¯ ) x < θ ( M , γ 1 , b ¯ ) ) .
We then have
L ( M , γ ¯ , γ 1 , b ¯ ) V p ( C ) , L ( M , γ ¯ , γ 1 , b ¯ ) = ¬ H ( M , δ , b ¯ ) .
Thus, if V p ( B ) + ¬ H ( M , δ , b ¯ ) , then V p ( B ) = ¬ H ( M , δ , b ¯ ) , and consequently V p ( B ) V q ( C ) . This yields a contradiction. Hence,
V p ( B ) + = ¬ H ( M , δ , b ¯ ) , and V q ( B ) V q ( C ) = .

4. Discussion

The main result of this work is the unification of the concepts of type orthogonality and neighborhoods in a type. It can be observed that the notion of a neighborhood of an element within a type generalizes the idea of algebraic closure in a type.
The concept of orthogonality, originally introduced by Shelah S. in [22], is further refined here. In particular, semi-isolation between 1-types splits into two distinct notions: weak orthogonality and almost orthogonality for weakly o-minimal theories.
This paper establishes the connection between p-stable (p-preserving) types and neighborhoods, highlighting how local type behavior can be captured through neighborhood analysis.
The orthogonality properties of types in weakly o-minimal theories, as explored in this article, can be extended to the broader class of NIP theories. In particular, the foundations for this extension, including the notion of ordered stable theories (o-stable theories), were established in works [9,11,23].

Author Contributions

Conceptualization, B.B.; Formal analysis, B.B., N.T. and T.Z.; Funding acquisition, B.B.; Methodology, B.B. and N.T.; Supervision, B.B.; Validation, B.B., N.T. and T.Z.; Writing—original draft, B.B. and N.T.; Writing—review and editing, B.B., N.T. and T.Z. All authors have read and agreed to the published version of the manuscript.

Funding

This research is funded by the Science Committee of the Ministry of Science and Higher Education of the Republic of Kazakhstan (Grant No. AP19677434).

Data Availability Statement

The materials supporting this study are provided in the article. For any additional questions, please contact the corresponding author.

Conflicts of Interest

The authors declare no conflicts of interest.

References

  1. van den Dries, L. Remarks on Tarski’s problem concerning ( R , + , · , exp ) . In Studies in Logic and the Foundations of Mathematics; Elsevier: Amsterdam, The Netherlands, 1983. [Google Scholar] [CrossRef]
  2. Dickmann, M.A. Elimination of quantifiers for ordered valuation rings. In Proceedings of the 3rd Easter Model Theory Conference, Gross Koris, Germany, 8–13 April 1985. [Google Scholar]
  3. Macpherson, D.; Marker, D.; Steinhorn, C. Weakly o-minimal structures and real closed fields. Trans. Am. Math. Soc. 2000, 352, 5435–5483. [Google Scholar] [CrossRef]
  4. Marker, D.; Steinhorn, C. Definable types in o-minimal theories. J. Symb. Log. 1994, 59, 185–198. [Google Scholar] [CrossRef]
  5. Mayer, L. Vaught’s conjecture for o-minimal theories. J. Symb. Log. 1988, 53, 146–159. [Google Scholar] [CrossRef]
  6. Alibek, A.; Baizhanov, B.S.; Kulpeshov, B.S.; Zambarnaya, T.S. Vaught’s conjecture for weakly o-minimal theories of convexity rank 1. Ann. Pure Appl. Log. 2018, 169, 1190–1209. [Google Scholar] [CrossRef]
  7. Kulpeshov, B.S. Vaught’s conjecture for weakly o-minimal theories of finite convexity rank. Izv. Math. 2020, 84, 324–347. [Google Scholar] [CrossRef]
  8. Kulpeshov, B.S.; Sudoplatov, S.V. Vaught’s conjecture for quite o-minimal theories. Ann. Pure Appl. Log. 2017, 168, 129–149. [Google Scholar] [CrossRef]
  9. Baizhanov, B.; Umbetbayev, O.; Zambarnaya, T. Non-orthogonality of 1-types in theories with a linear order. Bull. Irkutsk. State Univ. Ser. Math. 2025, 53, 131–140. [Google Scholar] [CrossRef]
  10. Baizhanov, B.S. Orthogonality of one-types in weakly o-minimal theories. In Algebra and Model Theory; Pinus, A.C., Ponomaryov, K.N., Eds.; Novosibirsk State Technical University: Novosibirsk, Russia, 1999; pp. 5–28. [Google Scholar]
  11. Baizhanov, B.S.; Verbovskii, V.V. O-stable theories. Algebra Log. 2011, 50, 211–225. [Google Scholar] [CrossRef]
  12. Baizhanov, B.S. One-Types in Weakly O-Minimal Theories; Informatics and Control Problems Institute: Almaty, Kazakhstan, 1996; pp. 77–90. [Google Scholar]
  13. Denecke, K. The Partial Clone of Linear Formulas. Sib. Math. J. 2019, 60, 572–584. [Google Scholar] [CrossRef]
  14. Kumduang, T.; Sriwongsa, S. Superassociative structures of terms and formulas defined by transformations preserving a partition. Commun. Algebra 2023, 51, 3203–3220. [Google Scholar] [CrossRef]
  15. Marker, D. Omitting types in o-minimal theories. J. Symb. Log. 1986, 51, 63–74. [Google Scholar] [CrossRef]
  16. Baizhanov, B.S.; Tazabekova, N.S. Essential kinds of 1-types over sets of models of weakly o-minimal theories. Kazakh Math. J. 2023, 23, 6–27. [Google Scholar] [CrossRef]
  17. Lascar, D.; Poizat, B. An introduction to forking. J. Symb. Log. 1979, 44, 330–350. [Google Scholar] [CrossRef]
  18. Laskovski, M.; Steinhorn, C. On o-minimal expansions of Archimedean ordered groups. J. Symb. Log. 1995, 60, 817–878. [Google Scholar] [CrossRef]
  19. Henkin, L. The completeness of the first-order functional calculus. J. Symb. Log. 1949, 14, 159–166. [Google Scholar] [CrossRef]
  20. Shelah, S. Classification Theory and the Number of Non-Isomorphic Models; North Holland: Amsterdam, The Netherlands, 1978. [Google Scholar]
  21. Baldwin, J. Fundamentals of Stability Theory; Springer: Berlin/Heidelberg, Germany, 1988. [Google Scholar]
  22. Shelah, S. Classification Theory and the Number of Non-Isomorphic Models; Studies in Logic and the Foundations of Mathematics; North-Holland Publishing Company: Amsterdam, The Netherlands; New York, NY, USA; Oxford, UK, 1990; Volume 92, p. xxxiv + 705. [Google Scholar]
  23. Verbovskiy, V. On a classification of theories without the independence property. Math. Log. Q. 2013, 59, 119–124. [Google Scholar] [CrossRef]
Figure 1. p is a quasirational to the right type and q is a quasirational to the left type.
Figure 1. p is a quasirational to the right type and q is a quasirational to the left type.
Mathematics 13 03271 g001
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.

Share and Cite

MDPI and ACS Style

Baizhanov, B.; Tazabekova, N.; Zambarnaya, T. Orthogonality of 1-Types over Sets, Neighborhoods of Sets in 1-Types in Weakly Ordered Minimal Theories. Mathematics 2025, 13, 3271. https://doi.org/10.3390/math13203271

AMA Style

Baizhanov B, Tazabekova N, Zambarnaya T. Orthogonality of 1-Types over Sets, Neighborhoods of Sets in 1-Types in Weakly Ordered Minimal Theories. Mathematics. 2025; 13(20):3271. https://doi.org/10.3390/math13203271

Chicago/Turabian Style

Baizhanov, Bektur, Nargiza Tazabekova, and Tatyana Zambarnaya. 2025. "Orthogonality of 1-Types over Sets, Neighborhoods of Sets in 1-Types in Weakly Ordered Minimal Theories" Mathematics 13, no. 20: 3271. https://doi.org/10.3390/math13203271

APA Style

Baizhanov, B., Tazabekova, N., & Zambarnaya, T. (2025). Orthogonality of 1-Types over Sets, Neighborhoods of Sets in 1-Types in Weakly Ordered Minimal Theories. Mathematics, 13(20), 3271. https://doi.org/10.3390/math13203271

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop