
TL;DR
This paper provides an accessible overview of PAC structures, summarizing key concepts and recent developments discussed during the RIMS Model Theory Workshop 2018.
Contribution
It offers a clear exposition of PAC structures, highlighting their significance and recent research directions in model theory.
Findings
Summarizes recent advances in PAC structures
Clarifies the role of PAC structures in model theory
Provides insights from the 2018 RIMS workshop
Abstract
An expository paper written down after RIMS Model Theory Workshop 2018. To appear in RIMS Kokyuroku.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsHomotopy and Cohomology in Algebraic Topology · Algebraic Geometry and Number Theory · Geometric and Algebraic Topology
PAC structures in nutshell
Daniel Max Hoffmann*†*
*†*Instytut Matematyki
Uniwersytet Warszawski
Warszawa
Poland
*†*SDG. The author is supported by the Narodowe Centrum Nauki grants no. 2016/21/N/ST1/01465, and 2015/19/B/ST1/01150.
Instytut Matematyki, Uniwersytet Warszawski
1. Introduction
This is an overwiev of recent results about pseudo-algebraically closed substructures (PAC substructures) of some stable ambient structure. Our aim is a compact presentation of the main results from [16], [15], [11] and [18], so a reader interested in studying PAC substructures might quickly get into the subject. The content of the text covers all topics from our talk at the RIMS Model Theory Workshop 2018 and the arrangement of the text is based on the order of the mentioned talk.
We fix some stable theory in a language , such that has quantifier elimination and elimination of imaginaries, then we choose a monster model of , say , and a group .
We are interested in providing new examples of structures which may serve in the studies on neo-stability. So the general rule for our approach is to start with a stable structure and then “break” the stability in a controlled manner. It turns out that PAC substructures suit perfectly for our purposes, since they are controlled by absolute Galois groups. In other words, we want to “break” stability and obtain PAC substructures with understandable absolute Galois groups.
We thank organizers of the RIMS Model Theory Workshop 2018 - especially, we are grateful to Hirotaka Kikyo for his support and kindness.
2. Pseudo-algebraically closed structures
2.1. Definitions
In the theory of fields an extension of fields is regular if it is separable and is relatively algebraically closed in (). There is no reasonable generalization of the notion of separability for abstract structures, therefore, if we want to introduce a general notion of regularity, we need to restrict our considerations to some subclass of substructures of . If the field is perfect (i.e. definably closed in some monster model of ACF), then is separable. Passing to definable closure seems to be a solution:
Definition 2.1**.**
Let be small subsets of . We say that is regular if
[TABLE]
The above notion of regularity coincides with the notion of stationarity given in [21, Definition 5.17] and in [20]:
Fact 2.2** (Lemma 3.35 in [16]).**
For a small set and a complete type over it follows: {IEEEeqnarray}rCl p is stationary &⇔ (*∀A⊧p)(E⊆*EA is regular)
⇔ (*∃A⊧p)(E⊆EA is regular).
Note that regularity is invariant under the action of automorphisms, every extension of an algebraically closed subset is regular, and regularity is transitive (if and are regular, then also is regular). By Lemma 3.3 in [16], if is an existentially closed substructure of (where and are small substructures of ), then is regular, so regular extensions are related to existential closedness. A substructure is existentially closed if it is existentially closed in all extensions (i.e. all small extensions living inside ). Quite interesting notion occurs, if we relax conditions in this definition by requiring existential closedness only in regular extensions:
Definition 2.3**.**
Assume that . Let be a substructure of . We say that is pseudo-algebraically closed (PAC) in if for every small (in the sense of ) substructure of , which is a regular extension of , it follows that is existentially closed in . If we say “PAC substructure” instead of “PAC substructure in ”.
Note that PAC substructures are definably closed (so PAC substructures in the case of fields coincide with perfect PAC fields). For some reasons it will be better to call PAC substructures “regularly closed substructures” (e.g. it may happen that algebraically closed substructure is not pseudo-algebraically closed), but we introduced this definition as an analogon of the well known (in field theory) notion of PAC fields. A field is pseudo-algebraically closed (is a PAC field) if each non-empty absolutely irreducible -variety has a -rational point. It might be difficult to generalize such a definition of PAC fields, but luckily for us there is a theorem saying that PAC fields are exactly these fields which are existentially closed in every regular extension (Proposition 11.3.5 in [14]). Hence “regularly closed substructures” are called “PAC substructures”. Introducing PAC substructures (called also PAC structures) was motivated by key role of PAC fields in the research of field theory in the second half of the 20th century. In short, they were “discovered” in [1] and [2] as a generalization of pseudofinite fields, but the name “PAC fields” was given in [13]. Reader interested in results about PAC fields may consult: [6], [7]), [8], [9], [10], [12]. The most important property of PAC fields - so-called “Elementarily Equivalence Theorem” (Theorem 20.3.3 in [14], Proposition 33 in [9]) - implies that, to a large extent, logical properties of PAC fields are controlled by their absolute Galois groups. A desired generalization - “Elementarily Equivalence Theorem for Structures” - will be provided in an upcoming subsection (two PAC substructures have the same first order theory if they have isomorphic Galois groups), but before this let us discuss basic properties of PAC structures.
In our approach, we define PAC substructures as a generalization of existentially closed substructures. However, we are not first in studying PAC substructures. Studying PAC substructures has begun (to our knowledge) in [19], where the author attempted to develop “geometric simplicity theory” by developing an analogon of model theory of bounded PAC fields (which are simple) in the context of strongly minimal ambient model (in our case the ambient model is stable). He defined PAC substructures in the following way:
Definition 2.4** (Definition 1.2 in [19]).**
Let be strongly minimal and has quantifier elimination and elimination of imaginaries. Let satisfy the definable multiplicity property (consult “Framework” at page 8. in [19]). A subset of is a PAC subset of , if every multiplicity formula with parameters from has a solution in .
By Proposition 3.10 in [16], both notions of a PAC substructure (Definitions 2.3 and 2.4) coincide in the strongly minimal context. Many important facts about PAC structures are provided in [31] and in [32]. Authors of [31] and [32] work with a stronger notion of a PAC substructure (in the stable context):
Definition 2.5** (Definition 3.1 in [31]).**
Let be stable, a cardinal, , and let be an -substructure of . We say that is a -PAC substructure of if whenever has cardinality smaller than and is complete stationary type over (in the sense of ), then has a realization in .
This definition of a PAC substructure assumes some saturation, which - as we will see soon - is crucial if we want to avoid serious obstructions (e.g. in the Elementary Equivalence Theorem for Structures). For the reader convenience we visualize relations between all three definitions. In the set-up of a strongly minimal theory:
[TABLE]
In the set-up of a stable theory:
[TABLE]
It was mentioned that working with somehow saturated PAC structures might be more convenient. Nevertheless, passing to an elementary extension which is PAC substructure is not “free of charge”:
Lemma 2.6** (Lemma 2.12 in [11]).**
Suppose PAC is a first order property and pure saturation over is a first order property. Let be PAC in . Let be an infinite cardinal. Then, there is a -saturated elementary extension of , which is PAC in .
Where the missing notions are defined as follows:
Definition 2.7**.**
Assume that and is a substructure of .
- (1)
We say that is purely saturated over if every type over is realized in . 2. (2)
We say that PAC is a first order property if there exists a set of -formulas such that
[TABLE] 3. (3)
We say that pure saturation over is a first order property if there exists a set of -formulas such that
- (i)
if is purely saturated over , then , 2. (ii)
if and is -saturated, then is purely saturated over .
If has no finite cover property (an assumption stronger than stability, see Definition 4.1 and Theorem 4.2 in Chapter II of [34]), then pure saturation over is a first order property (see Remark 2.10 in [11] or Remark 3.6 in [31]). Therefore our impression is that it might be very hard to pass to a saturated elementary extension which remains PAC (which is not the case for existentially closed substructures) and so results for non-saturated PAC substructures are desired, even if they require more complicated techniques. Some of results require a weaker variant of saturation which we introduce right now.
For a small substructure of , let us define {IEEEeqnarray*}rCl ST(P,κ,λ) &:= {qftp(¯d/A) — A⊆P, —A—¡κ,
P⊆dcl(P,¯d) is regular and —¯d—¡λ}.
If is PAC, then each element of is a partial type in the sense of . We say that is -regularly saturated if every element of is realized in . We use “-regularly saturated” for “-regularly saturated” (see Definition 3.2 in [11]). If is PAC and -saturated (in the sense of ), then is -saturated.
On the other hand passing to elementary substructure preserves being PAC (by Fact 2.4 and Fact 2.6 in [11]).
2.2. A bite of Galois theory
First of all, let us clarify what do we understand by Galois extension.
Definition 2.8**.**
- (1)
Assume that are substructures of . We say that is normal over (or we say that is a normal extension) if . (Note that if is small and is normal, then it must be .) 2. (2)
Assume that are small substructures of such that , and is normal over . In this situation we say that is a Galois extension.
If is a Galois extension, then is a profinite group. Many facts from classical Galois theory have their counterparts in the model-theoretic variant of Galois theory. Some of these generalization might be found in [29], in Section 3. in [16] or in [15]. To convince the reader that a lot of the classical Galois theory generalizes quite straightforward, let us provide some highlights.
Fact 2.9** (The Galois correspondence).**
Let be a Galois extension, introduce
[TABLE]
[TABLE]
Then is a mapping between and , is a mapping between and and it follows
[TABLE]
Lemma 2.10** (Lemma 2.10 in [15]).**
Assume that is a small definably closed substructure of equipped with a -action ( is smaller than the saturation of ). Let be given by .
- (1)
If for every the orbit is definable, then is normal. 2. (2)
If , then is a Galois extension. 3. (3)
If is finite, then , hence also the second point follows. 4. (4)
(Artin’s theorem) If is finite and the -action is faithful, then . 5. (5)
Assume that is profinite, the -action is faithful and for every the stabiliser is an open subgroup of . Then is Galois and (as profinite groups).
Absolute Galois groups and Galois groups of extensions play a major role in our description of PAC substructures of : {IEEEeqnarray*}rCl G(A):=Aut(acl(A)/dcl(A)) & (the absolute Galois group of )
G(B/A):=Aut(dcl(B)/dcl(A)) (the Galois group of extension )
For example, is regular extension if and only if the restriction map is onto. Moreover, one may find interesting that all profinite groups occur in our stable theory as Galois groups of some Galois extensions:
Fact 2.11** (Corollary 3.3 in [15]).**
A group is profinite if and only if there exist a Galois extension of small substructures of such that .
An important property of the absolute Galois group of a PAC substructure is projectivity, which was known in the strongly minimal context (Lemma 1.17 in [19]) and then generalized to the stable context (Theorem 4.4 in [15]):
Theorem 2.12** (Theorem 4.4 in [15]).**
If a small is PAC, then is projective.
A natural question is whether any projective profinite group occurs as the absolute Galois group of some PAC substructure. The following result puts some light on this problem.
Theorem 2.13**.**
Assume that is a Galois extension of small substructures of and assume that there is an epimorhism of profinite groups , and is projective. there exists a definably closed substructure of and an isomorphism of profinite groups such that
[TABLE]
is commuting. Moreover, if any type over has only finitely many extensions over , then is PAC.
For example, if is -stable, then a profinite group is projective if and only if is isomorphic to the absolute Galois group of some PAC substructure of (see Corollary 4.10 in [15]). How about the same for any stable ? We do not know it due to the use of a generalization of the Ax-Roquette theorem in the proof of Theorem 2.13. There are problems with generalizing the Ax-Roquette theorem (algebraic extension of a PAC field is a PAC field), more precisely: there is an example of a stable theory where algebraic closure of a PAC substructure is not a PAC substructure (see Section 5. in [31]). The best (to our knowledge) generalization of the Ax-Roquette theorem was provided in Proposition 3.9 in [31]:
Proposition 2.14**.**
Suppose is -PAC substructure of .
- i)
Any finite algebraic extension of is also a -PAC* substructure of .* 2. ii)
Suppose that in every (finitary) complete type over any set has finite multiplicity. Then any algebraic extension of is -PAC.
In Lemma 4.5 in [15], the above proposition was formulated for PAC substructures: if is a PAC substructure and any type over has only finitely many (non-forking) extensions over , then any algebraic extension of is a PAC substructure. Actually, formulation of Lemma 4.5 in [15], which is rather complicated, gives us also that any finite Galois extension of a PAC substructure (“finite” means that the Galois group of this extension is finite) is a PAC substructure (to show this you may use “Primitive Element Theorem”, Theorem 5.3 in [11]).
2.3. Elementarily Equivalence Theorem
The idea that the theory of a PAC substructure might be controlled by its absolute Galois group comes from the theory of PAC fields (see works of Fried, Jarden and Kiehne). However, some results for PAC substructures were obtained even without generalizing the Embedding Lemma (Lemma 2.1 in [22]) or Elementarily Equivalence Theorem (Theorem 3.2 in [22]). For example, in [32], it was shown that PAC substructures with small absolute Galois group (i.e. bounded PAC substructures) are simple (Corollary 3.22 in [32]). This result was obtained under assumption that “PAC is a first order property”, which seems to be natural assumption in studying PAC substructures.
The Embedding Lemma was crucial in the proof of the Elementarily Equivalence Theorem for PAC fields and its generalized form (Lemma 3.5 in [11]) plays important role in the proof of the Elementarily Equivalence Theorem for PAC substructures (Proposition 3.8 in [11]). Moreover, the generalized Embedding Lemma might be used in a description of types in PAC substructures and is used in the proof of the upcoming Weak Indpendence Theorem ([18]). Since the generalized Embedding Lemma is involved in several techniques, we provide it here in the most general formulation.
Lemma 2.15** (Embedding Lemma, Lemma 3.5 in [11]).**
Assume that
- •
, , , are small Galois extensions in ,
- •
, , ,
- •
* is regular,*
- •
* is -regularly saturated, where ,*
- •
* is PAC in ,*
- •
* is such that and ,*
- •
* is a continuous group homomorphism such that*
[TABLE]
where for each , commutes.
Then there exists such that
- •
,
- •
, ,
- •
* for any .*
Moreover, if is onto and , then is regular.
On the other hand, we provide here only a consequence, which has rather simple and elegant formulation, from the Elementarily Equivalence Theorem for PAC substructures (Proposition 3.8 in [11]).
Theorem 2.16** (Elementarily Equivalence Theorem, Corollary 3.9 in [11]).**
If and are -regularly saturated PAC substructures of (), and for some definably closed of size strictly smaller than there exists a continuous isomorphism such that
[TABLE]
is commuting, then .
It is remarkable that there is no (to our knowledge) easy way to relax the assumption about saturation in the above Theorem 2.16. We can assume that “PAC is a first order property” and “pure saturation over is a first order property” and then try to pass to saturated elementary extensions of our given PAC substructures and . The problem in this approach is that the isomorphism of profinite groups and does not carry enough data about “model-theoretic” structure of and , and therefore there are serious problems in lifting up to the level of saturated elementary extensions of and . The issue shows up if we consider many sorted structures:
Example 2.17**.**
Consider two sorted structure , where is the field of complex numbers and there is no interaction between sorts. Note that , but
[TABLE]
We may even pass to to get elimination of imaginaries, and then do the Morleyisation, to obtain quantifier elimination, but absolute Galois groups will remain isomorphic despite substructures do not share the same first order theory.
Clearly, the above example is based on fact that the isomorphism between absolute Galois groups is “mixing” sorts. To avoid such phenomena, the notion of sorted isomorphism is introduced (in [11]) and developed into notion of sorted profinite groups (in [18]), which form a category. In short: sorted structure on codes on which sorts live primitive elements of finite Galois extensions of . Sorted profinite groups can be presented as first order structures in some abstract many sorted language, so called (sorted) compelete systems, and, what is more surprising, interpreted in (structure considered with a predicate for set ). The reader interested in more details may find them in [18] (which will be published on arxive soon).
The Elemetarily Equivalence Theorem for non-saturated PAC structures, Theorem 5.8 in [11], assumes “PAC is a first order property” and “pure saturation over is a first order property”, and requires that isomorphism between and preserves sorts. So the price for relaxing the assumption about saturation (in Thereom 2.16) is high and to avoid paying it, in the following text, we will focus mostly on saturated PAC substructures.
2.4. Weak Independence Theorem
This subsection is only to mention some ideas and describe results without precise formulation of them. Elementarily Equivalence Theorem characterizes the first order theory of a PAC substructure/field. Usually model theory aspires to make one more step and try to find some geometrical behavior in models of a given theory. We would like to imitate methods from geometric stability theory in non-stable theories which are lying not to far from stability. To do this we need to consider a notion of independence, which inherits some properties from well-known geometrical notions of independence.
In [5], the author describes a very interesting concept of inducing a notion of independence in a (saturated) PAC field by combining forking independence present in the separable closure of and forking independence given in the complete system corresponding to . The main ingredient is Theorem 2.1 from [5], which says that if there is “a solution of the independence theorem problem” on the level of complete system corresponding to , then there is “a solution of the independence theorem problem” in the field . Using this result, Nick Ramsey in his doctoral dissertation (Corollary 7.2.7 in [33]) shows that for a PAC field the following holds: if the theory of the complete system related to is NSOP1, then is NSOP1. In Ramsey’s result the notion of independence in is combined from forking independence in the separable closure of and from Kim-dividing on the level of complete system corresponding to .
We were interested in generalizing the aforementioned results to the level of PAC substructures of stable monster and we plan to provide such generalizations in [18]. For example, we already generalized Theorem 2.1 from [5], which is the main ingredient also on the level of PAC substructures. Now, generalizing Theorem 7.2.6 and Corollary 7.2.7 from [33] should be straightforward and we are working on it.
One of our goals is to provide new examples of theories with NSOP1. One could ask: could not we construct such examples in a more direct way, e.g. structures given by more combinatorial approach? Yes, we could, but in the case of NSOP1 PAC substructures, we already dispose a tool to study model-theoretical properties of these structures - the general Galois theory. And as we will see in a moment, there is a way to construct PAC substructures with a desired absolute Galois group.
3. Substructures with -action
This part borrows results from [16] and [15]. The reader should treat [16] as a published version of author’s doctoral dissertation. The initial idea behind [16] was to obtain a way of “breaking”, in a controlled manner, stability of a given stable theory by considering additional group action by automorphisms. The desired goals were achieved and under some assumptions the resulting theory remains simple but not stable. As side product of studies on existentially closed substructures with a group action, it was observed that such substructures are PAC substructures and the definition of PAC substructures was slightly reformulated (see Section 3.1 in [16]) so we obtained Definition 2.3. It was also observed that there is a link between group which acts on considered substructures and their absolute Galois groups. Therefore we may adjust to control PAC substructures given as reducts of existentially closed substructures with a group action of .
3.1. Basics
The research in [16], which is a base for the following lines, was motivated by results of [8] and [17]. We fix a group and set language to be the language extended by unary function symbols .
Definition 3.1** (Definition 2.5 in [16]).**
- (1)
We introduce set of -sentences , which contains exactly the following axioms:
- i)
is an automorphism of -structure for every , 2. ii)
for every . 2. (2)
Let be an -structure. We say that is a -action on if . 3. (3)
If is an -theory, then is an -theory equal to the set of consequences of , i.e. .
There is an interesting question whether a class of existentially closed models of , for a given theory , is an elementary class, in other words whether model companion of exists (for some reasons it is more reasonable to ask about the existence of the model companion for ). The question is even more interesting, since the answer for the case of is related to nfcp. For research in this line, the reader may consult [3], [23], [24], [25] and [26].
For our purposes, we will focus on the class of existentially closed models of (recall that is stable and allows to eliminate quantifiers and imaginaries), so small substructures of which are equipped with a -action and which are existentially closed among the class of substructures equipped with a -action. By Proposition 3.56 in [15], such substructures are PAC substructures in . Moreover, if is finitely generated, then also the substructure of invariants is PAC (by Proposition 3.51 in [16]) and it is bounded (Corollary 3.50 in [16]). More precisely, if is an existentially closed model of , then by invariants of the -action we understand elements of the set . By Corollary 3.22 in [32], the set for finitely generated , constitutes an -substructure which is, as bounded PAC substructure, simple (see Theorem 4.40 in [16]). Now, we proceed to the simplicity of a prospective model companion of the theory .
3.2. Independence Theorem and simplicity
In this subsection we assume that the model companion of the theory , say , exists. We will describe assumptions needed to get simplicity of . First, let us recall that if a PAC substructure is bounded (its absolute Galois group is small as a profinite group) then its theory is simple (Corollary 3.22 in [32]). In the case of PAC fields, we have a stronger fact: a PAC field is simple if and only if it is bounded (Fact 2.6.7 in [27]). If is an existentially closed field with a -action, then is PAC and if is not bounded then can not be simple (since it reduct is not simple). Therefore, if we attempt to show simplicity of some monster model of , it is natural to assume that is bounded in (i.e. is a small profinite group, e.g. if is finite then is bounded, see Proposition 4.25 in [16]):
Theorem 3.2** (Theorem 4.21 and Proposition 4.26 in [16]).**
Assume that is bounded in . Let and let , , , , and be complete -types over which satisfy and if then
[TABLE]
Then, there exists a complete -type which extends each and such that if then
[TABLE]
Ternary relation \mathop{\mathchoice{\displaystyle\kern 5.71527pt\hbox to0.0pt{\hss\displaystyle\mid\hss}\lower 3.87495pt\hbox to0.0pt{\hss\displaystyle\smile\hss}\kern 5.71527pt}{\textstyle\kern 5.71527pt\hbox to0.0pt{\hss\textstyle\mid\hss}\lower 3.87495pt\hbox to0.0pt{\hss\textstyle\smile\hss}\kern 5.71527pt}{\scriptstyle\kern 2.80048pt\hbox to0.0pt{\hss\scriptstyle\mid\hss}\lower 1.89871pt\hbox to0.0pt{\hss\scriptstyle\smile\hss}\kern 2.80048pt}{\scriptscriptstyle\kern 1.42882pt\hbox to0.0pt{\hss\scriptscriptstyle\mid\hss}\lower 0.96873pt\hbox to0.0pt{\hss\scriptscriptstyle\smile\hss}\kern 1.42882pt}}^{\circ} which occurs in the above theorem is defined as follows:
[TABLE]
where are small subsets of . By Proposition 4.16 from [16], this ternary relation is an independence relation, hence it is forking independence in and so is simple (Theorem 4.22 in [16]) - under the assumption that is bounded. Moreover, boundedness of implies also that the theory of has geometric elimination of imaginaries (Theorem 4.36 in [16]).
There are several examples of which have model companions:
- •
ACFA is supersimple, not stable,
- •
if is finite then (e.c. fields with group action of , see [17]) is supersimple of SU-rank equal to , not stable
- •
ACFA (e.c. fields with group action of , see [28]) is simple, not supersimple, not stable
- •
CCMA (Complex Compact Manifolds with Automorphism, see [4]) is supersimple, not stable
We end this part with an unexpected result binding together simplicity of a field equipped with a group action with simplicity of its reduct to the structure of the pure field.
Corollary 3.3** (Corollary 4.31 in [16]).**
Let be the theory of fields, be the language of rings and let be a group (not necessarily finite). Assume that (= ) exists and let . The following are equivalent.
- (1)
The theory of in the language is simple. 2. (2)
The field is a bounded field. 3. (3)
The theory of in the language is simple.
3.3. Frattini cover
As we already mentioned, we can adjust absolute Galois groups (in the sense of ) of existentially closed substructures of equipped with a -action by changing the group . Assume that is such a substructure of . Now, we will describe some correlations between and Galois groups related to substructure . This description involves the following notion:
Definition 3.4**.**
Let be profinite groups and be a continuous epimorphism. The mapping is called a Frattini cover if for each closed subgroup of , the condition implies that . If moreover the profinite group is projective, the map is the unique universal Frattini cover (consult Proposition 22.6.1 in [14]).
The intuition behind the following results is that the -action on is determined by its restriction to . Note that is a Galois extension (by Lemma 3.28 in [16]), hence is a profinite group and it makes sense to study this group by standard for profinite groups methods. For example, is generated as a profinite group by (Proposition 3.30 in [16]), which implies that if is finitely generated, then also is finitely generated (as a profinite group, see Proposition 3.49 in [16]). The following result generalizes a similar one for fields with group action from [35], the proof in [15] uses Theorem 1.1 from [30] which is based on the classification of finite simple groups.
Proposition 3.5** (Proposition 5.1 in [15]).**
If is finitely generated then (the profinite completion of ).
Let us assume that is finitely generated. We know that and are PAC substructures of . After using some results from [15] and Theorem 2.12, we may conclude:
Corollary 3.6** (Corollary 5.5 in [15]).**
The restriction map
[TABLE]
is the universal Frattini cover.
By Proposition 3.5 we obtain the following short exact sequence
[TABLE]
which gives us a generalization of a result which was known in the case of fields ([35], [17]):
Corollary 3.7** (Corollary 5.6 in [15]).**
It follows that
- (1)
* (the domain of the universal Frattini cover of the group ),* 2. (2)
G\big{(}M\cap\operatorname{acl}(M^{G})\big{)}\cong\ker\Big{(}\operatorname{Fratt}\big{(}\hat{G}\big{)}\to\hat{G}\Big{)}.
Finally, we see that is a PAC substructure of controlled by its absolute Galois group which is isomorphic to . If is finite, then (by Lemma 2.10.(2)) so and is a PAC substructure of controlled by its absolute Galois group given as \ker\Big{(}\operatorname{Fratt}\big{(}G\big{)}\to G\Big{)}.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] James Ax. Solving diophantine problems modulo every prime. Annals of Mathematics , 85(2):161–183, 1967.
- 2[2] James Ax. The elementary theory of finite fields. Annals of Mathematics , 88(2):239–271, 1968.
- 3[3] John T. Baldwin and Saharon Shelah. Model companions of T aut subscript 𝑇 aut {T}_{\rm{a}ut} for stable T. Notre Dame J. Formal Logic , 42(3):129–142, 07 2001.
- 4[4] Martin Bays, Martin Hils, and Rahim Moosa. Model theory of compact complex manifolds with an automorphism. Trans. Amer. Math. Soc. , 369(6):4485–4516, 2017.
- 5[5] Zoé Chatzidakis. Amalgamation of types in pseudo-algebraically closed fields and applications. available on https://arxiv.org/abs/1704.08132 .
- 6[6] Zoé Chatzidakis. Properties of forking in ω 𝜔 \omega -free pseudo-algebraically closed fields. Journal of Symbolic Logic , 67(3):957–996, 2002.
- 7[7] Zoé Chatzidakis and Ehud Hrushovski. Perfect pseudo-algebraically closed fields are algebraically bounded. Journal of Algebra , 271(2):627 – 637, 2004.
- 8[8] Zoé Chatzidakis and Anand Pillay. Generic structures and simple theories. Annals of Pure and Applied Logic , 95(1-3):71–92, 1998.
