Abelian groups definable in -adically closed fields
Abstract
Recall that a group has finitely satisfiable generics (fsg) or definable -generics (dfg) if there is a global type on and a small model such that every left translate of is finitely satisfiable in or definable over , respectively. We show that any abelian group definable in a -adically closed field is an extension of a definably compact fsg definable group by a dfg definable group. We discuss an approach which might prove a similar statement for interpretable abelian groups. In the case where is an abelian group definable in the standard model , we show that , and that is an open subgroup of an algebraic group, up to finite factors. This latter result can be seen as a rough classification of abelian definable groups in .
1 Introduction
In this paper we study abelian groups definable in -adically closed fields. Recall that a definable group has finitely satisfiable generics (fsg) if there is a global type on , finitely satisfiable in a small model, with boundedly many left translates. Similarly, has definable f-generics (dfg) if there is a definable global type on with boundedly many left translates. The main theorem of this paper is the following decomposition of abelian definable groups into dfg and fsg components:
Theorem 1.1.
Suppose that is a -adically closed field and is an abelian group definable in . Then there is a short exact sequence of definable groups
where has dfg and is definably compact and has fsg.
An analogous decomposition for definably amenable groups in o-minimal structures was proved by Conversano and Pillay [CP12, Propositions 4.6–7] (see also [PY16, Fact 1.18]). Pillay and Yao asked whether such a decomposition exists for any definably amenable group in a distal theory [PY16, Question 1.19]; Theorem 1.1 can be seen as evidence towards a positive answer.
When , we obtain two useful consequences from Theorem 1.1:
Theorem 1.2.
Suppose that is an abelian definable group in .
-
1.
.
-
2.
There is a finite index definable subgroup and a finite subgroup such that is isomorphic to an open subgroup of an algebraic group.
This yields a loose “classification” of abelian definable groups in —up to finite factors, they are exactly the open subgroups of algebraic groups.
Acknowledgments.
The first author was supported by the National Natural Science Foundation of China (Grant No. 12101131). The second auothor was supported by the National Social Fund of China (Grant No. 20CZX050). Section 5 was partially based on joint work with Zhentao Zhang, who declined to be an author on this paper.
1.1 Outline
In Section 2, we review some tools needed in the proof. In Section 3 we prove the decomposition in Theorem 1.1. In Section 4 we obtain the consequences for -definable groups listed in Theorem 1.2. In Section 5 we discuss our original strategy for Theorem 1.1, which suggests a generalization of Theorem 1.1 to interpretable groups (Conjecture 5.14).
1.2 Notation and conventions
“Definable” means “definable with parameters.” We write the monster model as . A “type” is a complete type, and a “partial type” is a partial type. Tuples are finite by default. We usually write tuples as rather than . We distinguish between “real” elements or tuples (in ) and “imaginaries” (in ), and we distinguish between “definable” (in ) and “interpretable” (in ). The exception is Appendix B, where we work in . If is a definable set, then denotes its code, a tuple in . If is a definable type, then denotes its code, an infinite tuple in .
Throughout, means the complete theory of , and a “-adically closed field” is a model of this theory, or equivalently, a field elementarily equivalent to . We do not consider “-adically closed fields” in the broader sense (fields elementarily equivalent to finite extensions of ), though we strongly suspect that all the results generalize to these theories. We write the language of as . The language should be one-sorted; otherwise the choice of is irrelevant.
2 Tools
In this section, we review a few tools that will be needed in the proof of the main theorems. In Section 2.1 we show that certain properties (, dfg) behave well in short exact sequences. In Section 2.2 we show that we can take quotients by certain dfg groups without leaving the definable category.
2.1 Extensions
Recall that and exist for definable groups in NIP theories [HPP08, Proposition 6.1].
Lemma 2.1 (Assuming NIP).
Let be a surjective homomorphism of definable groups. Then .
Proof.
There is a surjection , so is bounded and . There is an bijection , so is bounded and . This implies . ∎
Lemma 2.2 (Assuming NIP).
Let be a short exact sequence of definable groups. If and , then .
Proof.
The fact that and means that and are profinite. The short exact sequence
() |
shows that is bounded, and then () is continuous in the logic topology. As is bounded, it must be a quotient of which is profinite. Therefore is profinite. In the category of compact Hausdorff groups, an extension of a profinite group by a profinite group is profinite. Therefore is profinite, which implies . ∎
Recall that has definable Skolem functions.
Lemma 2.3.
Suppose that is a saturated model of . Let
be a short exact sequence of definable groups. Then has dfg iff and do.
Proof.
We prove the following:
-
1.
If has dfg, then has dfg.
-
2.
If has dfg, then has dfg.
-
3.
If and have dfg, then has dfg.
By definable Skolem functions, there is a definable function which is a set-theoretic section of , in the sense that for . Now we proceed with the proofs:
-
1.
If is a definable f-generic type in , then is a definable f-generic type in .
-
2.
The proof is nearly identical to [PY19, Lemmas 2.24, 2.25]. In an elementary extension , take realizing a definable f-generic type in . Write as for some . Then , so is definable. We claim that has boundedly many left translates, and is therefore a definable f-generic type in . Note that because is bounded. If , then , and therefore
But , and so
Therefore is invariant under left translation by any , and it has boundedly many left translates.
-
3.
Let and be dfg types of and respectively. Let be a small model defining the section , the short exact sequence, and all the left translates of and .
In some elementary extension , take and . Then is -definable—it is the Morley product of and . Let . Then is again -definable. We claim that every left translate of is -definable.
Fix some . Let . Let . Let . Note
so . Let . Then
Now is a left-translate of the dfg type , and so is -definable. If is , then is a left translate of the dfg type (because ). Therefore is again -definable. As , we see that is -definable for the same reason that is -definable, essentially because and are -definable. ∎
See Theorem B.6 in the appendix for an alternate proof of (3) not using definable Skolem functions.
2.2 Codes and quotients
Let be a definable group and be a normal subgroup. A priori, the quotient group is interpretable, not definable. In this section, we show that for certain dfg groups , the quotient is automatically definable (Corollary 2.9). The key is to show that certain definable types are coded by real tuples (Theorem 2.7). Both of these results will be proved in greater generality in future work [AGJ22, Theorems 3.4, 4.1].
If is a definable set in a model , let denote “the” code of in , which is well-defined up to interdefinability. If , then
and this property characterizes when is sufficiently saturated and homogeneous.
Lemma 2.4.
Let be a field and be Zariski closed. Then the definable set is coded by a tuple in (rather than ). In particular, finite subsets of are coded by tuples in .
Proof.
Passing to an elementary extension, we may assume is -saturated and strongly -homogeneous. Let . Let be the Zariski closure of in . Note . By elimination of imaginaries in ACF, there is a tuple which codes in the structure . If then fixes setwise, so it also fixes the Zariski closure . Therefore , for any . By Galois theory, is in the perfect closure of . Replacing with if necessary, we may assume is a tuple in .
We claim that codes in the structure . Suppose . Extend to an automorphism arbitrarily. Then codes because
The starred requires some explanation. The direction holds because the formation of Zariski closures is automorphism invariant. The direction holds because fixes setwise and . ∎
Lemma 2.5.
Work in a monster model of .
-
1.
If an imaginary tuple is algebraic over a real tuple , then is definable over .
-
2.
If an imaginary tuple is interalgebraic with a real tuple , then is interdefinable with some real tuple .
More generally, both statements hold if we work over a set of real parameters .
Proof.
-
1.
Note that by definable Skolem functions, and so . Submodels are algebraically closed, so and .
-
2.
By part (1), . Write as for some -definable function . Let be the set of realizations of . Then is finite as . Moreover, is -definable, and so the code is in . By Lemma 2.4, we can take the code to be a real tuple. For any , we have , which implies . Then is interdefinable with the real tuple .
The “more general” statements follow by the same proofs. Indeed, we can name the elements of as constants without losing definable Skolem functions or codes for finite sets. ∎
If is a definable -type over , let denote the infinite tuple , where
For , we have
and this property determines up to interdefinability when is sufficiently saturated and homogeneous.
Lemma 2.6.
If is definable, then is interdefinable with a (finite) real tuple.
Proof.
By [JY22, Proposition 2.24], the type must accumulate at some point in the projective line , because is definably compact. If necessary, we can push forward along the map to ensure . Then . Note . There are only boundedly many types concentrating at by [Joh18, Corollary 7.5] or [JY22, Fact 2.20], so has a small orbit under . Then . As in the proof of Lemma 2.5(1), , so is interdefinable with . ∎
Theorem 2.7.
Suppose is a definable type, and . Then is interdefinable with a real tuple.
Proof.
Take an elementary extension containing a realization of . Then , so there is some such that is a transcendence basis of over , implying that is field-theoretically algebraic over and . Then there is a Zariski-closed set such that there are only finitely many with .
Let be the smallest Zariski-closed set such that , or equivalently, the smallest Zariski-closed set on which concentrates. Any automorphism of which fixes fixes , and so
(1) |
As , there are only finitely many with . Therefore . By Lemma 2.4, we may assume is a real tuple in , and then by Lemma 2.5(1). Therefore and are interdefinable over .
Take a bijection defined over such that . Then is the pushforward of the definable type along the -definable bijection . Therefore
(2) |
Likewise, is the pushforward of along the 0-definable coordinate projection , so
(3) |
Combining equations (1)–(3), we see that is interdefinable with . But is a real tuple by Lemma 2.4 as noted above, and is a real tuple by Lemma 2.6. ∎
Using a different argument, one can show that Theorem 2.7 holds for any definable -type, without the assumption [AGJ22, Theorem 3.4]. However, the real tuple may need to be infinite [AGJ22, Proposition 3.7].
Proposition 2.8.
If a one-dimensional dfg group acts on a definable set , then the quotient space is definable (not just interpretable).
Proof.
Take a global definable type on with boundedly many right translates. Take a small model over which everything is defined, including the boundedly many right translates of . It suffices to show that every element of the interpretable set is interdefinable over with a real tuple. By Lemma 2.5(2), it suffices to show that every element of is interalgebraic over with a real tuple. Fix some element , where . Let denote the pushforward of along the map . Note that the global types and both have dimension 1 (or less). By Theorem 2.7, the code can be taken to be a real tuple. We claim that is interalgebraic with over .
In one direction, is contained in the collection
which is -invariant by the first line, and small by the second line. It follows that has a small number of conjugates over , and so .
In the other direction, the type concentrates on , so its pushforward along the -definable map is the constant type . Therefore . This completes the proof that is interalgebraic with over . ∎
Again, this holds without the assumption . See [AGJ22, Theorem 4.1].
Corollary 2.9.
Let be a definable group and be a 1-dimensional definable normal subgroup. If has dfg, then is definable and .
3 Proof of Theorem 1.1
Work in a model .
Theorem 3.1.
Let be a -adically closed field and be a definable abelian group in . Then there is a definable short exact sequence
such that has dfg, has fsg, and is definably compact.
Proof.
For definable groups, fsg is equivalent to definable compactness [Joh21, Theorem 1.2]. Say a subgroup is “good” if is definable and has dfg. For example, is good. Take a good subgroup maximizing . If is definably compact then we are done. Otherwise, is not definably compact. By [JY22, Corollary 6.11], there is a 1-dimensional definable dfg subgroup of . This subgroup has the form for some definable subgroup of . The short exact sequence
shows that has dfg by Lemma 2.3, and that
The quotient is definable by Corollary 2.9, and so is a good subgroup, contradicting the choice of . ∎
4 Abelian groups over
Fact 4.1.
Let be a definably amenable group definable over . There is an algebraic group over and a definable finite-to-one group homomorphism from to .
Theorem 4.2.
If is an abelian group definable over , then .
Proof.
Corollary 4.3.
If is an abelian group definable in , then there is a finite index definable subgroup and finite subgroup such that is isomorphic to an open subgroup of an algebraic group over .
Proof.
By Theorem 4.2, . By Fact 4.1, there is an algebraic group and a finite-to-one definable homomorphism . By compactness there is a finite-index subgroup such that extends to a finite-to-one definable homomorphism . Replacing with the Zariski closure of the image of , we may assume the image is an open subgroup of . ∎
5 Interpretable groups
In this section, we discuss our original approach to Theorem 3.1, which yielded a weaker result, only giving an interpretable group. However, this approach is more general in one way—one can start with an interpretable group. Unfortunately, in the interpretable case we don’t know how to prove the termination of the recursive process implicit in the proof of Theorem 3.1.
Proposition 5.1.
Let be an abelian definable group, let be a definable subgroup, and let be the interpretable quotient group. Consider the canonical definable manifold topology on , and the quotient topology on .
-
1.
The quotient map is an open map.
-
2.
The quotient topology on is definable.
-
3.
The quotient topology on is a group topology.
-
4.
The quotient topology on is Hausdorff.
Proof.
-
1.
If is open, then which is open. By definition of the quotient topology, is open.
-
2.
If is a definable basis of opens on , then is a definable basis of opens on , because is an open map.
-
3.
We claim is continuous on . Fix . Let be an open neighborhood of . Take lifting and . Then , which is open. By continuity of the group operations on , there are open neighborhoods and such that . Because is an open map, and are open neighborhoods of and , respectively. If and , then , because we can write for , and then . This proves continuity of at .
-
4.
Because the quotient topology is a group topology, it suffices to show that is closed. By definition of the quotient topology, it suffices to show that is closed in . On definable manifolds, the frontier of a set is lower-dimensional than the set itself [CKDL17, Theorem 3.5]:
But is a union of cosets of , and each coset has dimension . Therefore must be empty, and is closed. ∎
Definition 5.2.
A manifold-dominated group is an interpretable group with a Hausdorff definable group topology such that there is a definable manifold and an interpretable surjective continuous open map .
In the setting of Proposition 5.1, is manifold dominated via the map .
Remark 5.3.
If is any interpretable group, then there is a definable group topology on making be manifold-dominated [Joh22, Theorem 5.10]. Moreover, is uniquely determined, though the manifold is not. This motivates working in the more general context of manifold-dominated abelian groups, rather than the special case of quotient groups .
Theorem 5.4.
Let be a manifold-dominated interpretable abelian group. Suppose is not definably compact. Then there is an interpretable subgroup with the following properties:
-
1.
is not definably compact.
-
2.
.
-
3.
has dfg.
Theorem 5.4 is an analogue of [JY22, Theorem 6.8, Corollary 6.11], and the proof is similar. Nevertheless, we sketch the proof for completeness.
For the rest of the section, work in a monster model . Fix a definable manifold , an interpretable abelian group with a Hausdorff definable group topology, and an interpretable continuous surjective open map . Also fix a small model over which everything is defined.
Definition 5.5.
If is an interpretable topological space (in ) and , then a good neighborhood basis of is an interpretable family with the following properties:
-
1.
is a neighborhood basis of .
-
2.
.
-
3.
Each set is clopen and definably compact.
-
4.
.
This is more general than the definition in [JY22, Definition 2.27], since we are considering topological spaces rather than topological groups. The definition here is slightly weaker, since we do not require when is a group.
Fix some element lifting . By the proof of [JY22, Proposition 2.28], there is a good neighborhood basis of in . Let . Then is a good neighborhood basis of in . The analogue of [JY22, Proposition 2.29] holds, via the same proof:
-
1.
For any , there is such that .
-
2.
For any , there is such that .
Say that a set , not necessarily interpretable, is bounded if for some . As in [JY22, Proposition 2.10], is bounded if and only if is contained in a definably compact subset of . If , let denote the set
as in [JY22, §4.1]. Let mean .
Lemma 5.6.
Let be an unbounded interpretable set. Let be bounded, but not necessarily interpretable. Then there is such that is bounded.
Proof.
The proofs of Lemmas 4.9, 4.10, 4.11 in [JY22] work here, after making a couple trivial changes. The interpretable group has finite dp-rank because . ∎
Recall our assumption that is -interpretable for some small model . Fix -saturated with . If is a definable type or definable partial type over , then denotes its canonical extension over . (See [PS17, Definition 2.12] for definability of partial types. When is complete, is the heir of .)
Lemma 5.7.
There is a 1-dimensional definable type whose pushforward has the following properties:
-
1.
is “unbounded” over , in the sense that does not concentrate on any -interpretable bounded set, or equivalently, does not concentrate on for any .
-
2.
Similarly, the heir is unbounded over .
-
3.
If realizes and for any , then realizes .
Proof.
Take with . In other words, is infinitesimally close to 0 over . Then is definable. Let . As is not definably compact, . The set is a non-empty -definable subset of . By definable Skolem functions, there is with . Then for some -definable function . Let . Then , so is definable. Let and let . By choice of , , which implies for any . Thus is unbounded over . As is the heir, it is similarly unbounded over .
Finally, suppose that satisfies the assumptions of (3). Then , so there is with . Let . Then , and in particular realizes and . Recall the sets used to define . If for some , then , contradicting the assumptions. Therefore, for any . By [JY22, Lemma 2.25], realizes . Then realizes . ∎
Fix as in Lemma 5.7. Fix realizing and let . Then realizes .
We will make use of the notation and facts from [JY22, §5], applied to the group and the definable type . In particular, is the infinitesimal partial type of over , is the infinitesimal partial type of over , and is the standard part map, a partial map from to . The domain of is the subgroup of points in infinitesimally close to points in . If , then denotes the image of under .
The following lemma takes the place of [JY22, Fact 6.3].
Lemma 5.8.
Suppose is -interpretable.
-
1.
The set is interpretable (in the structure )
-
2.
.
See Remark A.1 for the definition of ict pattern and dp-rank.
Proof.
-
1.
Fix some interpretable basis of opens for . Let be the collection of -interpretable basic open sets which intersect . Then is interpretable in the structure , because is defined externally using , but is definable. Now if , the following are equivalent:
-
(a)
.
-
(b)
There is such that for every -interpretable basic open neighborhood , we have .
-
(c)
For every -interpretable basic open neighborhood , there is such that .
-
(d)
Every -interpretable basic open neighborhood of is in .
Indeed, (a)(b) by definition, (b)(c) by saturation of , and (c)(d) by definition of . Condition (d) is definable because is.
-
(a)
-
2.
Let be the dp-rank of the interpretable set . It is finite, bounded by . There is an ict-pattern of depth in . That is, there are are uniformly interpretable sets for and , and points for , such that . By Theorem A.6 in the appendix, we can also ensure that is open and . As is -saturated, we can arrange for all the data to be -interpretable. Then each is for some . Since is open and -interpretable, we have for . Since is closed and -interpretable, we have for . Then the sets and elements are an ict-pattern of depth in , showing . ∎
Lemma 5.9.
The following subsets of are equal:
-
1.
.
-
2.
.
-
3.
-
4.
-
5.
.
See [JY22, Definition 5.3] for the definition of .
Proof.
Lemma 5.10.
If is -interpretable and contains , then is unbounded in .
Proof.
If not, take such that . By Lemma 5.7(2), is not in any -interpretable bounded sets. Therefore is unbounded. By Lemma 5.6, we can find such that is bounded. Then . This means that
Therefore there is such that . Then there is with . The conditions on and are definable over (where is the realization of ). By definable Skolem functions, we can assume . Then is a pushforward of , so is a 1-dimensional definable type on . This type concentrates on the definably compact set , and therefore specializes to some point by [JY22, Lemma 2.23]. As the map is continuous, specializes to . Thus exists and equals . Since is closed, . But , and
a contradiction. ∎
We can now complete the proof of Theorem 5.4. By Lemma 5.9,
() |
The groups are -interpretable because is a -definable partial type. The sets are interpretable by Lemma 5.8(1). Both intersections involve at most terms, and both intersections are filtered.
If some is bounded, then by -saturation of we have for some , contradicting Lemma 5.10. Therefore, every group is unbounded. Consequently, no is definably compact.
Since has dimension 1, there is some -definable set of dimension 1. Then . If defines , then , and has dp-rank at most 1 by Lemma 5.8(2). By -saturation, () gives some such that . Then has dp-rank at most 1. On the other hand, is infinite, since it is not definably compact. Therefore has dp-rank at least 1.
It remains to show that the interpretable subgroup has dfg. The proof of [JY22, Lemma 6.10] works with minor changes. For completeness, we give the details. For abelian groups of dp-rank 1, “not fsg” implies dfg as in the proof of [PY19, Lemma 2.9]. It suffices to show that does not have fsg. Assume for the sake of contradiction that has fsg. By [HPP08, Proposition 4.2], non-generic sets form an ideal, and there is a small model such that every generic set contains an -point. Take large enough that contains every point in . Then is not generic in , so is generic, meaning that finitely many translates of cover . But and its translates are bounded (as subsets of ), so then is bounded, a contradiction. This completes the proof of Theorem 5.4.
Corollary 5.11.
Let be an abelian interpretable group. Then there is and an increasing chain of dfg subgroups with such that the quotients have dp-rank 1. In the case when , the quotient is definably compact and has fsg.
Proof.
Any interpretable group is manifold-dominated [Joh22, Theorem 5.10], so we can apply Theorem 5.4 to any interpretable group. The first application gives ; applying the theorem to gives , and so on. The process terminates if any quotient is definably compact. Definably compact groups have fsg [Joh22, Theorem 7.1]. To prove that the groups have dfg, we can no longer use Lemma 2.3, as lacks definable Skolem functions. But Theorem B.6 in the appendix works. ∎
Remark 5.12.
Remark 5.13.
Conjecture 5.14.
In Corollary 5.11, is finite. Therefore, any abelian interpretable group sits in a short exact sequence where has dfg and has fsg and is definably compact.
Appendix A Nice ict patterns
Remark A.1.
Following [Sim15, Definition 4.21], an ict-pattern of depth in a partial type is a sequence of formulas and an array with such that for any function , the following partial type is consistent:
Abusing notation, we say that is an ict-pattern to mean that the pair is an ict-pattern. Sometimes we consider ict-patterns where the columns are indexed by an infinite linear order other than . The definition is analogous, and ict-patterns of this sort can be converted to ict-patterns indexed by via a compactness argument.
Finally, the dp-rank of is the supremum of cardinals such that there is an ict-pattern of depth in , possibly in an elementary extension.
Work in for some monster model . There is a well-behaved notion of dimension on [Gag05], which gives rise to a notion of independence:
This notion satisfies many of the usual properties [Joh22, §2.1].111The one unusual property is that “” is strictly weaker than “”. Say that a sequence is dimensionally independent over a set if for , where . As usual, this is independent of the order on .
Lemma A.2.
If is finitely satisfiable in , then .
Proof.
Suppose not. Let . By [Gag05, Proposition 3.7], there is a -interpretable set containing with . Write as for some -formula . By [Joh22, Proposition 2.12], the set is definable, defined by some -formula . Then . As is finitely satisfiable in , there is some such that . Then is in the -interpretable set which has dimension as . Therefore , a contradiction. ∎
Corollary A.3.
Suppose is -indiscernible. Then the sequence is dimensionally independent over .
Proof.
For example, is finitely satisfiable in ; any formula in is satisfied by for . This argument shows that any finite subsequence of is dimensionally independent over . This implies the full sequence is dimensionally independent, by finite character of . ∎
Lemma A.4.
If is dimensionally independent over , and , then for all but at most values of .
The proof is standard, but we include it for completeness.
Proof.
Otherwise, passing to a subsequence, we could arrange for to be dimensionally independent over , but for each . The sequence cannot decrease times, so there is some such that , i.e.,
As , left transitivity gives , a contradiction. ∎
Lemma A.5.
Let be a -interpretable set of parameters, with dp-rank . Then there is and an ict pattern of depth in of the form , such that the array is mutually -indiscernible, and for each , the sequence is dimensionally independent over .
Proof.
Let denote two copies of laid end to end, with the second copy denoted . Take an ict pattern in . Let be a mutually -indiscernible array extracted from . Then is an ict pattern in . Let . Then is mutually -indiscernible, and each row is dimensionally independent over by Corollary A.3. ∎
Theorem A.6.
Let be a manifold-dominated interpretable group of dp-rank . There is an ict-pattern in such that if , then the following properties hold:
-
1.
Each set is open.
-
2.
For each function , there is an element such that
Proof.
By [Joh22, Theorem 5.10], the topology on is “admissible”, and so
(Small boundaries property) |
for any interpretable subset , by [Joh22, Proposition 4.34]. By Lemma A.5, there is an ict-pattern and a set of parameters (over which is interpretable) such that the are mutually indiscernible over , and each row is dimensionally independent over . Take some such that for all and . By [Gag05, Proposition 3.7] there is a formula in such that . Replacing with and replacing with , we may assume that . Let . Then by indiscernibility.
For each , we have for all but finitely many , by Lemma A.4. Throwing away the finitely many bad values of in each row, we may assume for all . Thus for . By the Small Boundaries Property,
for . Then cannot be in the -interpretable set . By choice of , we also have . So for any . Thus
By mutual indiscernibility, we can find for any such that
Recall that the topology on is a group topology, so every open neighborhood of has the form for some open neighborhood of . For each with , we can find an open neighborhood such that . By saturation, there is an interpretable open neighborhood with for all . Because the topology is a group topology, there is a smaller interpretable open neighborhood such that and .
Let . Note that is open. If , then
The fact that implies that
The neighborhood then shows that . On the other hand, , so . Therefore, if , then . Putting everything together, we get
The sets are uniformly interpretable, so we can find some formula such that each has the form for some (not the original ones). Then is the desired ict pattern. ∎
Appendix B Extensions and dfg
Work in a highly resplendent monster model . always means . All sets and parameters can come from by default. “Definable” means “interpretable.”
Definition B.1.
A definable set is almost -definable if it is -definable, or equivalently, is finite. A global definable type is almost -definable if it is -definable, or equivalently, is small.
The following is folklore; see [Joh20, Lemma 3.13] for a proof.
Fact B.2.
Suppose realizes for some almost -definable global type . Suppose realizes for some almost -definable global type . Then realizes for some almost -definable global type .
Definition B.3.
Let be an -definable group. Say that has dfg over if there is a global definable type on such that and all its left-translates are almost -definable.
Lemma B.4.
Let be a definable dfg group and be a definable set with a regular right action of . Suppose everything is -definable, and has dfg over . Then there is a global type on that is almost -definable.
Proof.
For , let denote the pushforward of the -definable type along the map from to . Note that is a definable type on .
The set is small, because it is for any fixed . If , then fixes and fixes setwise, since was defined in an invariant way. Therefore any has small orbit under , implying that is almost -definable. ∎
If is a -definable group, let be the new structure obtained by adding a copy of as a new sort , and putting no structure on other than the regular right action of . For any , there is an automorphism of fixing and acting as left translation by on the new sort . In fact, .
This construction is called “Construction ” in [HP11, §1], where it is attributed to Hrushovski’s thesis. It also appears in [Sim15] above Lemma 8.19. As mentioned in [Sim15], is a conservative extension of , in the sense that it introduces no new -definable or definable sets on . After naming the element , the two structures are bi-interpretable. Since we assumed was very resplendent, will be too.
Lemma B.5.
Let be a small set of parameters. Suppose that in , there is a global type on that is almost -definable. Then has dfg over .
Proof.
For , let denote the unique such that . Let denote the pushforward of along the map from to . Then is a definable type on . If , we can extend to fixing . Then
There are only a small number of possibilities for , and so is almost -definable.
If , then for , and so
for . Replacing with in the argument above, we see that is almost -definable. In other words, every translate of is almost -definable, showing has dfg over . ∎
Lemmas B.4 and B.5 are formally analogous to [Sim15, Lemma 8.19], replacing “non-forking over ” with “almost -definable.”
Theorem B.6.
If is a short exact sequence of definable groups, and have dfg, then has dfg.
Proof.
Naming parameters, we may assume the whole sequence is -definable, and that and have dfg over . Construct . Let be the new sort with a regular right action of . Let be the quotient . Then has a regular right action by . By Lemma B.4, there is an almost -definable global type on . Take realizing . Let be the fiber of over . Then is a -definable set with a -definable regular right action by . By Lemma B.4, there is an almost -definable global type on . Let realize . Note . By Fact B.2, there is an almost -definable global type on such that realizes . By Lemma B.5, has dfg. ∎
References
- [AGJ22] Pablo Andújar Guerrero and Will Johnson. Around definable types in -adically closed fields. arXiv:2208.05815v1 [math.LO], 2022.
- [CKDL17] Pablo Cubides-Kovacsics, Luck Darnière, and Eva Leenknegt. Topological cell decomposition and dimension theory in -minimal fields. Journal of Symbolic Logic, 82(1):347–358, 2017.
- [CP12] Annalisa Conversano and Anand Pillay. Connected components of definable groups and -minimality I. Advances in Mathematics, 231:605–623, 2012.
- [Gag05] Jerry Gagelman. Stability in geometric theories. Annals of Pure and Applied Logic, 132:313–326, 2005.
- [HP11] Ehud Hrushovski and Anand Pillay. On NIP and invariant measures. J. Eur. Math. Soc., 13(4):1005–1061, 2011.
- [HPP08] Ehud Hrushovski, Ya’acov Peterzil, and Anand Pillay. Groups, measures, and the NIP. J. Amer. Math. Soc., 21(2):563–596, April 2008.
- [Joh18] Will Johnson. The canonical topology on dp-minimal fields. J. Math. Logic, 18(2):1850007, 2018.
- [Joh20] Will Johnson. On the proof of elimination of imaginaries in algebraically closed valued fields. Notre Dame Journal of Formal Logic, 61(3):363 – 381, 2020.
- [Joh21] Will Johnson. A note on fsg groups in -adically closed fields. arXiv:2108.06092v1 [math.LO], 2021.
- [Joh22] Will Johnson. Topologizing interpretable groups in -adically closed fields. arXiv:2205.00749v1 [math.LO], 2022.
- [JY22] Will Johnson and Ningyuan Yao. On non-compact -adic definable groups. J. Symbolic Logic, 87(1):188–213, 2022.
- [MOS20] Samaria Montenegro, Alf Onshuus, and Pierre Simon. Stabilizers, NTP2, groups with f-generics, and PRC fields. J. Inst. Math. Jussieu, 19(3):821–853, 2020.
- [OP08] A. Onshuus and A. Pillay. Definable groups and compact -adic Lie groups. Journal of the London Mathematical Society, 78(1):233–247, 2008.
- [PS17] Y. Peterzil and S. Starchenko. Topological groups, -types and their stabilizers. J. European Math. Soc., 19(10):2965–2995, 2017.
- [PY16] Anand Pillay and Ningyuan Yao. On minimal flows, definably amenable groups, and o-minimality. Adv. in Mathematics, 290:483–502, February 2016.
- [PY19] Anand Pillay and Ningyuan Yao. Definable -generic groups over -adic numbers. arXiv:1911.01833v1 [math.LO], 2019.
- [Sim15] Pierre Simon. A guide to NIP theories. Lecture Notes in Logic. Cambridge University Press, July 2015.