MS-measurability via coordinatization
Abstract.
We define a notion of coordinatization for -categorical structures which is, like Lie coordinatized structures in [2], a certain kind of expansion of a tree. We show that a structure which is coordinatized, in a certain strong sense, by -categorical MS-measurable structures itself is MS-measurable.
Key words and phrases:
MS-measurable structures, asymptotic classes, coordinatization, -categorical theories2010 Mathematics Subject Classification:
03C13 , 03C45, 03C151. Introduction
The notion of MS-measurable structures was introduced by Macpherson and Steinhorn in [9]. An MS-measurable structure is an infinite structure whose definable sets are equipped with an -valued dimension and an -valued measure satisfying natural properties (e.g., a variant of Fubini’s Theorem). All MS-measurable structures are supersimple of finite SU-rank. The motivating examples of MS-measurable structures are infinite pseudofinite fields. More generally, a non-principal ultraproduct of a so-called asymptotic class of finite structures is always MS-measurable. An asymptotic class means that we have, in some sense, tight estimates of the sizes of the definable sets in all structures in the class; this condition is essentially a generalization of the classical Lang–Weil estimates for varieties in the class of finite fields [1]. There are also MS-measurable structures which are not even pseudofinite, so cannot be obtained from asymptotic classes [4].
Coordinatization is a method of decomposing a model as a tree of geometries. Roughly speaking, it means that the structure can be constructed in a nice way from a tree, the skeleton of the structure, by gluing additional structures on some nodes of tree. By allowing the components to interact with each other, we may define different notions of coordinatization. In [2], for example, Cherlin and Hrushovski define a “Lie coordinatized” structure to be a structure with a treelike form of finite height which witnesses how a structure is built by a sequence of finite and affine covers; they then prove that a countable structure is smoothly approximated if and only if it is Lie coordinatizable. Elwes, in [5], has proven that any smoothly approximable structure is MS-measurable by showing that it arises from an approximating sequence of envelopes which forms an asymptotic class.
In [7], Hill has studied the construction of pseudo-finite structures using a certain notion of coordinatization. In particular, he has shown that a structure that is coordinatized by structures with the finite sub-model property itself has the finite sub-model property. In [7], Hill uses a notion of coordinatization with a lot of independence similar to what is found in [8], but does not come with size estimates. Also, in [6], Hill uses a different but related kind of independence to get size estimates. Insofar as there is some overlap between [6] and [7] which suggests that there is a nice intraction between MS-measurability and pseudo-finiteness, it is worthwhile to study MS-measurability of structures obtained as expansions of trees.
In this paper, we define a strong notion of coordinatization for -categorical structures obtained as certain kinds of expansions of trees. We show that a structure which is coordinatized by one-dimensional -categorical MS-measurable structures is itself MS-measurable. This gives new examples of MS-measurable structures. This paper can be counted as the first step towards a more general problem for the study of an approach to understanding the intersection of two model-theoretically natural classes of structures, countably categorical 1-based structures on one hand (see [3]), and MS-measurable structures (see [9]) on the other hand. In the long run, the goal is to develop a notion of coordinatization that captures the structures in that intersection. Here, we have worked out how we would expect that notion to look by working out the details of a certain strong notion of coordinatization. We expect that the ”right” notion will turn out to be a relaxation of the notion of coordinatization here.
The paper is organized as follows. In Subsection 1.1, we fix some notation and conventions which we use throughout the paper. In Section 2, we express some preliminaries and building blocks which will be used for the rest of the paper including the notions of tree plans, tree-closure, and expansions of trees. We provide all material which we need to define our notion of coordinatization. In Section 3, we define a certain notion of coordinatization and show how to construct structures coordinatized in this way. In Section 4, we recall the definition of MS-measurability and prove a criterion for MS-measurability of -categorical structures. Then we prove the main theorem saying that one can lift MS-measurability to coordinatized structures.
1.1. Notation and conventions
Throughout this paper, we use calligraphic upper-case letters like , to denote infinite structures with universes and , respectively. We use simple upper-case letters like to denote finite structures and identify them with their universes. In general, our notation for such structures is standard (see [10]). By we mean that is an elementary substructure of . By we mean that is a finite subset of . We write and to denote the algebraic closure and definable closure of in , respectively. For and , by and we mean and , respectively. We use to denote disjoint union. By we mean the set of all finite tuples of members of . We write to denote the set of all automorphisms of that fix pointwise. A theory is algebraically trivial if for all , for all , . If is an -formula and , we write to denote the set defined in by the -formula , i.e. . By we mean . For a countably infinite -categorical structure , and , we remind the reader that is always isolated, by the Ryll-Nardzewski theorem. Also in such a structure,
-
i.
By , we mean is the set defined by some formula that isolates .
-
ii.
We will introduce notions of dimension and measure for definable sets. By and , we mean and where is the set defined by a formula which isolates .
-
iii.
When we write , we mean that
where isolates for each , and enumerates .
2. Tree structures
In this section, we introduce some basic notions and techniques which are needed for the rest of the paper.
2.1. Tree plans
In order to define the notion of coordinatized structure in the next section, that is a kind of expansion of a tree, we first need the notion of tree plan.
Definition 2.1.1.
-
I.
The language of trees, , has signature , where is a binary relation symbol, is a constant symbol, and is a binary function symbol, and is a unary function symbol.
-
II.
A tree is an -structure such that:
-
•
is a partial ordering of the universe in which every downset () is well-ordered.
-
•
is the unique minimum element of — the root of .
-
•
For , is the unique maximum element of that is below both and — the meet of and .
-
•
For each , is the maximum element among the elements that are strictly less than . It is called the predecessor of . Also, as a convention we let .
Note that the class of trees in this sense is not first-order axiomatizable.
-
•
It follows from Definition 2.1.1 that is actually finite for all , and so predecessors exist.
Note that with function extension ordering has a natural tree structure, and when we write a tree , we mean that is a substructure. In paticular, it contains and is closed under .
Definition 2.1.2.
-
I.
A tree plan is just a pair , where is a finite tree (containing ) and is a function such that .
Under almost all circumstances it’s preferable to omit from the notation and start from the declaration “ is tree plan…”
-
II.
Given a tree plan , we define
We call each member of an infinity-node of .
For a given tree plan and a set (possibly infinite), we can define a tree, called , by identifying every infinity-node of with the set . Roughly speaking, is an extension of obtained by replacing each infinity-node with -many new nodes, and leaving other nodes to themselves.
Definition 2.1.3.
Let be a tree plan. For any non-empty set , we define a tree , and a function as follows:
if and for each :
-
–
if , then ;
-
–
if , then .
We then define just by setting , and we define
which is the set of infinity-nodes of . Note that for each and such that , there is a bijection between and the set
Observation 2.1.4.
Let be a tree plan. Then for any two sets and , if , then and . In fact, it can be shown that if and are both infinite and , then .
In the following, for a subset of a tree we define the set of points below (and above) , and also define the height of the tree.
Definition 2.1.5.
Let be a tree plan and . Let be an arbitrary set and .
-
(1)
We define . We say is downward closed if .
-
(2)
We define .
-
(3)
We define the height of , , to be the smallest number such that . I.e.
-
•
,
-
•
if , then if and only if and .
Also we define the height of the tree plan as follows:
-
•
In the next definition we define a closure operator on a tree . Roughly speaking, for a given we define the tree-closure of in to be the smallest subset of containing that is definably closed. Note that a definably closed set will be downward closed as well, by applying function.
Definition 2.1.6.
Let be a tree plan. For a set , we define tree-closure
as follows:
We set .
Using , we formulate another definition which is useful in relating an element to that may not itself be a member of . For and , we set
Note that if and only .
From now on, we fix a tree plan and a countably infinite set . Let
where for each , by we mean that is a unary relation symbol. We consider as an -structure with for each .
When is clear from context, for brevity, we write:
-
•
in place of ;
-
•
in place of ;
-
•
in place of ;
-
•
when we mean ;
-
•
in place of ;
Finally, we set
and for an expansion of , and each ,
These sets are called components of . Note that if and , then .
Here is a lemma which will be used in Section 3, in particular in the proof of Corollary 3.2.4, showing that certain expansions of are -categorical and eliminate quantifiers.
Lemma 2.1.7.
is ultra-homogeneous, and its theory, , is -categorical.
Proof.
Let be the class obtained by closing under isomorphisms. It’s easily seen that is the Fraïssé limit of . So is an ultra-homogeneous -structure, and its theory, , is -categorical. ∎
3. Coordinatization
In this section, we introduce a strong notion of coordinatization. Then, by constructing an example, in Subsection 3.2 we show such coordinatized structures exist. Finally, we verify that the example works.
3.1. Nil-interaction coordinatized structures
For a tree plan and a countably infinite set , we define a nil-interaction coordinatized structure to be an -categorical expansion of in which, roughly speaking, there is no interaction between different components other than what already supplies. This is analogous to what Cherlin and Hrushovski, in [2], call a Lie coordinatized structure in contrast to a Lie coordinatizable structure.
For the rest of this section, we take and as fixed. First, we make some notation for discussing -categorical expansions of in general.
Definition 3.1.1.
Let be an expansion of , and let . For each , let
and
where, for each , means is an -ary relation symbol.
Now, let be an -categorical expansion of , and let such that and . Then we define to be the -structure with universe and interpretations
for all and .
Also, we define
which is a closed subgroup of .
Definition 3.1.2.
Let be an expansion of . We say that is a nil-interaction coordinatized structure (or NIC structure) if all of the following conditions hold:
-
N1.
is -categorical, eliminates quantifiers, and has .
-
N2.
For each single element , .
-
N3.
For and , if , then
The next proposition shows that for each infinity-node of , there is an -categorical theory such that whenever . It shows that, up to isomorphism, the set of components of an NIC structure is finite, which we count as desirable.
Proposition 3.1.3.
Let be a tree plan and let be a NIC structure expanding . Let . Then there is an -categorical theory such that whenever . Moreover, for any , is an isomorphism of onto .
Proof.
Suppose and . Then is a bijection of onto . Also, for all , for all (see Definition 3.1.1), and for all we have
Therefore via . Suppose and . Let define in , and let be a formula that (i.e. for any , if and only if ). Since , by N2. So . This follows that . We set for any such that . Since is -categorical by N1, is -categorical as well. ∎
3.2. Existence of NIC structures
In this subsection, we provide an example which shows that nil-interaction coordinatized structures exist. We start with a tree plan . For each , we fix an -categorical theory in a relational language . We extend our language to by adding an -ary predicate symbol for each -ary relation symbol . Roughly speaking, we define a nil-interaction coordinatized structure as a -structure as follows: is the underlying set, and for each infinity-node with we identify with a model of .
3.2.1. Construction
The ingredients for constructing a NIC structure are the following:
-
•
A tree plan , and a countably infinite set .
-
•
For each , let be a theory in a relational language . We assume that is -categorical, algebraically trivial, eliminates quantifiers, and has .
We also assume that if are distinct, then .
-
•
For each , fix a bijection , where is a fixed countable model of .
We then define
Finally, is the -structure such that:
-
•
-
•
For each , such that , for each ,
Note that if and , then .
3.2.2. Verification
In this subsection, we verify that the structure obtained from the construction just presented satisfies N1, N2 and N3. Throughout this subsection, (for ) and are as in that construction.
Remark 3.2.1.
For , such that , so that for some , and , we define
and by setting if , and with a slight abuse of notation
whenever . We also notice that is the topological closure of the subgroup of generated by
Notation 3.2.2.
Let such that , and let . We write to denote the map where is given by .
The following lemma has a key role to verify that satisfies N1 and N2.
Lemma 3.2.3.
Let such that , and let such that . Let and where and . Then there is an automorphism such that . In particular, .
Proof.
Let . There is such that
and
We prove the statement by induction on , the length of the path from to . If , then and . Let , for some . Let and for some . Since and is ultra-homogeneous, there is an automorphism such that and (see Notation 3.2.2). We get such that and for each , . We define a bijection by
We set where . If , then some ancestor of is in , so where and thus . Suppose the statement holds for the case that the length of the path from to is , and suppose the length of the path from to equals . Since , . So and satisfy the assumptions of the statement. By the induction hypothesis, there is such that . A similar argument like the case will work here. More precisely, since , . So and satisfy the hypotheses for the case . Let . Since , there is an automorphism such that . So by an argument like the case , we get with , and we set . ∎
Corollary 3.2.4.
satisfies N1.
Proof.
Let . To prove -categoricity, we show that for all , is finite. For , it follows from Lemma 3.2.3 for , and the fact that is -categorical (see Lemma 2.1.7) and for all . Assume for all . We want to show that . For this, it is enough to show that for every , the set is finite. Suppose, towards a contradiction, that there are and , such that whenever . Since is -categorical, the pigeonhole principle allows us to assume that for all . So we may assume that for all . Since is algebraically trivial (for each ) and is finite, is finite as well. By the pigeonhole principle, there are finitely many types over in , for each . So for all but finitely many , the pairs satisfy the assumptions of the Lemma 3.2.3, so we may apply Lemma 3.2.3 to get an automorphism such that . This implies that for all but finitely many , which is a contradiction. Thus .
Since is -categorical, it eliminates quantifiers whenever is ultra-homogeneous. So it is enough to show that is ultra-homogeneous. Since is in the signature, every substructure of will be closed downwards (see Definition 2.1.5).
Claim.
Suppose is an -embedding where is a finite substructure of . Let such that . Then there is an -embedding such that .
Proof.
Suppose . Let . Since and is an -embedding, . We choose such that . We set . Now suppose . Let and . Since is -categorical, there is formula, say , that isolates where is an enumeration of . Let such that and . We need to show that is realized in . Since is an -embedding (partial elementary map) and , . We choose such that . Finally we set . ∎
Now let an -embedding be given, where is a finite substructure of . Let be an enumeration of . We construct an increasing sequence as follows.
-
•
Stage : set and .
-
•
Stage : If , then we set and . Otherwise, we may assume that
with for each . Then we set
-
•
Stage : If , then we set and . If , then we consider which is a partial isomorphism whose domain does not contain . Assume
with for each . Let . Then we set
Finally, we set which is an isomorphism from onto itself, and .
Now we show that We know that . We will show that for any , . Let be given, and let . We will show that . Let
such that , for each . Since , . Let . Since by hypothesis is algebraically trivial, there is a set such that for all , and For each , and satisfy the assumptions of Lemma 3.2.3. So for each , there is an automorphism such that . Since has distinct images under each of these automorphisms, is an infinite set of realizations of . Thus . ∎
Corollary 3.2.5.
satisfies .
Proof.
Let , and such that . We claim that . First we note that . Let . Since , . Hence by Lemma 3.2.3, . ∎
Corollary 3.2.6.
satisfies N3.
Proof.
Let and such that . Let such that
Suppose and set . Also, suppose , note that if not, then so there is nothing to do. Since
there is such that fixes (see Notation 3.2.2) pointwise, and . Then by Lemma 3.2.3, there is an automorphism such that . Therefore .
∎
Theorem 3.2.7.
is a NIC structure.
Here we prove a proposition that is interesting by itself, but it does not have any role in the rest of the paper.
Proposition 3.2.8.
Suppose for some , and . Let . Let be the coarsest partition of such that for each , for any , we have and . (For each , let and .) Then, abusing notation a little bit,
where for each . More precisely, let
For every , if , then there is an automorphism such that .
Proof.
By induction on we show that for any , if , then there is an automorphism such that . The base case, , follows from Lemma 3.2.3. Assume that the statement holds for any tuple of length . Let . Suppose . We will show that there is an automorphism such that and . We have . By the induction hypothesis, we get such that . So and . It is enough to show that there is an automorphism such that and . Since and , we can replace with . Now there are two possibilities. One possibility is that and are both in one of the components that already meets or not. In each case, we just need to apply Lemma 3.2.3 (similar to proof of Corollary 3.2.6).
∎
4. Lifting MS-measurability for coordinatization
In this section, we state and prove our main theorem which says how MS-measurability can be lifted from components to the nil-interaction coordinatized structure. Also, in this section we provide a criterion for MS-measurability of -categorical structures. This criterion helps us to verify that the function , constructed in Subsection 4.3, is MS-measurable.
4.1. Definitions and the statement of the main theorem
First we recall the following definition.
Definition 4.1.1.
Let be any structure. For each positive , denotes the set of all definable sets , where definable means “definable with parameters”. We note that in , the formulas involved do not matter – only the sets themselves are considered. We also define .
Here we recall the definition of MS-measurable structures from [9].
Definition 4.1.2.
An infinite -structure is called MS-measurable if there is a function
such that the following conditions hold.
-
MS1.
For each -formula , there is a finite set , such that for all , we have .
-
MS2.
If is finite, then .
-
MS3.
For every -formula and all , the set is -definable.
-
MS4.
(Fubini) Suppose is a definable surjective function, where . Let which is finite by MS1. For each , let , which is definable by MS3. Then, is a partition of , and
Here we express the statement of the Main Theorem.
Main Theorem (4.1).
Let be a tree plan and let be a NIC structure. Suppose that for each , is MS-measurable via such that . Then is MS-measurable via such that for all with and all tree-closed sets ,
and
The proof of the Main Theorem will appear in Subsection 4.3.
We note that the assumption that , for each , is just a convenience for the exposition. One can eliminate it at the expense of more arduous bookkeeping.
4.2. MS-measurability for -categorical theories
In this subsection, we provide a criterion for MS-measurability among -categorical theories. As mentioned before, this criterion is used in Subsection 4.3.
Theorem 4.2.1.
Let be a countably infinite -categorical structure. The following are equivalent.
-
(1)
is MS-measurable.
-
(2)
There is a function
satisfying the following conditions:
-
cMS1.
For all and , for all , .
-
cMS2.
For any and any -definable set , if
then
-
cMS3.
For all and , and
-
cMS4.
For any , , and , if and , then
-
cMS1.
Proof.
Let be a countably infinite -categorical structure. Set . Let be as in item 2 of Theorem 4.2.1. Lemmas 4.2.3 through 4.2.7 all together show that is MS-measurable via .
The following easy Lemma shows that is also automorphism-invariant for definable sets and it is used in Lemma 4.2.3 and Lemma 4.2.5.
Lemma 4.2.2.
Suppose and . Suppose cMS1 and cMS2 hold. Then .
Proof.
First we decompose into a disjoint union of complete types, then we apply cMS2 and cMS1. ∎
Lemma 4.2.3.
MS1 holds.
Proof.
Let , where . For each , let be a realization of . Then, by cMS1, Lemma 4.2.2 and the Ryll-Nardzewski Theorem,
which is finite. ∎
Lemma 4.2.4.
MS2 holds.
Proof.
Let where , and suppose is finite. Let be an enumeration of , so that is the disjoint union of the solution sets of . By cMS3, for each , and then by cMS2, . Also, by cMS3, we have
as required. ∎
Lemma 4.2.5.
MS3 holds.
Proof.
Let , where and , and let . For each , let be a realization of , and let be an isolating formula. Let
and . Then,
by Lemma 4.2.2. ∎
Lemma 4.2.6 (MS4 Special Case).
Let , and let be a surjective -definable function, where is the solution set of for some . Then, MS4 holds for this – i.e.
Proof.
We may assume that . For each , we define
which is just the solution set of , and we observe that . By cMS2, we have ; let
We observe that
Now, by cMS2 again, we have .
and
which completes the proof of the lemma. ∎
Lemma 4.2.7.
MS4 holds.
Proof.
Let , and let be a surjective -definable function. We may assume that . For each , let . By cMS2, we have and , where . By Lemma 4.2.6, we find that
as desired. ∎
Let be a countably infinite -categorical MS-measurable structure via . Lemmas 4.2.8 through 4.2.11 all together show that satisfies cMS1, …, cMS4.
Lemma 4.2.8.
cMS1 holds.
Proof.
Let and , and let . Let be a formula that isolates , and let enumerate . Let . By MS3, there is an -formula (i.e. without parameters) which defines Since and , . So .
∎
Lemma 4.2.9.
cMS2 holds.
Proof.
Let and a -definable set. Let . We proceed by induction on . For , we define by if ; if . Note that is definable with parameters from . We observe that . Case 1: if , then the result follows from MS. Case 2: if , then for . By MS4,
and
Now, suppose both statements hold for . Let . We first apply the induction hypothesis to , and conclude the statements by applying the case to and . ∎
Lemma 4.2.10.
cMS3 holds.
Proof.
Let and . Let . Since is algebraic over , there are finitely many, say , realizations for . By MS2, . Clearly . On the other hand by -categoricity, for each , there is such that . Hence . ∎
Lemma 4.2.11.
cMS4 holds.
Proof.
Let and . Let and . Let and be the formulas that isolate and respectively where enumerates . Let witness that . We define with such that
We observe that is a -definable surjective function onto , for each we have and so by MS1, . By MS4,
and
as desired. ∎
4.3. Proof of the Main Theorem Main Theorem
The proof of the Main Theorem consists of three parts, including construction of (Subsection 4.3.1), well-defindness (Subsection 4.3.2) and verification (Subsection 4.3.3).
4.3.1. Construction of
We define the function with as follows.
-
I.
First, we consider complete 1-types over closed sets. Consider where .
-
•
If , then and .
-
•
If , then there is a such that where for each . Let for each . Note that if , then we define simply because .
Then we define
-
•
-
II.
Suppose we have defined for complete -types over closed sets. Let be a closed subset, , and . We want to define and . We take the Lascar (in)equality as a pattern to follow, setting
and
-
III.
So far we have defined for complete types over closed sets. Now, let be an arbitrary definable set over . Let such that
Then we define
We set , and then we define
4.3.2. Well-definedness of
For a given definable set , there are many different finite sets over which is definable. Depending on which set of parameters we choose, it is possible that different values for may arise. So, in this subsection we show that the function , as defined above, is independent of the choice of which set provides the parameters for defining .
First we prove a general fact about -categorical MS-measurable structures which is needed in Lemma 4.3.2.
Fact 4.3.1.
Suppose is MS-measurable via and -categorical. Let and . Then there is some such that and . Moreover,
Proof.
Let , , and let . By -categoricity, there are finitely many complete types over , say , that extend . So . By cMS2, . Suppose that this maximum is attained by . Set . So is non-empty. By cMS2, . ∎
Lemma 4.3.2.
Let be closed sets, and let . Let , and let be the complete extensions of over . Let . Then
-
(1)
There is an element such that — i.e. is non-empty.
-
(2)
.
Proof.
For item 1, we may assume that where and for each . Since is closed and , we know that is an infinity-node, say . Let and . Since and is trivial in and , we know that . By Fact 4.3.1, there is an element such that and . Subsequently, by -categoricity of there is an automorphism such that . By N3, there is such that . We choose . Now we verify that . Suppose for each . Then
By definitoin of we can write
For item 2, let be a realization of for each , and let be an automorphism such that . For each , let .
Claim.
For each , if and only if .
Proof.
Suppose . Then
Coversely, suppose for some . Since the correspomdimg summands of the above equation should be the same, . ∎
From this, it follows that . For each and for each , let . By definition of we have
Now, we distribute over the summation, and we note that for and
Since neither nor meet and ,
∎
In order to extend Lemma 4.3.2 to -types, for arbitrary , we need to know that permuting the indices does not matter. In the following proposition we show that is permutation/coordinate invariant. This is used in the proof of Lemma 4.3.9 as well.
Proposition 4.3.3 (Permutation/coordinate invariance).
For all closed subsets , for all , and for all , we have
-
(1)
.
-
(2)
.
Proof.
Since is generated by adjacent transposition, it is enough to show that for any closed set , for any and
Since
and
it is enough to show that for any closed set and any ,
We consider the following cases: and are comparable, and are incomparable and meet at the same point, and are incomparable and meet at different points.
-
case 1.
Suppose . Then we have
So it suffices to show that Let
where for , and let for some , . Then
So we have to show that
For each , if , then
On the other hand, for each , if and only if . So
as we desire.
-
case 2.
Suppose . Let . Then
and
So it is enough to show that
(1) We have
and by replacing them in equation (1) we have
This completes case 2.
-
case 3.
Suppose , and . In this situation we observe that
So we calculate
as we desire.
We can do a similar calculation for as well. ∎
Lemma 4.3.4.
Let be closed sets. Then for every , for every , there is a finite list such that:
-
(1)
and for each .
-
(2)
For any , if and , then for exactly one .
Moreover, given these conditions, we also find that
Proof.
We proceed by induction on . The base case, , follows from Lemma 4.3.2. Inductively, we assume that the lemma has been proven for -tuples and any closed sets . Now, let be closed sets, and let and ; we prove the statement of the lemma for the -tuple . By the induction hypothesis, let be as in the statement of the lemma for , and for each , let be such that .
Now, for each , we apply Lemma 4.3.2 with and with in place of to obtain elements such that
-
•
and for all .
-
•
For any , if and , then for exactly one .
The next claim verifies that works for .
Claim.
-
(1)
and for all and .
-
(2)
For any , if and , then for exactly one pair of numbers and .
Proof.
For item (1), suppose and , then we can write:
Also, since by the induction hypothesis and , .
For item (2), we note that there is such that . So by abuse of notation we may assume that such that , , , and . Since , by definition of we have and . Since and , by the induction hypothesis there is such that . Also by the induction hypothesis, there is such that . Thus . ∎
∎
Proposition 4.3.5.
The function , defined in the proof of Theorem Main Theorem, is well-defined. More precisely, let . Let such that is -definable. Let such that is -definable as well. Let and such that and Let and Then for all
Proof.
Let . It suffices to apply Lemma 4.3.4 to each and . More precisely, let for each , and let for each . By Lemma 4.3.4, for each and each there are and such that , for each , and , for each . Suppose and , then
We have to show that for all . They are equal because they are the maximum values among dimensions of types over as well. We can do a similar calculation for as well. ∎
4.3.3. Verification of
Here we show that the function defined in Subsection 4.3.1 works, that is, is MS-measurable via . By Theorem 4.2.1, we just need to verify that satisfies conditions .
Lemma 4.3.6.
cMS1 holds.
Proof.
It is enough to prove this for complete 1-types over a closed set. Let be closed and . Let . Suppose
such that for each . Suppose
Then by construction of we have
and
On the other hand we have ,
and for each . Let
Since the image of any infinity-node under an automorphism is an infinity-node, . Thus
and
∎
Lemma 4.3.7.
cMS2 and cMS3 hold.
Proof.
This follows from part III of the construction of . ∎
Lemma 4.3.8.
cMS3 holds.
Lemma 4.3.9.
cMS4 holds.
Proof.
Let and . Let . By a simple induction on and using part II of the construction of , we have
and
So, it suffices to show that
We calculate:
and
as desired. ∎
Acknowledgment
The author would like to thank Cameron Hill for all of his support and very helpful guidance. The author also would like to thank Alex Kruckman for his reading of the first draft and for the helpful comments.
References
- [1] Z. Chatzidakis, L. van den Dries, and A. Macintyre. Definable sets over finite fields. Journal für die reine und angewandte Mathematik, 427:107–135, 1992.
- [2] G. Cherlin and E. Hrushovski. Finite Structures with Few Types. Princeton University Press, 2003.
- [3] M. Djordjevic. Finite satisfiability and -categorical structures with trivial dependence. Journal of Symbolic Logic, 71(3):810–830, 2006.
- [4] R. Elwes. Dimension and measure in finite first order structures. PhD thesis, University of Leeds, 2005.
- [5] R. Elwes. Asymptotic classes of finite structures. Journal of Symbolic Logic, 72(2):418–438, 2007.
- [6] C. D. Hill. On 0,1-laws and asymptotics of definable sets in geometric Fraïssé classes. Fundamenta Mathematicae, 239(3):201 – 219, 2017.
- [7] C. D. Hill. Pseudo-finite -categorical structures via coordinatization. preprint, 202X.
- [8] A. Kruckman. Disjoint n-amalgamation and pseudofinite countably categorical theories. Notre Dame J. Formal Log., 60:139–160, 2019.
- [9] D. Macpherson and C. Steinhorn. One-dimensional asymptotic classes of finite structures. Transactions of the American Mathematical Society, 360(1):411–448, January 2008.
- [10] D. Marker. Model Theory: An Introduction, volume 217 of Graduate Texts in Mathematics. Springer, 2002.