This paper was converted on www.awesomepapers.org from LaTeX by an anonymous user.
Want to know more? Visit the Converter page.

One Dimensional t.t.t Structures

Daniel Lowengrub Department of Mathematics
The Hebrew University of Jerusalem
Jerusalem, 91904, Israel
lowdanie@gmail.com

1. Introduction

The notion of a first order topological structure was introduced by Pillay [1] as a generalization of the notion of an o-minimal structure. The idea is to provide a general framework in which model theory can be used to analyze a topological structure whose topology isn’t necessarily induced by a definable order. In the o-minimal case, the topology is generated from a basis where each basis set can be defined by substituting the variables y1y_{1} and y2y_{2} by suitable parameters in the following formula

ϕ(x,y1,y2)=y1<x<y2\phi(x,y_{1},y_{2})=y_{1}<x<y_{2}

A first order topological structure generalizes this to the case where ϕ\phi is some arbitrary formula with more than one variable.

Pillay also introduced the notion of topologically totally transcendental (t.t.t) structures which have the additional property that any definable set has a finite number of connected components. For example, by definition o-minimal structures are t.t.t.

In the previously mentioned paper, Pillay proved that one dimensional t.t.t structures have some characteristics in common with o-minimal structures such as the exchange property. Furthermore, he showed that if the topology of a one dimensional t.t.t structure is induced by a definable dense linear ordering then the structure is o-minimal.

In this paper we’ll focus on ω\omega-saturated one dimensional t.t.t structures and prove that under a few additional topological assumptions, such structures are composed of o-minimal components in a relatively simple manner.

Our main result which will be proved in section 4 will be to show that if we assume that removing any point from the structure splits it into at least two connected components, then the structure must be a one dimensional simplex of a finite number of o-minimal structures:

Theorem 1.

Let MM be a 1-dimensional connected ω\omega-saturated t.t.t structure such that for each point xMx\in M, M\{x}M\backslash\{x\} has at least two definably connected components. Then there exists a finite set XMX\subset M such that each of the finite number of connected components of M\XM\backslash X are o-minimal.

In section 5 we’ll analyze the case where removing a point doesn’t necessarily split the structure, and will find two alternative topological properties which guarantee that the structure is locally o-minimal. This is done by showing that basis sets which are small enough can be split by removing a point.

Theorem 2.

Let MM be a 1-dimensional ω\omega-saturated t.t.t structure such that one of the following holds:

  1. (1)

    There exist a definable continuous function F:M2MF:M^{2}\rightarrow M and a point aMa\in M such that for each xMx\in M, F(x,x)=aF(x,x)=a and F(x,)F(x,\cdot) is injective.

  2. (2)

    For every basis set UU, |bd(U)|=2|bd(U)|=2.

Then for all but a finite number of points, for every point xMx\in M there’s a basis set UU containing xx such that UU is o-minimal.

An immediate corollary of part 1 of theorem 2 is that if an ω\omega-saturated one dimensional t.t.t structure admits a topological group structure then it is locally o-minimal.

Towards the end of the section we’ll prove a version of the monotonicity theorem for locally o-minimal structures. This shows that locally o-minimal structures share many characteristics with standard o-minimal structures.

Theorem 1 illustrates that the defining characteristic of o-minimal structures within the general setting of ω\omega-saturated one dimensional t.t.t structures isn’t existence of the order itself, but rather the ability to disconnect the structure by removing a point.

Theorem 2 shows that even in the case where an ω\omega-saturated one dimensional t.t.t structure isn’t o-minimal, it will at least be o-minimal on a local scale provided that it has a rudimentary internal structure.

An important step in proving the theorems above will be to show that the relation axba\sim_{x}b, which says that aa and bb are in the same connected component of M\{x}M\backslash\{x\}, is definable.

Proposition.

Let MM be a 1-dimensional ω\omega-saturated t.t.t structure such that for each point xMx\in M, M\{x}M\backslash\{x\} has more than one connected component. Then the relation axbM3a\sim_{x}b\subset M^{3} is definable.

In section 3 we’ll prove that that the number of connected components in a definable family is uniformly bounded.

Proposition.

Let (M,ϕ)(M,\phi) be a 11-dimensional ω\omega-saturated t.t.t structure and

α(x,y1,,yl)L\alpha(x,y_{1},\dots,y_{l})\in L

. Then there exists a constant CC\in\mathbb{N} such that for every ll-tuple c1,,clMc_{1},\dots,c_{l}\in M, α(c1,,cl)\alpha(c_{1},\dots,c_{l}) has less than CC connected components.

This in turn will allow us to prove that elementary extensions of such structures are t.t.t as well.

2. Preliminaries

In this section we review some of the notions, definitions and results from Pillay [1] which will be used heavily throughout the following sections.

Definition 3.

Let MM be a two sorted LL structure with sorts MtM_{t} and MbM_{b} and let ϕ(x,y1,,yk)\phi(x,y_{1},\dots,y_{k}) be an LL formula such that {ϕMt(x,a¯)|a¯Mbk}\{\phi^{M_{t}}(x,\bar{a})|\bar{a}\in M_{b}^{k}\} is a basis for a topology on MtM_{t}. Then the pair (M,ϕ)(M,\phi) will be called a first order topological structure. When we talk about the topology of MtM_{t} we mean the one generated by the basis described above.

Remark.

In Pillay’s paper, first order topological structures were defined on a one-sorted structure where each element can be both a parameter for a basis set, and a point in the topological space. However, in practice this double meaning isn’t needed, so we’re using the two sorted definition both for clarity and in order to slightly strengthen some of the theorems.

In addition, we consider the following condition on a first order topological structure MM:

(A) Every definable set XMtX\subset M_{t} is a boolean combination of definable open subsets.

In this paper we assume that MtM_{t} is Hausdorff and (M,ϕ)(M,\phi) is a first order topological structure satisfying (A).

The following topological result is also helpful in this context and was proved by Robinson [2, 4.2].

Lemma 4.

Let VV be a topological space, and WVW\subset V a non-empty subset. Let AVA\subset V be a boolean combination of open subsets of VV and let B=V\AB=V\backslash A. Then either WAW\cap A or WBW\cap B has an interior with respect to the induced topology on WW.

Definition 5.

Let MM be a first order topological structure satisfying (A) and let XMtX\subset M_{t} be a closed definable subset of MtM_{t}. The ordinal valued DM(X)D_{M}(X) is defined by:

  1. (1)

    If XX\neq\emptyset then DM(X)0D_{M}(X)\geq 0.

  2. (2)

    If δ\delta is a limit ordinal and DM(X)αD_{M}(X)\geq\alpha for all α<δ\alpha<\delta then DM(X)δD_{M}(X)\geq\delta.

  3. (3)

    If there’s a closed definable YMtY\subset M_{t} such that YXY\subset X, YY has no interior in XX and DM(Y)αD_{M}(Y)\geq\alpha then DM(X)α+1D_{M}(X)\geq\alpha+1.

Remark.

We’ll write DM(X)=αD_{M}(X)=\alpha if DM(X)αD_{M}(X)\geq\alpha and DM(X)α+1D_{M}(X)\ngeq\alpha+1. We’ll write DM(X)=D_{M}(X)=\infty if DM(X)αD_{M}(X)\geq\alpha for all α\alpha.

Definition 6.

We say that MM has dimension if DM(X)D_{M}(X)\neq\infty for all closed definable subsets XMtX\subset M_{t}.

In addition, we define the number of definable connected components for definable subsets of our topology:

Definition 7.

Let XMtX\subset M_{t} be definable. Then dM(X)d_{M}(X) is the maximum number d<ωd<\omega such that there are disjoint definable clopen sets X1,,XdXX_{1},\dots,X_{d}\subset X with X=i=1dXiX=\cup_{i=1}^{d}X_{i} , and \infty if no such dd exists.

Remark.

Throughout the paper, when we say “connected” we always mean “definably connected”.

And now for the main definition:

Definition 8.

We say that MM is topologically totally transcendental (t.t.t) if MM is a first order topological structure satisfying (A) with dimension such that for every definable set XMtX\subset M_{t}, dM(X)<d_{M}(X)<\infty. We say that a theory TT is t.t.t is every model of TT is t.t.t.

The following lemma was proved by Pillay [1, 6.6] and plays a key role in most of the proofs in this paper.

Lemma 9.

Let MM be a 1-dimensional t.t.t structure. Then:

  1. (1)

    For any closed and definable XMtX\subset M_{t}, D(X)=0D(X)=0 iff XX is finite.

  2. (2)

    The set of isolated points of MtM_{t} is finite.

  3. (3)

    For any definable XMtX\subset M_{t} there are pairwise disjoint definably connected definable open subsets X1,,XmMtX_{1},\dots,X_{m}\subset M_{t} and a finite set YMtY\subset M_{t} such that X=(i=1mXi)YX=(\cup_{i=1}^{m}X_{i})\cup Y.

  4. (4)

    For any definable XMtX\subset M_{t}, the set of boundary points of XX is finite.

Remark.

One consequence of part 33 of lemma 9 which will be used many times below is that if a set AMtA\subset M_{t} is definable then the statement AA is infinite” is expressible in first order logic as it’s equivalent to the statement AA has no interior”.

3. Connected Components in Definable Families

In this section we’ll show that the number of connected components is uniformly bounded over a definable family. This is used to prove that in 1-dimensional ω\omega-saturated structures, the property of being t.t.t is preserved under elementary equivalence.

Lemma 10.

Let (M,ϕ)(M,\phi) be a 11-dimensional ω\omega-saturated t.t.t structure. Then there exists a number KK\in\mathbb{N} such that for each point bMbb\in M_{b}, |bd(ϕMt(b)|K|bd(\phi^{M_{t}}(b)|\leq K.

Proof.

For each bMbb\in M_{b}, |bd(ϕMt(b)||bd(\phi^{M_{t}}(b)| is finite. The lemma then follows from the fact that MM is ω\omega-saturated.∎

Lemma 11.

Let (M,ϕ)(M,\phi) be a definably connected 11-dimensional ω\omega-saturated t.t.t structure, KK\in\mathbb{N} a number such that for each point bMbb\in M_{b} we have |bd(ϕMt(b)|K|bd(\phi^{M_{t}}(b)|\leq K, and XMtX\subset M_{t} a definable subset such that bd(X)=nbd(X)=n. Then dM(X)nKd_{M}(X)\leq n\cdot K.

Proof.

Let N=dM(X)N=d_{M}(X) and let {Y1,,YN}\{Y_{1},\dots,Y_{N}\} be pairwise disjoint clopen (in XX) subsets of XX such that X=i=1NYiX=\cup_{i=1}^{N}Y_{i}. In addition, we denote the elements of bd(X)bd(X) by bd(X)={a1,,an}bd(X)=\{a_{1},\dots,a_{n}\}.

By the Hausdorffness of MtM_{t}, we can find basis sets {U1,,Un}\{U_{1},\dots,U_{n}\} such that for all 1in1\leq i\leq n:

  1. (1)

    aiUia_{i}\in U_{i}

  2. (2)

    For all 1jN1\leq j\leq N, if Yj{ai}Y_{j}\neq\{a_{i}\} then Yj\UiY_{j}\backslash U_{i}\neq\emptyset.

Claim.

For all 1jN1\leq j\leq N, if YjY_{j} isn’t a point then there exists an 1in1\leq i\leq n such that aiYi¯a_{i}\in\bar{Y_{i}} and bd(Ui)Yjbd(U_{i})\cap Y_{j}\neq\emptyset.

Proof.

Let 1jN1\leq j\leq N be chosen such that YjY_{j} isn’t a point. Without loss of generality, YjXY_{j}\neq X because otherwise XX would be connected and the lemma would be trivial. Since MtM_{t} is definably connected, bd(Yj)bd(Y_{j})\neq\emptyset. In addition, YjY_{j} is clopen in XX so bd(Yj)bd(X)bd(Y_{j})\subset bd(X). Therefore, there exists some 1in1\leq i\leq n such that aiYi¯a_{i}\in\bar{Y_{i}}.

We’ll now see that bd(Ui)Yjbd(U_{i})\cap Y_{j}\neq\emptyset.

Assume for contradiction that bd(Ui)Yj=bd(U_{i})\cap Y_{j}=\emptyset. Then both UiYjU_{i}\cap Y_{j} and UicYjU_{i}^{c}\cap Y_{j} are non-empty clopen subsets of XX, which is a contradiction to the fact that YjY_{j} is a connected component.

This completes the claim. ∎

Without loss of generality, let’s choose an integer LL between 11 and NN such that {Y1,,YL}\{Y_{1},\dots,Y_{L}\} are points and {YL+1,,YN}\{Y_{L+1},\dots,Y_{N}\} are not points. Furthermore, let’s choose an integer MM between 11 and nn such that {a1,,aM}\{a_{1},\dots,a_{M}\} are isolated and {aM+1,,an}\{a_{M+1},\dots,a_{n}\} are not. It’s clear that LML\leq M.

According to the claim, for each index L+1jNL+1\leq j\leq N there exists an integer 1in1\leq i\leq n and a point yjy_{j} such that yjbd(Ui)y_{j}\in bd(U_{i}) and aiYj¯a_{i}\in\bar{Y_{j}}. We note that from the fact that aiYj¯a_{i}\in\bar{Y_{j}}, it follows that aia_{i} is not an isolated point. This gives us a mapping:

ϕ:{YL+1,,YN}i=M+1nbd(Ui)\phi:\{Y_{L+1},\dots,Y_{N}\}\rightarrow\bigcup_{i=M+1}^{n}bd(U_{i})

Since ykyly_{k}\neq y_{l} for each L+1k<lNL+1\leq k<l\leq N , the map ϕ\phi is injective. Furthermore,

|i=M+1nbd(Ui)|(nM)K(nL)K|\bigcup_{i=M+1}^{n}bd(U_{i})|\leq(n-M)\cdot K\leq(n-L)\cdot K

so by the injectivity of ϕ\phi we get that NL(nL)KN-L\leq(n-L)\cdot K. But K1K\geq 1 so NnKN\leq n\cdot K.∎

Proposition 12.

Let (M,ϕ)(M,\phi) be a 11-dimensional ω\omega-saturated t.t.t structure and let α(x,y1,,yl)L\alpha(x,y_{1},\dots,y_{l})\in L be a formula. Then there exists a constant CC\in\mathbb{N} such that for every ll-tuple c1,,clMc_{1},\dots,c_{l}\in M, dM(αMt(c1,,cl))<Cd_{M}(\alpha^{M_{t}}(c_{1},\dots,c_{l}))<C.

Proof.

First of all, let KK\in\mathbb{N} a number such that for each point bMbb\in M_{b} we have |bd(ϕMt(b)|K|bd(\phi^{M_{t}}(b)|\leq K. By lemma 10, for each c¯Ml\bar{c}\in M^{l} there exists a number nc¯n_{\bar{c}}\in\mathbb{N} such that bd(αMt(c¯))<ncbd(\alpha^{M_{t}}(\bar{c}))<n_{c}. Therefore, since MM is ω\omega-saturated, there exists some nn\in\mathbb{N} such that for each tuple c¯Ml\bar{c}\in M^{l}, bd(αMt(c¯))<nbd(\alpha^{M_{t}}(\bar{c}))<n.

We’ll show that we can choose CC to be dM(Mt)Knd_{M}(M_{t})\cdot K\cdot n. Let m=dM(Mt)m=d_{M}(M_{t}) and let {Y1,,Ym}\{Y_{1},\dots,Y_{m}\} be pairwise disjoint definably connected subsets such that Mt=i=1mYiM_{t}=\cup_{i=1}^{m}Y_{i}. By lemma 11, for each 1im1\leq i\leq m and c¯Ml\bar{c}\in M^{l}, dM(αMt(c¯)Yi)<nKd_{M}(\alpha^{M_{t}}(\bar{c})\cap Y_{i})<n\cdot K. The proposition then follows immediately. ∎

We’ll now use this boundedness result in order to prove that a certain set of first order properties are necessary and sufficient for an ω\omega-saturated first order topological structure to be t.t.t.

Theorem 13.

Let (M,ϕ)(M,\phi) be an ω\omega-saturated 1-dimensional t.t.t structure. Then MM has the following properties:

  1. (1)

    For every formula α(x,y1,,yl)L\alpha(x,y_{1},\dots,y_{l})\in L, there exists some CC\in\mathbb{N} such that for every tuple c¯Ml\overline{c}\in M^{l}, there exist CC points x1,,xCx_{1},\dots,x_{C} in αMt(c¯)\alpha^{M_{t}}(\overline{c}) such that αMt(c¯)\{x1,,xC}\alpha^{M_{t}}(\overline{c})\backslash\{x_{1},\dots,x_{C}\} is open.

  2. (2)

    For every formula α(x,y1,,yl)L\alpha(x,y_{1},\dots,y_{l})\in L, there exists a constant CC\in\mathbb{N} such that for all c1,,clMc_{1},\dots,c_{l}\in M, dM(αMt(c1,,cl))<Cd_{M}(\alpha^{M_{t}}(c_{1},\dots,c_{l}))<C.

  3. (3)

    For any pair of formulas α(x,y1,,ys)\alpha(x,y_{1},\dots,y_{s}) and β(x,y1,,yt)\beta(x,y_{1},\dots,y_{t}) in LL, and for all a¯Ms\overline{a}\in M^{s} and b¯Mt\overline{b}\in M^{t}, if B=βMt(b¯)αMt(a¯)=AB=\beta^{M_{t}}(\overline{b})\subset\alpha^{M_{t}}(\overline{a})=A is closed and non empty and doesn’t have an interior in AA, then AA has an interior in MtM_{t}.

Furthermore, if (M,ϕ)(M,\phi) is a first order topological structure which satisfies these three properties and is Hausdorff, then MM is a 1-dimensional t.t.t structure.

Proof.

First we’ll see that the three properties are sufficient. Assume that (M,ϕ)(M,\phi) is a first order topological structure such that MtM_{t} is Hausdorff and has the three properties in the theorem.

By property 1, every definable set XX is a boolean combination of open sets so MM has property (A). By property 2, every definable set has a finite number of definably connected components. Finally, by property 3, D(M)=1D(M)=1.

Now we’ll prove the first part of the theorem. Let (M,ϕ)(M,\phi) be an ω\omega-saturated t.t.t structure. By the definition of t.t.t, MtM_{t} is Hausdorff. We’ll now prove that MM has each one of the required properties.

  1. (1)

    Let α(x,y1,,yl)L\alpha(x,y_{1},\dots,y_{l})\in L. Since MM is t.t.t, for every c¯Ml\overline{c}\in M^{l}, there exist CC points x1,,xCx_{1},\dots,x_{C} in αMt(c¯)\alpha^{M_{t}}(\overline{c}) such that αMt(c¯)\{x1,,xC}\alpha^{M_{t}}(\overline{c})\backslash\{x_{1},\dots,x_{C}\} is open. Since MM is ω\omega-saturated, we can choose CC uniformly for all c¯Ml\overline{c}\in M^{l}.

  2. (2)

    This property is essentially proposition 12.

  3. (3)

    This follows from the fact that D(M)=1D(M)=1.

Corollary 14.

Let ϕ(x,y1,,yk)\phi(x,y_{1},\dots,y_{k}) be a formula and let (M,ϕ)(M,\phi) be a 11-dimensional t.t.t structure which is ω\omega-saturated. In addition, let NN be a model such that NMN\equiv M. Then (N,ϕ)(N,\phi) is a 11-dimensional t.t.t structure.

Proof.

This is immediate from the fact that all of the properties in theorem 13 can be expressed in first order logic. ∎

4. Structures With Splitting

4.1. Introduction

Our main result in this section is that for any 1-dimensional ω\omega-saturated t.t.t structure, if removing any point splits the space into more that one connected component then there exists a finite set XMtX\subset M_{t} such that each connected component of Mt\XM_{t}\backslash X is o-minimal.

In order to prove this, we first obtain some intermediate results such as the fact that the equivalence relation yxzy\sim_{x}z specifying if yy and zz are in the same connected component of Mt\{x}M_{t}\backslash\{x\} is a definable relation in Mt3M_{t}^{3}. We also introduce a notion of “local flatness” which is used as a stepping stone between t.t.t structures and o-minimality.

For example, consider the structure Rint=,I(x,y,z)R_{int}=\langle\mathbb{R},I(x,y,z)\rangle where I(x,y,z)I(x,y,z) is true if zz lies on the interval between xx and yy. In example 22 we’ll show that RintR_{int} has the property that removing any point splits the space into more that one connected component. We’ll use this fact to show that the relation yxzy\sim_{x}z is indeed definable. In the end of this section we’ll demonstrate how applying the construction of the order to RintR_{int} gives the standard ordering on the reals.

In this section we’re assuming that MtM_{t} has no isolated points. This doesn’t pose a problem because MtM_{t} has at most a finite number of isolated points so we can remove them without affecting any of our results.

4.2. A Definable Relation

The following equivalence relation is useful for analyzing what happens when a point is removed from a structure.

Definition 15.

Let MM be a 1-dimensional t.t.t structure. Let x,a,bMtx,a,b\in M_{t}. Then axba\sim_{x}b will be a relation which is true iff aa and bb are in the same definable connected component of Mt\{x}M_{t}\backslash\{x\}.

Remark.

Note that by proposition 12, there exists an NN\in\mathbb{N} such that for each point xMtx\in M_{t}, x\sim_{x} has less than NN equivalence classes.

Our first goal is to show that if for every xMtx\in M_{t} we have dM(Mt\{x})2d_{M}(M_{t}\backslash\{x\})\geq 2, then xMt3\sim_{x}\subset M_{t}^{3} is definable.

We start by showing that for any xx such that dM(Mt\{x})>2d_{M}(M_{t}\backslash\{x\})>2, xacl()x\in acl(\emptyset).

The following technical lemma will be used many times throughout the proof.

Intuitively, the lemma says that after removing two points, the space is divided into three distinct components. The part “in between” the points we removed and one additional side for each of the points.

Lemma 16.

Let MM be a 1-dimensional ω\omega-saturated t.t.t structure, CMtC\subset M_{t} an open connected definable subset, abCa\neq b\in C and 2k,l2\leq k,l\in\mathbb{N} such that dM(C\{a})=kd_{M}(C\backslash\{a\})=k and dM(C\{b})=ld_{M}(C\backslash\{b\})=l. Let A1,,AkA_{1},\dots,A_{k} and B1,,BlB_{1},\dots,B_{l} be the connected components of C\{a}C\backslash\{a\} and C\{b}C\backslash\{b\} respectively such that aB1a\in B_{1} and bA1b\in A_{1}. Then:

  1. (1)

    bd(i=2kAi)={a}bd(\cup_{i=2}^{k}A_{i})=\{a\}

  2. (2)

    bd(j=2lBj)={b}bd(\cup_{j=2}^{l}B_{j})=\{b\}

  3. (3)

    bd(A1B1)={a,b}bd(A_{1}\cap B_{1})=\{a,b\} and for every open set UU containing aa or bb, U(A1B1)U\cap(A_{1}\cap B_{1})\neq\emptyset.

  4. (4)

    The following union is disjoint:

    C=(i=2kAi){a}(A1B1){b}(j=2lBj)C=(\cup_{i=2}^{k}A_{i})\cup\{a\}\cup(A_{1}\cap B_{1})\cup\{b\}\cup(\cup_{j=2}^{l}B_{j})
Proof.

First we’ll prove 11.

Since CC is connected, aAi¯a\in\overline{A_{i}} for each 1ik1\leq i\leq k. Therefore, since aAia\notin A_{i} for each 2ik2\leq i\leq k, abd(i=2kAi)a\in bd(\cup_{i=2}^{k}A_{i}). In addition, i=2kAi\cup_{i=2}^{k}A_{i} is open which means that bd(i=2kAi){a}A1bd(\cup_{i=2}^{k}A_{i})\subset\{a\}\cup A_{1}. But A1A_{1} is open as well and disjoint to i=2kAi\cup_{i=2}^{k}A_{i} so bd(i=2kAi)={a}bd(\cup_{i=2}^{k}A_{i})=\{a\}.

Similarly, bd(j=2lBj)={b}bd(\cup_{j=2}^{l}B_{j})=\{b\}.

We’ll now show that i=2kAiB1\cup_{i=2}^{k}A_{i}\subset B_{1}. In order to do that we first prove that (i=2kAi){a}(\cup_{i=2}^{k}A_{i})\cup\{a\} is connected in C\{b}C\backslash\{b\}. Assume for contradiction that X1X_{1} and X2X_{2} form a clopen partition of (i=2kAi){a}(\cup_{i=2}^{k}A_{i})\cup\{a\} in C\{b}C\backslash\{b\}. Without loss of generality, aX1a\in X_{1} which means that aX2¯a\notin\overline{X_{2}}. Furthermore, A1A_{1} is open and bA1b\in A_{1} which means that bX2¯b\notin\overline{X_{2}}. Together this means that X2(i=2kAi)X_{2}\subset(\cup_{i=2}^{k}A_{i}) and bbd(X2)b\notin bd(X_{2}). Therefore, X2X_{2} is clopen in CC which is a contradiction to the fact that CC is connected.

Now, B1B_{1} is the connected component of C\{b}C\backslash\{b\} containing aa. So from the fact that (i=2kAi){a}(\cup_{i=2}^{k}A_{i})\cup\{a\} is connected in C\{b}C\backslash\{b\} it follows that i=2kAiB1\cup_{i=2}^{k}A_{i}\subset B_{1}.

We’re now ready to prove 44. It’s immediate that

(i=2kAi)(A1B1)=(j=2lBj)(A1B1)=(\cup_{i=2}^{k}A_{i})\cap(A_{1}\cap B_{1})=(\cup_{j=2}^{l}B_{j})\cap(A_{1}\cap B_{1})=\emptyset

In addition, since (i=2kAi)B1(\cup_{i=2}^{k}A_{i})\subset B_{1} it follows that (j=2lBj)(i=2kAi)=(\cup_{j=2}^{l}B_{j})\cap(\cup_{i=2}^{k}A_{i})=\emptyset. This shows that the union is disjoint so all that’s left is to show that it’s equal to CC.

Let cCc\in C be a point such that

c(j=2lBj){a}(i=2kAi){b}c\notin(\cup_{j=2}^{l}B_{j})\cup\{a\}\cup(\cup_{i=2}^{k}A_{i})\cup\{b\}

Since cC\{a}c\in C\backslash\{a\} and c(i=2kAi)c\notin(\cup_{i=2}^{k}A_{i}) it follows that cA1c\in A_{1}. Similarly, cB1c\in B_{1}. Therefore, cA1B1c\in A_{1}\cap B_{1}.

We’re now ready to prove 33.

First of all, assume for contradiction that A1B1=A_{1}\cap B_{1}=\emptyset. Then by parts 1, 2 and 4 of the lemma, the sets (i=2kAi){a}(\cup_{i=2}^{k}A_{i})\cup\{a\} and {b}(j=2lBj)\{b\}\cup(\cup_{j=2}^{l}B_{j}) would form a clopen partition of CC which is a contradiction to the assumption that CC is connected.

We’ll now show that bd(A1B1)={a,b}bd(A_{1}\cap B_{1})=\{a,b\} On the one hand, aint(B1)a\in int(B_{1}) and aA1¯a\in\overline{A_{1}} so abd(A1B1)a\in bd(A_{1}\cap B_{1}). Similarly, bA1B1b\in A_{1}\cap B_{1}. On the other hand, A1B1A_{1}\cap B_{1} is open so

bd(A1B1)(i=2kAi){a}{b}(j=2lBj)bd(A_{1}\cap B_{1})\subset(\cup_{i=2}^{k}A_{i})\cup\{a\}\cup\{b\}\cup(\cup_{j=2}^{l}B_{j})

But i=2kAi\cup_{i=2}^{k}A_{i} and j=2lBj\cup_{j=2}^{l}B_{j} are open well so bd(A1B1){a}{b}bd(A_{1}\cap B_{1})\subset\{a\}\cup\{b\}. Together we get that bd(A1B1)={a,b}bd(A_{1}\cap B_{1})=\{a,b\}.

Finally, let UU be an open set containing aa or bb. Since bd(A1B1)={a,b}bd(A_{1}\cap B_{1})=\{a,b\}, it follows that U(A1B1)U\cap(A_{1}\cap B_{1})\neq\emptyset. ∎

Lemma 17.

Let MM be a 1-dimensional ω\omega-saturated connected t.t.t structure. Let DMtD\subset M_{t} be an open definable subset, E(x,a,b)Mt3E(x,a,b)\subset M_{t}^{3} a definable relation and NN\in\mathbb{N} such that:

  1. (1)

    N2N\geq 2.

  2. (2)

    For every xDx\in D and a,bMta,b\in M_{t}, axbE(x,a,b)a\sim_{x}b\Rightarrow E(x,a,b).

  3. (3)

    For every xDx\in D, E(x,a,b)E(x,a,b) is an equivalence relation with NN classes.

Then for each point aDa\in D, there exists a point bDb\in D such that the definable set X={xD|¬E(x,a,b)}X=\{x\in D|\neg E(x,a,b)\} is infinite.

Proof.

Let aDa\in D. Without loss of generality, DD is connected. Otherwise, we’ll look at the connected component containing aa. We’ll now show that there exists a point bDb\in D such that for an infinite number of points xDx\in D we have ¬E(x,a,b)\neg E(x,a,b). In order to do this, we’ll inductively construct a sequence of points (b1,b2,)(b_{1},b_{2},\dots) in DD such that for each nn\in\mathbb{N} and each 1j<n1\leq j<n, abnbja\sim_{b_{n}}b_{j} and ¬E(bj,a,bn)\neg E(b_{j},a,b_{n}).

For n=1n=1, we can choose any b1D\{a}b_{1}\in D\backslash\{a\}.

Let’s assume that we constructed the sequence up to bnb_{n}. Let X1,,Xc(bn)X_{1},\dots,X_{c(b_{n})} be the connected components of Mt\{bn}M_{t}\backslash\{b_{n}\} such that aX2a\in X_{2}. We choose bn+1Db_{n+1}\in D to be some point such that ¬E(bn,a,bn+1)\neg E(b_{n},a,b_{n+1}). By our assumptions on E(x,a,b)E(x,a,b), bn+1X2b_{n+1}\notin X_{2}. So without loss of generality, in bn+1X1b_{n+1}\in X_{1}. Let Y1,,Yc(bn+1)Y_{1},\dots,Y_{c(b_{n+1})} be the connected components of M\{bn+1}M\backslash\{b_{n+1}\} such that bnY1b_{n}\in Y_{1}. By lemma 16, for all 1<jc(bn+1)1<j\leq c(b_{n+1}), YjX2=Y_{j}\cap X_{2}=\emptyset. By the inductive hypothesis, bjX2b_{j}\in X_{2} for all 1j<n1\leq j<n. This means that for all 1j<n1\leq j<n, bjY1b_{j}\in Y_{1}. Similarly, aY1a\in Y_{1} and we already know that bnY1b_{n}\in Y_{1}. Together we’ve shown that abn+1bja\sim_{b_{n+1}}b_{j} for all 1j<n+11\leq j<n+1.

We’ll now show that for all 1j<n1\leq j<n, ¬E(bj,a,bn+1)\neg E(b_{j},a,b_{n+1}). This will be enough because we already know that ¬E(bn,a,bn+1)\neg E(b_{n},a,b_{n+1}).

Let jj be an index such that 1j<n1\leq j<n. Let X1,,Xc(bj)X_{1},\dots,X_{c(b_{j})} be the connected components of Mt\{bj}M_{t}\backslash\{b_{j}\} such that aX2a\in X_{2} and bnX1b_{n}\in X_{1}. In addition, let Y1,,Yc(bn)Y_{1},\dots,Y_{c(b_{n})} be the connected components of Mt\{bn}M_{t}\backslash\{b_{n}\} such that bj,aY1b_{j},a\in Y_{1} and bn+1Y2b_{n+1}\in Y_{2}. Since bjY1b_{j}\in Y_{1} and bnX1b_{n}\in X_{1}, by lemma 16 it follows that Y2X1Y_{2}\subset X_{1} which means that bnbjbn+1b_{n}\sim_{b_{j}}b_{n+1}. By our assumptions on EE this implies E(bj,bn,bn+1)E(b_{j},b_{n},b_{n+1}). Therefore, as ¬E(bj,a,bn)\neg E(b_{j},a,b_{n}), we can conclude that ¬E(bj,a,bn+1)\neg E(b_{j},a,b_{n+1}).

Now, by the ω\omega-saturation, there exists a point bDb\in D such that |{xD:¬E(x,a,b)}|=|\{x\in D:\neg E(x,a,b)\}|=\infty. ∎

Lemma 18.

Let MM be a 1-dimensional ω\omega-saturated connected t.t.t structure. Let DMtD\subset M_{t} be an open definable subset, E(x,a,b)Mt3E(x,a,b)\subset M_{t}^{3} a definable relation and NN\in\mathbb{N} such that:

  1. (1)

    For every xDx\in D and a,bMta,b\in M_{t}, axbE(x,a,b)a\sim_{x}b\Rightarrow E(x,a,b).

  2. (2)

    For every xDx\in D, E(x,a,b)E(x,a,b) is an equivalence relation with NN classes.

Then N2N\leq 2.

Proof.

Assume for contradiction that N>2N>2. For ease of notion, we define c(x)=dM(Mt\{x})c(x)=d_{M}(M_{t}\backslash\{x\}) for each xMtx\in M_{t}. We note that for all xDx\in D, c(x)>2c(x)>2.

By lemma 17, there exist points a,bMta,b\in M_{t} such that for an infinite number of points xDx\in D, ¬E(x,a,b)\neg E(x,a,b).

We denote the infinite set {xD:¬E(x,a,b)}\{x\in D:\neg E(x,a,b)\} by XX.

Let x,yXx,y\in X, let X1,,Xc(x)X_{1},\dots,X_{c(x)} be the connected components of Mt\{x}M_{t}\backslash\{x\} such that aX1a\in X_{1} and bX2b\in X_{2} and let Y1,,Yc(y)Y_{1},\dots,Y_{c(y)} be the connected components of Mt\{y}M_{t}\backslash\{y\} such that aY1a\in Y_{1} and bY2b\in Y_{2}.

First we note that for every jj such that 3jc(x)3\leq j\leq c(x), yXjy\notin X_{j}. Because let jj be an index such that 3jn(x)3\leq j\leq n(x), let kk be an index such that xYkx\in Y_{k} and assume for contradiction that yXjy\in X_{j}. Then, since yXjy\in X_{j} and xYkx\in Y_{k}, it follows from lemma 16 that X1,X2YkX_{1},X_{2}\subset Y_{k} which means that a,bYka,b\in Y_{k}. However, this contradicts our assumption that ayba\nsim_{y}b.

In an analogous fashion, for each index jj such that 3jc(y)3\leq j\leq c(y) we have xYjx\notin Y_{j}.

Therefore, xY1Y2x\in Y_{1}\cup Y_{2} and yX1X2y\in X_{1}\cup X_{2}.

Since this is true for any pair of points x,yXx,y\in X, by lemma 16 we get that:

  1. (1)

    for all 3ic(x)3\leq i\leq c(x) and 3jc(y)3\leq j\leq c(y) , XiYj=X_{i}\cap Y_{j}=\emptyset

  2. (2)

    for all 3ic(x)3\leq i\leq c(x), XiX=X_{i}\cap X=\emptyset.

From these two results we’ll show that that Mt\XM_{t}\backslash X has an infinite number of definable connected components. First of all, by 22 it follows that for each point xXx\in X, the classes of E(x,a,b)E(x,a,b) not containing aa and bb are definable sets which are contained and clopen in Mt\XM_{t}\backslash X. Furthermore, by 11, all the sets obtained this way are disjoint.

But since XX is both infinite and definable, this is a contradiction to the fact that MM is t.t.t. ∎

Now, let pp be some type in S()S(\emptyset). We now show that there exist a \emptyset-definable relation Rp(x,a,b)Mt3R_{p}(x,a,b)\subset M_{t}^{3} and an infinite \emptyset-definable set DpMtD_{p}\subset M_{t} such that:

  1. (1)

    For all elements xpx\models p and points a,bMta,b\in M_{t}, Rp(x,a,b)axbR_{p}(x,a,b)\iff a\sim_{x}b.

  2. (2)

    For all elements xDpx\in D_{p} and points a,bMta,b\in M_{t}, axbRp(x,a,b)a\sim_{x}b\Rightarrow R_{p}(x,a,b).

  3. (3)

    For all elements xDpx\in D_{p}, Rp(x,a,b)Mt2R_{p}(x,a,b)\subset M_{t}^{2} is an equivalence relation with dM(Mt\{y})d_{M}(M_{t}\backslash\{y\}) equivalence classes where yy is some element realizing pp.

  4. (4)

    For every element xx that realizes pp, xDpx\in D_{p}.

We construct RpR_{p} and DpD_{p} in the following way. First, let xx be some realization of pp and define NN by N=dM(Mt\{x})N=d_{M}(M_{t}\backslash\{x\}). Then there exist ϕ1(x,y¯),,ϕN(x,y¯)\phi_{1}(x,\bar{y}),\dots,\phi_{N}(x,\bar{y}) such that:

(*) for some y¯\bar{y}, ϕ1Mt[y¯],,ϕNMt[y¯]\phi_{1}^{M_{t}}[\bar{y}],\dots,\phi_{N}^{M_{t}}[\bar{y}] partition Mt\{x}M_{t}\backslash\{x\} into NN disjoint clopen sets. Furthermore, for any other z¯\bar{z}, if (ϕ1Mt[z¯],,ϕNMt[z¯])(\phi_{1}^{M_{t}}[\bar{z}],\allowbreak\dots,\allowbreak\phi_{N}^{M_{t}}[\bar{z}]) is a partition of Mt\{x}M_{t}\backslash\{x\} into disjoint clopen sets then it’s the same partition as (ϕ1Mt[y¯],,ϕNMt[y¯])(\phi_{1}^{M_{t}}[\bar{y}],\allowbreak\dots,\allowbreak\phi_{N}^{M_{t}}[\bar{y}]).

Since this is a first order statement, (*) holds for all xpx\models p.

Now, we define DpD_{p} as the set of all the points xMtx\in M_{t} such that (*) holds for xx with the formulas ϕ1(x,y¯),,ϕN(x,y¯)\phi_{1}(x,\bar{y}),\dots,\phi_{N}(x,\bar{y}). We then define Rp(x,a,b)R_{p}(x,a,b) as a relation which is true iff for one of the points y¯\bar{y} guaranteed by (*) for xx, the sets ϕ1Mt[y¯],,ϕNMt[y¯]\phi_{1}^{M_{t}}[\bar{y}],\dots,\phi_{N}^{M_{t}}[\bar{y}] partition Mt\{x}M_{t}\backslash\{x\} into NN disjoint clopen sets such that aa and bb are in the same section of the partition.

Proposition 19.

Let MM be a 1-dimensional ω\omega-saturated connected t.t.t structure and let xMtx\in M_{t} be a point such that dM(Mt\{x})>2d_{M}(M_{t}\backslash\{x\})>2. Then Dtp(x/)D_{tp(x/\emptyset)} is finite and in particular, xacl()x\in acl(\emptyset).

Proof.

Let N=dM(Mt\{x})N=d_{M}(M_{t}\backslash\{x\}) and p=tp(x/)p=tp(x/\emptyset). Since N>2N>2, by applying lemma 18 with D=int(Dp)D=int(D_{p}) and E=RpE=R_{p}, int(Dp)int(D_{p}) is finite. Therefore, DpD_{p} is finite. ∎

We now look at what happens if dM(Mt\{x})=2d_{M}(M_{t}\backslash\{x\})=2.

As before, let pS()p\in S(\emptyset) be a type such that for some element xx realizing pp we have dM(Mt\{x})=2d_{M}(M_{t}\backslash\{x\})=2. We define D~pDp\tilde{D}_{p}\subset D_{p} as the set of points xDpx\in D_{p} such that there exist elements a,bMta,b\in M_{t} and a basis set UMtU\subset M_{t} containing xx such that for all points uUu\in U, ¬Rp(u,a,b)\neg R_{p}(u,a,b).

Proposition 20.

Let MM be a 1-dimensional ω\omega-saturated connected t.t.t structure and let pS1()p\in S_{1}(\emptyset) be a complete type in MtM_{t}. In addition, assume that for some (all) elements xpx\models p, x\sim_{x} has 22 equivalence classes. Then, for each point xx realizing pp, one of the following hold:

  1. (1)

    There exists a finite \emptyset-definable subset of DpD_{p} containing xx and in particular, xacl()x\in acl(\emptyset).

  2. (2)

    int(D~p)int(\tilde{D}_{p}) is a set containing xx such that for every point yint(D~p)y\in int(\tilde{D}_{p}), dM(Mt\{y})=2d_{M}(M_{t}\backslash\{y\})=2.

Proof.

First of all, if DpD_{p} is finite then the first case holds for all xpx\models p.

Let’s assume that DpD_{p} is infinite. Now, suppose that for each point xx realizing pp:

(*) for all a,bMta,b\in M_{t} and for every basis set UU containing xx, there exists a point uUu\in U such that R(u,a,b)R(u,a,b).

We define the set CDpC\subset D_{p} as the set of points in DpD_{p} with property (*). CC is clearly \emptyset-definable. Furthermore, for all xpx\models p, xCx\in C. Assume for contradiction that CC is infinite. In that case, by lemma 17 there exist points a,bMta,b\in M_{t} and a basis set UCU\subset C such that for all uUu\in U, ¬R(u,a,b)\neg R(u,a,b). This is clearly a contradiction to (*). This means that CC is finite so again we’re in the first case for every point xpx\models p.

Therefore, we can assume that for all elements xx realizing pp, xD~px\in\tilde{D}_{p}.

If D~p\tilde{D}_{p} is finite then again we’re in the first case for every point xpx\models p.

We’ll now see that if D~p\tilde{D}_{p} is infinite then for each point yint(D~p)y\in int(\tilde{D}_{p}), dM(Mt\{y})2d_{M}(M_{t}\backslash\{y\})\leq 2. This will finish the proposition because we already know that for every point xD~px\in\tilde{D}_{p}, dM(Mt\{x})2d_{M}(M_{t}\backslash\{x\})\geq 2. We also note that if xDp~\int(D~p)x\in\tilde{D_{p}}\backslash int(\tilde{D}_{p}) then clearly we’re in the first case as |D~p\int(D~p)|<|\tilde{D}_{p}\backslash int(\tilde{D}_{p})|<\infty.

Let’s assume for contradiction that yint(D~p)y\in int(\tilde{D}_{p}) and dM(Mt\{y})>2d_{M}(M_{t}\backslash\{y\})>2. Since yD~py\in\tilde{D}_{p}, there exist points a,bMta,b\in M_{t} and a basis set UD~pU\subset\tilde{D}_{p} containing yy such that for all uUu\in U, ¬Rp(u,a,b)\neg R_{p}(u,a,b). Let Y1,Y2,Y3Y_{1},Y_{2},Y_{3} be three definable disjoint clopen sets partitioning Mt\{y}M_{t}\backslash\{y\} such that aY1a\in Y_{1} and bY2b\in Y_{2}. Since MtM_{t} is connected, there exists a zz such that zY3Uz\in Y_{3}\cap U. Since zDpz\in D_{p}, k=dM(Mt\{z})2k=d_{M}(M_{t}\backslash\{z\})\geq 2. Let Z1,,ZkZ_{1},\dots,Z_{k} be definable pairwise disjoint clopen sets partitioning Mt\{z}M_{t}\backslash\{z\} such that yZ1y\in Z_{1}. Since yZ1y\in Z_{1} and zY3z\in Y_{3}, by lemma 16 it follows that Y1Y2Z1Y_{1}\cup Y_{2}\subset Z_{1} which means that a,bZ1a,b\in Z_{1}. However, this is a contradiction to the fact that ¬Rp(z,a,b)\neg R_{p}(z,a,b). ∎

We now use the previous two propositions to show that if for each point xMtx\in M_{t} we have dM(Mt\{x})>1d_{M}(M_{t}\backslash\{x\})>1, then the relation axbMt3a\sim_{x}b\subset M_{t}^{3} is \emptyset-definable.

Proposition 21.

Let MM be a 1-dimensional connected ω\omega-saturated t.t.t structure such that for each point xMtx\in M_{t}, dM(Mt\{x})>1d_{M}(M_{t}\backslash\{x\})>1. Then the relation axbMt3a\sim_{x}b\subset M_{t}^{3} is definable.

Proof.

We’ll show that both axba\sim_{x}b and axba\nsim_{x}b are \bigvee-definable by formulas without parameters.

axba\nsim_{x}b is clearly \bigvee-definable by formulas without parameters because axba\nsim_{x}b iff there exist two open sets whose boundary is {x}\{x\} such that one contains aa and the other contains bb.

We’ll now prove that axba\sim_{x}b is \bigvee-definable by formulas without parameters. This is done by showing that for each point xMtx\in M_{t}, there exists a set CxMt3C_{x}\subset M_{t}^{3} which is definable without parameters such that:

  1. (1)

    For all points y,a,bMty,a,b\in M_{t}, (y,a,b)Cxayb(y,a,b)\in C_{x}\Rightarrow a\sim_{y}b

  2. (2)

    (x,a,b)Cxaxb(x,a,b)\in C_{x}\iff a\sim_{x}b

Let’s choose some xMtx\in M_{t} and define p=tp(x/)p=tp(x/\emptyset).

If dM(Mt\{x})=N>2d_{M}(M_{t}\backslash\{x\})=N>2 then, by proposition 19, DpD_{p} is a finite \emptyset-definable set containing xx. Furthermore, for every yDpy\in D_{p}, dM(Mt\{x})Nd_{M}(M_{t}\backslash\{x\})\geq N. Let’s denote the points in DpD_{p} by Dp={y1,,yk}D_{p}=\{y_{1},\dots,y_{k}\}. Without loss of generality, there exists some 0l<k0\leq l<k such that for all 1il1\leq i\leq l, dM(Mt\{yi})>Nd_{M}(M_{t}\backslash\{y_{i}\})>N and for all l+1ikl+1\leq i\leq k, dM(Mt\{yi})=Nd_{M}(M_{t}\backslash\{y_{i}\})=N. It’s easy to see that for each 1il1\leq i\leq l, xDtp(yi/)x\notin D_{tp(y_{i}/\emptyset)}. Therefore, we can define:

Cx=((Dp\i=1lDtp(yi/))×Mt2)RpC_{x}=((D_{p}\backslash\bigcup_{i=1}^{l}D_{tp(y_{i}/\emptyset)})\times M_{t}^{2})\cap R_{p}

. Finally, let’s assume that dM(Mt\{x})=2d_{M}(M_{t}\backslash\{x\})=2.

If DpD_{p} contains a finite \emptyset-definable set containing xx, then we can define CxC_{x} in the same way as in the previous case. Otherwise, by proposition 20, int(D~p)Dpint(\tilde{D}_{p})\subset D_{p} is a set containing xx such that for all yint(D~p)y\in int(\tilde{D}_{p}), dM(Mt\{y})=2d_{M}(M_{t}\backslash\{y\})=2. Therefore, we can define:

Cx=(int(D~p)×Mt2)RpC_{x}=(int(\tilde{D}_{p})\times M_{t}^{2})\cap R_{p}

. This finishes the proof of the proposition.∎

Example 22.

Let’s look at the structure Rint=,I(x,y,z)R_{int}=\langle\mathbb{R},I(x,y,z)\rangle where I(x,y,z)I(x,y,z) is true if zz lies on the interval between xx and yy. In other words:

I(x,y,z)={(x,y,z)3|(x<z<y)(y<z<x)}I(x,y,z)=\{(x,y,z)\in\mathbb{R}^{3}|(x<z<y)\vee(y<z<x)\}

The basis sets will be given by:

{IRint(a,b,z)|a,b}\{I^{R_{int}}(a,b,z)|a,b\in\mathbb{R}\}

Since ,<\langle\mathbb{R},<\rangle is an ω\omega-saturated one dimensional t.t.t structure, so is RintR_{int}. We’ll now see that for every point aa\in\mathbb{R}, \{a}\mathbb{R}\backslash\{a\} has two definably connected components in RintR_{int}.

Let aa be some point in \mathbb{R}. Let cc and bb be two constants in \mathbb{R} such that c<a<bc<a<b. Then:

x<aI(x,a,c)I(c,a,x)x<a\iff I(x,a,c)\vee I(c,a,x)
a<xI(a,x,b)I(a,b,x)a<x\iff I(a,x,b)\vee I(a,b,x)

this shows that \{a}\mathbb{R}\backslash\{a\} has two definably connected components in RintR_{int}.

Therefore, by proposition 21, the relation axba\sim_{x}b is definable in RintR_{int}. Indeed:

axb¬I(a,b,x)a\sim_{x}b\iff\neg I(a,b,x)

4.3. Local and Global Flatness

We’ll now prove that, under the condition that removing any point creates at least two connected components, there exist a finite number of points such that after removing them, the remaining finite number of connected components are o-minimal. This is done by first showing that up to a finite number of points the structure is ”locally o-minimal”, and then showing that local o-minimality implies global o-minimality. In addition, the definability of the relation axbMt3a\sim_{x}b\subset M_{t}^{3} will play a crucial role.

We start by defining a notion of “local flatness” and then showing that locally flat points have a neighborhood which behaves similarly to an o-minimal one.

Definition 23.

Let MM be t.t.t structure. We say that the point xMtx\in M_{t} is locally flat if there exist points a,bMta,b\in M_{t} and a basis set UU such that for every point uUu\in U, auba\nsim_{u}b. We say that a set DD is locally flat if all of it’s points are locally flat.

We first show that in the type of structures which we’re currently interested in, all but a finite number of points are locally flat.

Proposition 24.

Let MM be a 1-dimensional ω\omega-saturated connected t.t.t structure such that for each point xMtx\in M_{t}, dM(Mt\{x})>1d_{M}(M_{t}\backslash\{x\})>1. Then for all but a finite number of points xMtx\in M_{t}, xx is locally flat.

Proof.

Let XMtX\subset M_{t} be the set of points xMtx\in M_{t} such that for all points a,bMta,b\in M_{t} and for every basis set UU, there exists a point yUy\in U such that ayba\sim_{y}b. By proposition 21, XX is definable.

Assume for contradiction that XX is infinite. Then, by lemma 17, there exists a pair of points a,bMta,b\in M_{t} such that the set X~={xX|axb}\tilde{X}=\{x\in X|a\nsim_{x}b\} is infinite. In addition, X~\tilde{X} is definable so there exists a basis set UU which is contained in X~X\tilde{X}\subset X. This is clearly a contradiction to the definition of XX. ∎

The next few propositions will show that points which are locally flat have a neighborhood on which we can define a linear order. This motivates the “flatness” in the definition.

Lemma 25.

Let MM be a 1-dimensional ω\omega-saturated connected t.t.t structure such that for all xMtx\in M_{t}, dM(Mt\{x})>1d_{M}(M_{t}\backslash\{x\})>1. Let xMtx\in M_{t} be locally flat and let UMtU\subset M_{t} be an open connected definable set containing xx. Then U\{x}U\backslash\{x\} has two connected components.

Proof.

Since dM(Mt\{x})>1d_{M}(M_{t}\backslash\{x\})>1 and MtM_{t} is connected, it’s enough to show that U\{x}U\backslash\{x\} has no more than two connected components.

Assume for contradiction that U1,,UkU_{1},\dots,U_{k} are the connected components of U\{x}U\backslash\{x\} with k>2k>2. In addition, let a,bMta,b\in M_{t} be points and let VUV\subset U be a basis set containing xx such that for all vVv\in V, avba\nsim_{v}b.

Let the sets X1,X2Mt\UX_{1},X_{2}\subset M_{t}\backslash U be part of a clopen partition of Mt\UM_{t}\backslash U such that aX1a\in X_{1} and bX2b\in X_{2}. By the connectedness of MtM_{t}, there exist points b1,b2bd(U)b_{1},b_{2}\in bd(U) such that b1X1b_{1}\in X_{1} and b2X2b_{2}\in X_{2}. Without loss of generality, b1bd(U1)b_{1}\in bd(U_{1}) and b2bd(U2)b_{2}\in bd(U_{2}). Furthermore, the connectedness of MtM_{t} implies that U3VU_{3}\cap V\neq\emptyset.

Now, let yy be a point in U3VU_{3}\cap V. By lemma 16, U1U_{1} and U2U_{2} are both subsets of the connected component of U\{y}U\backslash\{y\} which contains xx. So since U1¯X1\overline{U_{1}}\cap X_{1}\neq\emptyset and U2¯X2\overline{U_{2}}\cap X_{2}\neq\emptyset, both X1X_{1} and X2X_{2} are in the same connected component of Mt\{y}M_{t}\backslash\{y\}. This means that ayba\sim_{y}b which is a contradiction to the fact that yVy\in V. ∎

One consequence of lemma 25 which will be used later is that if we remove all of the finite number of points which aren’t locally flat then for each of the remaining connected components CC, and for each point xCx\in C, C\{x}C\backslash\{x\} will have exactly two connected components. This will be used to show that CC is o-minimal.

Our next goal is to define an order on some neighborhood of each locally flat point. Let x0Ux_{0}\in U be locally flat and let UMtU\subset M_{t} be a connected definable neighborhood of x0x_{0}. We define a relation <x0,U<_{x_{0},U} on UU in the following way.

By lemma 25, U\{x0}U\backslash\{x_{0}\} has two connected components which we’ll denote by V+V_{+} and VV_{-}. Let xx and yy be points in UU. We’ll say that x<x0,Uyx<_{x_{0},U}y if one of the following hold:

  • x,yV+x,y\in V_{+} and x0xyx_{0}\nsim_{x}y

  • x,yVx,y\in V_{-} and x0yxx_{0}\nsim_{y}x

  • yV+y\in V_{+} and xVx\in V_{-}.

  • y=x0y=x_{0} and xVx\in V_{-}.

  • x=x0x=x_{0} and yV+y\in V_{+}.

Note that by proposition 21, x<x0,Uyx<_{x_{0},U}y is definable.

We now show that if x0x_{0} is locally flat then there exists a neighborhood x0Ux_{0}\in U such that <x0,U<_{x_{0},U} defines a dense linear order on UU.

Proposition 26.

Let MM be a 1-dimensional connected ω\omega-saturated t.t.t structure such that for all xMtx\in M_{t}, dM(Mt\{x})>1d_{M}(M_{t}\backslash\{x\})>1. Let DMtD\subset M_{t} be a connected open definable subset such that for every point xDx\in D, dM(M\{x})=2d_{M}(M\backslash\{x\})=2. Let x0Dx_{0}\in D be a locally flat point. Then there exists a connected open neighborhood UDU\subset D of x0x_{0} such that <x0,U<_{x_{0},U} defines a dense linear order on UU.

Proof.

Since x0x_{0} is locally flat, there exist points a,bMta,b\in M_{t} and a basis set VDV\subset D such that x0Vx_{0}\subset V and for every point yVy\in V we have ayba\nsim_{y}b.

We can assume that VV is connected because otherwise we can take the connected component containing x0x_{0}. In addition, let V+V_{+} and VV_{-} be the two connected components of V\{x0}V\backslash\{x_{0}\} (by lemma 25 there are exactly two) and let CaC_{a} and CbC_{b} be the connected components of Mt\{x0}M_{t}\backslash\{x_{0}\} such that aCaa\in C_{a} and bCbb\in C_{b}. In addition, without loss of generality V+CaV_{+}\subset C_{a} and VCbV_{-}\subset C_{b}. This follows from the fact that CaVC_{a}\cap V and CbVC_{b}\cap V partition VV into two clopen sets so by lemma 25, one must equal V+V_{+} and the other must equal VV_{-}.

We’ll now show that <x0,V<_{x_{0},V} is a dense linear order on VV.

Let xx, yy and zz be points in V+V_{+}. In addition, let XaX_{a} and XbX_{b} be the connected components of Mt\{x}M_{t}\backslash\{x\} such that aXaa\in X_{a} and bXbb\in X_{b}. YaY_{a}, YbY_{b}, ZaZ_{a} and ZbZ_{b} are defined analogously for yy and zz.

Since x,yV+Cax,y\in V_{+}\subset C_{a}, it follows from lemma 16 that x0Xbx_{0}\in X_{b} and x0Ybx_{0}\in Y_{b}. Because if we assume for contradiction that x0Xax_{0}\in X_{a} then by lemma 16 we get that CbXb=C_{b}\cap X_{b}=\emptyset which is a contradiction to the fact that bCbXbb\in C_{b}\cap X_{b}. The proof that x0Ybx_{0}\in Y_{b} is identical.

  1. (1)

    xx0,Vyy<x0,Vxx\nless_{x_{0},V}y\Rightarrow y<_{x_{0},V}x:

    According to the assumption, x0xyx_{0}\sim_{x}y which together with the fact that x0Xbx_{0}\in X_{b} means that yXby\in X_{b}. Now let’s assume for contradiction that xYbx\in Y_{b}. Since yXby\in X_{b} we get from lemma 16 that YaXa=Y_{a}\cap X_{a}=\emptyset which is a contradiction since aXaYaa\in X_{a}\cap Y_{a}. Therefore, xYax\in Y_{a} which together with x0Ybx_{0}\in Y_{b} gives y<xo,Vxy<x_{o,V}x.

  2. (2)

    x<x0,Vyyx0,Vxx<_{x_{0},V}y\Rightarrow y\nless_{x_{0},V}x:

    Since x<x0,Vyx<_{x_{0},V}y and x0Xbx_{0}\in X_{b}, we get that yXay\in X_{a}. Now, we claim that xYbx\in Y_{b}. For otherwise, if xYax\in Y_{a} then we’d get from lemma 16 that YbXb=Y_{b}\cap X_{b}=\emptyset which is a contradiction.

    Therefore, since x0Ybx_{0}\in Y_{b} as well, yx0,Vxy\nless_{x_{0},V}x.

  3. (3)

    x<x0,Vyy<x0,Vzx<x0,Vzx<_{x_{0},V}y\wedge y<_{x_{0},V}z\Rightarrow x<_{x_{0},V}z:

    According to the assumptions, x0,xYbx_{0},x\in Y_{b}, zYaz\in Y_{a}, x0Xbx_{0}\in X_{b} and yXay\in X_{a}. We have to prove that zXaz\in X_{a} as well. But again by lemma 16, yXaxYbYaXay\in X_{a}\wedge x\in Y_{b}\Rightarrow Y_{a}\subset X_{a}.

The proof of these claims is either trivial or identical when xx, yy and zz are distributed differently among V+V_{+}, VV_{-} and {x0}\{x_{0}\}.

This shows that <x0,V<_{x_{0},V} is indeed a linear order. We’ll now show that if x<x0,Vyx<_{x_{0},V}y then there exists a point zVz\in V such that x<x0,Vz<x0,Vyx<_{x_{0},V}z<_{x_{0},V}y. Again we’ll assume that x,yV+x,y\in V_{+}. As before, this means that xYbx\in Y_{b} and yXay\in X_{a} which by lemma 16 implies that (XaYb)V(X_{a}\cap Y_{b})\cap V\neq\emptyset. Let zz be some point in (XaYb)V(X_{a}\cap Y_{b})\cap V. By the definition of <x0,V<_{x_{0},V} and the fact that it’s linear we get that x<x0,Vz<x0,Vyx<_{x_{0},V}z<_{x_{0},V}y. ∎

Before extending the order defined to connected components, we introduce the notion of an interval in a t.t.t structure and prove some useful properties.

Definition 27.

Let MM be a 1-dimensional t.t.t structure and x,yMtx,y\in M_{t} such that dM(Mt\{x})=dM(Mt\{y})=2d_{M}(M_{t}\backslash\{x\})=d_{M}(M_{t}\backslash\{y\})=2. In addition, let X1X_{1} and X2X_{2} be a clopen partition of Mt\{x}M_{t}\backslash\{x\} and let Y1Y_{1} and Y2Y_{2} be a clopen partition of Mt\{y}M_{t}\backslash\{y\} such that xY1x\in Y_{1} and yX1y\in X_{1}. Then the interval between xx and yy will be defined as I(x,y)=X1Y1I(x,y)=X_{1}\cap Y_{1}. If x=yx=y then I(x,y)=I(x,y)=\emptyset.

Remark.

By lemma 16, if VMtV\subset M_{t} is an open definable connected subset and x,yVx,y\in V then I(x,y)VI(x,y)\cap V\neq\emptyset and the following union is disjoint:

V=(X2V){x}(I(x,y)V){y}(Y2V)V=(X_{2}\cap V)\cup\{x\}\cup(I(x,y)\cap V)\cup\{y\}\cup(Y_{2}\cap V)

This motivates us to think of I(x,y)I(x,y) as the set lying “in between” xx and yy.

Lemma 28.

Let MM be a 1-dimensional connected ω\omega-saturated t.t.t structure such that for every point xMtx\in M_{t}, dM(Mt\{x})>1d_{M}(M_{t}\backslash\{x\})>1. Let DMtD\subset M_{t} be a connected open definable subset which is locally flat. Let xyx\neq y be points in DD. Then:

  1. (1)

    I(x,y)DI(x,y)\cap D is a non-empty definable open connected set.

  2. (2)

    {x,y}=bd(I(x,y))\{x,y\}=bd(I(x,y)).

  3. (3)

    If a,bD\{x,y}a,b\in D\backslash\{x,y\} such that axba\sim_{x}b and a,bI(x,y)a,b\notin I(x,y), then ayba\sim_{y}b.

  4. (4)

    If a,bD\{x,y}a,b\in D\backslash\{x,y\} such that axba\nsim_{x}b and a,bI(x,y)a,b\notin I(x,y), then ayba\nsim_{y}b.

Proof.

Let X1X_{1} and X2X_{2} be the connected components of Mt\{x}M_{t}\backslash\{x\} and let Y1Y_{1} and Y2Y_{2} be the connected components of Mt\{y}M_{t}\backslash\{y\}. Note that by proposition 25, both D\{x}D\backslash\{x\} and D\{y}D\backslash\{y\} have exactly two connected components which are given by X1DX_{1}\cap D, X2DX_{2}\cap D and Y1DY_{1}\cap D, Y2DY_{2}\cap D respectively. Without loss of generality, xY1x\in Y_{1} and yX1y\in X_{1} so I(x,y)=X1Y1I(x,y)=X_{1}\cap Y_{1}, X2Y1X_{2}\subset Y_{1} and Y2X1Y_{2}\subset X_{1}. By lemma 16 this means that

(*) D=(X2D){x}(I(x,y)D){y}(Y2D)D=(X_{2}\cap D)\cup\{x\}\cup(I(x,y)\cap D)\cup\{y\}\cup(Y_{2}\cap D).

We’ll now prove the four parts of the lemma.

  1. (1)

    First of all, since X1X_{1} and Y1Y_{1} are definable, I(x,y)I(x,y) is definable as well.

    By lemma 16, I(x,y)DI(x,y)\cap D\neq\emptyset. I(x,y)I(x,y) is open as the intersection of open sets.

    Now, assume for contradiction that I(x,y)DI(x,y)\cap D isn’t connected. Let A1A_{1} and A2A_{2} be a clopen partition of I(x,y)DI(x,y)\cap D. By lemma 16 , the boundaries of A1A_{1} and A2A_{2} in DD are contained in {x,y}\{x,y\}. Since DD is connected, for each i=1,2i=1,2 we have either xbd(ai)x\in bd(a_{i}) or ybd(Ai)y\in bd(A_{i}). Assume for contradiction that xA1¯x\notin\overline{A_{1}} and yA2¯y\notin\overline{A_{2}}. By (*) this means that the sets

    (DX2){x}A2,(DY2){y}A1(D\cap X_{2})\cup\{x\}\cup A_{2},\>(D\cap Y_{2})\cup\{y\}\cup A_{1}

    form a clopen partition of DD which is a contradiction to the assumption that DD is connected.

    Therefore, without loss of generality, we can assume that xbd(A1)x\in bd(A_{1}) and xbd(A2)x\in bd(A_{2}). But then the set U=DY1U=D\cap Y_{1} is open and U\{x}U\backslash\{x\} has more than two connected components which is a contradiction to lemma 25.

  2. (2)

    This follows immediately from lemma 16.

  3. (3)

    If a,bX2Da,b\in X_{2}\cap D then since X2Y1X_{2}\subset Y_{1}, a,bY1a,b\in Y_{1} which means that ayba\sim_{y}b. So we can assume that a,bX1Da,b\in X_{1}\cap D. By the assumption, a,bY1a,b\notin Y_{1} which by (*) implies that a,bY2ayba,b\in Y_{2}\Rightarrow a\sim_{y}b.

  4. (4)

    Without loss of generality, aX1a\in X_{1} and bX2b\in X_{2}. Therefore, bY1b\in Y_{1}. In addition, Y2X1Y_{2}\subset X_{1} and aY1X1a\notin Y_{1}\cap X_{1} so aY2a\in Y_{2}. This means that ayba\nsim_{y}b.

Lemma 29.

Let MM be a 1-dimensional connected ω\omega-saturated t.t.t structure such that for all xMtx\in M_{t}, dM(Mt\{x})>1d_{M}(M_{t}\backslash\{x\})>1. Let DMtD\subset M_{t} be a connected open definable subset which is locally flat. Let x0Dx_{0}\in D. Then there exist points a,bDa,b\in D such that:

  1. (1)

    x0I(a,b)x_{0}\in I(a,b)

  2. (2)

    <x0,I(a,b)<_{x_{0},I(a,b)} defines a dense linear order on I(a,b)I(a,b)

  3. (3)

    I(a,b)DI(a,b)\subset D

  4. (4)

    For all xI(a,b)x\in I(a,b), axba\nsim_{x}b

Proof.

By proposition 26, there exists a definable connected open neighborhood UDU\subset D of x0x_{0} such that <x0,U<_{x_{0},U} defines a dense linear order on UU. Since MtM_{t} is Hausdorff and bd(U)bd(U) is finite, we can assume that <x0,U<_{x_{0},U} defines a dense linear order on U¯\overline{U}. Let aa be the point on bd(U)bd(U) such that x0<x0,Uax_{0}<_{x_{0},U}a and such that for every point ybd(U)y\in bd(U) with x0<x0,Uyx_{0}<_{x_{0},U}y, ax0,Uya\leq_{x_{0},U}y. Similarly, Let bb be the point on bd(U)bd(U) such that b<x0,Ux0b<_{x_{0},U}x_{0} and for each point ybd(U)y\in bd(U) with y<x0,Ux0y<_{x_{0},U}x_{0}, yx0,Uby\leq_{x_{0},U}b.

Let A1A_{1} and A2A_{2} be a clopen partition of Mt\{a}M_{t}\backslash\{a\} such that bA1b\in A_{1} and let B1B_{1} and B2B_{2} be a clopen partition of Mt\{b}M_{t}\backslash\{b\} such that aB1a\in B_{1}. Furthermore, let X+X_{+} and XX_{-} be a clopen partition of Mt\{x0}M_{t}\backslash\{x_{0}\} such that aX+a\in X_{+} and bXb\in X_{-}.

First we prove that x0I(a,b)=A1B1x_{0}\in I(a,b)=A_{1}\cap B_{1}. Assume for contradiction that x0A2x_{0}\in A_{2}. Since aX+a\in X_{+} it follows from lemma 16 that XA2X_{-}\subset A_{2} which implies that bA2b\in A_{2} which is a contradiction. Similarly, x0B1x_{0}\in B_{1}. Together this shows that x0A1B1x_{0}\in A_{1}\cap B_{1}.

Next we’ll prove that for every point yI(a,b)U¯y\in I(a,b)\cap\overline{U} we have ayba\nsim_{y}b and b<x0,Uy<x0,Uab<_{x_{0},U}y<_{x_{0},U}a. Let yy be some point in I(a,b)U¯I(a,b)\cap\overline{U}. Without loss of generality, yX+y\in X_{+}. Since in addition yA1y\in A_{1}, ax0,Uya\nless_{x_{0},U}y which means that y<x0,Uay<_{x_{0},U}a. By the definition of the order this implies that x0yax_{0}\nsim_{y}a. Let Y1Y_{1} and Y2Y_{2} be a clopen partition of Mt\{y}M_{t}\backslash\{y\} such that x0Y1x_{0}\in Y_{1} and aY2a\in Y_{2}. By lemma 16, XY1X_{-}\subset Y_{1} which means that bY1b\in Y_{1}. This proves that y<x0,Uay<_{x_{0},U}a and ayba\nsim_{y}b. Similarly, b<x0,Uyb<_{x_{0},U}y.

We’ll now see that I(a,b)UI(a,b)\subset U. By lemma 28, I(x,y)DI(x,y)\cap D is a non-empty open connected set. Furthermore, as we showed above, x0I(a,b)x_{0}\in I(a,b). Assume for contradiction that I(a,b)\UI(a,b)\backslash U\neq\emptyset. Then by the connectedness of I(a,b)DI(a,b)\cap D, I(a,b)bd(U)I(a,b)\cap bd(U)\neq\emptyset. Let yy be a point in I(a,b)bd(U)I(a,b)\cap bd(U). Then as we saw before, b<x0,Uy<x0,Uab<_{x_{0},U}y<_{x_{0},U}a which is clearly a contradiction to the choice of aa and bb.∎

Lemma 30.

Let MM be a 1-dimensional connected ω\omega-saturated t.t.t structure such that for every point xMtx\in M_{t}, dM(Mt\{x})>1d_{M}(M_{t}\backslash\{x\})>1. Let DMtD\subset M_{t} be a connected open definable subset which is locally flat. Let x0x_{0}, aa and bb be points in DD such that x0I(a,b)Dx_{0}\in I(a,b)\subset D, for every point yI(a,b)y\in I(a,b) we have ayba\nsim_{y}b and <x0,I(a,b)<_{x_{0},I(a,b)} defines a dense linear order on I(a,b)I(a,b).

Then for each pair of points c,dI(a,b)c,d\in I(a,b) such that c<x0,I(a,b)dc<_{x_{0},I(a,b)}d,

I(c,d)={yI(a,b)|c<x0,I(a,b)y<x0,I(a,b)d}I(c,d)=\{y\in I(a,b)|c<_{x_{0},I(a,b)}y<_{x_{0},I(a,b)}d\}

.

Proof.

Let CaC_{a} and CbC_{b} be a clopen partition of Mt\{c}M_{t}\backslash\{c\} such that aCaa\in C_{a} and bCbb\in C_{b} and let DaD_{a} and DbD_{b} be a clopen partition of Mt\{d}M_{t}\backslash\{d\} such that aDaa\in D_{a} and bDbb\in D_{b}. Furthermore, let A1A_{1} and A2A_{2} be a clopen partition of Mt\{a}M_{t}\backslash\{a\} such that c,d,bA1c,d,b\in A_{1} and let B1B_{1} and B2B_{2} be a clopen partition of Mt\{b}M_{t}\backslash\{b\} such that c,d,aB1c,d,a\in B_{1}.

Let X+X_{+} and XX_{-} be a clopen partition of Mt\{x0}M_{t}\backslash\{x_{0}\} such that aXa\in X_{-} and bX+b\in X_{+}. We’ll assume that c,dX+c,d\in X_{+} since the other cases are either similar or trivial.

Now we’ll show that x0Cax_{0}\in C_{a} and x0Dax_{0}\in D_{a}. Assume for contradiction that x0Cbx_{0}\in C_{b}. Since cX+c\in X_{+}, it follows from lemma 16 that XCa=X_{-}\cap C_{a}=\emptyset which is a contradiction to the fact that aXCaa\in X_{-}\cap C_{a}. The proof that x0Dax_{0}\in D_{a} is similar.

Since c<x0,I(a,b)dc<_{x_{0},I(a,b)}d and x0CaDax_{0}\in C_{a}\cap D_{a}, by the definition of <x0,I(a,b)<_{x_{0},I(a,b)} it follows that dCbd\in C_{b} and cDac\in D_{a}.

We’re now ready to prove the lemma.

First we note that by lemma 16, it follows from the assumptions above that I(a,b)=A1B1I(a,b)=A_{1}\cap B_{1}, CbA1C_{b}\subset A_{1} and DaB1D_{a}\subset B_{1}. In addition, since dCbd\in C_{b} and cDac\in D_{a} it follows from lemma 16 that I(c,d)=CbDaI(c,d)=C_{b}\cap D_{a}. Together this means that I(c,d)I(a,b)I(c,d)\subset I(a,b).

We’ll now prove that

I(c,d)={yI(a,b)|c<x0,I(a,b)y<x0,I(a,b)d}I(c,d)=\{y\in I(a,b)|c<_{x_{0},I(a,b)}y<_{x_{0},I(a,b)}d\}

Let yy be some point in I(a,b)I(a,b) such that c<x0,I(a,b)y<x0,I(a,b)dc<_{x_{0},I(a,b)}y<_{x_{0},I(a,b)}d. Since c<x0,I(a,b)yc<_{x_{0},I(a,b)}y, yX+y\in X_{+}. In addition, yX+Cacx0,I(a,b)yy\in X_{+}\cap C_{a}\Rightarrow c\nless_{x_{0},I(a,b)}y so yCby\in C_{b}. In a similar fashion it follows that yDay\in D_{a}. Together this means that yI(c,d)y\in I(c,d).

Now, let yy be a point in I(c,d)=CbDaI(c,d)=C_{b}\cap D_{a}. Since CbX+C_{b}\subset X_{+}, yX+y\in X_{+}. Furthermore, since yCby\in C_{b}, c<x0,I(a,b)yc<_{x_{0},I(a,b)}y. Finally, since yDay\in D_{a}, dx0,I(a,b)yd\nless_{x_{0},I(a,b)}y which means that y<x0,I(a,b)dy<_{x_{0},I(a,b)}d. ∎

Now, let’s assume that MM and the set DMtD\subset M_{t} fulfill the assumptions in lemma 29. Then for each point x0Dx_{0}\in D there exists a pair of points aa and bb in DD such that x0I(a,b)Dx_{0}\in I(a,b)\subset D, for every point yI(a,b)y\in I(a,b) we have ayba\nsim_{y}b and <x0,I(a,b)<_{x_{0},I(a,b)} defines a dense linear order on I(a,b)I(a,b).

By lemma 30, this means that for all c,dI(a,b)c,d\in I(a,b), I(c,d)I(a,b)I(c,d)\subset I(a,b) and:

{yI(a,b)|c<x,Vxy<x,Vxd}=I(c,d)\{y\in I(a,b)|c<_{x,V_{x}}y<_{x,V_{x}}d\}=I(c,d)

. In other words, in the set I(a,b)I(a,b) guaranteed by lemma 29, the notion of an interval we defined above coincides with the interval induced by the order <x0,I(a,b)<_{x_{0},I(a,b)}.

We’ll now prove three lemmas about locally flat points which together will show that the order we defined above can be extended from locally flat points to connected locally flat sets.

Lemma 31.

Let MM be a 1-dimensional connected ω\omega-saturated t.t.t structure such that for every element xMtx\in M_{t}, dM(Mt\{x})>1d_{M}(M_{t}\backslash\{x\})>1. Let DMtD\subset M_{t} be a connected open definable subset which is locally flat. Let xx, aa and bb be points in DD such that for every open set UDU\subset D containing xx there exists some point uUu\in U such that auba\nsim_{u}b. Then axba\nsim_{x}b.

Proof.

Since MtM_{t} is Hausdorff, there exists an open definable connected set UD\{a,b}U\subset D\backslash\{a,b\} containing xx. By lemma 29, there exists a pair of points cc and dd in UU such that xI(c,d)Ux\in I(c,d)\subset U, for every point yI(c,d)y\in I(c,d) we have cydc\nsim_{y}d and <x,I(c,d)<_{x,I(c,d)} defines a dense linear order on I(c,d)I(c,d).

By the assumptions of the lemma, there exists some yI(c,d)y\in I(c,d) such that ayba\nsim_{y}b. By lemma 30, I(x,y)I(c,d)I(x,y)\subset I(c,d) which means that a,bI(x,y)a,b\notin I(x,y). So by lemma 28, axba\nsim_{x}b.∎

Lemma 32.

Let MM be a 1-dimensional connected ω\omega-saturated t.t.t structure such that for all xMtx\in M_{t}, dM(Mt\{x})>1d_{M}(M_{t}\backslash\{x\})>1. Let DMtD\subset M_{t} be a connected open definable subset which is locally flat. Let xx, aa and bb be points in DD such that axba\nsim_{x}b. The there exists a definable open set UDU\subset D containing xx such that for every uUu\in U, auba\nsim_{u}b.

Proof.

As in the previous lemma, there exists an open definable connected set UD\{a,b}U\subset D\backslash\{a,b\} containing xx. By lemma 29, there exists a pair of points cc and dd in UU such that xI(c,d)Ux\in I(c,d)\subset U, for every point yI(c,d)y\in I(c,d) we have cydc\nsim_{y}d and <x,I(c,d)<_{x,I(c,d)} defines a dense linear order on I(c,d)I(c,d).

Let’s choose some point yI(c,d)y\in I(c,d). Since a,bI(c,d)a,b\notin I(c,d) it follows that a,bI(x,y)I(c,d)a,b\notin I(x,y)\subset I(c,d). Therefore, by lemma 28, ayba\nsim_{y}b. ∎

We now use the previous two lemmas to show that in some well defined sense, locally flat sets look like a line.

Lemma 33.

Let MM be a 1-dimensional ω\omega-saturated t.t.t structure such that for every point xMtx\in M_{t}, dM(Mt\{x})>1d_{M}(M_{t}\backslash\{x\})>1. Let DMtD\subset M_{t} be a connected open definable subset which is locally flat. Then, there doesn’t exist a definable connected closed subset FDF\subset D such that bd(F)>2bd(F)>2.

Proof.

Assume for contradiction that FDF\subset D is a definable closed connected subset and that a,b,cbd(F)a,b,c\in bd(F).

Let FabF_{ab} denote the set of points xFx\in F such that axba\nsim_{x}b.

Claim.

FabF_{ab}\neq\emptyset.

Proof.

By lemma 29, there exists a pair of points xx and yy in DD such that aI(x,y)Da\in I(x,y)\subset D, for every point zI(x,y)z\in I(x,y) we have xzyx\nsim_{z}y and <a,I(x,y)<_{a,I(x,y)} defines a dense linear order on I(x,y)I(x,y).

Let ss and tt be points in I(x,y)I(x,y) such that s<a,I(x,y)a<a,I(x,y)ts<_{a,I(x,y)}a<_{a,I(x,y)}t. By lemma 30,

{zI(a,b)|s<a,I(x,y)z<a,I(x,y)t}=I(s,t)\{z\in I(a,b)|s<_{a,I(x,y)}z<_{a,I(x,y)}t\}=I(s,t)

so we can use the notion I(s,t)I(s,t) to represent the interval given by the order <a,I(x,y)<_{a,I(x,y)}. We’ll use the result throughout the proof of the claim.

Since I(s,t)=I(s,a){a}I(a,t)I(s,t)=I(s,a)\cup\{a\}\cup I(a,t) and abd(U)a\in bd(U), we can assume without a loss of generality that for every point vI(a,t)v\in I(a,t) there exists a point uI(a,v)u\in I(a,v) such that uFu\in F. Therefore, there exists some point uI(a,t)u\in I(a,t) such that I(a,u)FI(a,u)\subset F. Because assume for contradiction that for every uI(a,t)u\in I(a,t) there existed some vI(a,u)v\in I(a,u) such that vFv\notin F. In that case, the definable set I(a,t)FI(a,t)\cap F would have an infinite number of connected components which is a contradiction to MM being t.t.t.

Now, since aint(F)a\notin int(F), for every point uI(s,a)u\in I(s,a) there must be some point vI(u,a)v\in I(u,a) such that vFv\notin F. Similarly to above, this means that there exists some point vI(s,a)v\in I(s,a) such that I(v,a)F=I(v,a)\cap F=\emptyset.

Together, this means that without loss of generality we can assume that I(x,a)F=I(x,a)\cap F=\emptyset and I(a,y)FI(a,y)\subset F.

If bI(a,y)b\in I(a,y) then for any uI(a,b)I(a,y)Fu\in I(a,b)\subset I(a,y)\subset F, auba\nsim_{u}b and so uFabu\in F_{ab}.

Let’s assume that bI(a,y)b\notin I(a,y).

Let A1A_{1} and A2A_{2} be a clopen partition of Mt\{a}M_{t}\backslash\{a\} such that xA1x\in A_{1} and let X1X_{1} and X2X_{2} be a clopen partition of Mt\{x}M_{t}\backslash\{x\} such that aX1a\in X_{1}. By the choice of A1A_{1} and X1X_{1}, I(x,a)=A1X1I(x,a)=A_{1}\cap X_{1}. Furthermore, since I(x,a)F=I(x,a)\cap F=\emptyset and UU is connected, from lemma 16 it follows that FA2¯F\subset\overline{A_{2}} or FX2¯F\subset\overline{X_{2}}. But I(a,y)A2I(a,y)\subset A_{2} and I(a,y)FI(a,y)\subset F so it must be that FA2¯=A2{a}F\subset\overline{A_{2}}=A_{2}\cup\{a\}. This means that bA2b\in A_{2}.

Now, let uu be some point in I(a,y)FI(a,y)\subset F. Let U1U_{1} and U2U_{2} be a clopen partition of Mt\{u}M_{t}\backslash\{u\} such that aU1a\in U_{1}. Assume for contradiction that bU1b\in U_{1}. Since bA2b\in A_{2} this means that bA2U1b\in A_{2}\cap U_{1}. But aU1a\in U_{1} and uA2u\in A_{2} which means that I(a,u)=A2U1I(a,u)=A_{2}\cap U_{1}. This implies that bI(a,u)I(a,y)b\in I(a,u)\subset I(a,y) which is a contradiction to our assumption. Therefore, bU1b\in U_{1} and aU2a\in U_{2} which means that uFabu\in F_{ab}.

This concludes the proof of the claim. ∎

By lemmas 32 and 31, UabU_{ab} is clopen. Therefore, U=UabU=U_{ab}.

Similarly, if UacU_{ac} and UbcU_{bc} are defined in the analogous fashion, U=Uac=Ubc=UabU=U_{ac}=U_{bc}=U_{ab}. We’ll now show that this is a contradiction.

Let’s choose a point xint(U)x\in int(U). Let X1X_{1} and X2X_{2} be the two connected components of D\{x}D\backslash\{x\}. Either X1X_{1} or X2X_{2} will contain two out of aa, bb, and cc. Without loss of generality, a,bX1a,b\in X_{1}. However, since xUabx\in U_{ab}, axba\nsim_{x}b which is clearly a contradiction. ∎

We’re now ready to show that every locally flat set is o-minimal. In order to do this, we’ll extend our previous notion of order from neighborhoods of locally flat points to locally flat sets.

Let DD be a definable open connected locally flat set. Let aDa\in D be some arbitrary point which we’ll think of as the center. In addition, let D+D_{+} and DD_{-} be the two connected components of D\{a}D\backslash\{a\} which we’ll think of as the “positive side” and the “negative side”. Finally let x,yDx,y\in D. We say that x<a,Dyx<_{a,D}y if one of the following holds:

  • x,yD+x,y\in D_{+} and axya\nsim_{x}y

  • x,yDx,y\in D_{-} and ayxa\nsim_{y}x

  • yD+y\in D_{+} and xDx\in D_{-}

  • y=ay=a and xDx\in D_{-}

  • x=ax=a and yD+y\in D_{+}

By proposition 21, <a,D<_{a,D} is definable.

The next proposition shows that <a,D<_{a,D} defines a dense linear order on DD such that the induced interval topology is equivalent to the topology induced by MtM_{t}.

Proposition 34.

Let MM be a 1-dimensional connected ω\omega-saturated t.t.t structure such that for each point xMtx\in M_{t}, dM(Mt\{x})>1d_{M}(M_{t}\backslash\{x\})>1. Let DMtD\subset M_{t} be a connected open definable subset which is locally flat and let aa be some point in DD. Then <a,D<_{a,D} defines a dense linear order on DD such that the induced interval topology is equivalent to the topology induced by MtM_{t}.

Proof.

Let D+D_{+}, DD_{-} be the sets used in the definition of <a,D<_{a,D} above.

Let x,y,zDx,y,z\in D. In addition, let X1X_{1} and X2X_{2} be the connected components of D\{x}D\backslash\{x\} such that aX1a\in X_{1}. Y1Y_{1}, Y2Y_{2}, Z1Z_{1} and Z2Z_{2} are defined analogously for yy and zz.

  1. (1)

    xa,Dyy<a,Dxx\nless_{a,D}y\Rightarrow y<_{a,D}x:

    We assume that x,yD+x,y\in D_{+}. The other possibilities are either identical or trivial. By the assumption, yX1y\in X_{1}. Assume for contradiction that xY1x\in Y_{1}. Since aX1Y1a\in X_{1}\cap Y_{1}, by lemma 16 both X2X_{2} and Y2Y_{2} are subsets of D+D_{+}.

    Let’s define

    F=(D+X1Y1){a}{x}{y}F=(D_{+}\cap X_{1}\cap Y_{1})\cup\{a\}\cup\{x\}\cup\{y\}

    . By lemma 16 FF is closed and bd(F){a,x,y}bd(F)\subset\{a,x,y\}. We’ll now show that FF is connected and that bd(F)={a,x,y}bd(F)=\{a,x,y\}.

    Let CC be some connected component of FF. Since DD is connected, bd(C)={a,x,y}bd(C)=\{a,x,y\}. For assume for contradiction that one of the points in the set {a,x,y}\{a,x,y\} was not included in bd(C)bd(C). Without loss of generality, let’s assume that bd(C)={x,y}bd(C)=\{x,y\}. Since bd(C){a,x,y}bd(C)\subset\{a,x,y\}, bd(X2)={x}bd(X_{2})=\{x\} and bd(Y2)={y}bd(Y_{2})=\{y\}, it follows that CX2X1{x}{y}C\cup X_{2}\cup X_{1}\cup\{x\}\cup\{y\} is a clopen subset of DD which is clearly a contradiction. Assuming that bd(C)bd(C) is equal to some other strict subset of {a,x,y}\{a,x,y\} gives a similar contradiction.

    In addition, aa, xx and yy are boundary points of DD_{-}, X2X_{2} and Y2Y_{2} respectively so by lemma 25, each one of aa, xx, and yy is the boundary point of at most one connected component of FF. Therefore, FF has only one connected component and bd(F)={a,x,y}bd(F)=\{a,x,y\}.

    However, this is a contradiction to lemma 33.

  2. (2)

    x<a,Dyya,Dxx<_{a,D}y\Rightarrow y\nless_{a,D}x:

    Also in this case we’ll assume that x,yD+x,y\in D_{+}. Since x<a,Dyx<_{a,D}y and aX1a\in X_{1}, we get that yX2y\in X_{2}. Now, we claim that xY1x\in Y_{1}. For otherwise, if it was true that xY2x\in Y_{2} then we’d get from lemma 16 that Y1X1=Y_{1}\cap X_{1}=\emptyset which is a contradiction to the fact that aX1Y1a\in X_{1}\cap Y_{1}.

  3. (3)

    x<a,Dyy<a,Dzx<a,Dzx<_{a,D}y\wedge y<_{a,D}z\Rightarrow x<_{a,D}z:

    According to the assumptions, a,xY1a,x\in Y_{1}, zY2z\in Y_{2}, aX1a\in X_{1} and yX2y\in X_{2}. We have to prove that zX2z\in X_{2} as well. But again by lemma 16,

    yX2xY1Y2X2zX2y\in X_{2}\wedge x\in Y_{1}\Rightarrow Y_{2}\subset X_{2}\Rightarrow z\in X_{2}

    .

This shows that <a,D<_{a,D} is a linear order. We’ll now show that <a,D<_{a,D} is dense.

Let’s assume that x<a,Dyx<_{a,D}y. As we showed above, this means that yX2y\in X_{2} and xY1x\in Y_{1}. By lemma 28, X2Y1=I(x,y)X_{2}\cap Y_{1}=I(x,y)\neq\emptyset. Let ss be some point in I(x,y)I(x,y). Since sX2Y1s\in X_{2}\cap Y_{1}, it follows from the definition of <a,D<_{a,D} that x<a,Ds<a,Dyx<_{a,D}s<_{a,D}y.

We’ll now see that the order topology induced on DD by <a,D<_{a,D} is equivalent to the topology on DD induced by MtM_{t}.

As a first step, we note that if x<a,Dyx<_{a,D}y, then

I(x,y)D={zD|x<a,Dz<a,Dy}I(x,y)\cap D=\{z\in D|x<_{a,D}z<_{a,D}y\}

. This is immediate from the definitions of I(x,y)I(x,y) and <a,D<_{a,D}.

Let UDU\subset D be an open set in DD with xUx\in U. By lemma 29, there exists a pair of points s,tUs,t\in U such that xI(s,t)x\in I(s,t) and I(s,t)UI(s,t)\subset U. Without loss of generality, s<a,Dts<_{a,D}t.

Therefore,

x{uD|s<a,Du<a,Dt}=I(s,t)DUx\in\{u\in D|s<_{a,D}u<_{a,D}t\}=I(s,t)\cap D\subset U

. The other direction is trivial as I(x,y)I(x,y) is open in DD for every x,yDx,y\in D. ∎

We now obtain our primary result as an immediate consequence of propositions 24 and 34.

Theorem 35.

Let MM be a 1-dimensional connected ω\omega-saturated t.t.t structure such that for every point xMtx\in M_{t}, dM(Mt\{x})>1d_{M}(M_{t}\backslash\{x\})>1. Then there exists a finite set XMtX\subset M_{t} such that each of the finite number of connected components of Mt\XM_{t}\backslash X are o-minimal.

Proof.

Let XX be the definable set of points in MtM_{t} which aren’t locally flat. By proposition 24, XX is finite. Let DD be a connected component of Mt\XM_{t}\backslash X. Since there’re only a finite number of connected components, DD is a connected open definable subset which is locally flat. By proposition 34, there exists a definable dense linear order which induces the topology on DD. By [1, 6.2], this means that DD is o-minimal.∎

Remark.

Note that even if MtM_{t} isn’t connected, we can obtain theorem 35 for any open connected definable subset DMtD\subset M_{t} with the property that removing any point from DD splits DD into more than one connected component.

Example 36.

Let’s return to the structure Rint=,I(x,y,z)R_{int}=\langle\mathbb{R},I(x,y,z)\rangle from example 22. By theorem 35, we should be able to recover the standard order << on \mathbb{R} from II.

Let D=D=\mathbb{R} and let aa be some point from \mathbb{R}. In addition, let xx and yy be points in \mathbb{R} such that a<x<ya<x<y. By the construction of, <a,D<_{a,D} it’s clear that a<a,Dx<a,Dya<_{a,D}x<_{a,D}y. By checking the other possibilities for xx and yy in a similar fashion it’s easy to see that <a,D<_{a},D is equivalent to <<.

5. Structures Without Splitting

In this section we look at structures where removing a point doesn’t split the structure into more than one connected component. One example of such a structure is the unit circle. Our main goal in this section will be to find alternative topological properties which ensure that the structure is at least locally o-minimal as in the case of the unit circle.

Lemma 37.

Let MM be an ω\omega-saturated one dimensional t.t.t structure. Let AA be a definable open set, f:A𝒫(Mt)f:A\rightarrow\mathcal{P}(M_{t}) a function such that f(x)f(x) is finite for each point xMtx\in M_{t} and Γ\Gamma the graph of ff. Then for each point xAx\in A, the fiber (Γ¯)x(\overline{\Gamma})_{x} is finite.

Proof.

Let’s assume for contradiction that there exists a point xAx\in A and a sequence of points (yi)i<ω(y_{i})_{i<\omega} in MtM_{t} such that for every i<ωi<\omega, every basis set UAU\subset A containing xx and every basis point VV containing yiy_{i}, there exists some zU\{x}z\in U\backslash\{x\} such that f(z)Vf(z)\in V.∎

Claim.

For every i<ωi<\omega and every basis set VV containing yiy_{i} there exists a basis set UAU\subset A containing xx such that for every basis set WUW\subset U containing xx we have f(bd(W))Vf(bd(W))\cap V\neq\emptyset.

Proof.

Let’s take some i<ωi<\omega. Let VV be some basis set containing yiy_{i}. Assume for contradiction that for every basis set UAU\subset A containing xx there exists some basis set WUW\subset U containing xx such that f(bd(W))V=f(bd(W))\cap V=\emptyset.

We now define X=f1(V)AX=f^{-1}(V)\cap A. By the definition of yiy_{i}, for every basis set WW containing xx, W(X\{x})W\cap(X\backslash\{x\})\neq\emptyset. Therefore, by the assumption for contradiction there exists a descending sequence of basis sets (Wi)i<ω(W_{i})_{i<\omega} such that for all i<ωi<\omega:

  • xWiXx\in W_{i}\subset X

  • Wi+1¯Wi\overline{W_{i+1}}\subsetneq W_{i}

  • bd(Wi)X=bd(W_{i})\cap X=\emptyset

Proof.

By the last two properties, for every i<ωi<\omega the set Wi\Wi+1W_{i}\backslash W_{i+1} is clopen in XX. But this means that XX can be partitioned into an infinite number of definable clopen subsets which is a contradiction. ∎

Now, by the ω\omega-saturation we can assume that there exists some N<ωN<\omega such that for every zAz\in A, |f(z)|<N|f(z)|<N. Similarly, there exists some B<ωB<\omega such that for every basis set VV, |bd(V)|<B|bd(V)|<B. Let V1,,VNB+1V_{1},\dots,V_{NB+1} be pairwise disjoint basis sets such that for every 1iNB+11\leq i\leq NB+1 we have yiViy_{i}\in V_{i}. By the claim, there exists a basis set UAU\subset A containing xx such that for every basis set WUW\subset U containing xx and every every 1iNB+11\leq i\leq NB+1 we have f(bd(W))Vif(bd(W))\cap V_{i}\neq\emptyset.

Let WUW\subset U be some basis set. By the definitions of NN and BB, |f(bd(W))|NB|f(bd(W))|\leq NB which is a contradiction to the fact that V1,,VNB+1V_{1},\dots,V_{NB+1} are pairwise disjoint.∎

Proposition 38.

Let MM be an ω\omega-saturated one dimensional t.t.t structure such that there exist a definable continuous function F:Mt2MtF:M_{t}^{2}\rightarrow M_{t} and a point aMta\in M_{t} such that for each xMtx\in M_{t}, F(x,x)=aF(x,x)=a and F(x,)F(x,\cdot) is injective. Let f:Mt𝒫(Mt)f:M_{t}\rightarrow\mathcal{P}(M_{t}) be a function such that for every xMtx\in M_{t}, |f(x)|<|f(x)|<\infty and f(x)xf(x)\neq x. Let Γ\Gamma be the graph of ff. Then for every basis set UMtU\subset M_{t}, there exists a point xUx\in U such that (x,x)Γ¯(x,x)\notin\overline{\Gamma}.

Proof.

Assume for contradiction that there exists some basis set UMtU\subset M_{t} such that for every xUx\in U, (x,x)Γ¯(x,x)\in\overline{\Gamma}. We now define the function g:U𝒫(Mt)g:U\rightarrow\mathcal{P}(M_{t}) by

g(x)={F(x,y)|yf(x)}g(x)=\{F(x,y)|y\in f(x)\}

.

In addition, we define the function h:Mt𝒫(U)h:M_{t}\rightarrow\mathcal{P}(U) by

h(y)=g1(y)Uh(y)=g^{-1}(y)\cap U

. Let Γg\Gamma_{g} and Γh\Gamma_{h} be the graphs of gg and hh respectively.

By our assumption on FF, F(x,x)=aF(x,x)=a for each xUx\in U. Therefore, by the continuity of FF together with the assumption that for every xUx\in U, (x,x)Γ¯(x,x)\in\overline{\Gamma}, we get that (x,a)Γg¯(x,a)\in\overline{\Gamma_{g}} for each xUx\in U.

Furthermore, since for every xUx\in U we have f(x)xf(x)\neq x and F(x,)F(x,\cdot) is injective, g(x)ag(x)\neq a for all xUx\in U.

We’ll now show that there exists an open set AA containing aa such that for every yAy\in A, the set h(y)h(y) is finite. By our assumptions on ff, g(x)g(x) is finite for every xMtx\in M_{t}. Therefore, by the exchange principle there are a finite number of points yMty\in M_{t} such that h(y)h(y) is infinite. Furthermore, h(a)=h(a)=\emptyset so by the Hausdorffness of MtM_{t}, there exists an open set AA containing aa such that for every yAy\in A, the set h(y)h(y) is finite.

In addition, since (x,a)Γg¯(x,a)\in\overline{\Gamma_{g}} for each xUx\in U, the fiber (Γh¯)a(\overline{\Gamma_{h}})_{a} is infinite. However, this is a contradiction to lemma 37.∎

Proposition 39.

Let MM be an ω\omega-saturated one dimensional t.t.t structure such that there exist a definable continuous function F:Mt2MtF:M_{t}^{2}\rightarrow M_{t} and a point aMta\in M_{t} such that for each xMtx\in M_{t}, F(x,x)=aF(x,x)=a and F(x,)F(x,\cdot) is injective.

Then for every basis set UU there exists a basis set VUV\subset U such that for every point xVx\in V there exists a basis set WW such that bd(W)V={x}bd(W)\cap V=\{x\}.

Proof.

First of all, without loss of generality we can assume that for every xMtx\in M_{t} there is some basis set WW such that xbd(W)x\in bd(W). Because let XX be the set of all such points. XX is clearly definable. Assume for contradiction that XcX^{c} has a non empty interior. Let WW be a basis set such that W¯X\overline{W}\subset X. Then bd(W)Xbd(W)\subset X which is clearly a contradiction. Therefore, XcX^{c} is finite.

We define a function f:U𝒫(Mt)f:U\rightarrow\mathcal{P}(M_{t}) by

f(x)={yx|there exists a basis set W such that {x,y}bd(W)}f(x)=\{y\neq x|\textrm{there exists a basis set }W\textrm{ such that }\{x,y\}\subset bd(W)\}

Let NN be an integer such that for every basis set UU, |bd(U)|<N|bd(U)|<N. Let Γ\Gamma be the graph of ff.

We now look at two cases.

For the first case let’s assume that there exists a basis set VUV\subset U such that for each xVx\in V, |f(x)|<|f(x)|<\infty. By proposition 38, there exists some basis set WVW\subset V such that (W×W)Γ=(W\times W)\cap\Gamma=\emptyset. This means that for every point xWx\in W, there exists a basis set AA such that bd(A)W={x}bd(A)\cap W=\{x\}. Because let xx be some point in WW and let AA be a basis set such that xbd(A)x\in bd(A). Since (W×W)Γ=(W\times W)\cap\Gamma=\emptyset, the rest of the boundary points of AA are not contained in WW which means that bd(A)W={x}bd(A)\cap W=\{x\}.

For the second case, assume that for every basis set VUV\subset U there exists some point xVx\in V such that f(x)f(x) is infinite. We now assume for contradiction that there doesn’t exist a basis set VUV\subset U such that for every point xVx\in V, there exists a basis set WW such that bd(W)V={x}bd(W)\cap V=\{x\}.

In order to get a contradiction, we’ll inductively build a sequence of tuples of points, basis sets and functions (xi,Vi,fi)i=1N(x_{i},V_{i},f_{i})_{i=1}^{N} with the following properties:

  • V1V_{1} is an arbitrary basis set in UU, x1x_{1} is a point in V1V_{1} such that f(x1)f(x_{1}) is infinite and f1=ff_{1}=f.

  • For all 1iN1\leq i\leq N, fi:U𝒫(Mt)f_{i}:U\rightarrow\mathcal{P}(M_{t}) is defined by

    fi(x)={yx,x1,,xi1|there exists a basis set Wf_{i}(x)=\{y\neq x,x_{1},\dots,x_{i-1}|\textrm{there exists a basis set }W
     such that {x,x1,,xi1,y}bd(W)}\textrm{ such that }\{x,x_{1},\dots,x_{i-1},y\}\subset bd(W)\}
  • For all 1iN1\leq i\leq N, xiVix_{i}\in V_{i}

  • For all 1iN1\leq i\leq N, fi(xi)f_{i}(x_{i}) is infinite.

  • For all i<ji<j, xiVjx_{i}\notin V_{j}

The existence of (x1,V1,f1)(x_{1},V_{1},f_{1}) follows immediately from our assumptions in the second case.

Let’s assume that we’ve constructed the sequence up to the ii-th place. Since fi(xi)f_{i}(x_{i}) is infinite, there exists some basis set Vi+1fi(xi)V_{i+1}\subset f_{i}(x_{i}) such that xiVi+1x_{i}\notin V_{i+1}. We define fi+1f_{i+1} as above.

Now, if for all xVi+1x\in V_{i+1} the set fi+1(x)f_{i+1}(x) would be finite then just as in the first case, together with the fact that i<jxiVji<j\Rightarrow x_{i}\notin V_{j}, there would exist a basis set WUW\subset U such that for every yWy\in W, there exists a basis set AA such that bd(A)W={y}bd(A)\cap W=\{y\}. Therefore, by our assumption for contradiction, there exists some point xi+1Vi+1x_{i+1}\in V_{i+1} such that fi+1(xi+1)f_{i+1}(x_{i+1}) is infinite. Thus we’ve found a tuple (xi+1,Vi+1,fi+1)(x_{i+1},V_{i+1},f_{i+1}) satisfying the requirements.

However, the existence of the tuple (xN,VN,fN)(x_{N},V_{N},f_{N}) is clearly a contradiction because on the one hand fN(xN)f_{N}(x_{N}) is infinite but by the definition of NN, for every point xUx\in U the set fN(x)f_{N}(x) is empty. ∎

We’ll now prove a similar proposition under the assumption that all of the basis sets have only two points in their boundary.

Lemma 40.

Let XX be a topological space and let UXU\subset X and VXV\subset X be connected open sets such that

bd(U)V=bd(V)U=bd(U)\cap V=bd(V)\cap U=\emptyset

and UVU\neq V. Then UV=U\cap V=\emptyset.

Proof.

Let’s look at the open set W=UVW=U\cap V. If W=W=\emptyset then we’re finished.

Let’s assume that WW\neq\emptyset. If WUW\neq U then since UU is connected, the boundary of WW in UU must be non-empty. Let xUx\in U be a point in bd(W)bd(W). Since xWx\notin W, xVx\notin V. But xW¯V¯x\in\overline{W}\subset\overline{V} which means that xbd(V)x\in bd(V). This is a contradiction to the fact that xUx\in U. Therefore, W=UW=U. Similarly, W=VW=V. Together this means that U=VU=V which is a contradiction to the assumption. ∎

Lemma 41.

Let MM be a t.t.t structure and let XMtX\subset M_{t} be some finite subset. Then there are only a finite number of basis sets UMtU\subset M_{t} such that bd(U)=Xbd(U)=X.

Proof.

Let \mathcal{B} be the set of basis sets UU such that bd(U)=Xbd(U)=X. Assume for contradiction that \mathcal{B} is infinite. Let 𝒞\mathcal{C} be defined by

𝒞=U{CMt|C is a connected component of U}\mathcal{C}=\bigcup_{U\in\mathcal{B}}\{C\subset M_{t}|C\textrm{ is a connected component of }U\}

For each C𝒞C\in\mathcal{C}, bd(C)Xbd(C)\subset X. In addition, since \mathcal{B} is infinite, 𝒞\mathcal{C} is infinite as well. However, by lemma 40, for each pair of connected components C1,C2𝒞C_{1},C_{2}\in\mathcal{C}, C1C2=C_{1}\cap C_{2}=\emptyset. Therefore, the definable set

𝒞=\bigcup\mathcal{C}=\bigcup\mathcal{B}

can be partitioned into an infinite number of clopen sets which is a contradiction to the fact that MM is t.t.t.∎

Proposition 42.

Let MM be an ω\omega-saturated one dimensional t.t.t structure such that for every basis set UU, |bd(U)|=2|bd(U)|=2.

Then for every basis set UU there exists a basis set VUV\subset U such that for every point xVx\in V there exists a basis set WW such that bd(W)V={x}bd(W)\cap V=\{x\}.

Proof.

As before, without loss of generality we can assume that for every xMtx\in M_{t} there is some basis set WW such that xbd(W)x\in bd(W).

We also use the function f:U𝒫(Mt)f:U\rightarrow\mathcal{P}(M_{t}) defined above by

f(x)={yx|there exists a basis set W such that {x,y}bd(W)}f(x)=\{y\neq x|\textrm{there exists a basis set }W\textrm{ such that }\{x,y\}\subset bd(W)\}

Let UU be some basis set. First let’s assume that there exists a point uUu\in U such that |f(u)U|=|f(u)\cap U|=\infty. Since MtM_{t} is Hausdorff, there exists some basis set Vf(u)UV\subset f(u)\cap U such that uVu\notin V. VV clearly satisfies the requirements of the proposition.

On the other hand, assume that for each point uUu\in U, |f(u)U|<|f(u)\cap U|<\infty. By lemma 41 this means that there are only a finite number of basis sets WUW\subset U such that ubd(W)u\in bd(W). By the ω\omega-saturation this means that there exists some number NN\in\mathbb{N} such that for each point uUu\in U there are at most NN basis sets WUW\subset U such that xbd(W)x\in bd(W).

We’ll now show using downward induction that there exists a basis set VUV\subset U such that for every point vVv\in V, there are no basis sets WVW\subset V such that vbd(W)v\in bd(W) which is clearly a contradiction.

Assume that we found a basis set ViV_{i} for 0<iN0<i\leq N such that for every point vViv\in V_{i}, there are at most ii basis sets WUW\subset U such that xbd(W)x\in bd(W). Let viv_{i} be some point in ViV_{i} and let XX be the set of points xVix\in V_{i} such that there exists a basis set WW with viWv_{i}\in W and xbd(W)x\in bd(W). Again by the fact that MtM_{t} is Hausdorff it follows that XX is infinite. We choose Vi1V_{i-1} to be some basis set such that Vi1XV_{i-1}\subset X and viVi1v_{i}\notin V_{i-1}.

Now, let xx be some point in Vi1V_{i-1}. Since xVix\in V_{i}, there are at most ii basis sets WViW\subset V_{i} such that xbd(W)x\in bd(W). However, one of these sets contains viv_{i} which isn’t an element in Vi1V_{i-1}. Therefore, there are at most i1i-1 basis sets WVi1W\subset V_{i-1} such that xbd(W)x\in bd(W).

This finishes the downward induction and the proposition.∎

Theorem 43.

Let MM be a 1-dimensional ω\omega-saturated t.t.t structure such that one of the following holds:

  1. (1)

    There exist a definable continuous function F:Mt2MtF:M_{t}^{2}\rightarrow M_{t} and a point aMta\in M_{t} such that for each xMtx\in M_{t}, F(x,x)=aF(x,x)=a and F(x,)F(x,\cdot) is injective.

  2. (2)

    For every basis set UU, |bd(U)|=2|bd(U)|=2.

Then for all but a finite number of points, for every point xMtx\in M_{t} there’s a basis set UU containing xx such that UU is o-minimal.

Proof.

It’s enough to prove that for every basis set UU there exists a point x0Ux_{0}\in U with an o-minimal neighborhood.

Let UU be a basis set. By propositions 39 and 42, there exists a basis set VUV\subset U such that for every point xVx\in V there exists a basis set WW such that bd(W)V={x}bd(W)\cap V=\{x\}. This means that for every point xVx\in V, V\{x}V\backslash\{x\} has at least two connected components. Without loss of generality VV is connected. By theorem 35 (and the remark immediately after it), this means that after removing a finite number of points from VV the remaining connected components are o-minimal. Let CC be one of the o-minimal components and let x0x_{0} be some point in CC. Clearly x0x_{0} has an o-minimal neighborhood.∎

Corollary 44.

Let MM be an ω\omega-saturated one dimensional t.t.t structure which admits a topological group structure . Then all but a finite number of points have an o-minimal neighborhood.

Proof.

We define a function F:Mt2MtF:M_{t}^{2}\rightarrow M_{t} by

F(x,y)=xyF(x,y)=x-y

The function FF clearly satisfies the conditions of theorem 43. ∎

Proposition 45.

Let MM be an ω\omega-saturated one dimensional t.t.t structure such that all but a finite number of points have an o-minimal neighborhood. Let f:MtMtf:M_{t}\rightarrow M_{t} be definable function. Then ff is continuous for all but a finite number of points.

Proof.

We’ll show that in every basis set UU there is a point x0Ux_{0}\in U such that ff is continuous at x0x_{0}.

Let UU be a basis set and let Γ\Gamma be the graph of ff.

If the projection of Γ(U×Mt)\Gamma\cap(U\times M_{t}) onto the second coordinate is finite then there exists a basis set VUV\subset U such that ff is constant on VV.

On the other hand, if the projection is infinite then there exists some point yMty\in M_{t} with an o-minimal neighborhood such that for any basis set VV containing yy there exists some xUx\in U such that yf(x)Vy\neq f(x)\in V. Let VV be an o-minimal basis set containing yy. By the choice of yy, f1(V)Uf^{-1}(V)\cap U is infinite so by the assumption there exists some o-minimal basis set WUW\subset U such that f(W)Vf(W)\subset V. Since both WW and VV are o-minimal, by the monotonicity theorem there exists some x0WUx_{0}\in W\subset U such that ff is continuous at x0x_{0}. ∎

We conclude this section by giving two examples of theorem 43.

Example 46.

For the first example we return to the unit circle mentioned in the beginning of the section. We’ll look at the structure S=S1,R(x,y,z)S=\langle S^{1},R(x,y,z)\rangle where R(x,y,z)R(x,y,z) is true if xx and yy are not opposite each other and zz lies on the short arc between xx and yy. If we define the set of basis sets as

{RS(a,b,z)|a,bS}\{R^{S}(a,b,z)|a,b\in S\}

then SS is a 1-dimensional ω\omega-saturated t.t.t structure. In addition, for every basis set UU, |bd(U)|=2|bd(U)|=2 so by theorem 43 SS is locally o-minimal. This is indeed true as locally SS looks like the structure RintR_{int} from example 22 which was shown to be o-minimal.

Example 47.

This example is a slight variant of Rint=,I(x,y,z)R_{int}=\langle\mathbb{R},I(x,y,z)\rangle. Let’s define the relation RI(x,y,z)RI(x,y,z) in R=,+,,0,1,<R=\langle\mathbb{R},+,\cdot,0,1,<\rangle by:

RI(x,y,z)(x<z<y)(1<xy<1)RI(x,y,z)\iff(x<z<y)\wedge(-1<x-y<1)

So RIRI is a version of II restricted to intervals with a length of less than 1.

Let RR¯R\prec\overline{R} be an ω\omega-saturated elementary extension and let ¯\overline{\mathbb{R}} be the universe of R¯\overline{R}. We define R¯rint=¯,RI\overline{R}_{rint}=\langle\overline{\mathbb{R}},RI\rangle to be the restriction of R¯\overline{R} to the language {RI}\{RI\}.

Clearly R¯rint\overline{R}_{rint} is ω\omega-saturated. In addition, since R¯\overline{R} is o-minimal, R¯rint\overline{R}_{rint} is a one dimensional t.t.t structure.

However, for any point a¯a\in\overline{\mathbb{R}}, ¯\{a}\overline{\mathbb{R}}\backslash\{a\} has only one definably connected component in RrintR_{rint}. Because assume for contradiction that the sets

A+={x¯|x>a}A_{+}=\{x\in\overline{\mathbb{R}}|x>a\}
A={x¯|x<a}A_{-}=\{x\in\overline{\mathbb{R}}|x<a\}

were definable in R¯rint\overline{R}_{rint} using the constants c1,,cNc_{1},\dots,c_{N}. Let’s define subsets

A~+={x¯|(x>a)(n<Nk(x>cn+k)}\tilde{A}_{+}=\{x\in\overline{\mathbb{R}}|(x>a)\wedge(\forall n<N\forall k(x>c_{n}+k)\}
A~={x¯|(x<a)(n<Nk(x<cn+k)}\tilde{A}_{-}=\{x\in\overline{\mathbb{R}}|(x<a)\wedge(\forall n<N\forall k(x<c_{n}+k)\}

By the definition of RIRI, an automorphism of ¯\overline{\mathbb{R}} which swaps A~+\tilde{A}_{+} and A~\tilde{A}_{-} is an automorphism of R¯rint\overline{R}_{rint} together with the constants c1,,cNc_{1},\dots,c_{N} which is a contradiction.

On the other hand, the basis sets of RrintR_{rint} have two boundary points so by theorem 43, every point in RrintR_{rint} has an o-minimal neighborhood. This makes sense because for any point a¯a\in\overline{\mathbb{R}} and interval UU containing aa with a length of less than one, we can define an order on UU in the same way that we defined an order on RintR_{int} in example 22.

Acknowledgement

I’d like to thank Ehud Hrushovski for providing valuable insights and guidance throughout the time spent working on this paper.

References

  • [1] A. Pillay, First order topological structures and theories, The Journal of Symbolic Logic 52 (1987), no. 3, 763–778.
  • [2] A. Robinson, A note on topological model theory, Fundamenta Mathematicae 81 (1974), 159–171.