Nilpotent Group-Counterexamples to Zil’ber’s Conjecture
Andreas Baudisch
Institut für Mathematik,Humboldt-Universität zu Berlin,
D-10099 Berlin, Germany
[email protected]
Abstract.
We construct uncountably categorical 3-nilpotent groups of exponent p>3.
They are not one-based and do not allow the interpretation of an infinite field. Therefore they are counterexamples to Zil’ber’s Conjecture. First 2-nilpotent new uncountably categorical groups were contructed in [4]. Here we use the method of the additive Collapse developed in [6]. Essentially we work with 3-nilpotent graded Lie algebras over the field with p elements.
Key words and phrases:
Model Theory, uncountably categorical Lie algebras and groups
1991 Mathematics Subject Classification:
03C60
1. Introduction
Zil’ber’s Conjecture is the following statement:
Let T be an uncountably categorical theory in a countable language. If it is not one-based, then it is possible to interpret an infinite field in T.
The first counterexample was given by E.Hrushovski in 1988 (see [14]). It is a relational strongly minimal theory that does not even allow to interpret an infinite group.
In [4] a first group-counterexample is given . Using the classical results on groups of finite Morley rank it is easy to see that such a group-counterexample is essentially a simple group or a nilpotent group of finite exponent. The groups constructed in [4] are nilpotent of class 2 and of exponent p>2. In fact we worked with alternating bilinear maps. In the terminology of this paper they are 2-nilpotent graded Lie algebras over the field F(p) with p elements (p>2). If we try a similar construction in higher nilpotency classes
additional difficulties arise. Here we will give 3-nilpotent counterexamples.
In his paper [15] on the fusion of two strongly minimal sets E. Hrushovski developed new ideas for such constructions as above. Together with A.Martin-Pizarro and M.Ziegler we used his ideas to obtain fields of prime characteristic
of Morley rank 2 equipped with a definable additive subgroup of rank 1[10]. Furthermore we realised the fusion of two strongly minimal sets with DMP over a common vector space to obtain again a strongly minimal set[11]. Finally bad fields were construced by M.Hils, A.Martin-Pizarro, F.Wagner and me [12].
In [6] a common frame is built for the constuctions of the new uncountably categorical groups, the red fields, and the fusion over a vector space.
There we have a starting theory T that fulfills certain conditions. Notions like codes and difference sequences as in [10] and [11] are introduced and finally a collaps gives the desired theory of finite Morley rank.
In this paper we will follow this strategy of [6]. The main part (section 2 - 11) is devoted to the construction of an elementary theory of a 3-nilpotent graded Lie algebra over F(p), as a starting theory for the collaps.
It has infinite Morley rank.
In section 2 we consider c-nilpotent graded Lie algebras M=M1⊕…⊕Mc over a finite field K
in a suitable elementary language L.
The Mi are K-vector spaces. For x∈Mi and y∈Mj we have [x,y]∈Mi+j. A function δ over the set of all finite substructures A of M
into the natural numbers is defined. For c=2 the definition is a minor deviation of the definition in [4].
Submodularity for the case c=2 is shown. Furthermore we define A is strong in M, if δ(A)≤δ(B) for
all finite A⊆B⊆M. For later amalgamation a class Kc is defined. In Lie algebras M in Kc we have 0<δ(A) for all substrucures A=⟨0⟩ of M.
In section 3 amalgamation is introduced. The existence of the free amalgam of c-nilpotent graded Lie algebras over a fixed field is shown in [7]. We study the structure of of the free amalgam in the case c=3.
In section 4 we describe the results for the case c=2 from [4] and [6].
From now on we work with 3-nilpotent Lie algebras.
In section 5 a functor F from Kc−1 into Kc is defined. For A∈Kc let A∗=A/Ac. If B=⟨B1⊕…⊕Bc−1⟩∈Kc and A∗≅B∗, then there is a homomorphism of F(A∗) onto B. In the case of 3-nilpotent Lie algebras we show that a strong embedding of B∗ into A∗ in the sense of K2
implies that the natural homomorphism of F(B∗) into F(A∗) is an embedding.
This is part of the main result
(Theorem 5.5) in this section. It was proved in A.Amantini’s dissertation [1].
In section 6 we work again in K3. Submodularity of the δ-function for substructures
A∈M, where A∗≤M∗, is shown. Then we prove the amalgamation property for K3 with strong embeddings.
Using this amalgamation we obtain in section 7 a countable strong Fraïssé-Hrushovski limit M - the desired Lie algebra.
We study the theory T3 of M. M is uniquely determined by richness: If B is strong in A and both are in K3, then a strong embedding f of B into M can be extended to an strong embedding of A into M. We give an axiomatization of T3.
In section 8 non-forking and canonical bases are investigated.
T3 is ω-stable and CM-trivial.
Let C be a monster model of T3. In section 9 we define a pregeometry cl, using the δ-function. Its domain is
the union R(C)=C1∪C2 of the first two vector spaces of the graduation.
The pregeometry is defined for all finite subspaces A=⟨A1A2⟩. The smallest L-subspaces of this form
are generated by a single element in R(C)=C1∪C2.
Our aim is to find a strong substructure Pμ(C)
of C, that has an uncountably categorical theory with the desired properties. For this we have to ensure that
in the structure Pμ(C) the geometrical closure is the algebraic closure.
Therefore
we study so-called minmal prealgebraic extension over substructures in section 10. We build formulas ϕ∈Xhome that describe these extensions. They are strongly minimal. To realise our aim above we define an expansion Cμ of C
by adding a new predicate Pμ, such that in the substructure Pμ(Cμ) the number of solutions of the ϕ∈Xhome with parameters in Pμ(Cμ) is finite. The bound is given by a function μ
on codes, that are modifications of the formulas in Xhome.
There are uncountably many possible μ-functions.
In [6] conditions are formulated that provide the existence of Cμ. There we work with a pregeometry over a vector space, but here R(C) is the union of two vector spaces. Therefore we have to modify the conditions from [6]. In section 11 we show that T3 satisfies these new conditions C(1)- C(7) for the collaps.
In the following sections we use our full knowledge of T3 and not only these conditions.
In section 12 we indroduce codes α, that are modifications of the formulas in Xhome. Difference sequences are realizations of a spezial formulas
ψα(xˉ0,…,xˉλ) that describes some properties of a
sequence aˉ0−fˉ,…,aˉλ−fˉ
,where aˉ0,…,aˉλ,fˉ is a Morley sequence of
realizations of a code formula φα(xˉ,b).
Then we introduce bounds for difference sequences in section 13. For this Lemma 13.1
provides an
important combinatorial property of these sequences.
It needs new ideas for the proof.
We consider a class Kμ of strong subalgebras of C, where a suitable function μ on
the set of codes gives the desired bounds.
In section 14 we use the condition C(6) to amalgamate strong subalgebras from Kμ inside C.
We get a countable Kμ-rich strong subalgebra Pμ(C) of C:
If B≤A are in Kμ and if there is an
strong embedding of B into Pμ(C), then we can extend the
embedding to a strong embedding of A into Pμ(C).
In section 15 we extend our language by a predicate Pμ for this subalgebra. The new language is denoted by Lμ. A Lμ-structure (M,Pμ(M)) is a 2×rich Lμ-structure,
if M is a rich model of T3,
Pμ(M)≤M is Kμ-rich, and the geometrical dimension of M over Pμ(M) is infinite.
These structures have a complete theory T3μ, with a monster model Cμ.
In section 16 T3μ is axiomatized. We get ω-stability.
Let Γ(Cμ) be the L-substructure with domain Pμ.
It is the desired new uncountablly categorical graded 3-nilpotent Lie algebra over a finite field. It will be
considered in section 17.
In this substructure cl is part of the algebraic clousure. Γ(Cμ) is stably embedded in Cμ. In Γ(Cμ) the predicate R has Morley rank 1 and Morley degree 2.
The geometry of the algebraic closure is not locally modular, but the theory is CM-trival. It is not possible
to interpret an infinite field.
The Morley rank of this structure is 3.
In section 18 we get group counterexamples by interpretation.
We use the Baker-Campbell-Hausdorff-formula. Here the sum is finite. These groups are bi-interpretable with the Lie algebras of T3μ without graduation. Their theories are uncountably categorical. They are not one-based, CM-trivial, and do not allow the interpretation of a field.
2. Definition of δ
We consider c-nilpotent graded Lie algebras M over a finite field K in a language L. The non-logical
symbols of L are the following: There are +, −,[math] and unary functions for the scalar multiplication with the elements of K to describe the underlying vector space. Furthermore we have unary predicates
Ui (1≤i≤c) for the graduation. That means M=⊕1≤i≤cMi, where Mi=Ui(M).
Projections pri are needed to ensure that substructures are again graded. [x,y] is the symbol for the Lie - multiplication. In M Ui(a) and Uj(b) implies Ui+j([a,b]). ⟨X⟩ denotes the L-substructure of M generated by X⊂M. ⟨X⟩lin
denotes the linear hull of X. If a∈Ui(M), then we say that a is homogeneous of degree i. A subset X is homogeneous, if all its elements are homogenous. If a∈M then a=∑1≤i≤criai, where ai∈Ui(M)=Mi. The degree of a is the smallest i, such that ri=0. Finally ⟨⟨X⟩⟩ is the ideal generated by X in
M. ldim is used to denote the linear dimension.
A,B,C,D denote finite and M,N arbitrary c-nilpotent graded Lie algebras over K. For every
finite A
we define an integer δ(A) that is uniquely determined by the isomorphism type of A. Note that we do not assume in general that A=⟨A1⟩.
We use the Theorem of Sirsov-Witt: Every subalgebra of a free Lie algebra over a field is free. In [3]
a key lemma for the proof of this Theorem is formulated, that is useful from a model-theoretic point of view. Here we develop the results in a context with graduation.
If F(X) is the the free Lie algebra freely generated by X, then F(X) becomes a free graded Lie algebra, if we define Ui(F(X)) to be the vector space generated by all momomials over X of degree i. U1(F(X)) is the linear hull of X. Projections are defined in the usual way. Then we have
[TABLE]
where Z1(M)⊆…⊆Zc(M) is the upper central series and
Γ1(M)⊇…⊇Γc(M) the lower central series.
Definition 2.1**.**
Let Y be a homogeneous subset of M.
- (1)
Y is an (o)-system in M, if for all i (1≤i≤c) Ui(Y) is linearly independent over
⟨U1(Y),…,Ui−1(Y)⟩i.
2. (2)
Y generates M freely, if Y is an o-system
in M, that generates M and for every c-nilpotent graded Lie algebra N over K
every map f of Y into N with Ui(y) implies Ui(f(y)) can be extended to an L-homomorphism of M into N.
We call such a Lie algebra M the free algebra F(Y).
The fact that Y generates M freely can be expressed by linear independence of basic commutators.
In [3] the following Theorem is taken from the proof of the Sirsov-Witt-Theorem and applied for the following corollaries. Here we formulate it with graduation.
Theorem 2.2**.**
In a free graded c-nilpotent Lie Algebra F(X) every (o)-system Y freely generates
⟨Y⟩.
Corollary 2.3**.**
Every element of F(Y) has a unique presentation as a linear combination of basic commutators over Y.
Definition 2.4**.**
If X=∪1≤i≤cXi where Xi⊆Ui(M) is a generating o-system for M, then we define o−dimi(M)=∣Xi∣. o−dim(M)=∑1≤i≤co−dimi(M).
It is easily seen, that o−dimi(M) is independent from the choice of X.
Corollary 2.5**.**
If M and N are free and o−dimi(M)=o−dimi(N) for 1≤i≤c, then M≃N.
We choose a generating o-system W for some c-nilpotent graded Lie algebra M. Let F(X) be the free graded c-nilpotent Lie algebra over K freely generated by X, where X be an o-system with ∣Xi∣=∣Wi∣
for 1≤i≤c.
Then for every map of Xi onto Wi for all i we get a homorphism f of F(X) onto M. Hence
M≃F(X)/ker(f).
Definition 2.6**.**
We call F(X),ker(f) as above a canonical pair for M. As we
will see below it is unique up to automorphisms of F(X).
If g is any homorphism of F(X) onto M, then there is a generating o-system X0 in F(X) such that
g(Xi0)=Wi. By Corollary 2.5 there is an automorphism α with α(Xi)=Xi0. Hence f=gα and ker(g) is an automorphic image of ker(f). It follows that the following definition is independent of f.
Definition 2.7**.**
An ideal basis for M≃F(X)/ker(f) is a homogeneous subset Y of ker(f), such that
Yi generates ker(f)∩F(X)i modulo ⟨⟨Y2,…,Yi−1⟩⟩∩F(X)i for 2≤i≤c.
For finite M we define ideal−dimi(M)=∣Yi∣ and
[TABLE]
and δ(M)=δc(M).
o−dimi(M), ideal−dimi, and δi(M) are invariants of M. They depend only on the isomorphism-typ of M. In the approach in [4] and in [6] for c=2 we consider only substructures A with A=⟨A1⟩. In that context the
proof of the next lemma is easier.
Lemma 2.8**.**
Submodularity holds for δ2.
Let M be a 2-nilpotent graded Lie algebra. Let A and C be subalgebras of M. Then
[TABLE]
Proof.
Define Ai∩Ci=Bi. Let X1=X1(AC)=X1(C)X1(B)X1(A) be a vector basis for ⟨CA⟩1 such that:
**: **
X1(B) is a vector basis of B1.
**: **
X1(B)X1(C) is a vector basis of C1.
**: **
X1(B)X1(A) is a vector basis of A1.
We define:
**: **
X20(B) is a vector basis for ⟨C1⟩2∩⟨A1⟩2 over ⟨B1⟩2.
**: **
X2A(B) is a vector basis for ⟨A1⟩2∩C2 over ⟨B1⟩2+⟨X20(B)⟩.
**: **
X2C(B) is a vector basis for ⟨C1⟩2∩A2 over ⟨B1⟩2+⟨X20(B)⟩.
**: **
X21(B) is a vector basis for B2∩⟨X1⟩2 over
⟨B1⟩2+⟨X20(B)X2A(B)X2C(B)⟩.
**: **
X22(B) is a vector basis of B2 over ⟨X1⟩2.
Note that X2A(B)∪X2C(B) is linearly independent over ⟨X1(B)⟩2+⟨X20(B)⟩2.
Now B2 has the following vector basis X2(B) over ⟨B1⟩:
[TABLE]
Let X21(A) and X21(C) be choosen such that
**: **
X2C(B)X21(B)X21(A) is a vector basis of A2∩⟨A1C1⟩2 over ⟨A1⟩2.
**: **
X2A(B)X21(B)X21(C) is a vector basis of C2∩⟨A1C1⟩2
over ⟨C1⟩2.
Choose X22(A) and X22(C) such that
**: **
X2(A)=X2C(B)X21(B)X22(B)X21(A)X22(A) is a vector basis of A2 over ⟨A1⟩2.
**: **
X2(C)=X2A(B)X21(B)X22(B)X21(C)X22(C) is a vector basis of C2 over ⟨C1⟩2.
Then X2(AC)=X22(B)X22(A)X22(C) is a vector basis of ⟨AC⟩2 over ⟨A1C1⟩2. Hence X1(AC)X2(AC) is a generating o-system of ⟨AC⟩. Then
[TABLE]
where I is a subspace of F(X1(AC)2.
We get
- (1)
δ2(⟨AC⟩=∣X1(AC)∣+∣X2(AC)∣−ldim(I)
2. (2)
δ2(A)=∣X1(B)∣+∣X1(A)∣+∣X2(A)∣−ldim(I∩F(X1(B)X1(A)).
3. (3)
δ2(C)=∣X1(B)∣+∣X1(C)∣+∣X2(C)∣−ldim(I∩F(X1(B)X1(C)).
4. (4)
δ2(B)=∣X1(B)∣+∣X2(B)∣−ldim(I∩F(X1(B)).
5. (5)
o−dim1(A)+o−dim1(C)−o−dim1(B)=o−dim1(AC).
6. (6)
o−dim2(A)+o−dim2(C)−o−dim2(B)=
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
7. (7)
δ2(A)+δ2(C)−δ2(B)=δ2(AC)+∣X21(B)X21(A)X21(C)∣−∣X20(B)∣+
[TABLE]
Let I0 be (I∩F(X1(B)X1(A)))⊕I∩F(X1(B))(I∩F(X1(B)X1(C)). Then I0 is a subspace of I and I contains ∣X20(B)∣ - many elements ψi=ψi(A)+ψi(C) with
ψi(A)∈F(X1(B)X1(A)) and ψi(C)∈F(X1(B)X1(C)), that are linearly independent over I0.
Hence
[TABLE]
∎
We summeraize the results of the computation above.
Corollary 2.9**.**
*As above B=A∩C. We define:
rB=ldim((⟨A1C1⟩2∩B2)/⟨A1⟩2+⟨C1⟩2,
rA=ldim((⟨A1C1⟩2∩A2)/⟨A1⟩2+⟨C1⟩2,
rC=ldim((⟨A1C1⟩2∩C2)/⟨A1⟩2+⟨C1⟩2,
and
if ⟨A1C1⟩=F(A1C1)/I, then s=ldim(I/(I∩(F(A1))+F(C1)). Then*
- (1)
δ2⟨AC⟩)−δ2(C)=δ2(A)−δ2(B)−(rA+rC−rB+s).**
2. (2)
δ2(⟨AC⟩)=δ2(A)+δ2(C)−δ2(A∩C)* if and only if *
rA=rC=rB=s=0* if and only if*
A2* and C2 do not contain elements in ⟨A1C1⟩∖⟨A1⟩2+⟨C1⟩2,*
and if ⟨A1C1⟩=F(A1C1)/I, then I=(I∩(F(A1))+F(C1)).
Definition 2.10**.**
Let M be a graded c-nilpotent Lie algebra over a finite field K.
Let A be a substructure of M.
- (1)
For 2≤i≤c A is i-strong in M (short A≤iM), if for all 2≤j≤i and all
A⊆C⊆M we have δj(A)≤δj(C).
2. (2)
We write A≤M, if A≤cM. In this case we say A is strong in M.
We use A≤1M for A⊆M.
For the graded Lie algebras M∈K3, that we will consider later, we will have:
if δ3(A)≤δ3(C) for all finite C with A⊆C⊆M, then
δ2(A)≤δ2(C) for all finite C with A⊆C⊆M.
Lemma 2.11**.**
Let M be a graded c-nilpotent Lie algebra over a finite field K.
We assume for all (i-1)-strong substructures of M submodularity for δi is true. Furthermore for all substructures
A,C,E of M,where A,C are finite, we have:
- (0)
If A⊆E, then there is some A⊆A′≤i−1E and δi(A′)≤δi(A).
2. (2,i-1)
If A≤i−1C≤i−1M, then A≤i−1M.
3. (3,i-1)
If A,C≤i−1M, then A∩C≤i−1M.
Then for all substructures
A,C,E of M, where A,C finite the following is true:
- (1)
If C≤iM and E≤i−1M, then E∩C≤iE.
2. (2)
If A≤iC≤iM, then A≤iM.
3. (3)
If A,C≤iM, then A∩C≤iM.
Proof.
ad 1) By assumption C,E≤i−1M. Choose any D such that E∩C⊆D⊆E. By (3,i-1) we have E∩C≤i−1M. By (0) we have some D′, such that D⊆D′≤i−1E and δi(D′)≤δi(D). By (2,i-1)
we get D′≤i−1M. By submodularity for (i-1)-strong substructures of M we have
[TABLE]
Note D′∩C=D∩C=E∩C. Hence
[TABLE]
since C≤iM. It follows δi(E∩C)≤δi(D′)≤δi(D) for all D between E∩C and E.
ad 2) By (2,i-1) we have A≤i−1M. Also C≤i−1M. Consider A⊆E⊆M. If E⊆C or C⊆E, then δi(A)≤δi(E) or δi(A)≤δi(C)≤δi(E) respectively. Otherwise we apply (0) and obtain E⊆E′≤i−1M with δi(E′)≤δi(E). By submodularity
of δi for (i-1)-strong substructures
[TABLE]
By C≤iM and since δi(A)≤δi(E′∩C)
[TABLE]
Hence δi(A)≤δi(E′)≤δi(E).
ad 3) By 1) we have A∩C≤iA≤iM and by 2) A∩C≤iM.
∎
Note 1-strong substructures are substructures. Submodularity for δ2 for substructures is shown in
Lemma 2.8. Hence
Corollary 2.12**.**
For all substructures
A,C,E of M, where A,C are finte the following is true:
- (1)
If C≤2M and E⊆M, then E∩C≤2E.
2. (2)
If A≤2C≤2M, then A≤2M.
3. (3)
If A,C≤2M, then A∩C≤2M.
Let M be F(X)/⟨⟨Y⟩⟩, where X is a generating o-system with
o−dimi(M)=∣Xi∣ and Y is an ideal basis of ker(f), where f is as above f:F(X)→M, f is onto, and f(X) is a generating o-system of M.
Let M′ be M/Mi+1⊕…⊕Mc and τ the canonical homomorphism of M onto M′. Then τ is one-to-one on M1⊕…⊕Mi and ker(τ)=Mi+1⊕…⊕Mc.
Lemma 2.13**.**
Assume M⊆N and F(X),ker(f) is a canonical pair for N as above. Then there is a subalgebra
H of F(X), such that H,H∩ker(f) is a canonical pair for M.
Note that H is free by Theorem2.2.
Proof.
Choose an generating o-system Z for M and let Z0 be a f-preimage of Z in F(X). Let H be the substructure of F(X) generated by Z0.
∎
Definition 2.14**.**
If M⊆N, then X=∪1≤i≤cXi is an o-system for N over M,if
Ui(Xi),
X1 is minimal with ⟨M1X1⟩1=N1 and Xi is minimal with ⟨MX1…Xi⟩i=Ni.
Then o−dim(N/M)=∑1≤i≤c∣Xi∣ and o−dimi(N/M)=∣Xi∣.
In the context of Lemma 2.13 Y=∪2≤i≤cYi is an ideal basis of N over M, if Yi is a
vector space basis of F(X)i∩ker(f) over F(X)i∩(⟨⟨(ker(f)∩H),Y2,…,Yi−1⟩⟩).
Then ideal−dimi(N/M)=∣Yi∣ and ideal−dim(N/M)=∑2≤i≤cideal−dimi(N/M).
We extend Definition 2.10
Definition 2.15**.**
Let M be a graded c-nilpotent Lie algebra over a finite field.
Let A be a finite substructure.
- (3)
A is strong in M restricted by k (short A≤kM), if for all
A⊆C⊆M
with ∑1≤i≤c−1o−dimi(C/A)≤k, we have δ(A)≤δ(C).
Note that δ(C)=δ(⟨C1,…,Cc−1⟩)+o−dimc(C).
Definition 2.16**.**
Let Kc be the class of all graded c-nilpotent Lie algebras M over a fixed finite field K
considered as L - structures. such that the following is true:
For A⊆M we have min{o−dim(A),2}≤δ(A)
Lemma 2.17**.**
Assume M∈Kc.
Given i+j≤c in M holds
[TABLE]
We say that there are no homogeneous zero-divisors.
Proof.
Assume Ui(a), Uj(b), i+j≤c and i<j or i=j and a and b are linearly
independent . By assumption o−dim(⟨a,b⟩)=δ(⟨a,b⟩)=2. Hence [a,b]=0.
∎
Definition 2.18**.**
Let Hc be the subclass of all M∈Kc with M=⟨M1,…,Mc−1⟩.
Kcfin and Hcfin are the subclasses of finite sutructures.
Kc and Kcfin are closed under substructures.
Corollary 2.19**.**
- (1)
Let M be a graded 2-nilpotent Lie algebra ovr a finite field. M∈K2 if and only if
for every A=⟨A1⟩⊆M with lin−dim(A1)≥2 we have δ2(A)≥2.
2. (2)
Let M be a graded 3-nilpotent Lie algebra over a finite field. M∈K3 if and only if
for every A=⟨A1A2⟩⊆M with o−dim(A)≥2 we have δ3(A)≥2.
3. Free amalgamation
Let K be a class of structures as e.g. the class of all c-nilpotent graded Lie algebras over a fixed field, Kc, or Kcfin.
Definition 3.1**.**
We define the amalgamation and the free amalgamation for K.
**AP: **
Amalgamation Property Assume g0:B→A and g1:B→C are embeddings for
A,B,C∈K. Then there are some D in K and embeddings f0:A→D and f1:C→D such that f0∘g0=f1∘g1 for B.
** APS: **
We have the strong amalgamation property for K if in AP
f0(A)∩f1(C)=f0∘g0(B)=f1∘g1(B) holds.
**Free Amalgam: **
Let A,B,C,D∈K and assume that B is a common substructure of
A and C. If D is generated by A and C with A∩C=B, then
D is the free amalgam of A and C over B (short D=A⊗BC) in K, if for all homomorphisms
f:A→E and g:C→E into some E∈K with
f(b)=g(b) for b∈B there is a homomorphism h:D→E that extends f and g.
**Closed: **
K is closed under free amalgamation, if for A,B,C∈K and embeddings g0:B→A and g1:B→C, there exists a free amalgam A′⊗B′C′ in K and isomorphisms f0:A→A′ and f1:C→C′ , such that f0∘g0(b)=f1∘g1(b) for b∈B maps B onto B′ .
The free amalgam is a strong amalgam by definition. The homomorphism h:D→E in the definition is unique, since D is generated by A and C.
Note that A⊗BC is uniquely determined up to isomorphisms, if it exists.
We define as in [7]:
Definition 3.2**.**
For subsets A,B,C in a structure M we define
[TABLE]
if and only if
[TABLE]
.
Let L be countable.
K.Tent and M.Ziegler defined a stationary independence relation for the investigation of automorphism groups in [20]. We consider finite subsets A,B,C,D of a L-structure M.
Definition 3.3**.**
A relation A\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}}_{B}C for finite subsets of M is called a stationary independence relation in M if it fulfils the following properties.
**Inv: **
Invariance A\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}}_{B}C depends only on the elementary type of A,B,C.
**Mon: **
Monotonicity A\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}}_{B}CD implies A\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}}_{B}C and A\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}}_{BC}D.
**Trans: **
Transitivity A\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}}_{B}C and A\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}}_{BC}D imply A\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}}_{B}CD.
**Sym: **
Symmetry A\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}}_{B}C if and only if C\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}}_{B}A.
**Ex: **
Existence For A,B,C there is some A′ in M such that tp(A/B)=tp(A′/B) and
A^{\prime}\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}}_{B}C.
**Stat: **
Stationarity If tp(A/B)=tp(A′/B), A\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}}_{B}C, and A^{\prime}\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}}_{B}C, then
tp(A/BC)=tp(A′/BC).
In [7] the following is shown. Note that the graduation is essential for the amalgamation.
Theorem 3.4**.**
The class of c-nilpotent graded Lie algebras over a field K is closed under free amalgamation.
Theorem 3.5**.**
If K is a finite field, then the Fraïssé limit M0 of all finitely generated c-nilpotent graded Lie algebras
exists.
If Cuni is a monster model of Th(M0), then the free amalgam defines a stationary independence 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}}^{\otimes}in Cuni.
Then every graded Lie algebra we consider is a substructure in Cuni, and
if B⊆A, then every embedding of B in Cuni can be extended to A.
Furthermore tp(A/B) is completely determined by it’s quantifier-free part.
That means we can use the properties of a stationary independence relation for the free amalgam in the class of c-nilpotent graded Lie algebras over K.
Definition 3.6**.**
Let M be a graded c-nilpotent Lie algebra. By a vector space basis of M we mean
the union of the vector space bases Xi of all
subspaces Mi of the graduation.
In the proof of the Theorem 3.4 we prove the following Major Case. The final construction of the free amalgam is an iteration of it.
**Major Case: **
Assume A=⟨Ba⟩ and C=⟨Be⟩ with Ui(a) , Uj(e), and i,j<c.
Furthermore we have [a,b]∈B and [e,b]∈B for b∈B.
Then the free amalgam D of A and C over B exists. Let XB be a homogeneous vector space basis of B, Let Y be a vector space basis of the free graded
c-nilpotent Lie algebra freely generated by a and
e. We can assume that Y is a set of basic monomials over a,e. Then XBY is a vector space basis of D and the Lie multiplication is inductively defined by the Jacobi identity, using [a,b]∈B and [e,b]∈B for b∈B.
Corollary 3.7**.**
Let C,B,A be finite graded 2-nilpotent Lie algebras over a field. Let XB=X1BX2B be a vector space basis of B, XA=X1AX2A a vector space basis of A over XB, and XC=X1CX2C a vector space basis of C over XB. Then
[TABLE]
is a vector space basis of A⊗BC.
Using Corollary 2.9 we obtain:
Corollary 3.8**.**
Let M be a 2-nilpotent Lie algebra and
let B⊆A,B⊆C be subalgebras of M with A∩C=B. Then
the following are equivalent:
- (1)
⟨AC⟩=A⊗BC.
2. (2)
δ(⟨AC⟩)−δ(C)=δ(A)−δ(B).
3. (3)
There are no elements of
⟨A1C1⟩∖⟨A1⟩+⟨C1⟩ in A2 or in C2.
Furthermore if ⟨A1C1⟩=F(A1C1)/I, then I⊆⟨A1⟩F(A1C1)+⟨C1⟩F(A1C1).
Proof.
(2) and (3) are equivalent by Corollary 2.9.
If ⟨AC⟩=A⊗BC, then by Corollary 3.7 we obtain (3).
Finally we show that (3) implies (1). Let f be a homomorphism of A into E and g of C into E such that f and g coincide over B=A∩C. As above let XB=X1BX2B be a vector space basis of B, XA=X1AX2A a vector space basis of A over XB, and XC=X1CX2C a vector space basis of C over XB. Then
by the conditions of (3) {[x,y]:x∈X1A,y∈X1C} is linearly independent over ⟨A1⟩2+⟨C1⟩2. Therefore and by the second condition
the homomorphism h of F(X1(B)X1(A)X!(C)) into E, given by f and g, induces a homomorphism of ⟨A1C1⟩ into E. Then it is no problem to extend this to
⟨AC⟩.
∎
Corollary 3.9**.**
Let C,B,A be finite graded 3-nilpotent Lie algebras over a field with A∩C=B. Then the following are equivalent:
- (1)
⟨AC⟩=A⊗BC.
2. (2)
Let XB=X1BX2BX3B be a vector space basis of B, XA=X1AX2AX3A a vector space basis of A over XB, and XC=X1CX2CX3C a vector space basis of C over XB. Assume X1A and X1C are ordered. Then the following is a vector space basis of ⟨AC⟩:
[TABLE]
[TABLE]
[TABLE]
Proof.
It is easily seen, that there exists a graded Lie-algebra M with the vector space basis (2). We have only to define
[x,y] in a canonical way and then we have to show that the Jacobi identity is true. Using the definiton we get that
M≅A⊗BC.
∎
The following property of the free amalgam of 3-nilpotent graded Lie-algebras over a field
will be later useful:
Theorem 3.10**.**
In a 3-nilpotent graded Lie algebra over a field we consider U⊆V,
aˉ a sequence of elements, ⟨Uaˉ⟩∩V=U, B⊆U, and C⊆V such that
- (1)
⟨Vaˉ⟩=V⊗C⟨Caˉ⟩,
2. (2)
⟨Uaˉ⟩=U⊗B⟨Baˉ⟩.
*Then ⟨Uaˉ⟩=U⊗D⟨Daˉ⟩, where D=C∩B.
The same is true for c=2.*
Proof.
W.l.o.g. aˉ is a sequence of homogenous elements, since there are projections in the language.
By the assumptions a set of monomials of homegeneous elements from
⟨Uaˉ⟩ that is linearly independent over U
is linearly indepentent over V. Then ⟨aˉ⟩lin∩U=⟨aˉ⟩lin∩V. Hence we can assume w.l.o.g., that aˉ is linearly independent over
U and V. Furthermore we suppose w.l.o.g., that aˉ2 is linearly independent over
V2+⟨aˉ1⟩2 and aˉ3 is linearly independent over
⟨aˉ1aˉ2⟩3+V3.
Assume w.l.o.g. aˉ=eˉe′ˉe′′ˉ with the following properties:
- (3)
eˉ is a generating o-system for ⟨Vaˉ⟩ over V.
Then e1ˉ=a1ˉ and eˉ is an o-system
over U.
2. (4)
eˉe′ˉ is a generating o-system of ⟨Uaˉ⟩ over U.
Note that e′ˉ1 and e′′ˉ1 are empty.
Assume e∈e′ˉ2e′′ˉ2. Then w.l.o.g.
[TABLE]
where v2∈V2 and v1j∈V1.
By (1) and Corollary 3.9 we get v1j∈C1 and
v2=e−∑j[a1j,v1j]∈⟨Caˉ⟩∩V=C.
If e∈e′′ˉ2, then e∈⟨Uaˉ1⟩. Then by (2) and Corollary 3.9
v1j∈B1 and v2∈⟨Baˉ⟩∩U=B. By the considerations above
v1j∈D1 and v2∈D2.
We can rewrite (1) as ⟨Vaˉ⟩=V⊗C⟨Caˉ1eˉ2aˉ3⟩
and (2) as ⟨Uaˉ⟩=U⊗B⟨Baˉ1eˉ2e′ˉ2aˉ3⟩.
Let XiD be a vector space basis of Di. We can extend XiD by XiB, such that
XiDXiB is a vector space basis of Bi. Analogously we get XiC∩U, such that
XiDXiC∩U is a vector space basis of Ci∩Ui.
Let XiDXiC∩UXiC be a vector space basis of Ci.
Then
XiCXiC∩UXiDXiB is a vectorspace basis of ⟨CB⟩.
Let XiDXiC∩UXiBXiU be a vector space basis of Ui.
Let XiDXiC∩UXiBXiUXiCXiV be a vector space basis of Vi.
To get a vector space basis
of ⟨Caˉ1⟩2 over C2, we choose Y2DY2C∩UY2C
linearly independent, such that Y2D is a vector space basis of ⟨Daˉ1⟩2
over C2, Y2C∩U is a vectorspace basis of ⟨(C∩U)aˉ1⟩2 over
C2Y2D, and Y2C is a vector space basis of ⟨Caˉ1⟩2 over
C2Y2DY2C∩U. By (1) Y2DY2C∩UY2C is a vector space basis over V2.
By Corollary 3.9 and (1) we get that the union of the following sets is a
vector space basis for ⟨Vaˉ⟩2:
X2DX2C∩UX2CX2BX2UX2V for V2,
X2DX2C∩UX2CY2DY2C∩UY2Ceˉ2 for
⟨Caˉ⟩2, and
{[x,y]:x∈X1BX1UX1V,y∈aˉ1}.
If we use (2) and Corollary 3.9,
then we get the following vector space basis for
⟨Uaˉ⟩2, as the union of:
X2DX2BX2C∩UX2U for U2,
X2DX2BY2D{[x,y]:x∈X1B,y∈aˉ1}eˉ2e′ˉ2 for
⟨Baˉ⟩2, and
{[x,y]:x∈X1UX1U∩C,y∈aˉ1}.
We can rewrite the vector space basis as the union of:
X2DX2C∩UX2BX2U for U2,
X2DY2Deˉ2e′ˉ2 for
⟨Daˉ⟩2, and
{[x,y]:x∈X1BX1UX1U∩C,y∈aˉ1}.
By Corollary 3.9 we have ⟨U∗aˉ∗⟩=U∗⊗D∗⟨D∗aˉ∗⟩.
Note, that Y2C∩U={[x,y]:x∈X1C∩U,y∈aˉ1}.
Furthermore we have shown, that Y2B={[x,y]:x∈X1B,y∈aˉ1} is a
vector space basis of ⟨Baˉ1⟩2 over ⟨B2Y2D⟩2.
We consider e∈e′ˉ3e′′ˉ3. Then w.l.o.g.
[TABLE]
where v3∈V3 and Δ is a linear combination of monomials of the form
[w,z] with w∈V2,z∈aˉ1 or
z∈aˉ2,w∈V1 or [[v,y],u] where v,u∈V1,y∈aˉ1 or [[x,v],z] where
x,z∈aˉ1,v∈V1.
By Corollary 3.9 we get that v,u,w and v3 are in C similarly as above.
If e∈e′′ˉ3,
then (1) and (2) imply, that all these u,v,w and v3 are in D.
Hence we can replace (1) by ⟨Vaˉ⟩=V⊗C⟨Ceˉ⟩
and (2) by ⟨Uaˉ⟩=U⊗B⟨Beˉe′ˉ⟩.
Now we define analogously as above, that Y3D is a vector space basis of
⟨Daˉ1eˉ2⟩3 over C3 , Y3C∩U is a vector space basis
of (⟨C∩U)aˉ1eˉ2⟩3 over C3Y3D, and Y3C is a
vectorspace basis of ⟨Caˉ1eˉ2⟩ over C3Y3DY3C∩U.
Hence Y3DY3C∩UY3C is a vector space basis of ⟨Caˉ1eˉ2⟩3 over C3 and by (1) over V3.
We assume, that aˉ1 is ordered by a1j<a1k for j<k.
Furthermore we order X1BX1UX1V.
By (1) and Corollary 3.9 the union of the following sets is a vector space basis (5) of
⟨Vaˉ⟩3:
X3DX3C∩UX3CX3BX3UX3V for V3,
X3DX3C∩UX3CY3DY3C∩UY3Ceˉ3 for
⟨Caˉ⟩3,
{[x,y]:x∈X2BX2UX2V,y∈aˉ1orx∈Y2DY2C∩UY2Ceˉ2,y∈X1BX1UX1V},
{[[a1j,z],a1k]:j≤k,z∈X1BX1UX1V},
{[[x,a1j],y]:x≤y∈X1BX1UX1V}.
Let Y3B be a vector space basis of ⟨Baˉ⟩3 over X3DX3BY3D.
By (2) und (5) we have
[TABLE]
[TABLE]
We apply Corollary 3.9 to (2) to get
the union of the following sets as a
vector space basis (6) of ⟨Uaˉ⟩3:
X3DX3BX3C∩UX3U for U3,
X3DX3BY3DY3B
for
⟨Baˉ⟩3, and
{[x,y]:x∈X2C∩UX2U,y∈aˉ1orx∈Y2DY2Beˉ2e′ˉ2,y∈X1C∩UX1U}
{[[a1j,z],a1k]:j≤k,z∈X1C∩UX1U},
{[[x,a1j],y]:x≤y∈X1C∩UX1U}.
We can rewrite this vector space basis using the structure of Y2B and Y3B, as
described above:
X3DX3BX3C∩UX3U for U3,
X3DY3Deˉ3e′ˉ3 for ⟨Daˉ⟩3, and
{[x,y]:x∈Y2Deˉ2e′ˉ2,y∈X1BX1C∩UX1Uorx∈X2BX2C∩UX2U,y∈aˉ1}{[[a1j,z],a1k]:j≤k,z∈X1BX1C∩UX1U}{[[x,a1j],z]:x≤z∈X1BX1C∩UX1U}.
By Corollary 3.9 we get
[TABLE]
∎
We consider further consequences of Corollary 3.9.
Corollary 3.11**.**
*Let B and ⟨x⟩ with Ui(x) be finite graded 3-nilpotent Lie algebras. Let Z=Z1Z2Z3 be an ordered vectorspace basis of B.
If H is the ideal generated by x in D=B⊗⟨x⟩, then
it is freely generated by the following set X:*
- (1)
If U3(x),then X=X3={x}.
2. (2)
If U2(x), then X={x}∪{[z,x]:z∈Z1}.
3. (3)
If U1(x), then X={x}∪{[z,x]:z∈Z2}∪{[[z1,x],z2]:z1≤z2}.
The underlying vectorspace of D=B⊗⟨x⟩ is B⊕H. In case (1) and (2) X is also a vectorspace basis of H and in case (3)
X∪{[[x,z],x]:z∈Z1} is a vector space basis of H.
The algebraic background is well known. See e.g. [2].
Lemma 3.12**.**
Assume B∈K3, ⟨x⟩∈K3 with Ui(x), and D=B⊗⟨x⟩. Then
- (1)
B≤D, δ(D)=δ(B)+1.
2. (2)
D∈K3.
Proof.
As above let H be the ideal generated by x in D=B⊗⟨x⟩.
ad1)
Let B⊆E⊆D. Let Y be a generating o-system for B. Then B≃F(Y)/I and
D≅F(Yx)/⟨⟨I⟩⟩F(Yx). For E we choose
W in H such that YW is a generating o-system for E. Then E≅F(YW)/⟨⟨I⟩⟩F(YW).
Hence δ(B)≤δ(E), δ2(B)≤δ2(E), and δ(D)=δ(B)+1.
ad2)
Now we consider any E=⟨E1E2⟩⊆D. There is an o-system W over B∩E, that generates
E over E∩B. Then W extends every o-system for B∩E to a generating o-system for E. We have δ(E)=δ(B∩E)+∣W∣ .
∎
Definition 3.13**.**
Assume b,e∈B with Ui(b), Uj(e), and i<j≤c and there is no solution of
[b,x]=e in B. Such a pair b,e is called a divisor problem for B.
Definition 3.14**.**
B(e:b) is B⊗⟨x⟩ factorized by [b,x]=e.
We describe another way to define B(e:b) for B∈Kc.
Let ⟨bex⟩ be the graded Lie algebra defined by Uj−i(x), and [b,x]=e. Then ⟨bex⟩∈Kc, ⟨be⟩≤⟨bex⟩, and δ(⟨be⟩)=δ(⟨bex⟩). By Theorem 3.4
B⊗⟨be⟩⟨bex⟩ exists. It is B(e:b).
Now we consider again K3. As above we assume that Z is an ordered vector space basis of B. Let b be
the first element of Z and e the second. We use the description of B⊗⟨x⟩ above.
Let X− be the subset of all elements of X, where b does not occure. Let H− be the graded Lie algebra freely generated by X−.
Note that the underlying vectorspace of B(e:b) is B⊕H− and the Lie multiplication is given the Lie multiplication in B and in H− and by the action of B on H− in B⊗⟨x⟩ factorized by [b,x]=e.
Lemma 3.15**.**
Assume B∈K3, b∈Ui(B), e∈Uj(B), 1≤i<j≤3, and there is no solution of
[b,?]=e in B.
- (1)
B(e:b)≅B⊗⟨b,e⟩⟨b,e,x⟩, definded as above.
2. (2)
The underlying vector space of B(e:b) is B⊕H−. If j−i=2, then X− is also a vector space basis of H−. If j−i=1, then X−∪{[[x,z],x]:z∈Z1∖{b}} is a vectorspace basis of H−.
3. (3)
If E⊆B(e:b), then δi(E)≥δi(E∩B) and δ(E)≥min{2,o−dim(E)}.
4. (4)
B≤B(e:b), δ(B(e:b)=δ(B).
5. (5)
B(e:b)* is in K3.*
Proof.
ad (1) For every suitable A=⟨Ba⟩ with [b,a]=e there is a homomorphism h of B⊗⟨be⟩⟨bex⟩ onto A with h(B)=B pointwise and h(x)=a.
ad (2) is clear.
ad (3) D=B⊗⟨x⟩. Z, H , X , X−,and H− are defined as above. By definition B(e:b)=D/⟨⟨[x,b]−e⟩⟩.
Let E be a subspace of B(e:b).
If b∈/E, then there is a subset W, such that for every o-sytem V of B∩E
the set V∪W is a
generating o-system for E and δ(E)=δ(E∩B)+∣W∣. For δ2 use a similar argument.
The assertion is proved for this case.
Now we assume that b∈E. First we assume that there is an element d∈Uj−i(E)∖B. Then w.l.o.g.
d=x+c with c∈Uj−i(B). Then E=⟨(E∩B)dW⟩, where VW is an o-system for E,
if V is an o-system for ⟨(E∩B)d⟩. We get
δ(B∩E)+∣W∣)≤δ(E).
If o−dim(B∩E)=1, then B∩E=⟨b⟩. Then δ(E)=2+∣W∣.
Finally b∈E and Uj−i(E)=Uj−i(E∩B). By similar considerations as above δ(E)=δ(E∩B)+∣W∣. Similar considerations work for δ2.
(4) and (5) follow from (3).
∎
Lemma 3.16**.**
If B∈K2, then B(e:b) is in K2.
Lemma 3.17**.**
Assume A∩C=B are substructures in a 3-nilpotent graded Lie algebra M over a field. Furthermore we define for
c∈C that A+=⟨Ac⟩=A⊗B⟨Bc⟩ and
B+=⟨Bc⟩C. Then the following are equivalent:
- (1)
⟨AC⟩=A⊗BC.
2. (2)
⟨AC⟩=⟨A+C⟩=A+⊗B+C.
Proof.
Assume (1): A\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}}^{\otimes}_{B}C. By Mon we have A\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}}^{\otimes}_{\langle Bc\rangle}C. This is ⟨AC⟩=⟨A+C⟩=A+⊗B+C.
For the other direction we have A\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}}^{\otimes}_{\langle Bc\rangle}C and A\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}}^{\otimes}_{B}\langle c\rangle.
By **Trans ** we get A\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}}^{\otimes}_{B}C, as desired.
∎
We will apply the Lemma in K3, where [b,c]=e for homogeneous b,e in B.
4. 2-nilpotent graded Lie algebras
We work in K2. δ is δ2. In Lemma 2.8 submodularity for δ is shown.
Then Lemma 2.11 implies:
Lemma 4.1**.**
Let M be in K2.
Then for all substructures
A,C finite and E of M the following is true:
- (1)
If C≤M and E⊆M, then E∩C≤E.
2. (2)
If A≤C≤M, then A≤M.
3. (3)
If A,C≤M, then A∩C≤M.
4. (4)
If A≤kC≤M, then A≤kM.
Proof.
For (4) we need some proof. Assume A⊆E⊆M and o−dim1(E/A)≤k
or equivalently ldim(E1/A1)≤k. By (1) δ(E∩C)≤δ(E). Since
o−dim1(E∩C)/A)≤k, we have δ(A)≤δ(E∩C).
∎
The lemma implies the existence of CSS2(A) in M - the smallest strong subspace that contains A.
Lemma 3.16 implies that for every A∈K2 there is some A⊆C∈H2, such that
A≤C, δ(A)=δ(C), and C is obtained by free adjunction of divisors.
All results for c=2 in this paper are proved in [4], exept Lemmas 4.7 and
4.8. In [6] different proofs are given, using a general method developed in that paper, to obtain
the additive collaps. In both papers we work in H2.
Here we use K2. For c=2 there is no big difference between the two approches. But for greater c we have to start with Kc.
In this section we summarize some results from [4]. By Definition 2.15 B≤ldim(A/B)+nC means that δ(B)≤δ(E) for all B⊆E⊆C with lin−dim(E1/B1≤ldim(A/B)+n.
Theorem 4.2**.**
- (1)
K2* has the amalgamation property for strong embeddings.*
2. (2)
If A,B,C∈K2, B≤A,and B≤ldim(A/B)+nC, then there is an amalgam D of A and C over B in K2, such that C≤D and A≤nD. If no divisor problem in B has solutions in both A and C, then the free amalgam D=A⊗BC fulfils the assertion. In this case
δ2(D)=δ2(A)+δ2(C)−δ2(B).
Using this amalgamation we obtain the Fraïssé Hrushovski Limit M in the next theorem.
Theorem 4.3**.**
There is a countable structure M in K2, that satisfies the following condition:
**rich: **
If B≤A in K2 and there is a strong embedding f of B in M, then there is a strong extension of f that maps A into M.
M* is uniquely determined up to isomorphisms.*
If b∈M1 and e∈M2, then there exists B≤M with b,e∈B. Hence there is a strong embedding of B(e:b) over B into M. That means M is closed under homogeneous divisors and
M∈H2.
We speak about rich structures.
Theorem 4.4**.**
If M and N are rich K2-structures, ⟨aˉ⟩≤M, ⟨bˉ⟩≤N,
and ⟨aˉ⟩≅⟨bˉ⟩, then
[TABLE]
By the Theorem above there is a complete elementary theory T2 of all rich K2-structures.
T2=Th(M). Let T2(1) be an elementary description of K2 and
T2(2)**: **
For all n and all B≤A in K2 there is an elementary sentences saying that every
restricted by
(n+ldim(A/B)) strong embedding f of B in M can be extended to an restricted by n strong embedding of A in M.
The next theorem imlies that T2(1)∪T2(2) is an elementary axiomatization of T2.
Theorem 4.5**.**
- (1)
A rich K2-structure satisfies T2(1)∪T2(2).
2. (2)
Let M be a model of T2(1). M is rich if and only if M is an ω - saturated model of
T2(2).
Later we need the following:
Definition 4.6**.**
We work in some M∈K2. Let A, C, and N be substrucures, where A and C are finite.
- (1)
δ2(A/C)=δ2(⟨AC⟩)−δ2(C).
2. (2)
δ2(A/N)=min{δ2(A/C):C⊆N,Cfinite,⟨AC⟩∩N=C}.
Note that in (1) δ2(A/C) is not equal to
o−dim(A/C)−ideal−dim(A/C) in general.
In general we have:
o−dim(A/N)≤o−dim(A).
For B⊆A it holds o−dim(A)−o−dim(B)≤o−dim(A/B).
Lemma 4.7**.**
*Let M be a 2-nilpotent graded Lie algebra in K2. There exists a function h(n) such that:
We consider substructures C, A, and B=C∩A with o−dim(A/B)≤n and
δ2(A/C)≥0. Then there exist D, K, D∩K=H, and XC⊆C2∩⟨C1A1⟩
linearly independent over ⟨C1⟩2+⟨A1⟩2+B2, such that*
- (1)
B⊆H⊆D⊆C, D1=C1, C=⟨DXC⟩, K=⟨AH⟩, and
o−dim(H/B)≤h(n).
2. (2)
⟨CA⟩=⟨DA⟩=D⊗H⟨HA⟩.
3. (3)
We can define h(n)=(n+1)n.
Proof.
We define:
rA=ldim((⟨A1C1⟩2∩A2)/⟨A1⟩2+⟨C1⟩2,
rC=ldim((⟨A1C1⟩2∩C2)/⟨A1⟩2+⟨C1⟩2,
rB=ldim((⟨A1C1⟩2∩B2)/⟨A1⟩2+⟨C1⟩2, and
if ⟨A1C1⟩=F(A1C1)/I, then s=ldim(I/(I∩(F(A1)+F(C1)).
By Corollary 2.9 we get
δ2(⟨AC⟩)−δ2(C)=δ2(A)−δ2(B)−(rA+rC−rB+s).
Since δ2(A/C)≥0, we have δ2(A/B)≥0 and it is a bound for the size of
rA+rC−rB+s.
We consider an ideal basis {ψ1,…,ψs} of I over I∩(F(A1)+F(C1)).
Let
{ai1∈A1:1≤i≤k} be a vector basis for ⟨CA⟩1 over C1.
ψi has the following form:
[TABLE]
where bl∈C1 and ci∈F(C1)2. We add all the bl and ci to B and obtain H0.
Let d1,…,dr with r=rA+rC−rB be elements in ⟨A1C1⟩2 linearly
independent over ⟨A1⟩2+⟨C1⟩2, such that
d1;…,drB are in B2 , drB+1,…,drA are in A2 linearly independent over B2 and drA+1,…,dr are in C2 linearly independnet over B2 . For 1≤i≤rA
[TABLE]
where cl1∈C1, al1∈A1, ai2∈⟨A1⟩, and ci2∈⟨C1⟩. We add all these cl1
and ci2 to H0 and obtain H. Define {drA+1,…,dr}=XC. We choose YC⊆C2 maximal linearly independent over ⟨C1A1⟩2 and define D=⟨C1HYC⟩. By Corollary 3.8
it follows the assertion:
[TABLE]
We have added (k+1)×(s+rA) many elements to B. k+1≤n+1 and s+rA≤δ2(A)−δ2(B)≤o−dim(A)−o−dim(B)≤o−dim(A/B)≤n.
∎
Lemma 4.8**.**
*Let M be a 2-nilpotent graded Lie algebra in K2.
We consider finite substructures C, A, and B=C∩A with o−dim1(A/B)=n and
C≤M. Then there exists D, H, K,
and XCXBXA, such that*
- (1)
H⊆D⊆C*, B1⊆H, D1=C1,
D∩K=H and *
o−dim(H/B)≤h(n)=(n+1)×n,
2. (2)
H⊆K⊆⟨HA⟩, K1=⟨HA⟩1,
3. (3)
⟨CA⟩=⟨DK⟩=D⊗H⟨K⟩,
4. (4)
XCXBXA⊆⟨C1A1⟩2* is linearly independent over
⟨D1⟩2+⟨K1⟩2,
XB⊆B2, ⟨HXB⟩=⟨HB⟩,*
5. (5)
XC⊆C2, ⟨DXBXC⟩=C, and
6. (6)
XA⊆A2, ⟨KXBXA⟩=⟨HA⟩.
Proof.
We use the following subalgebras of ⟨CA⟩:
B0=⟨B1,(B2∩(⟨C1⟩2+⟨A1⟩2)),YB⟩,where
YB is a maximal subset of B2 linearly indepentent over ⟨C1A1⟩2.
C0=⟨C1,B0,YB,YC⟩, where YC is a maximal subset of C2 linearly independent
over ⟨C1A1YB⟩2.
A0=⟨A1,B0,YB,YA⟩, where YA is a maximal subset of A2 linearly independent
over ⟨C1A1YB⟩2. Furthermore
XB is a maximal subset of B2∩⟨C1A1⟩2 linearly independent over
B2∩(⟨C1⟩2+⟨A1⟩2).
XC is a maximal subset of C2∩⟨C1A1⟩2 linearly independent over
C2∩(⟨C1⟩2+⟨A1⟩2+XB).
XA is a maximal subset of CA∩⟨C1A1⟩2 linearly independent over
A2∩(⟨C1⟩2+⟨A1⟩2+XB). Then
B=⟨B0XB⟩, C=⟨C0XBXC⟩, and A=⟨A0XBXA⟩.
Since ⟨CA⟩=⟨C0A0⟩ and δ2(C)=δ2(C0)+∣XBXC∣, we have 0≤δ2(A/C)≤δ2(A0/C0). Furthermore C0∩A0=B0.
Then we get as in the proof of
Lemma 4.7
[TABLE]
where s is obtain as above:
If ⟨A1C1⟩=F(A1C1)/I, then s=ldim(I/(I∩(F(A1)+F(C1)).
Since C≤M, we have ⟨C1⟩≤M. Then
[TABLE]
Hence s≤lin−dim(A1/B1).
As above we add at most (lin−dim(A1/B1)+1)×s many elements from C0 to B0 to obtain
H0 such that
[TABLE]
We define H=H0, D=⟨C0H⟩, and K=⟨HA0⟩ and obtain
⟨DK⟩=D⊗HK.
By construction o−dim(H/B)≤(n+1)n.
∎
5. The functor F
If A is in Kc, then A∗=A/Ac is in Kc−1 and the canonical homomorphism
∗ of A onto A∗ is injectiv on A1⊕…⊕Ac−1 Let τ be this injectiv
map of A1⊕…⊕Ac−1 onto A∗. Let F(X) be the free graded c-nilpotent Lie algebra over K freely generated by an o-system X , where Xc=∅. Then F(X)∗ is the free
graded (c-1)-nilpotent Lie algebra over K freely generated by τ(X).
Now we assume, that A∈Kc−1, F(X)∈Kc where τ(X)
corresponds to a
generating o-system of A
and Xc=∅. Then A=F(X)∗/I for some
I in F(X)∗. That means
F(X)∗,I is the canonical pair for A in Kc−1.
Let J be the ideal in F(X) generated by τ−1(I). We define:
Definition 5.1**.**
F(A)=F(X)/J.
Let B∈Kc and B=⟨B1,…,Bc−1⟩. If A∈Kc−1 and A=B∗, then there is a homomorphism of F(A) onto B. In the case A∈K2 A∗ is a vector space and F(A∗) is the free 2-nilpotent Lie algebra over A∗.
F is a functor from Kc−1 with embeddings into Kc with homomorphisms. Let B and A be in Kc−1 and
f:B→A be an embedding. W.l.o.g. B is a substructure of A :
We consider the canonical pair F(X)∗,I for A as above. By Lemma2.13 there exits a subalgebra H of F(X)∗ such that H,I∩H is the canonical pair for B. Let K be the subalgebra of F(X) generated by τ−1(H). Then
F(B)=K/JB and F(A)=F(X)/J where JB=⟨⟨τ−1(I∩H)⟩⟩K and
J as above. Then (JB)i=Ji∩Ki for i<c and (JB)c⊆(Jc∩Kc).
This gives the desired homomorhism F(f) of F(B) into F(A).
For c=2 this is an embedding.
Already for c=3 there are examples where F(f) is not an embedding. See [1]. This causes a lot of efforts.
We use the notation γBA for F(f).
Consicer A∈Kc.
Let A− be ⟨A1⊕…⊕Ac−1⟩A. Then there is some N(A)⊆F(A∗)c, such that A−=F(A∗)/N(A). Hence
[TABLE]
Furthermore M∈Kc implies F(M∗)∈Kc: This is a consequence of the next inequality.
We consider Ai as subspace in Mi and in F(M∗)i. Then
[TABLE]
For δ2 submodularity is true
(Lemma 2.8). For A∈Kcfin and A=⟨0⟩ we have δ2(A)>0. Assume A⊆M∈Kc. By Corollary2.12 ⋂{C:A⊆C≤2M}
exists. It is the smallest 2-strong substructure of M, that contains A. We call it CSS2M(A) or
short CSS2(A).
Lemma 5.2**.**
Assume D≤2M∈Kc and XY is a vector space basis of D2
over ⟨D1⟩. Then ⟨D1X⟩≤2M. Especially
⟨D1⟩≤2M.
Proof.
Assume
⟨D1X⟩⊆E. There is Y0⊆Y linearly independent over E2,
such that D2=⟨(D2∩E2)Y0⟩lin. Then
[TABLE]
and
[TABLE]
Hence
[TABLE]
∎
In the next lemma we describe the structure of CSS2(A) for A∈K2:
Lemma 5.3**.**
Let B be a substructure of M∈K2.
Then CSS2(B)=D=⟨D1B2⟩ and the following is true:
- (1)
B1⊆D1, B2⊆D2 and ⟨D1⟩≤2M.
2. (2)
CSS2(⟨B1⟩)=C=⟨C1⟩≤2M* and C1⊆D1.*
3. (3)
If C1=D1, then
[TABLE]
Proof.
(1) is true by Lemma 5.2 and the definitions.
The first statement of (2) follows again from Lemma 5.2. If C1⊆D1, then
[TABLE]
by Lemma 2.8. Then
[TABLE]
since B1⊆C1∩D1, a contradiction.
If the inequality in (3) is not true, then D=⟨C1B2⟩.
∎
Lemma 5.4**.**
Let A be a 2-nilpotent graded Lie algebra with A∈K2.
Assume that X⊆A1 is a vector space basis of A1 and Y⊆A2 is a
vector space basis of A2 over
⟨X⟩2. We consider X and Y also as subsets in F(A).
Then ⟨XY⟩3F(A) is freely generated over ⟨X⟩3F(A) by
{[x,y]:x∈X,y∈Y}. In other words
F(A)=⟨XY⟩F(A)=⟨X⟩F(A)⊗⟨Y⟩F(A).
In this paper we mainly consider the case c=3.
The next Theorem gives an upper bound for the size of the kernel of γBA for A,B in K2fin. It is essentially in [1].
Theorem 5.5**.**
Let B⊆A be 2-nilpotent graded Lie algebras in K2fin, where F(A)∈K3. Then
**a): **
If B≤2A, then γBA is an embedding of F(B) into F(A).
**b): **
If A=CSS2A(B) and B=A, then ldim(ker(γBA))<δ2(B)−δ2(A).
We need the Theorem for
B=C∗ and A=D∗ where C⊆D in K3. Then we have F(A)∈K3. First we prove:
Lemma 5.6**.**
*Let ⟨E1,a⟩=A be in K2fin, where a∈A1∖E1. Let F(A1) be the free
3-nilpotent graded Lie algebra over the vectorspace A1.
Furthermore A=F(A1)∗/I.
Assume that
C1⊆E1⊆A1,
c1,…,cn is a vector space basis of C1, such that [ci,a]+ψi with
ψi∈F(E1)2 build a vector space basis of
I over F(E1)2∗. Let N2(C) be I∩⟨C1⟩2.
If n=1, then ldim(ker(γEA))=0. Otherwise*
[TABLE]
Proof.
By assumption A=⟨A1⟩ and E=⟨E1⟩ in K2fin.
Mainly we work in F(A1) the free graded 3-nilpotent Lie algebra over K freely generated by A1.
In F(A1) we use the same notation for the τ−1-images of subsets and elements in F(A1)∗, as
e.g. I and [ci,a]+ψi.
Then F(A)=F(A1)/J, where
J=⟨⟨ I⟩⟩F(A1). The non-zero elements of ker(γEA)⊆F(E1)3 have preimages μ∈J3∩⟨E1⟩3F(A1) that are not in
⟨⟨I∩F(E1)⟩⟩F(E1), where F(E1) is
considered as a subalgebra of F(A1). W.l.o.g.
[TABLE]
where ei∈A1 and θ∈I2∩E2. Since cancellation of [a,[ci,a]] is impossible, we have that ei∈E1. Furthermore ei∈C1. Otherwise [ei,[ci,a]] cannot be killed by monomials
[a,[ci,ei]]. Hence
[TABLE]
We have i=j, since we cannot cancel [ci,[ci,a]]. Since all monomials with a have to vanish, we get
[TABLE]
Then it follows that the θμ are in I2∩⟨C1⟩.
Let s be the linear dimension of ker(γEA).
If n=1, then there is no μ and s=0. If we have s many linearly independent elements in ker(γEA), then we have s such μ as above linearly independent over ⟨⟨I2∩E2⟩⟩F(E1). Hence the
[TABLE]
are linearly independent and therefore also the θμ. By the definition of K2
and since 2≤n, we have
δ2(⟨C1⟩)≥2. Therefore s<n−1 and ldim(ker(γEA)=s<n−1=δ2(B)−δ2(A).
∎
Now we show Theorem 5.5
Proof.
First we show, that it is sufficient to consider ⟨B1⟩⊆⟨A1⟩.
We assume that the assertion is true in this case and A=B.
Case a) By Lemma 5.2 we have ⟨B1⟩≤2A. Hence by assumption the
homomorphism of
F(⟨B1⟩) into F(⟨A1⟩) is an embedding.
By Lemma 5.4 we can consider F(⟨A1⟩) as a substructure of F(A) .
This is the first step of an induction on o−dim2(B) to show Case a). We can assume that B1=⟨0⟩, since n linearly independent elements in any F(A)2 generate a substructure
D with D1=⟨0⟩, D2 is a vector space with a basis of n elements, and
D3=⟨0⟩.
For the induction we consider ⟨Bb⟩≤A with b∈A2∖B and the canonical
homomorphism γ of F(B) into F(A) is an embedding. By Lemma 5.4
⟨Bb⟩=B⊗⟨b⟩. We distingush the following:
- i)
There are c∈B1 and a∈A1 such that [c,a]=b.
Then ⟨Ba⟩≤A. By induction there is an embedding γ+ of F(⟨Ba⟩) into F(A) that extends γ. Furthermore we get
⟨Ba⟩=⟨Bb⟩⊗⟨c,b⟩⟨c,a⟩.
Then F(⟨b,c⟩) can be considered as a substructure of F(⟨c,a⟩) and of
F(⟨Bb⟩) since ⟨Bb⟩=B⊗⟨b⟩.
We see easily
F(⟨Ba⟩)=F(⟨Bb⟩)⊗F(⟨bc⟩)F(⟨c,a⟩). Hence we obtain an embedding of F(⟨Bb⟩) into
F(⟨Ba⟩) and then into F(A).
2. ii)
There are no c∈B1 and a∈A1 with [c,a]=b.
By assumption there is some c∈B1. We fix some new element a with U1(a),
[c,a]=b, and define
B+=⟨Bb⟩⊗⟨c,b⟩⟨a,c,b⟩ and
A+=A⊗⟨c,b⟩⟨a,c,b⟩.
Then B+≤A+.
By induction there is an embedding of F(B+) into F(A+). As above we can show that
F(⟨Bb⟩) and
F(A) can be considered as substructures of F(B+) and F(A+) respectively.
Case b)
Since A=CSS2(B) we have A=⟨A1B⟩. We assume B=⟨B1Y⟩,
where Y={y1,…,yn} is a vector space basis of B2 over ⟨B1⟩.
By induction we define the structure ⟨zyixi⟩ by U1(xi),
U1(z), and [z,xi]=yi.
Furthermore let C be ⊗⟨z⟩1≤i≤n⟨zxiyi⟩. We define
B+=C⊗⟨y1,…,yn⟩B and
A+=C⊗⟨y1,…,yn⟩A. Then
B+⊆A+, δ(B+)=δ(B)+1, and δ(A+)=δ(A)+1.
B≤⟨Bz⟩≤…≤⟨Bzx1…xi⟩ and
A≤⟨Az⟩≤…≤⟨Azx1…xi⟩. Hence B≤B+ and A≤A+. By a) we can assume that F(B)⊆F(B+) and F(A)⊆F(A+).
We can apply the assumption since B+=⟨B1+⟩, A+=⟨A1+⟩,
and CSSA+(B+)=A+. Hence
[TABLE]
Now we assume B=⟨B1⟩ and A=⟨A1⟩. We use induction on ldim(A1/B1):
Case 1) ldim(A1/B1)=1
We use Lemma 5.6. Let B be E.
ad a) Since B≤2A, we have n≤1. By Lemma 5.6 ldim(ker(γBA))≤0, as desired.
ad b) Again by Lemma 5.6 ldim(ker(γBA))<n−1=δ2(B)−δ2(A).
Now we distinguish two cases for the induction step.
Case 2) There is some D=⟨D1⟩ such that B⊆D⊆A, B=D=A, and δ2(A)≤δ2(D)≤δ2(B).
ad a) Since B≤2A we have δ2(B)=δ2(D)=δ2(A). Then B≤2D and D≤2A.
By induction γBD and γDA are embeddings. Hence γBA is an embedding.
ad b) We choose D1 minimal with the properties of Case 2). We have A=CSS2A(D) and δ2(A)<δ2(D). By the minimality of D we get either δ2(D)<δ2(B) and CSS2D(B)=D or δ2(D)=δ2(B) and B≤2D. By induction for a) and b) we have
[TABLE]
[TABLE]
Then
[TABLE]
Case 3) For all D with D=⟨D1⟩ such that B⊆D⊆A, and B=D=A, δ2(D)<δ2(A) or δ2(B)<δ2(D).
Case 3.1 For some D as above δ2(D)<δ2(A). This is only possible in a). We choose such a D1 maximal. Then B≤2D and
D≤2A. The assertion follows by induction.
Case 3.2) For all D with D=⟨D1⟩ such that B⊆D⊆A, and B=D=A, we have δ2(D)≥δ2(A) and δ2(B)<δ2(D).
If for some D0 with D0=⟨D10⟩ such that B⊆D0⊆A, and B=D0=A we have δ2(D0)=δ2(A), then we are in a) and D0≤2A . We apply
induction.
Finally we can assume that for all D with D=⟨D1⟩ such that B⊆D⊆A, and B=D=A we have δ2(A)<δ2(D) and δ2(B)<δ2(D).
Then δ2(A)≤δ2(B), since otherwise δ2(Bd)≤δ2(A) for every d∈A1∖B1.
Note that δ2(Bd)≤δ2(B)+1.
Now we choose B1⊆E1 and a∈A1∖E1 such that ⟨E1a⟩=A. Hence by assumption δ2(A)<δ2(E). We will show that
ldim(ker(γBA))≤max{0,δ2(B)−δ2(A)−1}. Then a) and b) follow. Note that in a)
δ2(B)=δ2(A).
As in Lemma 5.6
we assume that
C1⊆E1, c1,…,cn is a vector space basis of C1, such that [ci,a]+ψi with ψi∈F(E1)2 is a basis of
I over F(E1)2∗, where A=F(A1)∗/I. Now we work in F(A1).
As above we use the same notations for subsets and elements of F(X) as for their τ-images in F(X)∗.
Define J=⟨⟨I⟩⟩F(A1) as above.
For every D=⟨D1⟩ with D1⊆A1 we use
N2(D) for I2∩⟨D1⟩2. W.l.o.g. we assume, that there is some m, such that c1,…,cm∈B1 and
cm+1,…,cn are linearly independent over B1. Furthermore let cm+1,…,cn,e1,…,erbe a basis of E1 over B1. For B1 we choose a basis that extends
c1,…,cm.
First we assume that 0<r. We order our basis of E1, as given above, in such a way that x<er for
all x=er. The set of all [x,y] with y<x is a vector space basis of ⟨E1⟩2. Hence
all monomials [x,er], where x=er, are in this basis.
We consider the occurence of monomials [x,er] in the ψi.
We show that they do not occure and apply induction. We consider the [ci,a]+ψi.
After linear transformations we can assume w.l.o.g. that there are
1≤lb≤m+1, m+1≤la≤n+1, and χi=[xi,er]
with xi from the vector basis of E1 for lb≤i≤m and la≤i≤n that are linearly independent such that :
**: **
In ψi for 1≤i<lb no χj occures.
**: **
For lb≤i≤m χi occures in ψi and not in ψj for j=i..
**: **
In ψi for m+1≤i<la no χj occures.
**: **
χj for la≤j≤n occures in ψj and does not occure in ψi for m+1≤i≤n with
i=j.
As in Lemma 5.6 we consider the preimage μ in F(A1) of an element in ker(γEA).
As in the proof of that lemma we get
[TABLE]
If ri,jμ=0 for some lb≤i≤m, then χi cannot be canceled. Otherwise lb=m+1.
If in this case ri,j=0 for some la≤i≤n, then χi cannot be canceled. Hence if μ represents an element of ker(γBA), then it is impossible that er occures in some ψi with
ri,jμ=0 for some j. Let E(−) be generated by B1 and cm+1,…,cn,e1,…,er−1 and A(−)=⟨E(−)1a⟩. We have shown, that ker(γBA)=ker(γBA(−)). By the
final assumption of Case 3.2)
B≤2A(−) and by induction ker(γBA(−))=0. The assertion is shown.
It remains the case where E1=B1,cm+1,…,cn. By Lemma 5.6
ldim(ker(γEA))≤k<n−1, where k=ldim(N2(C)).
Then 0<m, since otherwise no μ
as above can represent an element of ker(γBA). First we assume that 2≤m.
Let kb be ldim(N2(c1,…,cm)) and
ka=k−kb. Since B≤2E γBE is an embedding by induction. Hence in F(E) we have
ker(γBA)⊆(kerγEA).
Since E1 is generated by cm+1,…,cn over B1, we have
[TABLE]
[TABLE]
We will use:
[TABLE]
[TABLE]
and since 2≤m,
[TABLE]
It follows
[TABLE]
It remains the case m=1. We use the proof of Lemma 5.6
and show that
ker(γBA)=⟨0⟩.
The preimage of a
nontrivial element in ker(γBA)⊆F(B)⊆F(E) in F(⟨A1⟩) has the form
[TABLE]
Then the image of μ in F(B) has the form [c1,d], where d∈F(B)2.
This is impossible since F(A) is K3.
Therefore it has no homogeneous zero-divisors.
∎
Corollary 5.7**.**
Let D be a 3-nilpotent graded Lie algebra in K3.
- (1)
If B⊆D , A=CSS2D(B) , and B=A, then δ(A)<δ(B).
2. (2)
For graded Lie algebras M in K3 we can define B≤M, if δ(B)≤δ(A) for all B⊆A⊆M.
Proof.
ad(1)
We can assume D=A.
Note that o−dim3(D)≤o−dim(B).
In F(D∗) we have γB∗D∗(N3(B))⊆N3(D) and
[TABLE]
By Theorem 5.5 ldim(ker(γB∗D∗))<δ2(B)−δ2(D). Hence
[TABLE]
[TABLE]
[TABLE]
(2) follows from (1).
∎
Lemma 5.8**.**
Assume A≤nM∈K3 and A⊆C⊆D with o−dim(D∗/A∗)≤n. Then
δ(A)≤δ(C).
Proof.
We can assume w.l.o.g.
that D=⟨D1D2A3⟩.
By Corollary 5.7 δ(CSS2D(C))≤δ(C). Hence w.l.o.g. C≤2D.
Then
F(C∗) can be considered as a subspace of F(D∗). We have C−=F(C∗)/NC
and D−=F(D∗)/ND. Then ldim(NC)≤ldim(ND).
If o−dim(C∗/A∗)≤n, then we are done. Otherwise we show δ(A)≤δ(C).
Let
X=X2C(A)X2C(C) be a vector space basis of C2 over ⟨C1⟩2, where
X2C(A) is a vector space basis of A2 over ⟨C1⟩2
and X2C(C) is a vector space basis of C2 over ⟨C1A2⟩2. Let X3C be a vector space basis of C3 over C3−. Now
[TABLE]
Furthermore
[TABLE]
where X2D(A) is a vector space basis of A2 over ⟨D1⟩2,
X2D(D) is a vector space basis of D2 over ⟨D1A2⟩2 and X3D
is a vector space basis of D3 over D3−.
Then ∣X3C∣≥∣X3D∣
and ∣X2D(A)∣≤∣X2C(A)∣. By assumption
[TABLE]
Hence δ(D)≤δ(C).
∎
Corollary 5.9**.**
Assume M∈K3. A≤nM if and only if δ(A)≤δ(C) for all A⊆C⊆M, that are contained in some D⊆M with o−dim(D∗/A∗)≤n.
6. submodularity and amalgamation for K3
From now on we concentrat on 3-nilpotent graded Lie algebras.
Lemma 6.1**.**
We work in a 3-nilpotent graded Lie algebra M∈K3.
Assume C∩A=B and ⟨CA⟩∗=C∗⊗B∗A∗, α is the the canonical homomorphism of F(B∗) into F(A∗), and γ the canonical homomorphism of F(B∗) into F(C∗). We identify F(B∗)/⟨ker(α),ker(γ)⟩ with the isomorphic substructures in F(A∗)/α(ker(γ)) and in F(C∗)/γ(ker(α)). Then
[TABLE]
The isomorphism is given by the fact, that we can identify the ∗-images of both sides.
Proof.
If we apply ∗ to the right side, then the result is isomorphic to ⟨CA⟩∗. Hence there is a homomorphism h from the left side onto the right side.
Conversely there are homomorphisms f of F(C∗)/γ(ker(α)) and g of
F(A∗)/α(ker(γ)) into F(⟨AC⟩∗). f and g coincide on the intersection isomorphic to
F(B∗)/⟨ker(α),ker(γ)⟩. Hence there is a homomorphism k of the right side onto the left side. Since the ∗-images h∗=(k∗)−1 are isomorphisms we get the assertion. Note that
we have F(E∗)=⟨F(E∗)1F(E∗)2⟩F(E∗).
∎
Corollary 6.2**.**
*We are in the setting of Lemma 6.1.
Let X1a be an ordered vector space basis of A1 over B1 ,
X1c be an ordered vector space basis of C1 over B1,
X2a be a vector space basis of A2 over B2, and
X2c be a vector space basis of C2 over B2. Then*
- (1)
{[x,y]:x∈X1c,y∈X1a}* is a vector space basis of F(⟨CA⟩∗)2 over
C2+A2,*
2. (2)
[TABLE]
[TABLE]
[TABLE]
is a vectorspace basis of F(⟨CA⟩∗)3 over ⟨C1C2⟩3F(⟨CA⟩∗)+⟨A1A2⟩3F(⟨CA⟩∗).
The Corollary is a consequence of Lemma 6.1, Corollary 3.7, and
Corollary 3.9.
Lemma 6.3**.**
Let M be a 3-nilpotent graded Lie algebra in K3 and A and C are finite substructures of M with
A≤2M and C≤2M.
Then
[TABLE]
Proof.
Let B be A∩C.
By Lemma 2.8 we have
**1): **
δ2(⟨AC⟩≤δ2(A)+δ2(C)−δ2(B).
We can assume w.l.o.g. that M=⟨AC⟩. Let M−=⟨M1M2⟩ be isomorphic to F(M∗)/N, where N⊆F(M∗)3.
Furthermore we define
[TABLE]
Since A≤2M and C≤2M,
we have A∩C≤2M by Lemma 4.1. Hence we can consider
F(A∗),F(C∗),F(A∗∩C∗)=F(B∗) as substrucures of F(M∗)
by Theorem 5.5.
Since F((B∗)i=F(A∗)i∩F(C∗)i for i=1,2, there is an homomorphism of F(B∗) onto F(A∗)∩F(C∗). Hence F(B∗)=F(A∗)∩F(C∗).
Under these assumptions we have N(A)=N∩F(A∗)3, N(C)=N∩F(C∗)3, and
N(B)=N∩F(B∗)3.
Then N(C)∩N(A)=N(B). We get:
**2): **
ldim(N(⟨AC⟩))≥ldim(N(A))+ldim(N(C))−ldim(N(B))+r.
where r is the linear dimension of all ψa+ψb in N(⟨AC⟩) over N(A)+N(C) with
ψa∈F(A∗)3 and ψb∈F(C∗)3 .
Now we have to compute the o−dimensions3. In M3 we define:
**: **
X30(B) is a vector basis for ⟨C1C2⟩3∩⟨A1A2⟩3 over ⟨B1B2⟩3.
**: **
X3A(B) is a vector basis for ⟨A1A2⟩3∩C3 over ⟨B1B2⟩3+⟨X30(B)⟩.
**: **
X3C(B) is a vector basis for ⟨C1C2⟩3∩A3 over ⟨B1B2⟩3+⟨X30(B)⟩.
**: **
X31(B) is a vector basis for B3∩⟨A1A2C1C2⟩3 over
⟨B1B2⟩3+⟨X30(B)X3A(B)X3C(B)⟩.
**: **
X32(B) is a vector basis of B3 over ⟨A1A2C1C2⟩3.
Note that X3A(B)∪X3C(B) is linearly independent over ⟨B1B2⟩2+⟨X30(B)⟩3.
Now B3 has the following vector space basis X3(B) over ⟨B1B2⟩3:
[TABLE]
Let X31(A) and X31(C) be choosen such that
**: **
X3C(B)X31(B)X31(A) is a vector basis of A3∩⟨A1A2C1C2⟩3 over ⟨A1A2⟩2.
**: **
X3A(B)X31(B)X31(C) is a vector basis of C3∩⟨A1A2C1C2⟩2
over ⟨C1C2⟩2.
Choose X32(A) and X32(C) such that
**: **
X3(A)=X3C(B)X31(B)X32(B)X31(A)X32(A) is a vector basis of A3 over ⟨A1A2⟩3.
**: **
X3(C)=X3A(B)X31(B)X32(B)X31(C)X32(C) is a vector basis of C3 over ⟨C1C2⟩3.
Then X3(AC)=X32(B)X32(A)X32(C) is a vector basis of ⟨AC⟩3 over ⟨A1A2C1C2⟩3.
It follows:
**3): **
o−dim3(A)+o−dim3(C)−o−dim3(B)=
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
Since ∣X30(B)∣=r, 1), 2), and 3) imply
[TABLE]
∎
If we repeat the proof above without the assumptions C≤2M and A≤2M, then we obtain that
δ(A)+δ(C)−δ(B)−δ(⟨AC⟩) is the sum of the following summands:
- Σ1
δ2(A)+δ2(C)−δ2(B)−δ2(⟨AC⟩)
2. Σ2
∣X31(B)X31(A)X31(C)∣
3. Σ3
ldim(N)+ldim(N(B))−ldim(N(C))−ldim(N(A))−∣X30(B)∣.
In this general case we have 0≤Σ1 by Lemma 2.8. If Σ3≥0, then we have subadditivity.
We use this remark to get the following:
Lemma 6.4**.**
*Let M be a 3-nilpotent graded Lie algebra in K3, M=⟨CA⟩,
C∩A=B, and B≤2A.
We choose XB as a maximal subset of B2∗∩⟨C1A1⟩2 linearly independent over
⟨C1⟩2+⟨A1⟩2. Then let
XC be maximal subset of C2∗∩⟨C1A1⟩2 that is linearly independent over
⟨C1⟩2+⟨A1⟩2+⟨XB⟩2, and
XA be maximal subset of A2∗∩⟨C1A1⟩2 that is linearly independent over
⟨C1⟩2+⟨A1⟩2+⟨XB⟩2.
Furthermore there are D⊆C∗
H⊆B∗, K⊆A∗
such that*
- (1)
B∗=⟨HXB⟩, C∗=⟨DXBXC⟩,
A∗=⟨KXBXA⟩,
2. (2)
XB* is linearly independent over H2,*
XBXC* is linearly independent over D2,*
XBXA* is linearly independent over K2,
and*
3. (3)
⟨C∗A∗⟩=⟨DK⟩=D⊗HK.**
Then
- (1)
δ(⟨CA⟩)≤δ(C)+δ(A)−δ(B).
2. (2)
If ∣XCXBXA∣>0,
then δ(⟨CA⟩)<δ(C)+δ(A)−δ(B).
3. (3)
If C≤⟨CA⟩, then B≤A.
4. (4)
If C∗=D, B∗=H, A∗=K, B≤A, and ⟨CA⟩=C⊗BA,
then δ(⟨CA⟩)=δ(C)+δ(A)−δ(B) and C≤⟨CA⟩.
5. (5)
If C∗=D , B∗=H, A∗=K, B≤A, and δ(⟨CA⟩)=δ(C)+δ(A)−δ(B), then ⟨CA⟩=C⊗BA.
Proof.
Note that XBXCXA is linearly independent over D2+K2.
ad (1) We use the remark below Lemma 6.3.
We have only to show that 0≤Σ3.
By Lemma 6.1 we get
[TABLE]
where γ is the homomorphism of F(H) into F(D). Note that B≤2A implies
⟨HXB⟩≤2⟨KXB⟩. By Lemma 5.2 we get
H≤2K. Therefore we can consider F(H) as a substructure of F(K)
and F(B∗) as a substructure of F(A∗) by Theorem 5.5.
By Theorem 4.2 D≤2⟨DK⟩. Hence we consider F(D) as a
substructure of F(⟨DK⟩). Furthermore
we consider substructures of M∗ as subspaces of F(M∗):
We can rewrite (⊗) as
[TABLE]
where ⟨H⟩F(⟨DK⟩≅F(H)/ker(γ) and ⟨K⟩F(⟨DK⟩)≅F(K)/ker(γ).
By assumption XBXCXA is also linearly independent over D2+K2. Hence by
Lemma 5.4 and (⊗) we get that
(⊗⊗)
[TABLE]
where ⟨HXB⟩F(⟨DK⟩)=⟨H⟩F(⟨DK⟩)⊗⟨XB⟩F(⟨DK⟩)=⟨B∗⟩F(⟨DK⟩)≅F(B∗)/ker(γ),
⟨DXBXC⟩F(⟨DK⟩)=⟨D⟩F(⟨DK⟩)⊗⟨XBXC⟩F(⟨DK⟩)=⟨C∗⟩F(⟨DK⟩)≅F(C∗),
⟨KXBXA⟩F(⟨DK⟩)=⟨K⟩F(⟨DK⟩)⊗⟨XBXA⟩F(⟨DK⟩)=⟨A∗⟩F(⟨DK⟩)≅F(A∗)/ker(γ).
As in the proof of Lemma 6.3 we define ⟨CA⟩−=F(⟨C∗A∗⟩)/N,
C−=F(C∗)/N(C), B−=F(B∗)/N(B), and A−=F(A∗)/N(A). By (⊗⊗)
[TABLE]
where M(B) is the image of N(B)/ker(γ) in
⟨HXB⟩3F(⟨DK⟩) ,
M(C) is the image of N(C) in ⟨DXBXC⟩3F(⟨DK⟩),
M(A) is the image of N(A)/ker(γ) in ⟨KXBXA⟩3F(⟨DK⟩),
and
U is generated by a maximal number r=∣X30(B)∣ of ψC+ψA∈N, where
the ψC∈⟨C1C2XBXC⟩3 are linearly independent over M(C)3, and the
ψA∈⟨K1K2XBXA⟩3 are linearly independent over M(A)3.
Note that ldim(N(B)∩ker(γ))=ldim(N(A)∩ker(γ))=s.
Since s will be canceled we get 2) as above:
[TABLE]
Hence 0≤Σ3.
ad (2) If ∣XCXBXA∣>0, then Σ1>0
ad (3)
We have B≤2A by assumption. Then (1)
and C≤⟨CA⟩ imply 0≤δ(A/C)≤δ(A/B).
To prove the assertion choose B⊆E⊆A.
We have to show that ⟨CE⟩ satisfies the assumptions of the Lemma. We have
B≤2E. We choose XE as a subset of ⟨C1E1⟩∩E2 maximal linearly independent over ⟨C1⟩2+⟨E1⟩2+⟨XB⟩.
Note that we work in M∗. Let
K(E) be K∩E∗. Then we have E1=K(E)1 and ⟨DK(E)⟩=D⊗HK(E) by Mon.
Choose Y⊆E2 maximal linearly independent over ⟨K(E)2XBXE⟩.
and define KE=⟨K(E)Y⟩. Then ⟨KEXBXE⟩=E∗ and also
[TABLE]
Hence the assumptions of the Lemma are fulfilled and we get by (1) δ(⟨CE⟩)≤δ(C)+δ(E)−δ(B). Since C≤⟨CE⟩ we get the assertion for E.
ad (4)
As in (1) we use the remark below the proof of Lemma 6.3. We have ⟨C∗A∗⟩=C∗⊗B∗A∗. By Corollary 3.8 this implies δ2(⟨CA⟩)=δ2(C)+δ2(A)−δ2(B). This means Σ1=0. By Corollary 3.9 we get ∣X31(B)X31(C)X31(A)∣=0.
Hence Σ2=0.
As in the proof of (1) we have
[TABLE]
where ⟨C∗⟩F(⟨C∗A∗⟩)≅F(C∗), since C∗≤2C∗⊗B∗A∗,
⟨B∗⟩F(⟨C∗A∗⟩)≅F(B∗)/ker(γ), and
⟨A∗⟩F(⟨C∗A∗⟩)≅F(A∗)/ker(γ),
where γ is the homomorphism of F(B∗) into F(C∗) and w.l.o.g.
F(B∗)⊆F(A∗) by B∗≤2A∗.
Since ⟨CA⟩=C⊗BA we get similarly as in (1)
[TABLE]
where
M(C), M(B), and M(A) are the preimages of N(C), N(B), and N(A) respectively in
F(⟨C∗A∗⟩).
U is generated by r=∣X30(B)∣ many ψC+ψA∈N, where the
ψC∈⟨C1C2⟩3 are linearly independent over M(C), and
the ψA∈⟨A1A2⟩3 are linearly independent over M(A).
Then ldim(N(C))=ldim(M(C)), ldim(N(B))=ldim(M(B))+s, and ldim(N(A))=ldim(M(A))+s,
with s=ldim(ker(γ)∩N(B))=ldim(ker(γ)∩N(A)).
Hence
[TABLE]
With other words Σ3=0. We obtain
δ(⟨CA⟩)=δ(C)+δ(A)−δ(B).
We use this to show C≤⟨CA⟩.
For C⊆E⊆C⊗BA we have to show δ(C)≤δ(E).
By Mon ⟨C(E∩A)⟩=C⊗B(E∩A).
Then δ(C⊗B(A∩E))≤δ(E) by Corollary 3.9. Hence
it is suficient to consider the case
E=C⊗B(E∩A). Furthermore B≤A∩E. Hence we can assume that w.l.o.g.
E=⟨CA⟩.
It follows δ(C)≤δ(⟨CA⟩),
since B≤A by assumption.
ad (5) We use again the remark below Lemma 6.3. By⟨C∗A∗⟩=C∗⊗B∗A∗
we get Σ1=0. From the proof of (1) we know, that Σ3≥0. Hence by assumption Σ2=0 and Σ3=0.
As above by Lemma 6.1 we get an isomorphism
[TABLE]
where γ is the homomorphism of F(B∗) into F(C∗). Note that B≤2A implies F(B∗)⊆F(A∗). By Theorem 4.2 C≤2⟨AC⟩. Hence F(C∗)⊆F(⟨AC⟩∗).
As in the proof of Lemma 6.3 we define ⟨CA⟩−=F(⟨C∗A∗⟩)/N,
C−=F(C∗)/N(C), B−=F(B∗)/N(B), and A−=F(A∗)/N(A). By (⊗)
[TABLE]
where U is generated by r=∣X30(B)∣ many ψC+ψA, where
ψC∈⟨C1C2⟩3 and ψA∈⟨A1A2⟩3, that are linearly independent over N(C)+N(A).
Note that ldim(N(B)∩ker(γ))=ldim(N(A)∩ker(γ))=s.
Since s will be canceled we get :
[TABLE]
since 0=Σ3.
Then
f(N)=N(C)⊕N(B)/ker(γ)(N(A)/ker(γ))⊕U.
Assume we have homomorphisms j of C into E and g of A into E, that coinside on B.
There are homomorphisms j+ of F(C∗) into E and g+ of F(A∗)/ker(γ) into E, that coinside on
F(B∗)/ker(γ).
By (⊗) there is an homomorphism h+ of F(⟨C∗A∗⟩) into E.
By (=) and Σ2=0 we get an homomorphism h− of ⟨C−A−⟩ into E.
h− can be extended to a homomorphism h of ⟨CA⟩ into E . Hence ⟨CA⟩=C⊗BA.
∎
Lemma 6.5**.**
Assume D=C⊗BA and A=⟨Baˉ⟩, where aˉ is a
generating o-system of A over B. Then we get:
- (1)
D∗=C∗⊗B∗A∗**
2. (2)
If E⊆B, D=C⊗E⟨Eaˉ⟩, and B≤A, then C≤D and
E≤⟨Eaˉ⟩.
Proof.
ad(1) This is a consequence of the Lemmas 3.9 and 3.8.
ad(2) By Lemma 5.7 we have B∗≤A∗. By (1)
D∗=C∗⊗E∗⟨Eaˉ⟩∗.
By Lemma 6.4(4) we have C≤D.
By Lemma 4.1 B∗≤A∗ implies E≤2⟨Eaˉ⟩. Then by Lemma 6.4 (3)
we get E≤⟨Eaˉ⟩.
∎
As in Definition 4.6 we define
Definition 6.6**.**
For A,C,N⊆M∈K3:
- (1)
δ(A/C)=δ⟨AC⟩−δ(C).
2. (2)
δ(A/N)=min{δ(⟨AC⟩)−δ(C):C⊆N}.
From the end of the proof of Lemma 6.3 and Corollary 2.9 we get
Corollary 6.7**.**
Let M be a 3-nilpotent graded Lie algebra in K3 and A and C are 2-strong substructures. Then
δ(A/C)=δ(A/A∩C) if and only if δ2(A/C)=δ2(A/A∩C), A3 and C3
do not contain any elements from ⟨A1A2C1C2⟩3∖⟨A1A2⟩3+⟨C1C2⟩3 and if N is choosen as in the proof of 6.3, then N⊆F(A∗)3+F(C∗)3.
Corollary 6.8**.**
Let M be a 3-nilpotent graded Lie algebra in K3 and A and C are 2-strong substructures. Then
δ(A/C)=δ(A/A∩C) if and only if ⟨AC⟩=A⊗A∩CC.
Proof.
Let B be A∩C.
Assume ⟨AC⟩=A⊗A∩CC. Then ⟨A∗C∗⟩=A∗⊗A∗∩C∗C∗. By Corollary 3.8 we have δ2(A/C)=δ2(A/B). By Corollary 3.9
A3 and C3
do not contain any elements from ⟨A1A2C1C2⟩3∖⟨A1A2⟩3+⟨C1C2⟩3. Let N be chosen as in the proof of 6.3 .Then N⊆F(A∗)3+F(C∗)3. Hence
δ(A/C)=δ(A/A∩C) by Corollary 6.7.
For the other direction we use the other direction of Corollary 6.7. Then δ2(A/C)=δ2(A/B)
implies ⟨A∗C∗⟩=A∗⊗A∗∩C∗C∗ by Corollary 3.8.
By assumption A,C are 2-strong in ⟨AC⟩.
Then B is also 2-strong in A, C, and ⟨AC⟩.
Hence we can consider F(A∗),F(B∗),F(C∗) as subspaces of F(⟨A∗C∗⟩). F(A∗∩C∗)⊆F(A∗)∩F(C∗).
Since (F(A∗)∩F(C∗))∗=A∗∩C∗ , there is a homomorphism of F(A∗∩C∗) onto
F(A∗)∩F(C∗). Hence it is an isomorhism. We get equality and
[TABLE]
using the definiton of F and of the free amalgam. We choose N⊆F(⟨A∗C∗⟩)3 such that ⟨A1A2C1C2⟩=F(⟨A∗C∗⟩)/N.
Let f and g be homomorphisms of A and C respectively into E, such that f and g coincide on B.
Then there are homomrphisms f+ of F(A∗) into E and g+ of F(C∗) into E that coinside on F(B∗). Since we have a free amalgam we get
h+ of F(A∗)⊗F(B∗)F(C∗) into E.
By Corollary 6.7 N⊆F(A∗)3+F(C∗)3 and A3 and C3
do not contain any elements from ⟨A1A2C1C2⟩3∖⟨A1A2⟩3+⟨C1C2⟩3.
Hence
we get a homomorphism h from ⟨A1A2C1C2⟩ into E that extends f and g.
Then h can be extended to ⟨AC⟩.
Hence ⟨AC⟩=A⊗A∩CC.
∎
By Lemma 2.11, Lemma 4.1, Corollary 5.7 and Lemma 6.3 above we get (1), (2) and (3) in the next Corollary.
Corollary 6.9**.**
Let M be a 3-nilpotent graded Lie algebra in K3.
Then for all substructures
A,C,E of M, where A and C are finite the following is true:
- (1)
If C≤M and E≤2M, then E∩C≤E.
2. (2)
If A≤C≤M, then A≤M.
3. (3)
If A,C≤M, then A∩C≤M.
4. (4)
If A≤C≤kM, then A≤kM.
5. (5)
If B≤kM, C≤kM, o−dim(B∗)<k, and o−dim(C∗)<k, then B∩C≤kM.
Proof.
To prove (4), consider A⊆E⊆M with o−dim(E∗/A∗)≤k. Then
o−dim(⟨CE⟩∗/C∗)≤k. By Corollary 5.9 we get C≤⟨CE⟩.
By (2) we have A≤⟨CE⟩. Hence δ(A)≤δ(E).
ad(5): By Corollary 5.9 and the assumptions we get, that B≤⟨BC⟩
and C≤⟨BC⟩. Hence by (3) B∩C≤⟨BC⟩ and B∩C≤B.
Now assume B∩C⊆E⊆M and o−dim(E∗/B∗∩C∗)<k. Then
o−dim(⟨E∗B∗⟩/B∗)<k. By Corollary 5.9 B≤⟨EB⟩. By
B∩C≤B we get B∩C≤⟨EB⟩. Hence δ(B∩C)≤δ(E),
as desired.
∎
The Corollary allows the following definition.
Definition 6.10**.**
If A is a finite substructure of M in K3, then there exists a unique minimal C with
A⊆C≤M. We define C=CSS(A) - the selfsufficient closure.
Let A− be ⟨A1A2⟩
Lemma 6.11**.**
Let A be a finite substructure M∈K3.
- (1)
CSS(A−)=CSS(A−)−* and CSS(A−)⊆CSS(A).*
2. (2)
Either CSS(A)=⟨CSS(A−),A⟩ or there is some C such that
CSS(A−)≤C≤M, C=C−, CSS(A)=⟨CA⟩, and
[TABLE]
3. (3)
CSS2(A)⊆CSS(A).
4. (4)
If B⊆A, then CSS(B)⊆CSS(A).
Proof.
ad (1) For every substructure C⊆M we have δ(C)=δ(C−)+o−dim3(C).
By Lemma 6.3
[TABLE]
If CSS(A−)⊆CSS(A), then δ(CSS(A−))−δ(CSS(A−)∩CSS(A))<0,
and therefore δ(⟨CSS(A)CSS(A−)⟩)−δ(CSS(A))<0,a contradiction.
ad(2) If CSS(A)=⟨CSS(A−),A⟩, then there is some proper strong extension C
of CSS(A−) with C=C−, CSS(A)=⟨C,A⟩, and the inequation in
(2) is true.
ad (3) By Lemma 6.3 we have
[TABLE]
If CSS2(A)⊈CSS(A), then CSS2(A)=A and
δ2(CSS2(A))−δ2(CSS(A)∩CSS2(A))<0.
Hence δ(⟨CSS(A)CSS2(A)⟩)−δ(CSS(A))<0,
a contradiction.
ad (4) This is clear by definition.
∎
In the following Lemma we summarize facts we have already proved and used:
Lemma 6.12**.**
Assume A,B,C⊆M∈K3 , A,C≤2M, and A∩C=B.
W.l.o.g. we use ⊆ instead of the corresponding embeddings.
- (1)
F(B∗)⊆F(A∗)⊆F(M∗).
2. (2)
F(B∗)⊆F(C∗)⊆F(M∗).
3. (3)
F(A∗)∩F(C∗)=F(B∗).
4. (4)
Ifδ2(A∗/C∗)=δ2(A∗/B∗), then ⟨A∗C∗⟩=A∗⊗B∗C∗
and F(⟨A∗C∗⟩)=F(A∗)⊗F(B∗)F(C∗)
5. (5)
δ(A/C)=δ(A/B)* implies δ2(A/C)=δ2(A/B) and ⟨AC⟩=A⊗BC.*
6. (6)
In general we have δ2(A/C)≤δ2(A/B) and δ(A/C)≤δ(A/B). Furthermore
δ2(A/C)<δ2(A/B) implies δ(A/C)<δ(A/B).
Proof.
ad (1),(2) By Lemma 4.1 we have B≤2A≤2M and B≤2C≤2M. By Theorem 5.5
we get the assertion.
ad (3) F(A∗∩C∗)i=(F(A∗)∩F(C∗))i=(A∩C)i for i=1,2.
ad(4) The first assertion follows from Corollary 2.9. Then we apply Lemma 6.1. By our assumption α and γ are embeddings.
ad(5) It follows from Corollary 6.7 and 6.8.
ad(6) Here we have the subaddivity of δ2 and δ3. The last assertion follows from (5).
∎
Lemma 6.13**.**
Let M be a 3-nilpotent graded Lie algebra in K3.
For all A≤2n+n2C≤M we have A≤nM.
Proof.
We consider any A⊆E⊆M, such that
o−dim(E∗/A∗)≤n. By C≤⟨CE⟩ we get δ2(E∗/C∗)≥0. Furthermore o−dim1(E∗/C∗)≤n. By Lemma 4.8 we get:
Let B be E∩C. Then there exists D, H, K in M∗,
and XCXBXE, such that
- (1)
H⊆D⊆C∗, B1⊆H, D1=C1, and
o−dim(H/B∗)≤n2+n,
2. (2)
H⊆K⊆⟨HE∗⟩, K1=⟨HE∗⟩1,
3. (3)
⟨C∗E∗⟩=⟨DK⟩=D⊗H⟨K⟩,
4. (4)
XCXBXA⊆⟨C1A1⟩2 is linearly independent over
⟨D1⟩2+⟨K1⟩2,
XB⊆B2, ⟨HXB⟩=⟨HB∗⟩,
5. (5)
XC⊆C2, ⟨DXBXC⟩=C∗, and
6. (6)
XE⊆E2, ⟨KXBXE⟩=⟨HE∗⟩.
Now we can apply Lemma 6.4(3)
to C, ⟨H1H2E⟩=EH, and C∩EH
and obtain that C∩EH≤E. Hence δ(C∩EH)≤δ(E).
Note that
C∩EH=⟨C∩E,H1,H2⟩=⟨B,H1,H2⟩.
Furthermore in M∗ holds
[TABLE]
Since A≤2n+n2C, we have δ(A)≤δ(C∩⟨EH⟩)≤δ(E).
∎
Lemma 6.14**.**
Assume that A⊆E⊆D=C⊗BA. Then δ((E∩C)⊗BA)≤δ(E).
Proof.
By Mon E0=⟨(E∩C)A⟩=(E∩C)⊗BA. Since A⊆E
we have E1=E10=⟨(E∩C)1A1⟩lin. (E0)∗=⟨E1X⟩∗,
where X⊆E20 linearly independent over ⟨E1⟩2.
Next we have
E∗=⟨E1XY⟩∗, where Y⊆E2 is linearly independent over
(E20). Hence δ2(E)=δ2(E0)+∣Y∣.
Since A⊆E, we get that Y is linearly independent over
⟨E20C2⟩lin⊇A2. Therefore this linear independence is given by the
linear indpendence of {[x,y]:x∈X1(C),y∈X1(A)} as in Corollary 3.9
described. Hence
F(E∗)=F((E0)∗)⊗F(⟨Y⟩lin. By Corollary 3.9 again
E−=F(E∗)/N implies that N⊆F((E0)∗). Hence δ(E0)≤δ(E).
∎
In the following we identify the isomorphic copies of B in A and C and denote them by B.
Theorem 6.15**.**
Assume that B≤A and B≤2(ldim(A/B))+2+nC are in K3fin.
Then an amalgam D of A and C over B exists in K3fin with C≤D and A≤nD .
If B≤C, then A≤D. If no divisor problem of B has a solution in both A and C, then
D=A⊗BC has the desired properties. In this case δ(D)=δ(A)+δ(C)−δ(B).
Proof.
Let [b,?]=e be divisor problem in B with solutions a∈A and c∈C.
Since B≤A we have ⟨Ba⟩A≅B[e:b]=B′ and by B≤2(ldim(A/B))+2+nC also
⟨Bc⟩C≅B[e:b]=B′ . We use B′ for ⟨Ba⟩A as a substructure of
A and also B′ for ⟨Bc⟩C as a substructure of
C. By Lemma 3.15 δ(B′)=δ(B) and therefore
B′≤A and B′≤2(ldim(A/B′)+2+nC. Hence it is sufficient to prove the assertion for A,B′,C. Using an appropriate induction we can assume that there is no divisor problem in B with solutions in both A and C. In this case we show that
D=A⊗BC has the desired properties. By Theorem 3.4 D=A⊗BC exists.
By Theorem 4.2 we know that D∗∈K2fin.
Lemma 6.4 (4) implies C≤D. Similarly we have A≤D, if B≤C.
Next we show A≤nD. We consider A⊆E⊆D with o−dim(E∗/A∗)≤n. By Mon
⟨(C∩E)A⟩=(C∩E)⊗BA.
By Lemma 6.14 we have δ((E∩C)⊗BA)≤δ(E). Since B≤2(ldim(A/B))+2+nC it holds B≤(E∩C).
Lemma 6.4(4) implies A≤(E∩C)⊗BA.
Hence δ(A)≤δ((E∩C)⊗BA)≤δ(E).
By Theorem 4.2 we have D∗∈K2.
To show that D∈K3fin we consider E⊆D. We have to show: If 0<o−dim(E), then
δ(E)≥min{2,o−dim(E)}. By Corollary 5.7 we have to consider only δ.
Since D∗∈K2 and
by Corollary 5.7 we can assume w.l.o.g. that E≤2D. By Lemma 6.9 we have (E∩C)≤E. Therefore δ(E∩C)≤δ(E).
Furthermore w.l.o.g. o−dim3(E)=0.
Since
C∈K3
0<δ(E) for (E∩C)=⟨0⟩ and 1<δ(E) for 1<o−dim(E∩C).
Now asume that o−dim(E∩C)≤1. Then o−dim(E∩B)≤1.
An generating o-system for E∩A has the form X(A) or b,X(A), where
b is a non-zero element of B1∩E1 or B2∩E2 and
X(A)=X(A)1X(A)2, where
X(A)1 consists of elements ai1 with ai1∈(A1∩E1) linerarly independent over B1
and X(A)2 consists of elements ai2∈(A2∩E2) linearly
independent over ⟨BX(A)1⟩2.
To get an o-system for the vector space E∩⟨CA⟩lin we have to extend the o-system above in the following way:
Either we add c∈C1∖B1 or c∈C2∖B2, if E∩C=⟨0⟩ and
E∩B=⟨0⟩.
Furthermore we have Y=Y1Y2, where Yj consists of dij+eij, where the dij∈Aj are linearly
independent over ⟨Bj,…aij…⟩lin and eij∈Cj linearly independent over ⟨Bj,c⟩lin, (sometimes there is no c).
Let X be X(A),b, if there is some b and X=X(A) otherwise.
By Corollary 3.9 we can extend X,Y or X,c,Y respectively by some Z to get a generating
o-system for E, where
Z is linearly independent ⟨CA⟩lin.
Let Φ=Φ2Φ3 be an generating ideal system such that E=F(XYZ)/Φ or
E=F(X,c,Y,Z)/Φ.
Since o−dim(C∩E)≤1 we have Φ⊆F(X). Hence δ2(E)=δ2(E∩A)+∣c,Y,Z∣ or δ2(E)=δ2(E∩A)+∣Y,Z∣ respectively, and
δ(E)=δ(E∩A)+∣c,Y,Z∣ or δ(E)=δ(E∩A)+∣c,Y,Z∣ respectively.
Then min{2,o−dim(E)}≤δ(E).
∎
7. The strong Fraïssé Hrushovski Limit
K3fin is countable and there are only countably many strong embeddings for Lie algebras in K3fin. By Theorem 6.15 we have the amalgamation property for strong embeddings. As well known we get
the following strong Fraïssé Hrushovski limit. For more details see [22].
Theorem 7.1**.**
7.1
There exists a countable structure M in K3 that satisfies the following condition:
If B≤A are in K3fin and there is a strong embedding f of B into M, then it is possible to extend f to strong embedding of A into M.
We call M the strong Fraïssé Hrushovski limit of K3fin.
Corollary 7.2**.**
M* is unique up to isomorphisms.*
The proof is similar to the proof of the next result.
Theorem 7.3**.**
For any two rich structures M and N in K3 with ⟨aˉ⟩≤M, ⟨bˉ⟩≤N, and ⟨aˉ⟩M≅⟨bˉ⟩N we have (M,aˉ)≡L∞,ω(N,bˉ).
Proof.
We will show that we can play the Fraïssé Ehrenfeucht game infinitely many rounds reproducing the starting condition ⟨aˉ⟩≤M, ⟨bˉ⟩≤N, and ⟨aˉ⟩M≅⟨bˉ⟩N again and again. Assume w.l.o.g. that player I has chosen an element c in M. Choose cˉ in M such that cˉ contains aˉ
and c, and ⟨cˉ⟩M≤M. Then
⟨aˉ⟩M≤⟨cˉ⟩M. By assumption we have some isomorphism f of ⟨aˉ⟩M onto ⟨bˉ⟩N≤N. By richness f can be enlarged to embedding of ⟨cˉ⟩M onto some ⟨dˉ⟩N≤N.
∎
It follows that there is a common complete theory of all rich Lie algebras in K3. In Corollary 7.7 we
will see that the following gives an axiomatization.
Definition 7.4**.**
- T3(1)
Let T3(1) be the elementary description of K3.
2. T3(2)
For every pair B≤A in K3 we fix a function g(n) (see next lemma), such that:
If B≤g(n)M, then this embedding of B in M can be extendent to a ≤n-strong embedding of A in M.
3. (T3)
We define T3=T3(1)∪T3(2).
Theorem 6.15 implies the following
Lemma 7.5**.**
Every rich structure M in K3 fulfills the elementary axioms T3(2).
Proof.
Let C be the selfsufficient closure of B in M. Then we have B⊆C≤M.
If B≤M, then B=C. We assume that g(n)=2(ldim(A/B))+2+n2+n and
B≤2(ldim(A/B))+2+n2+nC.
We apply
Theorem 6.15
to get an amalgam D in K3 of A and C over B, such that C≤D and
A≤n2+nD. Since M is rich and C≤M there is a strong embedding of D in M over C.
By Lemma 6.13 we get A≤nM.
∎
Theorem 7.6**.**
A Lie algebra M in K3 is rich iff it is a ω-saturated model of T3.
Proof.
By Lemma 7.5 a rich M∈K3 satisfies T3. A ω-saturated model of T3 is a rich Lie algebra in K3 by ω-saturation. It remains to show that rich M∈K3 are ω-saturated. Let N be a ω-saturated model of T3. Then N is rich. and by Theorem 7.3
we have M≡L∞,ωN. Hence M is ω-saturated.
∎
Corollary 7.7**.**
T3* is an axiomatization of the complete theory of all rich graded Lie algebras in K3. If M is a model of T3 and A is a strong substructure of M, then the elementary type of A is completely
determined by its isomorphism-type.*
Lemma 7.8**.**
A model M of T3 satisfies the following:
- (1)
For all 1≤i<j≤3: ∀xz∃y(Ui(x)∧Uj(z)→[x,y]=z).
2. (2)
M∗⊨T2**
3. (3)
If M is rich, then M∗ is rich.
Proof.
To prove (1) assume Ui(a) and Uj(c). Let B≤M with a,c∈B. If [a,?]=c has no solution in B, then B≤B(c:a)
is in K3 by Lemma 3.15. By T3(2) there is a solution in M.
For (2) and (3) it is sufficient to show that M∗ is rich. This follows since M and therefore M∗ are
ω-saturated.
∎
Lemma 7.9**.**
Let A and B be subalgebras of some M∈K3, where B=⟨B1,B2,b1…bk⟩ and b1…bk∈B3 are linearly independent over ⟨B1B2⟩3.
- (1)
If B≤n+kA, then ⟨B1B2⟩≤nA.
2. (2)
If B≤A, then ⟨B1B2⟩≤A.
Proof.
(1) Choose ⟨B1B2⟩⊆E⊆A with o−dim(E∗/⟨B1B2⟩∗)≤n. Assume w.l.o.g. B∩E=⟨B1B2b1…bi⟩.
By assumption
[TABLE]
Hence δ(⟨B1B2⟩)≤δ(E).
(2) followa from (1).
∎
8. Non-forking
Definition 8.1**.**
Let X be any subalgebra of M⊨T3. We say X is strong in M (short: X≤M), if for all finte A⊆X we have CSS(A)⊆X. We define CSS(Y)=∪(A⊆Y,Afinite)CSS(A)
for Y⊆M.
Note that this definition generalizes the definition for finite X. Furthermore CSS(Y)≤M.
Remember that A,B,C,D are only used for finite substructures.
By Corollary 5.7 B≤M can be defined using δ only in the following way:
For all A with B⊆A⊆M we have δ(B)≤δ(A).
Lemma 8.2**.**
Let M be a model of T3.
- (1)
X≤M* if and only if for all finite B≤M δ(B∩X)≤δ(B).*
2. (2)
If X≤M and A≤M, then X∩A≤M.
Proof.
ad (1):
First assume X≤M. Consider B≤M. By assumption CSS(B∩X)⊆X. Hence
CSS(B∩X)=B∩X. It follows δ(B∩X)≤δ(B).
To prove the other direction consider A⊆X. Since CSS(A)≤M we get
δ(CSS(A)∩X)≤δ(CSS(A)) by assumption. Since A⊆(CSS(A)∩X) we get
CSS(A)=CSS(A)∩X⊆X.
ad (2): Since X≤M, there is some D≤M such that A∩X⊆D⊆X. Then
A∩X=A∩D≤M.
∎
Let C be a monster model of T3 and M⪯C. If A⊆M, then CSS(A) belongs to the algebraic closure of A. Hence CSS(A)⊆M and M≤C. If aˉ∈C, then by M≤C and definition
[TABLE]
Note that δ(CSS(Baˉ))−δ((CSS(Baˉ)∩M)≥0.
Lemma 8.3**.**
*Assume X≤C and aˉ∈C.
Choose aˉ⊆A≤CSS(⟨Xaˉ⟩), such that δ(A)−δ(A∩X)
is minimal.
Then CSS(⟨Xaˉ⟩)=X⊗A∩XA
and A=CSS(⟨(A∩X)aˉ⟩).*
Proof.
Note A≤C.
If (A∩X)≤C≤X, then by Lemma 6.3
[TABLE]
Note that A∩C=A∩X. Since C≤CSS(⟨AC⟩)∩X≤X, we have
δ(CSS(⟨AC⟩))/(CSS(⟨AC⟩)∩X)≤δ(CSS(⟨AC⟩))/C)≤δ(⟨AC⟩/C)≤δ(A/A∩C).
By minimality of δ(A/A∩X) we have equality in () for all such C. Therefore
δ(CSS(⟨AC⟩))=δ(⟨AC⟩). Hence CSS(AC)=⟨AC⟩ and CSS(AX)=⟨AX⟩. By Lemma 6.8 we get ⟨AC⟩=C⊗A∩CA, since
δ(A/C)=δ(A/A∩C) by (). We get CSS(AX)=⟨AX⟩=X⊗A∩XA
Since CSS(⟨(A∩X)aˉ⟩)⊆A and
CSS(⟨(A∩X)aˉ⟩)∩X=A∩X, we have for
A′=CSS(⟨(A∩X)aˉ⟩) that
[TABLE]
by the considerations above. Since δ(A)=δ(A′), this implies
A=CSS(⟨(A∩X)aˉ⟩).
∎
Corollary 8.4**.**
T3* is ω-stable.*
Proof.
Let M be any countable model of T3 and M⪯C. By Lemma 8.3 for a∈C there are
B≤M and A such that B=(M∩A)≤C, A=CSS(Ba), and CSS(Ma)=M⊗BA.
tp(a/M) is uniquely determined by the isomorphism type of CSS(Ma) by Theorem 7.3.
Hence it is sufficient to count for all B≤M all pairs B≤A in K3fin with A=CSS(Ba) for some a.
∎
Lemma 8.5**.**
Let C be a subalgebra of C. The algebraic closure of C in C (acl(C)) is the transitive closure of
CSS(C) under adjunction of homogeneous divisors.
Proof.
CSS(C) is in the algbraic closure of C. A homogeneous divisor is in the algebraic closure.
Let X be the transitive closure of CSS(C) under homogeneous divisors. Then X is in the algebraic closure of C and X≤C by Lemma
3.15.
Assume that a is not in X. Choose A as in Lemma 8.3, such that
A=CSS(⟨(A∩X)a⟩) and
CSS(⟨Xa⟩)=X⊗X∩AA. Let X∩A≤A1 be isomorphic to A over X∩A. All homogeneous divisors for X∩A in A1 are in X∩A. Hence
(X⊗X∩AA)⊗X∩AA1 is in K3 by Theorem 6.15 applied to all
X∩A≤D≤X. Since C is saturated we find A1 in C. Then
(X⊗X∩AA)⊗X∩AA1≤C. Since we can iterate this argument we see that
A and a are not in the algebraic closure of C.
∎
Above we have already defined:
For subsets A,B,C in a structure M we define
[TABLE]
if and only if
[TABLE]
Since T3 is ω-stable, we have non-forking A\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}}_{B}C.
Lemma 8.6**.**
Let B⊆A and B⊆C be substructures of a monster model C of T3. Then the following are equivalent:
- (1)
A\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}}_{B}C.
2. (2)
There are A′,B′,C′, such that
- (a)
CSS(A)⊆A′⊆acl(A),
2. (b)
CSS(C)⊆C′⊆acl(C),
3. (c)
B′=A′∩C′⊆acl(B),
4. (d)
⟨A′C′⟩≅A′⊗B′C′, and ⟨A′C′⟩≤C.
Proof.
First we assume that (2) is true. Using Lemmas 3.15, 3.16, and 3.17 we can extend B′ and C′, such that every solution of a division problem of B′ in A′ is already in B′. If we denote the new structures again by A′,B′,C′,
then they are again strong in C and (2) remains true.
Let C0=C′,C1,… be any insiscernible sequence over B′.
There are automorphisms fi of C that fix B′ pointwise with fi(C′)=Ci.
Let Ei be CSS(⟨C0…Ci⟩). There are no new homogeneous divisors in A′ for problems in B′.
By Theorem 6.15 A′⊗B′Ei exists in K3.
Since C is rich, there is some Ai⊆C such that
⟨A′Ei⟩≅⟨AiEi⟩≅Ai⊗B′Ei and ⟨AiEi⟩≤C.
By saturation there exists Aω such that ⟨AωEi⟩≤C and
⟨A′Ei⟩≅⟨AωEi⟩≅Aω⊗B′Ei
for all i<ω.
By Theorem 6.15 Aω≤Aω⊗B′Ei. Ci≤C, since C′≤C. We have
CSS(⟨AωCi⟩)⊆Aω⊗B′Ei≤C. By the structure of a free
product we get ⟨AωCi⟩≤Aω⊗B′Ei≤C:
To show this consider ⟨AωCi⟩⊆D⊆Aω⊗B′Ei. Then
[TABLE]
[TABLE]
By Lemma 6.14 we get
[TABLE]
Now we can applay Theorem 7.3 and get tp(Aω/Ci)=tp(A′/C′) for all i<ω. Then A^{\prime}\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}}_{B^{\prime}}C^{\prime} and therefore
A\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}}_{B}C,
since A⊆A′⊆acl(A), C⊆C′⊆acl(C), and B⊆B′⊆acl(B).
Assume (1) holds. We extend A′,B′ in (2 a, b, c) in such a way, that every homogeneous solution in C′ of a divisor problem of
B′ is already in B′. Use Lemmas 3.17, 3.16, and 3.15 . We use the same notation.
Then A′≤C and C′≤C
By assumption A^{\prime}\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}}_{B^{\prime}}C^{\prime} and B′⊆acl(B). Define C0=C′. By Theorem 6.15
C0⊗B′C1 exists in K3, where C0≅C1 and both are strong in C0⊗B′C1.
Since C is rich there exits C1 in C, such that C0⊗B′C1≤C. Then C1≤C and there is an
automorphismf1 of C with f1(C0)=C1 and f1(C1)=C0. By induction we get a sequence C0,C1,… in C, such that Ci≤C and Ei=C0⊗B′C1⊗B′…⊗B′Ci≤C.
Every substructure generated by a finite subset of the Ci is strong in C and isomorphic to the free amalgam of these Ci over B′. (Use Theorem 6.15 and Theorem 7.3). Hence the sequence of the Ci is an indiscernible sequence over B′. Let fi be the automorphism of C, that exchanges C0 and Ci and fixes all the other Cj.
Since A^{\prime}\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}}_{B^{\prime}}C^{\prime} there is some Aω in C, such that tp(Aω/C′)=tp(A′/C′)
and C0,C1… is indiscernible over Aω.
Note that B′⊆Aω.
fi(tp(Aω/C′)=tp(Aω/Ci). The following claim implies the assertion:
[TABLE]
(+) implies
[TABLE]
Then we have δ(⟨A′C′⟩)=δ(A′)+δ(C′)−δ(B′). The δ’s of the old and the
new A′,B′,C′ are the same. Hence we have (++) also for the original A′,B′,C′.
First we assume
[TABLE]
Then Lemma 6.8 implies
[TABLE]
Next we show, that (*) implies
[TABLE]
Otherwise
[TABLE]
and
[TABLE]
would imply by Sym and Trans
[TABLE]
and by Mon
a contradiction to (*).
Then
[TABLE]
By induction we get:
[TABLE]
since otherwise equality would be equivalent to A_{\omega}\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}}^{\otimes}_{\langle C_{0}\ldots C_{i-1}\rangle}C_{i}
and this implies together with C_{i}\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}}^{\otimes}_{B^{\prime}}\langle C_{0}\ldots C_{i-1}\rangle
[TABLE]
in contradiction to (*) by Mon.
Hence there is some j such that
[TABLE]
This contradicts
[TABLE]
We have shown the first part of the claim.
Using the same steps we can show, that
[TABLE]
Then
[TABLE]
It remains to prove
[TABLE]
Otherwise we have
[TABLE]
We show by induction on i that this implies
[TABLE]
Then
[TABLE]
for sufficiently large j - a contradiction.
We denote
[TABLE]
by Di. Then δ(Aω)≤δ(Di) , since Aω≤C.
For the induction we have
[TABLE]
[TABLE]
[TABLE]
[TABLE]
∎
Corollary 8.7**.**
- (1)
Assume B≤A≤C and B≤X≤C, such that A∩X=B where X can be infinite.
Then A\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}}_{B}X if and only if A\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}}^{\otimes}_{B}X and ⟨AX⟩≤C if and only if δA/X)=δ(A/B)
and ⟨AX⟩≤C .
2. (2)
Types over strong substructures are stationary.
We come back to Lemma 8.3. Note that every element in C is interdefinable with
a sequence of homogeneous elements.
Lemma 8.8**.**
Assume U≤V≤C, aˉ⊆C,
B≤U,
CSS(Baˉ)=AU, AU∩U=B, and
[TABLE]
Assume acl(⟨Uaˉ⟩)∩V=U,
C≤V, , AV=CSS(Caˉ), AV∩V=C, and
[TABLE]
If D=B∩C and A=AU∩AV, then A=CSS(⟨Daˉ⟩) and
[TABLE]
Proof.
Extend aˉ to eˉ, such that
⟨eˉ⟩∩U=⟨aˉ⟩∩U=⟨aˉ⟩∩V and
eˉ generates A over D.
By Mon ⟨Ueˉ⟩=U⊗B⟨Beˉ⟩ and ⟨Veˉ⟩=V⊗C⟨Ceˉ⟩. Then
Theorem 3.10 implies
[TABLE]
We get ⟨BA⟩=⟨Beˉ⟩=B⊗D⟨Deˉ⟩.
If ⟨BA⟩=AU, then ⟨Ueˉ⟩=CSS(⟨Uaˉ⟩),
as desired.
Otherwise there is some c∈AU, that is not in ⟨BA⟩. Then c is not in U,
not in V, and not in AV.
If we consider c as a linear combination over a vector space basis of
[TABLE]
as described in Lemma 3.9, then there are mixed monomials with elements in V∖C
and AV∖C. But then c is not involved in any relations. Therefore c∈/CSS(⟨Baˉ⟩=AU, a contradiction.
∎
In the next Corollary we use Lemma 8.8 for the case U=V.
Corollary 8.9**.**
*Assume U≤C and aˉ∈C. According to Lemma 8.3we have:
If A is
chosen with aˉ⊆A≤CSS(⟨Uaˉ⟩), such that δ(A)−δ(A∩U)
is minimal,
then CSS(⟨Uaˉ⟩)=U⊗A∩UA
and A=CSS(⟨(A∩U)aˉ⟩).
There is an A as above, that is minimal with these properties. We call B=A∩U the
self-sufficient canonical base algebra of tp(aˉ/U).*
Lemma 8.10**.**
We consider U≤C and tp(aˉ/U).
Let B be the self-sufficient base algebra of tp(aˉ/U), as in Corollary 8.9.
Then B is a weak canonical base of tp(aˉ/U). With respet to the given properties it is unique.
Proof.
We claim that B is a weak canonical base of tp(aˉ/U).
By Corollary 8.7 we have U\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}}_{B}A.
Since C is saturated, we can replace U by a saturated model U≤M⪯C such that M\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}}_{B}A. We have the same situation for M as for U:
A=CSS(⟨Baˉ⟩)=⟨Beˉ⟩, A∩M=B, CSS(Maˉ)=M⊗BA.
and A minimal with this properties.
Now we use Lemma 8.8 for M=N.
Let f be an automorphism of C that fixes M setwise.
First we assume, that it fixes B pointwise.
If g is f for M and the identity for aˉ, then it can be extended to CSS(Maˉ)=M⊗BA.
Since M⊗BA≤C, g is an elementary automorphism and therefore
tp(aˉ/M)=f(tp(aˉ/M) .
Conversely assume that f fixes tp(aˉ/M).
W.l.o.g. we can assume that f fixes aˉ pointwise.
Then f(A)∩M=f(B). By Lemma 8.8 we get CSS(Maˉ)=M⊗B∩f(B)⟨(B∩f(B))eˉ⟩. Hence B=f(B).
∎
Corollary 8.11**.**
T3* has the weak elimination of imaginaries.*
In section 10 we will introduce minimal strong prealgebraic extensions over strong subalgebras.
We have canonical base algebras for them.
We use CB(aˉ/X) to denote the canonical base of tp(aˉ/X).
Let us come back to the Lemma 8.9.Now we assume
that aˉ is generating o-system over B and over X.
[TABLE]
Let XB be a generating o-system of B. Then B∗=F(XB)∗/Φ2B,
where F(XB) is the free algebra freely generated by XB and Φ2B⊆F(X1B)2∗.
Furthermore B−=F(B∗)/Φ3B, where Φ3B⊆F(B∗)3.
Again we use elements of ⟨Baˉ⟩ to denote
their preimages in F(XBaˉ)
and in F(⟨Baˉ⟩∗).
The extension of X above is completely determined by ⟨Baˉ⟩. There are
sets Φ2 and Φ3 such that
[TABLE]
[TABLE]
where Φ2⊆F(XBaˉ)2∗ is linearly independent over F(XB) and
Φ3⊆F(⟨Baˉ⟩∗) is linearly independent over F(B∗).
See Definitions 2.6 and 2.7.
Definition 8.12**.**
The elements of Φi for i=2,3 are called relations of degree i.
Their structure is described in the proof of Theorem 3.10. We have coefficients and ends.
Corollary 8.13**.**
In Lemma 8.9
B is the self-sufficient closure of the substructure of X generated by
the ends and the coefficients of an ideal basis Φ2Φ3 in the situation above.
Corollary 8.14**.**
T3* is CM-trivial.*
Proof.
Assume M⪯N⪯C and acl(aˉM)∩N=M. We have to show that
CB(aˉ/M)⊆acleq(CB(aˉ/N)).
Let B be the self-sufficient canonical base algebra of tp(aˉ/M) and C be the
self-sufficient canonical base algebra of
tp(aˉ/N). We have to show, that B⊆C.
Then we have
B≤M,
CSS(Baˉ)=AM, AM∩M=B, and
[TABLE]
Furthermore acl(⟨Maˉ⟩)∩N=M,
C≤N, , AN=CSS(Caˉ), AN∩N=C, and
[TABLE]
By Lemma 8.8
[TABLE]
where A=CSS((B∩C)aˉ). Since B is minimal we get B⊆C, as desired.
∎
9. geometry
Let C be a monster model of T3 again.
Let U,V,W be substructures of C in H3. They are generated by their projections into C1 and C2 . If they are finite we use often H,J,K. H3fin is the subset of the finite substructures in H3. Since substructures are graded, the set of all H∈H3 of o-dimension ≤1 is {⟨a⟩:a∈(C1∪C2)}. Note that for a1∈C1 and a2∈C2 we have ⟨a1+a2⟩=⟨a1,a2⟩ and o-dimension and δ of this substructure is 2.
To compute δ(H) for H∈H3fin , we consider H≅F(H∗)/N. Then δ(H)=δ2(H)−ldim(N).
We define a pregeometry on R(C)=C1∪C2. For this we define a dimension function for all H∈H3fin.
Definition 9.1**.**
The dimension of a finite subset X=X1∪X2 with X1⊆C1 and
X2⊆C2
of R(C) is the dimension of the substrucure H=⟨X⟩∈H3fin generated by these elements:
d(H)=δ(CSS(H)).
d(A/H)=d(⟨AH⟩)−d(H) and
d(A/U)=min{d(A/H):H⊆U}.
We have CSS(H)=⟨CSS(H)1CSS(H)2⟩. Furthermore d(⟨0⟩)=0
Lemma 9.2**.**
d* defines a dimension function on R(C).*
Proof.
For H and K in H3 we have to show:
- (1)
d(∅)=d(⟨0⟩)=0.
2. (2)
d(H)>0, if H=⟨0⟩, since C∈K3.
3. (3)
d(⟨Ha⟩)≤d(H)+1 for a∈R(C).
4. (4)
If K⊆H, then d(K)≤d(H).
5. (5)
d(⟨HK⟩)≤d(H)+d(K)−d(⟨(H1∩K1)(H2∩K2)⟩).
If a∈CSS(H), then d(H)=d(⟨Ha⟩). Otherwise we use CSS(H)≤⟨CSS(H)a⟩. Then F(CSS(H)∗)⊆F(⟨CSS(H)a⟩∗). Hence
[TABLE]
By Lemma 6.11 we get CSS(K)⊆CSS(H). Hence d(K)≤d(H).
CSS(H) and CSS(K) are strong subsructures of CSS(⟨HK⟩). By Theorem 6.3
[TABLE]
[TABLE]
CSS(⟨(H1∩K1),(H2∩K2)⟩)≤CSS(H)∩CSS(K). Hence
d(⟨(H1∩K1)(H2∩K2)⟩)=δ(CSS(⟨(H1∩K1)(H2∩K2)⟩))≤δ(CSS(H)∩CSS(K))
∎
We define cl for substructures H and U of C in H3 and on the set R(C).
Definition 9.3**.**
For H⊆C and H∈H3fin we define
[TABLE]
cl(U) is the union of all cl(H) for H⊆U.
For X⊆R(C) we define
[TABLE]
Then the following is well-known:
Corollary 9.4**.**
cl* is a pregeometry on R(C). Furthermore acl(H)⊆cl(H). If H≤K≤C, then K⊆cl(H) if and only if δ(K)=δ(H).*
Lemma 9.5**.**
Assume U≤C, a∈U, and a∈R(C). Then there are the following possibilities:
- (1)
d(a/U)=1. In this case ⟨Ua⟩=CSS(Ua). (Transcentental Case)
2. (2)
d(a/U)=0.
- (a)
CSS(Ua)=⟨Ua⟩* . Then there are u1∈Ui(U) and u2∈Uj(U) such that
i<j and C⊨[u1,a]=u2. (Algebraic Case)*
2. (b)
δ(a/U)>0.
Definition 9.6**.**
We consider U∈H3, U≤C and
V∈H3 finitely generated over U.
If V=⟨Ua⟩ for some a∈R(C) and a∈cl(U), then
we call V a minimal trancentental extension.
If V=⟨Ua⟩ for some a∈R(C) and a∈acl(U), then
we call V a minimal algebraic extension.
If V=⟨Ua⟩ for all a∈R(C), δ(V/U)=0, and δ(W/U)>0 for all U⊆W⊆V, U=W=V, and W∈H3, then V is minimal prealgebraic over U. (short prealgebraic)
We use the definition of minimal prealgebraic also for U not strong in C.
If H≤K and K is minimal strong, then K is generated over H by a single element or it is
prealgebraic minimal (Lemma 9.5.
Lemma 9.7**.**
Assume U≤V≤C and V/U is finite. Then there is a sequence U=V0≤V1≤…≤Vn=V, such that
Vi+1 is minimal strong over Vi.
10. Prealgebraic minimal extensions
Lemma 10.1**.**
Assume that H≤K≤C is prealgebraic
minimal.
- (1)
If H≤U≤C, then K≤U or U∩K=H and ⟨UK⟩ is a minimal
prealgebraic extension of U and ⟨UK⟩=U⊗HK. tp(K/U) is the unique nonforking
extension of tp(K/H).
2. (2)
tp(K/H)* is strongly minimal.*
Proof.
By Lemma 6.3 we have
[TABLE]
If H=K∩U=K, then δ(K/(K∩U))<0, a contradiction. If K∩U=H, then
[TABLE]
and therefore ⟨UK⟩=U⊗HK by Lemma 6.8.
∎
Now we consider a prealgebraic minimal strong extension H≤K≤C. W.l.o.g we can assume that there is some M⪯C, such that tp(K/M) with K∩M=H is a nonforking extension. By Lemma 10.1:
[TABLE]
By Lemma 8.9 we get A≤⟨MK⟩ and B=M∩A, such that
[TABLE]
o−dim3(A/B)=0, A=⟨Baˉ⟩ where aˉ is a generating o-system of A over B,
and B is a self-sufficient weak canonical base algebra of tp(A/M).
B and A are strong substructures and minimal with these properties. B is in K3.
Now we will only assume that A is ≤m-strong for sufficiently large m.
Lemma 10.2**.**
Assume U≤C, aˉ is a generating o-system of ⟨Uaˉ⟩≤C
over U, o−dim3(aˉ)=0, and ⟨Uaˉ⟩ is prealgebraic minimal extension of U.
- (1)
If we have ⟨Uaˉ⟩=U⊗B⟨Baˉ⟩ and
⟨Uaˉ⟩=U⊗C⟨Caˉ⟩.
Then
⟨Uaˉ⟩=U⊗B∩C⟨(B∩C)(ˉa)⟩.
2. (2)
If we assume that
B ≤kC and C≤kC
for o−dim(B∗),o−dim(C∗)<k,
then (B∩C)≤kC.
For D⊆B we have D≤kC if and only if
D≤B.
Proof.
(1) is is a consequnece of Corollary 3.10.
(2) follows from Corollary 6.9.
∎
Definition 10.3**.**
For every prealgebraic minimal extension B≤A=⟨Baˉ⟩≤C, where B is the
self-sufficient canonical base algebra as in
Lemma 8.9 and aˉ is a generating o-system of A over B
we define a formula ϕ(xˉ,yˉ). xˉ stands for aˉ and yˉ for a generating
o-system for B. ϕ describes the following:
- (1)
The isomorphism-type of A over B.
2. (2)
There is no proper subalgebra D⊆B, such that ⟨Daˉ⟩≤A
and ⟨Daˉ⟩ describes a minimal prealgebraic extension of D.
3. (3)
For A/B we fix some m(A/B)=m, such that
2lindim(A/B)+2<m and
h(∣xˉ∣)+∣xˉ∣<m where h is the function in Lemma 4.7.
Then the formula says, that B≤m+o−dim(A∗/B∗)C.
Let Xhome be the set of these formalas. Instead of ϕ(aˉ,bˉ) we often write
ϕ(A/B).
In the above definition ϕ(A/B) implies , that A is a prealgebraic minimal strong extension
of B, A is ≤m-strong in C, B is minimal with this properties.
Lemma 10.4**.**
Let B≤A be in C with C⊨ϕ(A/B) for ϕ(xˉ,yˉ)∈Xhome, as described above.
Assume B⊆V for V=⟨V1V2⟩, A⊆V,
and δ(A/V)≥0.
Then
[TABLE]
A* provides a prealgebraic minimal strong extension of V.*
Proof.
We have ⟨VA⟩∈H3. We can asssume w.l.o.g. that V is finite. Otherwise we work with sufficiently large substructures.
Let Vs be the selfsufficient closure of V in ⟨VA⟩. By definiton of the selfsufficient closure we have
δ(A/Vs)≥0 and
⟨VA⟩=Vs, since δ(⟨VA⟩)≥δ(V).
Now Vs fullfils all assumptions on V in the Lemma.
We show the Lemma for Vs. Then it follows V=Vs and the assertion for V. Hence we can assume
w.l.o.g. that V is strong in ⟨VA⟩.
By Corollary 5.7 0≤δ2(A/V).
For C∗ Lemma 4.7 implies that there are XV⊆⟨V1A1⟩2∩V2 linearly independent over ⟨V1⟩2+⟨A1⟩2+(V∩A)2,
D, and H, such that
A∗∩V∗⊆H⊆D⊆V∗ , D1=V1,
V∗=⟨DXV⟩, o−dim(H/(A∗∩V∗))≤h(o−dim(A∗/V∗)) and
⟨VA⟩∗=D⊗H⟨HA∗⟩.
Let E1⊆V1 and E2⊆V2 in V be the isomorphic preimages of H1 and H2. Then define
E=⟨E1E2A⟩∩V. Then E∗ is the given H and ⟨E∩V⟩=E.
Furthermore we get o−dim(E∗/A∗)≤o−dim(E∗/A∗∩E∗)≤h(o−dim(A∗/V∗))≤m, where m comes from the definition of ϕ.
This we need later for (v).
Since V≤2⟨AV⟩ we get
E≤2⟨EA⟩
by Lemma 4.1.
By Lemma 6.4(1) the conditions (i) , (ii) and V∩⟨EA⟩=E imply
0≤δ(A/V)≤δ(A/E),
(iv) follows from Lemma 6.4(3), and (i) and (ii) since V≤⟨VA⟩.
E≤⟨EA⟩.
As seen before (ii) we have o−dim(E∗/A∗)≤m. Hence
we have A≤⟨AE⟩ by C⊨ϕ(A/B).
E and A are
strong in ⟨EA⟩.
By Lemma 6.3 and (iii)
0≤δ(A/V)≤δ(A/E)≤δ(A/E∩A).
Hence
E∩A=B,
since otherwise
the definition of a minimal prealgebraic extension and (vi) would imply
0≤δ(A/V)≤δ(A/E)≤δ(A/E∩A)<0,
a contradiction. Then (vi) and (vii) imply
0≤δ(A/V)≤δ(A/E)≤δ(A/B)=0
It follows by Corollary 6.8:
⟨EA⟩=E⊗BA
By Lemma 6.4(2) we get
If 0<∣XV∣, then δ(A/V)<δ(A/E).
By (x) and (viii) it follows that XV is empty. Hence we can apply Lemma 6.4(5) and get:
⟨VA⟩=V⊗EA.
By Trans (ix) and (xi) imply
⟨VA⟩=V⊗BA.
∎
Lemma 10.5**.**
Assume ϕ∈Xhome, and C⊨ϕ(A/B). Furthermore B⊆V≤C and V∈H3. Then
- (1)
Either A⊆V or ⟨AV⟩=V⊗BA and
⟨AV⟩≤C is a minimal prealgebraic extension of V.
2. (2)
In both cases A⊆cl(V).
Proof.
The assertions (1) and (2) are direct consequences of Lemma 10.4. A minimal prealgebraic
extension of a strong substructure is strong.
∎
Corollary 10.6**.**
For B⊆C and ϕ∈Xhome with C⊨∃xˉϕ(xˉ,B) we have
ϕ(xˉ,B) is strongly minimal.
Proof.
Assume C⊨ϕ(A/B).
The pair B≤A is in K3
and there is no x∈A∖B with [e,x]=d, where e,d∈B, since the extension is prealgebraic minimal strong.
Let B⊆C≤M≺C. By C⊨ϕ(A/B) B is sufficiently strong in C for the application of Theorem 6.15. Hence C⊗BA′ exist as a substructure of C, where tp(A′/B)=tp(A/B). By saturation this remains true, if we replace C by a model M:
[TABLE]
Hence there is a realisation of ϕ(x,B) generic over M. By Corollary 10.5 every
solution A that is not in M has this form:
[TABLE]
Hence ϕ(xˉ,B) is strongly minimal.
∎
Lemma 10.7**.**
Let ϕ(xˉ,yˉ)∈Xhome and C⊨∃xˉϕ(xˉ/B). Then B is the canonical paramter up to some automorphisms of B.
Proof.
Let M⪯C be saturated, such that B⊆M. By Lemma 10.6 there is a solution aˉ of ϕ(xˉ,B) generic over M. We use A=⟨Baˉ⟩. Then A∩M=B
Let f be an automorphism of C that fixes B pointweise and M setwise. Then tp(aˉ/M)=tp(f(aˉ)/M) by Lemma 10.5 and Corollary 10.6.
Now we consider an automorphism f of C, such that f fixes M setwise and f(tp(aˉ/M))=tp(aˉ/M).
W.l.o.g. f fixes aˉ pointwise. By Lemma 10.5
[TABLE]
We assume B=f(B) and show a contradiction. By Lemma 10.2 we get
[TABLE]
and ⟨(B∩f(B))aˉ⟩ is again ≤m-strong in C and it is a minimal
prealgebraic extension over a smaller substructure. See Lemma 6.4.
∎
Definition 10.8**.**
Assume bˉ⊆V for V∈H3, ϕ(xˉ,yˉ)∈Xhome, and aˉ is a solution of ϕ(xˉ,bˉ). Then aˉ is weakly generic over V, if ⟨aˉbˉ⟩∩V=⟨bˉ⟩ and δ(aˉ/V)=0. (short \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}}^{w}-generic).
Lemma 10.4 implies:
Corollary 10.9**.**
Assume bˉ⊆V for V∈H3, ϕ(xˉ,yˉ)∈Xhome, and aˉ is a weakly generic solution of ϕ(xˉ,bˉ) over V. Then ⟨Vaˉ⟩=V⊗bˉ⟨bˉaˉ⟩. aˉ is a prealgebraic minimal strong extension of V.
By Lemma 10.7 we obtain
Corollary 10.10**.**
Let ϕ(xˉ,yˉ) be a formula in Xhome. If ϕ(xˉ,bˉ) and ϕ(xˉ,b′ˉ) have common generic solutions, then ⟨b′ˉ⟩=⟨bˉ⟩ and there is an isomorphism of these two Lie - algebras, that can be extended by the identity of the common generic extension.
Hence we can define:
Definition 10.11**.**
For every ϕ(xˉ,yˉ)∈Xhome there is a unique ψ(xˉ,y)∈Leq, such that for every bˉ with C⊨∃xˉϕ(xˉ,bˉ) there is some b∈Ceq, such that ϕ(xˉ,bˉ) and ψ(xˉ,b) have the same solutions
and b is the canonical parameter of ψ(xˉ,y). Let X be the set of these ψ.
11. T3 satisfies the conditions for the collapse
In [6] there are conditions P(I) - P(VII) formulated for a theory T that provide the existence of an infinite substructure of the monster model of T with an ℵ1-categorical theory, such that cl becomes the algebraic closure in the small structure. In that paper R(C) is a vector space and we work essentially with finite subspaces of it. Here R(C) is C1∪C2 as defined above. We consider
pairs of subspaces V1⊆C1 and V2⊆C2 . Often we work with the L - structures
⟨V1V2⟩ in H3. The clousure cl can be considered as a relation beween such L -structures in H3. Elements coresspond to structures of o-dim 1. That means they
correspond to the elements of C1∪C2.
Now we transform the properties P(I) - P(VII) from [6] into conditions C(I) - C(VII) and
show that they are true in models of our theory T3. Then we can follow the proofs in [6].
Some modifications are necessary.
We obtain the desired Lie algebra, that is a counterexample to Zil’ber’s conjecture.
Let M be a model of T3. We work with
R(M) , the pregeometry cl on R(M), the set X of formulas,
and \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}}^{w} - genericity, as we have defined in this paper. Let C be again the monster model of T3.
- C(1)
The models M of T3 are graded
3-nilpotent Lie algebras over
Fq, where Fq is a finite field. The graduation is given by U1,U2,U3.
We work with R(x)=U1(x)∪U2(x) in M. Then M=⟨R(M)⟩.
C(1) is clear
- C(2)
There is a pregeometry on R(M), given by a∈cl(H) for a∈R(M) and H∈H3 and a notion ” H is a strong
substructure of M”, short H≤M. Both notions are invariant under automorphisms of C. ⟨0⟩≤M. For every finite H there exists an finite algebraic extension that is strong in M. Algebraic extensions of strong subspaces in H3 are strong. If M and N are models of T3, H⊆R(M), K⊆R(N), tpM(H)=tpN(K), and a∈Mi and b∈Ni for i=1 or i=2 are geometrically independent of H and K respectively, then tpM(a,H)=tpN(b,K). If in this case H≤M, then ⟨Ha⟩≤M. The geometrical dimension d(C) of R(C) is infinite.
C(2) is proved in this paper, especially in section 9. The next condition is proved in section 10.
X is defined there.
- C(3)
There is a set X of formulas ψ(xˉ,y) in Leq such that ψ(xˉ,b) is either empty or strongly minimal.
If ψ(aˉ,b) is true, then b is the canonical parameter. It is the canonical base algebra B modulo some
automorphisms.
aˉ=aˉ1aˉ2 with aˉ1⊆U1 and
aˉ2⊆U2 defines an o-system over B.
If ψ(xˉ,b) and ψ(xˉ,b′) have common generic solutions, then b=b′.
Length(xˉ)=nψ≥2.
If b is in dcleq(U) and M⊨ψ(aˉ,b), then aˉ∈cl(U).
If furthermore U≤M, then either aˉ⊆U or aˉ is a generic solution over U. In the generic case ⟨Uaˉ⟩≤M.
X is closed under affine o-transformations. See below.
We want to explane, what it means that X is closed under affine o-transformations:
We consider ψ(xˉ,y) in X.
Let ϕ(xˉ,yˉ) be a corresponding formula in Xhome. By Definition 10.3
and Lemma 10.4
we have that C⊨ϕ(aˉ,bˉ), aˉ∈/U, bˉ∈U,
and δ(aˉ/U)≥0 implies
[TABLE]
If cˉ∈⟨Uaˉ⟩∖U is an o-system over U with
[TABLE]
then c1ˉ=H1(a1ˉ)+m1ˉ, where H1 is a vector space
automorphism of ⟨a1ˉ⟩ and m1ˉ is a tuple in U1.
Furthermore c2ˉ=H2(a2ˉ)+Hd(a1ˉ)+m2ˉ, where H2 is
a vector space automorphism of ⟨a2ˉ⟩,
Hd(a1ˉ)=(…,∑j[di,j,a1j],…),
where di,j is in U1, and m2ˉ is a tuple in U2.
The matrix Hd uses the Lie-multiplication.
The tuple H1(a1ˉ),H2(a2ˉ)+Hd(a1ˉ) we denote by H(aˉ).
Definition 11.1**.**
We call H(aˉ) an o-transformation over B, if all di,j∈B. Furthermore
H(aˉ)+m1m2ˉ is an affine o-transformation over B.
H(aˉ)+m1m2ˉ gives us a new generating o-system of ⟨Uaˉ⟩ over U. As above we get a
a formula in Xhome for ϕ(H(xˉ)+mˉ,bˉ). An o-transformation H(xˉ)
is an homomorphism of the the underlying vector space of Cnα.
It is easily seen:
Lemma 11.2**.**
Assume that U≤C, ⟨Uaˉ⟩=⟨Ueˉ⟩
are a minimal prealgebraic extension of U given by
C⊨ϕ(aˉ,bˉ) and C⊨ψ(eˉ,cˉ)
with ϕ,ψ∈Xhome and bˉ and cˉ are in B⊆U.
Then the generating o-system eˉ of ⟨Uaˉ⟩ over U
is given by an affine
o-transformation of aˉ over B.
Proof.
By the considerations above we have eˉ=H(aˉ)+mˉ, where H is an
o-transformation and mˉ∈U. By Lemma 10.4
[TABLE]
and
[TABLE]
Since every element of eˉ2 is involved in some relations,
these relations have to split.
We get that H is an o-transformation over B.
∎
Also the next condition we have proved:
- C(4)
Let H≤M, K≤M. If ⟨H⟩≅⟨K⟩, then tp(H)=tp(K).
If H≤K≤M, H⊆K⊆cl(H), then there is a chain H=K0≤K1≤…≤Kn, where Kn=K, Ki≤M, and Ki+1⊆acl(Ki) or Ki+1 is obtained from Ki by adding a solution of some ψ(xˉ,b) in X generic over Ki, where b⊆dcleq(Ki).
- C(5a)
Let ψ(xˉ,y)∈X, V a subspace in H3, and b∈dcleq(V). Then the \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}}-generic type of ψ(xˉ,b) over V is \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}}^{w}-generic over V and all \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}}^{w}-generics of ψ(xˉ,b) over V have the same isomorphism type over V. They are \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}}^{w}-generic over every U⊆V with b∈dcleq(U).
2. C(5b)
If ψ(xˉ,y)∈X, U≤M, b∈dcleq(H), and eˉ0,eˉ1,… are solutions of ψ(xˉ,b) with eˉi⊆⟨U,H,eˉ0,…,eˉi−1)⟩,
then there are at most δ(H/U)
many i such that ei is not \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}}^{w}-generic over ⟨U,H,eˉ0,…,eˉi−1⟩.
The first statements of C(5) follow from 10.4 and 10.9. To prove the last assertion,
we consider
[TABLE]
where δj=δ(ejˉ/⟨U,H,e0ˉ,…,ej−1ˉ⟩).
If δj≥0, then ej is \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}}^{w}-generic over ⟨U,H,eˉ0,…,eˉj−1⟩ by Lemma 10.4. This proves the assertion.
Definition 11.3**.**
Let X be a definable subset of Cn of Morley - degree 1.
We consider Cn as a group with respect to +.
X is called a group set (respectively torsor set) if its generic type is the generic type of a definable subgroup of Cn (respectively coset of a definable subgroup). X is groupless if it is not a torsor set.
Let D be a subalgebra of C. Furthermore ϕ(xˉ,eˉ) is in Xhome with
eˉ∈D and there are at least 2 solutions in D, that form an o-system over eˉ. We
assume, that D∗≅F(X)/I, where X is a generating o-system of D∗
that contains the o-system eˉ1eˉ2 and F(X) is the
free 2-nilpotent graded Lie algebra over X. The isomorphism-type of the U1⊕U2-part of the solution set
of ϕ is given by linear combinations Θ of monomials [x,y] where x is from
xˉ1 and y from eˉ1 or xˉ1 and of one element g from
⟨eˉ⟩2. We call Θ a relation of level 2.
Let aˉ be a solution.
Since g is also a term over the second solution, we can assume
w.l.o.g. that Θ(aˉ,eˉ)∈I.
Then we consider D−=F(D∗)/J. Similary as above we define relations Δ of level 3.
Again it contains one summand h from ⟨eˉ⟩3 and we can consider it
as a term over the second solution. Hence w.l.o.g. Δ(aˉ,eˉ)∈J.
Corollary 11.4**.**
We are in the situation above. A solution of ϕ(xˉ,eˉ) in D is given by relations
of levels 2 and 3 that are in I or J respectively.
- C(6)
Assume C⊇B⊆A are strong subspaces of C in H3fin with C∩A=B and both minimal strong extensions of B given by generic solutions over B of formulas in X. Furthermore there are e∈dcleq(E), E∈H3, E⊆⟨AC⟩, and
at least two solutions in ⟨CA⟩ of some ψ(xˉ,e) in X.
Let dˉ∈⟨AC⟩ be a solution of ψ(xˉ,e) in X \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}}^{w}-generic over ⟨CE⟩ and over ⟨AE⟩.
Then ψ(xˉ,e) defines a torsor set. If it defines a group set, then e is in dcleq(B).
We can assume, that C and A are defined by formulas in Xhome with canonical base
algebras in B.
We prove C(6). By assumption we have δ(C)=δ(B)=δ(A) and B≤C by Corollary 6.9. By Lemma 6.3 we get
[TABLE]
Since B≤C it follows δ(⟨CA⟩)=δ(B) and ⟨CA⟩≤C.
Since δ(A/C)=δ(A/B), we have by Lemma 6.12
[TABLE]
D is in H3fin.
Assume (D∗)=F(X)/I and D−=F(D∗)/N, where X is a generating o-system of D∗,
F(X) is the free 2-nilpotent Lie algebra over X. Later we will modify X.
Then I⊆F(C1)2+F(A1)2. Since C≤C and A≤C we can suppose w.l.o.g. that F(C∗)⊆F(D∗),
F(A∗)⊆F(D∗), and F(B∗)=F(C∗)∩F(A∗)⊆F(D∗).
We obtain
N⊆F(C∗)3+F(A∗)3.
Let ϕ(xˉ,eˉ)∈Xhome be the corresponding formula for ψ(xˉ,e), , where e is eˉ modulo some automorphisms and ⟨eˉ⟩⊆E.
We can assume, that eˉ=e1ˉe2ˉe3ˉ
is a generating o-system for
⟨eˉ⟩.
We assume that the solution dˉ of ψ(xˉ,y) consists of d1i∈U1 for 1≤i≤m and
d2i∈U2 for m<i≤n.
Let XB=X1BX2BX3B with XiB⊆Bi be a vector space basis of B.
We extend XB by XC to get a vector space basis for C and
by XA to obtain a vector space basis for A. XC and XA should be graded as XB.
We can extend XBXCXA to obtain a vector space basis of C⊗BA as in Corollary 3.9.
Corollary 11.4 implies, that diˉ⊆Ci+Ai for i=1,2, since these elements have to be involved in relations of I or N.
The same is true for elements in eˉ . Here elements in C3+A3 are possible.
Hence
the elements d1j∈C1 of dˉ have to be in C1+A1 and the elements d2j have to be in
C2+A2. Since dˉ is \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}}^{w} - generic over ⟨CE⟩ and ⟨AE⟩, we get
d1j=c1j+a1j, where the c1j∈C1 are linearly independent over A1+E1 and the a1j∈A1 are linearly independent over C1+E1 and
d2j=c2j+a2j, where the c2j∈C2 are linearly independent over A2+E2 and the a2j∈A2 are linearly independent over C2+E2 .
Since dˉ is a weakly generic solution over ⟨CE⟩ and ⟨AE⟩
Corollary 10.9 implies
[TABLE]
and
[TABLE]
Note that mixed monomials [x,y] with x∈X1C and y∈X1A are linearly independent over C2+A2 and cannot be involved in any relation of I.
We choose the vector space bases above with the following additional assumptions for i=1,2,3:
XB contains a vector space bases ViB with elements eiB,j for ⟨eiˉ⟩∩B, where i=1,2,3.
XC contains a vector space bases ViC with elemets eiC,j for
⟨eiˉ⟩∩C modulo Bi.
XA contains a vector space bases ViA with elements eiA,j for
⟨eiˉ⟩∩A modulo Bi.
Furthermore there are fij∈XiC and gij∈XiA, such that ViBViCViA together with the basis Vi+ of elements
fij+gij form a vector space basis of ⟨eˉ⟩i∩(Ci+Ai).
The cij and aij are linearly independent over ViBViAViC…fij…gij….
We assume that they are part of our basis XBXCXA.
An element Θ in I∩⟨e1ˉd1ˉ⟩2F(D1) has the form:
[TABLE]
where h1j∈⟨e1ˉ⟩∩B1 , Θc∈F(C1)2 , and Θa∈F(A1)2 , and Θc+Θa∈⟨eˉ⟩2. Here we use the description of a vector space basis of
C⊗BA and I⊆⟨C1⟩2F(D1)+⟨A1⟩2F(D1).
We call the h1j the coefficients of Θ.
Corollary 3.9
implies that the description of a vector space basis for the representation of Θ as above work also for ⟨CEdˉ⟩=⟨CE⟩⊗⟨eˉ⟩⟨eˉdˉ⟩
and
⟨AEdˉ⟩=⟨AE⟩⊗⟨eˉ⟩⟨eˉdˉ⟩.
We see that the relations of level 2 define a torsor set. In the case of a group set there are no Θc+Θa and we have only the coefficients in B.
Now we turn to level 3: F(D∗)3.
We need an order of a subspace of D1. We define V1B<V1C<V1A<V1+<c1j<a1j. Inside V1B, V1C, V1A, and V1+ the order is given by the indizies. Furthermore
c1j<a1j<c1k<a1k, if j<k. We consider
[TABLE]
⟨eˉdˉ⟩2F(D∗)∩(F(C∗)+F(A∗))2 has the following vector space basis:
V2=V2BV2CV2AV2+V20V21, where V21={d2j:m<j≤n} and V20 is a subset of {[d1j,e1B,k]:1≤j≤m,k}. By assumption the [c1j,e1B,k] as summands of [d1j,e1B,k]∈V20 are linearly independent over
A2+E2. The same is true for the [a1j,e1B,k] over C2+E2.
In the next application of Corollary 3.9 we use [[d1j,d1k],x]=[[d1j,x],d1k]−[[d1k,x],d1j].
Then the following set W is a vector space basis of ⟨eˉdˉ⟩3F(D∗)
over F(C∗)3+F(A∗)3:
[TABLE]
where
- (1)
W1={[d2j,x]:m<j≤n,x∈V1C∪V1A∪V1+∪{d1k:1≤k≤m},}
2. (2)
W2={[[d1i,d1j],d1k]:j<i,j≤k},
3. (3)
W3={[y,d1k]:1≤k≤m,y∈V2∖(V2B∪V21)},
4. (4)
W4={[y,d1k]:1≤k≤m,y=[x,z],((x∈V1C∧z∈V1A∪V1+)∨(x∈V1A∧z∈V1+)∨(x=f1i+g1i∧z=f1j+g1j∧i<j),
5. (5)
W5={[[d1i,z],v]:1≤i≤m,z<v,z,v∈V1CV1AV1+}.
6. (6)
W6={[[d1i,z],d1k]:1≤i≤k≤m,z∈V1CV1AV1+}.
Finally we consider elements Δ∈N∩⟨eˉdˉ⟩3F(D∗). They need to have
the following form:
[TABLE]
where Δc∈F(C∗)3, Δa∈F(A∗)3,
Δc+Δa∈⟨eˉ⟩3F(D∗),
and Δd is a sum of monomials over
eˉdˉ that contain at least one dij. By the linear independence of W over F(C∗)3+F(A∗)3 we get that
Δd is a linear combination of monomials [d2i,h1], [d1i,h2], and [[d1i,h1j],h1k], where the coefficients h1, h1j, and h1k are all in B1∩⟨eˉ⟩1 and h2 is in B2∩⟨eˉ⟩2.
By the form of the Θ and Δ we see that ψ(xˉ,e) defines a torsor set in R(C)n.
If it is a group set, then we have only the coefficients in B.
- C(7)
For every substructure X of M with acl(R(X))∩R(M)=R(X),
X1=⟨0⟩, and ⟨R(X)⟩=X, we have
that X is the set of all d=a1+a2+[c1,c2], where a1,c1∈R(X)1 and a2,c2∈R(X)2.
C(7) is clearly fulfilled. We have shown:
Theorem 11.5**.**
T3* satiesfies the conditions C(1) - C(7).*
The proof of (C6) implies the following
Corollary 11.6**.**
*Assume ϕ(xˉ,yˉ)∈Xhome corresponds to ψ(xˉ,y)∈X.
If ϕ(xˉ,yˉ)∈Xhome gives us a torsor set, then isomorphism type of xˉ over
yˉ is given by equations of the following form:*
[TABLE]
where zj∈⟨yˉ⟩1 and y2∈⟨yˉ⟩2 or
[TABLE]
*where the wj are monomials of the form [x2k,v1] with v1∈⟨yˉ⟩1
or of the form [x1k,v2] with v2∈⟨yˉ⟩2, or of the form
[[x1k,v1l],v1i] with v1l,v1i∈⟨yˉ⟩1 and
y3∈⟨yˉ3⟩.
A group set, given by a formula in X, has no y2 and y3 in the equations.
If the set defined by ϕ(xˉ,yˉ)∈Xhome is a torsor set, then ϕ(xˉ,yˉ)∈Xhome defines itself a coset of a group. In case of a group set it defines a group.*
Proof.
First we assume that ϕ gives a group set.
In the setting of (C6) let A and C be extension of B, given by generic solutions aˉ
and cˉ of ϕ(xˉ,bˉ) over B. By definition aˉ+cˉ is a solution
of ϕ(xˉ,bˉ) weakly generic over A and C. Then the proof of (C6) gives the
assertion. If ϕ gives a torsor set, then let aˉ be again a generic solution of ϕ and
cˉ a solution of the corresponding group set.
∎
12. Codes and Difference Sequences
To get our main result we follow the proof in [6]. We replace the conditions P(I) - P(VII)
in that paper by C(1) - C(7).
R(C) is the union of two connected vector spaces now.
According to this we have two kinds of elements in R(C).
Therefore we consider substructures in H3 instead of the vector subspaces in [6].
Our approach in this paper is not strict axiomatic using C(1) - C(7), as in [6]. The next Lemma corresponds to Lemma 3.6 in [6].
Lemma 12.1**.**
Assume M is a model of T3, A,U∈H3 with A≤Mand U≤M. Then
- ( i)
A∩U≤M, and
2. (ii)
If A∩U∈H3, d(A/U)=d(A/A∩U), then ⟨UA⟩≤M.
There is a sequence of minimal strong extensions for A
[TABLE]
For every such sequence for A over A∩U
[TABLE]
is a sequence of minimal strong extensions for ⟨UA⟩ over U.
Proof.
ad(i) For finite U (i) is Lemma 6.9. Otherewise there is a finite U0≤M
with A∩U⊆U0⊆U. Then A∩U=A∩U0≤M.
ad(ii)
By Lemma 9.7 we get a geometrical
sequence A∩U=B0≤B1≤…≤Bk=A. That means Bi+1 is minimal strong over Bi. All Bi are strong in M.
We show by induction on i that ⟨UBi⟩≤M. We have
⟨UB0⟩=U≤M. If Bi+1=⟨Bi,b⟩ where b
is algebraic over Bi, then ⟨UBib⟩≤M by C(2). In the prealgebraic case the
assertion follows from ⟨UBi⟩≤M and C(3). In the
transcendental case Bi+1=⟨Bib⟩ with
b∈/cl(Bi) we have b∈/cl(⟨BiU⟩) since
d(A/U)=d(A/B0). By C(2) ⟨Bi+1U⟩≤M.
∎
Definition 12.2**.**
Two definable sets X and Y of Morley degree 1 are equivalent, if MR(X)=MR(Y) and MR(XΔY)<MR(X). We write X∼Y.
Definition 12.3**.**
We consider definable sets X⊆Cn where the elements aˉ=a1ˉa2ˉ are o-systems with U1(a1j) and U2(a2j). If H(xˉ) is an o-transformation, then we use
H(X)={H(aˉ):aˉ∈X}.
X+mˉ={a1ˉ+m1ˉ,a2ˉ+m2ˉ:aˉ∈X} for mˉ=m1ˉm2ˉ with U1(m1ˉ) and U2(m2ˉ).
The next 3 lemmas concern countable ω-stable theories. In 12.5 2) we consider
only T3.
For background and proofs see also [6]:
Lemma 12.4**.**
*(Version of Martin Ziegler [21])
Assume that T is a countable ω-stable theory of expansions of abelian groups.
Let M be a model of T and a, b, c be elements of M with a+b+c=0 and pairwise independent over some set B. Then we have:*
-
The strong types of the elements a, b, c over B have the same stabilizer U and U is connected.
2. 2)
a, b, and c are generic elements of acl(B)-definable cosets of U.
3. 3)
It follows that a, b, and c have the same Morley rank over B namely MR(U). U is definable over acl(B).
Lemma 12.5**.**
Let X, Y be definable sets of Morley degree 1.
-
If X∼Y, X,Y⊆Cn, and X is a group set (resp. torsor set), then Y is a group set (resp. torsor set).
2. 2)
We work in T3. We assume X is defined by some ϕ(xˉ,bˉ) in
Xhome in Cn and H(X) is a o-transformation over dˉ.
If X is a group set then H(X) is a group set. If X is a torsor set then H(X)+mˉ is a torsor
set.
Proof.
ad(2) If X is a group set, then H(X) is a group set by Corollary 11.6. For H(X) there is a
formula in Xhome over ⟨bˉdˉ⟩.
∎
Lemma 12.6**.**
Let φ(xˉ,yˉ) be a formula such that C⊨∃xˉφ(xˉ,bˉ) implies that φ(C,bˉ) is a strongly minimal subset of Cn.
Then {bˉ:φ(C,bˉ)\mboxisagroupset} is definable. Similarly for torsor sets.
Proof. We consider the group case. The following statements are equivalent:
- i)
φ(C,bˉ) is a group set.
2. ii)
There exist two generic bˉ-independent realizations aˉ1 and aˉ2 of φ(xˉ,bˉ) such that C⊨φ(aˉ1+aˉ2,bˉ).
3. iii)
C⊨∃∞xˉ1∈Cn∃∞xˉ2∈Cn(φ(xˉ1,bˉ)∧φ(xˉ2,bˉ)∧φ(xˉ1+xˉ2,bˉ)).
The equivalence of i) and ii) is shown in
[10]. iii) is first order since
φ(xˉ,bˉ) is strongly minimal. It is clearly
equivalent with ii). □
Note that X is a torsor set if for some (every) x∈X the set X−x is a group set.
Definition 12.7**.**
Given a group set X defined by a formula in Xhome over bˉ,
its invariant group is the set Inv(X) of o-transformations H over
bˉ with H(X)∼X.
For strongly minimal φ(xˉ,bˉ) ”H∈Inv(φ(xˉ,bˉ))” is an elementary property of bˉ. As in [10] Lemma 12.4 implies
Lemma 12.8**.**
*Let X⊆Cn be defined by a formula ϕ(xˉ,bˉ)∈Xhome, where
bˉ⊆B. H is an o-transformation over bˉ.
Let eˉ0 and eˉ1 be two generic B-independent elements in X. If \bar{e}_{0}-H\bar{e}_{1}\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}}\limits_{B}\bar{e}_{0} , then X is a torsor set. Moreover, if X is a group set, then H is in Inv(X).*
Proof.
Note that H(ejˉ) and ejˉ are interdefinable over B. We have
[TABLE]
Hence by Lemma 12.4 X is a torsor set. By Corollary 11.6 ϕ(xˉ,bˉ) defines
the coset. In the group case H(e1ˉ) is a generic element of a coset of X. By Lemma 12.5
H(X) is a group set, in fact a group. Hence X=H(X).
∎
Lemma 12.9**.**
- a)
Let φ(xˉ,y) and
ψ(xˉ0,…,xˉμ,y) be formulas where
xˉ and xˉi are in the home sort. Assume that
φ(xˉ,b) is strongly minimal where b is
in Ceq. Then we can express that any Morley sequence
aˉ0,…,aˉμ of φ(xˉ,b)
fulfils ⊨ψ(aˉ0,…,aˉμ,b).
2. b)
X∼Y* for strongly minimal sets can be
expressed.*
Proof.
b) follows from a) and
[TABLE]
is the desired formula in a).
∎
Definition 12.10**.**
If X is a strongly minimal subset of Cn and X∼φ(xˉ,b) where b∈Ceq, then we say that X is encoded by φ(xˉ,y).
We define codes similarly as in [10] and [6]. It is a modification of E. Hrushovski’s definition [15] to our context. The set C of good codes is a modification
of X.
Definition 12.11**.**
φα(xˉ,y) is a code formula or short a code, if it fulfils the following conditions:
- a)
Length(xˉ)=nα≥2, y is an element in Ceq that encodes a substructure
⟨yˉ⟩, and xˉ=x1ˉx2ˉ is an o-system over ⟨yˉ⟩, where x1ˉ
is in U1 and x2ˉ is in U2.
2. b)
The set φα(xˉ,b) is either empty or strongly minimal.
3. c)
nα is the o-dimension for all solutions.
4. d)
φα(xˉ,b)∼φα(xˉ,b′) implies b=b′.
5. e)
If some non-empty φα(xˉ,b) is groupless, then all φα(xˉ,b′) are.
6. f)
φα(x1ˉ+m1ˉ,x2ˉ+m2ˉ,b) is encoded by φα for all
m1ˉ∈C1∣x1ˉ∣ and all
m2ˉ∈C2∣x2ˉ∣.
7. g)
For all o-transformations H over ⟨dˉ⟩ the set φα(H(xˉ),,b) is encoded by φα.
By b) and d) b is the canonical parameter of φα(xˉ,b).
Lemma 12.12**.**
There is a set C0 of codes φα(xˉ,y) that encodes the strongly minimal sets that are encoded by the formulas in X.
Proof.
The proof is similar as the proof in [6] and that proof comes from [10].
The formulas in
X have the properties a)–d). Using Lemma 12.6 we
can assume w.l.o.g. that the formulas in X satisfy
a)–e). Since X is closed under suitable affine o-transformations given in f) and g) by
compactness there are finitely many φ1,…,φr
in X that encode all possible suitable affine o-transformations of
some given φ(xˉ,b).
Moreover we know that either all or none encode groupless sets by Lemma 12.5.
Choose a sequence w1,…,wr of different definable elements in Teq. Define
[TABLE]
Finally let φα(xˉ,y1,y)=i=1⋁r(φi′(xˉ,y)∧y1=wi).
φα has the properties a)–e). To show f) and g) let b, m1ˉ,m2ˉ, H1,Hd,H2 be given. By construction φα(xˉ,b1,b) is equivalent to some φ(H1′(x1ˉ)+m1ˉ′,H2′(x2)ˉ+Hd′′(x1ˉ)+m2ˉ′,b′). Hence
[TABLE]
[TABLE]
and the right side is encoded by φα by construction,
since
[TABLE]
for some Hc.
∎
Theorem 12.13**.**
There is a set C of good codes such that for every φ(xˉ,b) in X there is a unique φα(xˉ,c) in C such that φ(C,b)∼φα(C,c).
Proof.
(modification of the proofs in [6] and [10])
Let αi be a list of all codes from C0 (see Lemma 12.12). Again
define:
[TABLE]
φαi′ satisfies a)–e) we have to show f) and g). By construction φαi′(H(xˉ)+mˉ,b) is encoded by φαi. We need only to show that no φαj with j<i encodes it. Suppose that
[TABLE]
Then
[TABLE]
for some b′′. This contradicts the definition of φα′. Hence
C+={αi′:i<ω} has the desired properties.
∎
Corollary 12.14**.**
In the definition of C(1) - C(7) we can replace X by a set C of good codes.
Corollary 12.15**.**
If D≤C and D′ is a prealgebraic minimal extension of D, then there is a
unique good code α such that there is some b in dcleq(D) and a generic solution aˉ of φα(xˉ,b) that generates D′ over D. If cˉ is a generating
o-system of D′ over D, then there is some d∈dcleq(D) such that
cˉ is a generic solution of φα(xˉ,d)
Proof.
This follows from the properties of good codes, Lemma 12.13, and
Corollary 12.14.
∎
For each α∈C we choose a natural number mα such that
the existence of mα common solutions of φα(xˉ,bˉ) and φα(xˉ,bˉ′) implies φα(xˉ,bˉ)∼φα(xˉ,bˉ′). This is possible by the strong minimality of φα(xˉ,yˉ).
Theorem 12.16**.**
For each α∈C and λ≥mα there is a formula ψα(xˉ0,…,xˉλ) with the following properties:
- a)
For any initial segment {eˉ0,…,eˉλ,fˉ} of a Morley sequence of φα(xˉ,b)
[TABLE]
holds.
2. b)
For each realization (eˉ0,…,eˉλ) of ψα there is a unique b with ⊨φα(eˉi,b) for 0≤i≤λ. Moreover b∈dcleq(eˉi1,…,eˉimα) for any i1<…<imα.
(We call b the canonical parameter of the sequence eˉ0,…,eˉλ).
3. c)
b* encodes a unique canonical substructure ⟨bˉ⟩ for a corresponding formula in Xhome and each realization of ψα forms an o-system over ⟨bˉ⟩.*
4. d)
If ⊨ψα(eˉ0,…,eˉλ), then for i∈{0,…,λ}:
[TABLE]
5. e)
Given a realization (eˉ0,…,eˉλ) of ψα with canonical parameter b as in b), we have the following:
Suppose α is groupless:
-
If eˉi is a generic solution of φ(xˉ,bˉ), then \bar{e}_{i}-H\bar{e}_{j}\mathop{\mathchoice{\displaystyle\kern 5.71527pt\hbox to0.0pt{\hss\displaystyle\mathchar 566\relax\kern 8.00134pt\hss}\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\mathchar 566\relax\kern 8.00134pt\hss}\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\mathchar 566\relax\kern 3.92064pt\hss}\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\mathchar 566\relax\kern 2.00034pt\hss}\hbox to0.0pt{\hss\scriptscriptstyle\mid\hss}\lower 0.96873pt\hbox to0.0pt{\hss\scriptscriptstyle\smile\hss}\kern 1.42882pt}}\limits_{\bar{b}}\bar{e}_{i} for all o-transformations H over bˉ and j=i.
Suppose α is a coset code, then:
-
φα(xˉ,b)* is a group-set.*
2. 3)
ψα(eˉ0,…,eˉi−1,eˉi−eˉj,eˉi+1,…,eˉλ)* for j=i.*
3. 4)
ψα(eˉ0,…,eˉi−1,Heˉi,eˉi+1,…,eˉλ)* for all suitable o-transformations H∈Inv(φα(xˉ,b)) over bˉ.*
4. 5)
Moreover, if eˉi is generic in φα(xˉ,bˉ), then \bar{e}_{i}-H\bar{e}_{j}\mathop{\mathchoice{\displaystyle\kern 5.71527pt\hbox to0.0pt{\hss\displaystyle\mathchar 566\relax\kern 8.00134pt\hss}\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\mathchar 566\relax\kern 8.00134pt\hss}\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\mathchar 566\relax\kern 3.92064pt\hss}\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\mathchar 566\relax\kern 2.00034pt\hss}\hbox to0.0pt{\hss\scriptscriptstyle\mid\hss}\lower 0.96873pt\hbox to0.0pt{\hss\scriptscriptstyle\smile\hss}\kern 1.42882pt}}\limits_{\bar{b}}\bar{e}_{i} for all j=i and
all suitable o-transformations
H over bˉ not in Inv(φα(xˉ,b)).
Proof.
(Copy of the corresponding proof in [10] but in another theory.)
We consider the following partial type
[TABLE]
Claim. Σ has the properties a) – e).
Proof of the claim. a) is clear.
Given such a realization eˉ0,…,eˉλ of Σ,
where b′ and aˉ0,…,aˉλ,fˉ
are given as above. Hence {eˉi}0≤i≤λ is a Morley sequence of φα(xˉ+fˉ,bˉ′). Then φα(xˉ+fˉ,b′)∼φα(xˉ,b) for some b by f) in the definition of codes.
Since b is the canonical parameter of the generic type determined by φα(xˉ,b), the sequence {eˉi}0≤i≤λ is a Morley sequence for φα(xˉ,b). Given another b∗ which satisfies φα(eˉi,yˉ) for mα many i’s, it follows that φα(xˉ,b∗)∼φα(xˉ,b) by the choice of mα. By d) in the code-definition b∗=b. Hence b) is true for Σ.
c) is clear.
Since aˉ0,…,aˉi−1,fˉ,aˉi+1,…,aˉλ,aˉi is again a Morley sequence for φα(xˉ,b′) we have
[TABLE]
and hence
[TABLE]
We get d).
To prove e) we assume first that α is groupless (e1). That means φα(xˉ,b) is not a torsor set. By Lemma 12.8 the assertion follows.
Otherwise X=φα(C,b′) is a torsor set. Hence X−fˉ∼φα(xˉ,b) is a group set since fˉ is in X. This is (e2).
To prove (e3) we extend the Morley sequence {eˉi:0≤i≤λ} by an element dˉ. Then
[TABLE]
is again a Morley sequence for φα(xˉ,bˉ). Hence
[TABLE]
Similarly we get e4).
e5) follows again by Lemma 12.8. □(Claim)
Using compactness we get a finite part ψα′ of Σ that implies a), b), c), e1), e2), e5).
If α is groupless consider the following operations:
[TABLE]
and V be the subgroup generated by these operations. V is finite. Then
[TABLE]
satisfies d) and is also part of Σ.
If α is an coset code, property d) follows from e3) and e4). Hence it is sufficient that ψα satisfies e3) and e4). Let W(xˉ0,…,xˉλ) be the subgroup generated by the operations mentioned in e3) and e4). Again W is finite, and depends on Inv(φα(xˉ,bˉ)). Note that λ≥mα, hence b remains constant in b) after applying these operations. Set therefore:
[TABLE]
which has the required properties.
∎
Definition 12.17**.**
Let α, λ and ψα be as above. A realization of ψα is called a difference sequence for α. Moreover, given a realization eˉ0,…,eˉλ of ψα, we denote by a derived difference sequence one obtained by composition of the following operations:
[TABLE]
If ν≤λ and we use the operations above only for i≤ν, then we speak about a ν-derived sequence.
Corollary 12.18**.**
A permutation of a difference sequence is a difference sequence.
Proof.
Note that all permutations of a difference sequence
are obtained by the operation in d) of
Theorem 12.16.
∎
13. Bounds for difference sequences
A difference sequence for a good code α∈C forms an o-system. See Theorem 12.16c).
The next lemma is Lemma 5.1 in [6]. In our contex it needs a modified proof.
Lemma 13.1**.**
For every code formula φα(xˉ,y) and every natural number r, there is some
λ(r,α)=λ>0 such that for every D≤C and every difference sequence
e0ˉ,…,eμˉ for φα(xˉ,y) with canonical parameter b and
μ≥λ either
- (i)
the canonical parameter of some λ-derived sequence of e0ˉ,…,eμˉ
lies in dcleq(D)
or
- (ii)
for every α-o-system mˉ the sequence e0ˉ,…,eμˉ contains
a subsequence ei0ˉ,…,eir−1ˉ, such that mα≤ij and eij is
\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}}^{w}-generic over ⟨DBei0ˉ,…,eij−1ˉ⟩, where
B=⟨mˉ,e0ˉ,…,emα−1ˉ⟩.
Proof.
For T3
the proof in [6] needs some new ideas. We assume that the fixed finite field is F(q) with q elements.
We have ejˉ=ej1ˉej2ˉ,
where U1(ej1ˉ), U2(ej2ˉ) and analogusly xˉ=x1ˉx2ˉ.
Let x1ˉ be of length nα,1 and
x2ˉ be of length nα,2.
If assertion (i) is not true, then every suitable coset of Cnα/Dnα contains at most
mα-many elements eiˉ with i≤λ of the difference sequence under consideration.
Otherwise we could substract an ejˉ with j≤λ of a larger coset and would get a
λ-derived sequence with the canonical parameter in Deq.
Claim Assume nα,1=0. Then there is a natural number kα, such that for every μ and
every i≤μ we have ∣{j:i=j,ejˉ1=eiˉ1modD}∣≤kα.
Proof.
If nα,2=0, then kα=mα fulfills the assertion.
Now we assume, that nα,2=0.
We choose i such that ∣{j:i=j,ejˉ1=eiˉ1modD}∣ is maximal.
Since the permutation of a difference sequence is again a difference
sequence, we can assume that i=0. W.l.o.g. there is some l, such that e0ˉ1=elˉ1modD,
since otherwise we have only to ensure mα≤kα for this case.
By (d) in the definition of a difference sequence
[TABLE]
is again a difference sequence.
Hence w.l.o.g. e0ˉ1∈D and we consider Z={j:ejˉ1∈D}.
Our aim is, that we can find kα such that, ∣Z∣≤kα for all possible Z.
By assumption there are at most mα-many elements ej2 in the same coset modulo D.
After some permutations we can assume that there is some β, such that
[TABLE]
We consider E(β)2=⟨e0ˉ2,…,eβ2ˉ⟩. Let s2 be
ldim(E(β)2/B2+D2), where B=⟨mˉ,e0ˉ,…,emα−1ˉ⟩, as above.
Then ldim(E(β)2/D)≤s2+(mα+1)nα,2). All ejˉ2 with j≤β are in the
finite vector space E(β)2/D2 and at most mα many are in
the same coset of D2. We get
[TABLE]
Now define
[TABLE]
Then s2≤∣Y∣nα,2 and hence
[TABLE]
Now we choose kα, such that for all β>kα we have δ(B/D)<∣Y∣.
By (C 5b) there is at most one eiˉ that is weakly generic over ⟨DBe0ˉ,…ei−1ˉ⟩.
This is not possible, since eiˉ1∈D.
∎
Case nα,1=0.
We define E=E(λ)=⟨e0ˉ,…,eλˉ⟩. Let s be ldim(E1/B1+D1). Then ldim(E1/D1)≤s+(mα+1)nα,1.Then
[TABLE]
Define X={i:mα≤i≤λ,ei1ˉ∈/⟨D1B1+⟨e01ˉ,…,ei−11ˉ⟩1⟩. Since s≤∣X∣nα,1, we get
[TABLE]
If we choose λ sufficiently large we get
[TABLE]
By (C 5b) we get
ei0ˉ,…,eir−1ˉ, such that mα<ij and eij is
\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}}^{w}-generic over ⟨DBei0ˉ,…,eij−1ˉ⟩
Case nα,1=0.
If E=E(λ)=⟨e0ˉ,…,eλˉ⟩ as above, then E=⟨E2⟩.
We define s=ldim(E2/B2+D2). Then ldim(E2/D2)=s+(mα+1)nα,2 and
[TABLE]
Similarly as above we define
X={i:mα≤i≤λ,ei2ˉ∈/⟨D2+B2+⟨e02ˉ,…,ei−12ˉ⟩1⟩}. Since s≤∣X∣nα,2 we get
[TABLE]
We can choose λ as large such that
[TABLE]
By (C 5b) we get
ei0ˉ,…,eir−1ˉ, such that mα<ij and eij is
\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}}^{w}-generic over ⟨DBei0ˉ,…,eij−1ˉ⟩
∎
Now we consider all finite-to-one functions μ∗ and μ defined on the good codes α∈C with values in N. We assume that the following inequalities hold:
μ(α)≥mα,
μ∗(α)≥max(λ(mα+1,α)+1,nα+1),
μ(α)≥λ(μ∗(α),α)+1.
For the definition above we fix a function λ(r,α)
given by Lemma 13.1 and we assume that it is monotonous in
the first argument.
Finally we will get for each such function μ as
above a ”generic” substructure Pμ(C)≤C such that for all good codes α∈C there is no
difference sequences of length μ(α)+1.
We will extend the language L by a new predicate Pμ and consider
the structure ⟨C,Pμ(C)⟩ in the new language
Lμ. Pμ(C)
will be the desired L-structure of finite Morley rank. We will get
Pμ(C) by amalgamation of strong
subspaces in the class Kfinμ defined below.
Definition 13.2**.**
Let Kμ be the class of all strong substructures U of C in H3, such that for every good code α there is no difference sequence for α of length μ(α)+1 in U. Kfinμ are the finite structures in Kμ.
Note that difference sequences are given by realizations of the
formulasψα(xˉ0,…,xˉμ(α)) in
Theorem 12.16.
Here Kμ is a class of substructures in H3. In [6] we work with subspaces of
C1. We hav e to modify the proofs of [6] for the new contexts.
Let D≤D′ be strong subspaces of C in H3 with ldim(D′/D) finite.
By Lemma 9.7 there is a sequence of minimal strong extensions for
starting with D and arriving D′. We call it
a geometrical sequence.
In the next lemmas we will investigate the minimal steps in this sequence, especially the prealgebraic minimal steps for the case that D∈Kμ but D′∈/Kμ.
Lemma 13.3**.**
*Assume D≤D′≤C, D∈Kμ, D′ is a prealgebraic minimal extension of D and D′ is not Kμ. Let eˉ0,…,eˉμ(α) be a difference sequence
in D′ for a good code α, such that its canonical parameter c is in dcleq(D). Then we find a difference sequence dˉ0,…,dˉμ(α) for α in D′ with the same canonical parameter such that dˉ0,…,dˉμ(α)−1 are in D, and dˉμ(α) is a D-generic realization of φα(xˉ,cˉ) that generates D′ over D.
If we cannot find the new sequence by a permutation of the old one, then α is a group code and the new sequence is obtained using operations as eˉj is replaced by some H(eˉj)−eˉi where H is in Inv(φα(xˉ,cˉ)). α is the unique good code that describes D′ over D.*
Proof.
Let cˉ be a generating o-system of the canonical base algebra coded by c.
Since D∈Kμ, there is some eˉi not completely in D. Since D≤C by
C(3) eˉi is D-generic and generates D′ over D. If there is some other eˉj not completely in D, then again eˉj is D-generic and generates D′ over D.
By Lemma 11.2 eˉi=H(eˉj)−mˉj where H is a suitable o-transformation
over cˉ and mˉj is in D. Then H(eˉj)−eˉi is in D. Since eˉj is D-generic, we have
[TABLE]
By the properties of a difference sequence it follows that α is a group code and H is in Inv(φα(xˉ,cˉ)). If we replace eˉj by H(eˉj)−eˉi we obtain again a difference sequence with the same canonical parameter and this sequence has one more element in D. We can iterate the argument to obtain the assertion.
Finally for D′ over D there exists
a unique code in C by Theorem 12.13.
∎
Corollary 13.4**.**
Let D be in Kμ and D≤D′≤C be a minimal extension. If D′ has o-dimension one over D, then D′ is in Kμ. Otherwise, in the prealgebraic case, D′ is in Kμ if and only if none of the following two conditions holds:
- a)
There is a code α∈C and a difference sequence eˉ0,…eˉμ(α) for α in D′ such that
- i)
eˉ0,…,eˉμ(α)−1* are contained in D.*
2. ii)
D′=⟨Deˉμ(α)⟩ℓ.
3. iii)
In this case α is the unique good code that describes D′ over D.
2. b)
There exists a code α∈C and a difference
sequence for α in D′ of length μ(α)+1 with
canonical parameter b and with a subsequence
eˉ0,…,eˉμ∗(α)−1 of length
μ∗(α) such that eˉi is \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}}^{w}-generic over
D+B+⟨eˉ0,…,eˉi−1⟩ where B is
generated by the first mα elements of the given difference
sequence.
Proof.
Consider first the case where o−dim(D′/D)=1. Assume that D′ is not in Kμ. That means there is a difference sequence eˉ0,…,eˉμ(α). If the canonical parameter b lies in dcleq(D), then all eˉi would be in D, since eˉi∈/D
implies, that it generates a strong minimal extension over D with an o-dimension over D greater than 1. This contradicts D∈Kμ.
Otherwise by Lemma 13.1 some eˉj is a realization of
φα(xˉ,b) and an o-system over D since
μ(α)≥λ(1,α). Again we have a contradiction.
Finally we assume that D′ is minimal prealgebraic over D.
Again we assume that there is a difference sequence
eˉ0,…,eˉμ(α) in D′ for some good
code formula φα(xˉ,b) where b is
the canonical parameter. If b lies in dcleq(D), then by Lemma 13.3 we get case a). Otherwise since
μ(α)≥λ(μ∗(α),α) our sequence
contains a subsequence of length μ∗(α) as described in
b) by Lemma 13.1.
∎
14. Amalgamation in Kμ
Again we work in T3 or T3eq.
Lemma 14.1**.**
Let B⊆A and B⊆C in H3 all be strong subspaces of C. Assume that A and C are minimal prealgebraic extensions of B, A∩C=B, and that eˉ0,…,eˉμ(α) is a difference sequence for a good code α in ⟨AC⟩. Then there is a derived difference sequence of the above sequence with the canonical parameter in dcleq(C) or in dcleq(A).
Proof.
By assumption ⟨AC⟩=A⊗BC≤C, since A,B,C are strong substructures and
δ(A)=δ(B)=δ(C).
We assume that the assertion of the lemma is not
true. Let E=⟨eˉ0,…,eˉmα−1⟩. By
Lemma 13.1 we get a subsequence
eˉi0,…,eˉiμ∗(α), such that
eˉij is \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}}^{w}-generic over
⟨CEeˉi0,…,eˉij−1⟩.
Since μ∗(α)≥λ(mα+1,α)+1 we get a
subsequence of this sequence of length mα+1 such that
every element is \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}}^{w}-generic over ⟨CE⟩ and over ⟨AE⟩. Again we have applied Lemma 13.1. By C(6) φα(x,y) defines a torsor set and by the properties of a difference sequence a group set. Hence by C(6) bˉ∈dcleq(B), a contradiction to the assumption.
∎
By definition all structures A in Kμ are in H3 and there are strong embeddings of them into C. For a strong substructure A of C tpC(A) is given by the isomorphism type of A.
Embeddings of strong substructures with strong images are elementary embeddings.
Theorem 14.2**.**
The class Kfinμ has the amalgamation property with respect to strong embeddings: If
B≤C≤C, B′≤A≤C, B≅B′, and B,B′,A,C are in Kfinμ, then there is
some C≤D≤C in Kfinμ, such that the strong isomorphism of B′ onto B can be extended
to an strong embedding of A in D.
Proof.
Since C is rich we can assume w.l.o.g., that B=B′ and can exchange the roles of C and A.
Splitting A and C into chains of minimal strong extensions in Kμ (C4) we can assume w.l.o.g. that A and C are minimal strong extensions.
Case 1: o−dim(C/B)=1 or o−dim(A/B)=1.
W.l.o.g. A=⟨Ba⟩. If a is algebraic and a solution of a divisor problem of B, that has also a solution in C, then D=C. Otherwise D=⟨Ca⟩ is an amalgam in K.
By Corollary 13.4 the amalgam D is in Kμ.
Case 2: Both extensions C/B and A/B are prealgebraic.
Then D=C⊗BA exists and is in K by Theorem 6.15.
We assume that D is not in Kμ and show in this case that C and A have the same type over B.
There is a good code α with a difference sequence
eˉ0,…,eˉμ(α) in D. By
Lemma 14.1 and symmetry we may assume w.l.o.g. that its
canonical parameter bˉ lies in dcleq(C). By
Lemma 13.3 we may assume that
eˉ0,…,eˉμ(α)−1 are in C and
eˉμ(α) is an C-generic realization of
φα(xˉ,bˉ) which generates D over C.
Case 2A: We first assume that the canonical parameter for some (μ(α)−1)-derived difference sequence is in dcleq(B). Since this difference sequence has the same properties, we denote it again by eˉ0,…,eˉμ(α). By Lemma 10.1 we have the following
two subcases:
Case 2.A.1: eˉμ(α)∈A.
By minimality of A over B we have A=⟨Beˉμ(α)⟩. Since A is in
Kμ, there exists an eˉi that lies in C and not in B. By Lemma 10.1 B≤C
implies that eiˉ is B-generic and therefore isomorphic to eˉμ(α) over B.
Furthermore C=⟨eˉiB⟩.
Case 2.A.2: eˉμ(α) is a solution of
φα(xˉ,b) generic over A.
We have D=C⊗BA. The canonical base algebra of φα(xˉ,b) is in B.
By Lemma 10.4 we get D=C⊗B⟨Beˉα⟩.
Hence we get eˉμ(α)=aˉ+mˉ, where mˉ is in C
and aˉ is an o-system that generates A over B. It is the solution of a code formula with
parameter in B. Then eˉμ(α),aˉ,mˉ is a B-independent tripel.
By Lemma 12.4 eˉμ(α),aˉ,mˉ are generic elements of cosets of an acl(B)-definable group. But then the group
is defined by φ(xˉ,b) by the properties of a derived sequence. aˉ and −mˉ
are in the same coset. Therefore the have the same type over B.
Case2.B: No (μ(α)−1)-derived sequence has a canonical basis in dcleq(B).
Let E be ⟨Beˉ0,…,eˉmα−1⟩. Then b∈dcleq(E).
Furthermore
[TABLE]
and
[TABLE]
where aˉ is a generating o-system of A over B. It is the solution of a code formula
with canonical parameter c in Beq.
By Lemma 11.2 aˉ=H(eˉμ(α))+mˉ, where mˉ is in C
and H(eˉμ(α)) is an o-transformation over E.
Since μ(α) is suficciently large, Lemma 13.1 provides us some eˉi weakly
generic over ⟨Emˉ⟩. Let f be an isomorphism, that fixes ⟨Emˉ⟩ and sends eˉμ(α) onto eˉi. Then C=⟨Bf(aˉ)⟩ is
isomorphic to A.
∎
Definition 14.3**.**
Let D be a strong substructure of C in H3, that is in Kμ. D is called Kμ-rich
if for every finite B≤A in Kμ with B≤D, there exists an A′ with B≤A′≤D and A and A′ are isomorphic over B. Then A′≤C.
We can use Theorem 14.2 to produce a countable Kμ-rich strong substructure
Pμ(C) in C
via a Fraïssé-style-argument (see [22]):
Corollary 14.4**.**
There is a countable Kμ-rich strong substructure
Pμ(C) in C. It’s isomorphism type is unique. Hence it’s type in C is uniquely determined.
Corollary 14.5**.**
Let D be a Kμ-rich strong substructure of C. Then
- a)
acl(D)=D.
2. b)
d(D)≥ℵ0.
Proof.
a) Let A be a finite subspace of D and
a∈acl(A). W.l.o.g. we assume that A is a strong
subspace of C since D is a strong subspace. By property C(2)
and Corollary 13.4 every extension A′ of A by an element
algebraic over A is strong and in Kμ. By Kμ-richness follows
the assertion.
b) Let U≤C be a maximal substructure of D generated by
geometrically independent elements. Then U is strong in C and
U is in Kμ (Axiom C(2) ). U cannot
be finite since in this case an extension U′ of U by an
geometrically independent element would be in Kμ and had to
be realized in D (Corollary 13.4).
∎
15. The theory T3μ
Definition 15.1**.**
We extend our language L by a predicate Pμ. Let Lμ be the extended language. We are interested in Lμ-structures (M,D) where M⪯C is a rich model of T3, D is a
Kμ-rich substructure of M, and d(M/D)≥ℵ0. Then D≤M by definition. The interpretation of Pμ is
D. We call such a Lμ-structure a 2×rich Lμ-structure. Let Rμ(M)
be R(M)∩Pμ(M). We will show that the theory T3μ of all 2×rich
Lμ-structures is complete. Later we will also use M,N,… for Lμ-structures.
The L-reduct of a 2×rich Lμ-structure is rich in the sense of
T3.
We use aclL and often acl only for the algebraic closure in the L-reducts. aclμ is the algebraic closure in the full Lμ-structure.
Lemma 15.2**.**
We consider a 2×rich Lμ-structure (M,D) as above. Then
[TABLE]
.
Hence Pμ is definable using Rμ.
Corollary 14.4 provides us a 2×rich Lμ-structure. For a code formula φ(xˉ,y)∈C
we use often the coressponding L-formula and denote it by φ(xˉ,yˉ)∈C
Lemma 15.3**.**
Let (M,Pμ(M) be a Lμ-structure, where M is a model of T3, Pμ(M)≤M and
Pμ(M)∈Kμ. Furthermore let
φα(xˉ,bˉ) be a code formula. Then
φα(xˉ,bˉ) has only finitely many solutions
in Pμ(M).
Proof.
We assume that there are infinitely many solutions.
Choose a finite strong subspace B≤M in H3 such that
bˉ∈dcleq(B). There is a solution e0ˉ
in Pμ(M), but not in B. By C(3) it is a generic
solution over B. Since δ(⟨Be0ˉ⟩)=δ(B) we have ⟨Be0ˉ⟩≤M. Then we choose
a solution e1ˉ∈Pμ∖⟨Be0ˉ⟩. Again it is a solution
generic over ⟨Be0ˉ⟩ by C(3).
Again δ(⟨Be0ˉe1ˉ⟩)=δ(B) and therefore
⟨Be0ˉe1ˉ⟩≤M. In this way we get an infinite L-Morley-sequence for
φα(xˉ,bˉ) over B inside Pμ. By substraction by one solution we get
an infinite diffenrence sequence inside Pμ, a contradiction.
∎
Definition 15.4**.**
Let (M,Pμ(M)) be a 2×rich Lμ-structure. and A be
a finite substructure of M. A satisfies the condition (∗) if
(∗) A≤M, A∈H3, A∩Pμ(M)∈H3,
and d(A/A∩Pμ(M))=d(A/Pμ(M)).
The condition d(A/A∩Pμ(M))=d(A/Pμ(M)) says that the union of every geometrical basis of A∩Pμ(M) and every geometrical basis of A over Pμ(M) is a geometrical basis of A. This implies
[TABLE]
Note that Lemma 12.1 implies for A with property (∗)
that
[TABLE]
Then A∩cl(Pμ(M))∈H3, since it is obtained
by a sequence of algebraic and prealgebraic minimal strong extensions over A∩Pμ(M).
Lemma 15.5**.**
Let (M,Pμ(M)) be a 2×rich Lμ-structure. Assume A⊆M satiesfies (∗)
and aˉ⊆M. Then there is some D with A⊆D, aˉ⊆D,
and D satiesfies (∗). Furthermore
there is a sequence of minimal strong H3 - extensions
[TABLE]
such that they satisfy (),
Aj=⟨ABj⟩ for j≤i0, where B0=A∩Pμ(M) ,
Bi0=D∩Pμ(M), and B0≤B1≤…≤Bi0 is a sequence
of minimal strong extension.
Furthermore Aj=⟨ACj⟩ for i0<j≤i1, where
D∩Pμ(M)≤Ci0+1≤…≤Ci1=D∩cl(Pμ(M) is a sequence of
minimal strong extensions.*
Proof.
Choose A≤A′≤M, such that aˉ⊆A′ and A′∈H3.
Extend A′ to D⊆cl(A′), such that
D∩Pμ(M)⊆⟨D∩Rμ(M)⟩ and
D∩cl(Rμ(M))⊆cl(D∩Rμ(M)).
Then D∈H3, D∩Pμ(M)∈H3, and D∩cl(Rμ(M))∈H3.
Furthermore d(D/Pμ(M)=d(D/Pμ(M)∩D). Hence D satiesfies (∗).
By Lemma 12.1
[TABLE]
We get the desired sequence
[TABLE]
of minimal strong extensions, as described in the Lemma, by (C4).
By Lemma 12.1 we have
[TABLE]
By C(4) we get the complete sequence.
∎
Theorem 15.6**.**
Let M and N be 2×rich Lμ-structures. Assume A≤M and
f(A)≤N satisfy (∗) where f is an Lμ-isomorphism of A onto f(A).Then
(M,A) and (N,f(A)) are L∞,ωμ-equivalent.
Corollary 15.7**.**
The Lμ-theory T3μ of the 2×rich Lμ-structures is
complete.
Corollary 15.8**.**
Let M and N be 2×rich Lμ-structures, aˉ∈Rμ(M)
and bˉ∈Rμ(N). If tpLM(aˉ)=tpLN(bˉ), then (M,aˉ) and (N,bˉ) are
L∞,ωμ-equivalent.
Proof.
Adding elements from the algebraic closures we can assume w.l.o.g. that ⟨aˉ⟩ and ⟨bˉ⟩ are strong subspaces in H3. Then they fulfil (∗).
∎
Proof of Theorem 15.6.
Note that the assumptions imply by Corollary 7.7, that f is an elementary map with respect to the
L-reducts of M and N. f preserves the geometrically situation.
We show that the conditions
in the Theorem describe a winning strategy for the
Ehrenfeucht-Fraïssé-game between (M,A) and (N,f(A)):
Since M=⟨R(M)⟩ and N=⟨R(N)⟩ we can
assume w.l.o.g. that the players choose only elements in R(M)
and R(N). The situation is completely symmetric. Hence we can
assume that player I has choosen some element a in R(M). We
show that there are A∪{a}⊆D≤M and g extending
f such that again:
(∗∗)
D≤M and g(D)≤N fulfil
(∗),
where g is a Lμ-isomorphism.
(∗∗) describes again the winning strategy of player II in our
Fraïssé-Ehrenfeucht-game for (M,A) and (N,f(A)).
We apply Lemma 15.5 and get the desired D with a sequence of minimal strong extensions
between A and D. We use the notation of that Lemma.
Let g0 be f. We show by induction on i:
If there is a Lμ-isomorphism gi of Ai into N, that extends f and (∗∗) is true,
then we can extend gi to gi+1 that sends Ai+1 into N and fulfils (∗∗). Note that gi is an
elementary partiell L-isomorphism. gi is not only a
Lμ-isomorphism. It repects also cl(Pμ):
For i0<i Ai contains for every b∈cl(Pμ(M)∩Ai)=cl(Ai0) a sequence of minimal strong extensions
over Ai0 that contains b.
- (1)
i<i0.
- (a)
Ai+1=⟨Aib⟩, b∈Rμ(M), and d(b/A)=1.
By Corollary 14.5 there is some c∈Rμ(N) such that d(c/gi(Ai)=1 and
with gi+1(b)=c we can extend gi to an Lμ-isomorphism gi+1. Then g(Ai+1)
satisfies (∗).
2. (b)
Ai+1=⟨Aib⟩, b∈Rμ(M), d,e∈Bi, and [b,d]=e.
Since acl(Pμ(N))=Pμ(N), we get gi+1(b)∈Pμ(N).
3. (c)
Ai+1=⟨ABibˉ⟩, where bˉ∈Rμ(M) gives a prealgebraic minimal strong
extension of Bi by a solution of a formula ψ(xˉ,u) where ψ corresponds to a
good code and u is a canonical
base algebra in Bi.
Since N is 2×rich there is a solution gi+1(b) for ψ(xˉ,gi(u))
over gi(Ai) in Pμ(N).
We get (∗∗).
2. (2)
i0≤i<i1.
In this case we have no trancendental minimal strong extensions by (∗∗).
- (a)
Ai+1=⟨Aib⟩, b∈cl(Pμ(M))∖Pμ(M), [b,d]=e, and
d,e∈cl(Pμ(M))∩Ai.
There is some c∈cl(Pμ(N)) with [c,gi(d)]=gi(e), since cl(Pμ(N)) is algebraically closed.
If c∈Pμ(N), then
[TABLE]
Furthermore δ(gi(Bi0)=δ(gi(Ci))=δ(⟨gi(Ci)c⟩). Since
gi(Bi0)≤N, we get c∈cl(Bi0). By (+) it follows c∈acl(gi(Bi0). Then
b∈acl(Bi0)⊆Pμ(M), a contradiction.
Hence c∈/Pμ(N) and with gi+1(b)=c we get (∗∗) for i+1.
2. (b)
Ai+1=⟨ACibˉ⟩, where bˉ∈cl(Rμ(M)) gives a prealgebraic minimal strong
extension of Ci by a solution of a formula ψ(xˉ,u) where ψ corresponds to a
good code and u is a canonical
base algebra in Ci, and the solution bˉ is an o-system over Pμ(M).
Since N is a model of T3, there is a solution gi+1(bˉ) for ψ(xˉ,gi(u))
over gi(Ai) in cl(Pμ(N)), that is an o-system over Pμ(N). We use Lemma 15.3
We get (∗∗).
3. (3)
i1≤i≤m
- (a)
Ai+1=⟨Aib⟩, b∈R(M), b is geometrical independent over
⟨Rμ(M)Ai⟩.
Since N is 2×-rich, we find gi+1(b) in N, such that
gi+1(b) is geometrically independent over ⟨Rμ(N)gi(Ai)⟩. Then
(∗∗) is true.
2. (b)
Ai+1=⟨Aib⟩, [b,d]=e, d,e∈Ai, and b is not cl(Pμ(M)).
There is some c∈R(N), such that [c,gi(d)]=gi(e). We show c∈/cl(Pμ(N)).
Then we can extend gi by gi+1(b)=c and get (∗∗).
- (i)
d∈cl(Pμ(M))
Then d∈Ci1 and b,e∈/cl(Pμ(M).Then gi(d)∈gi(Ci1)⊆cl(Pμ(N))
and gi(e)∈/cl(Pμ(N). Hence c∈/cl(Pμ(N)).
2. (ii)
d∈/cl(Pμ(M) and e∈/cl(Pμ(M),d)
Then we have the same geometrically situation for gi(d) and gi(e) in N. Hence
c∈cl(Pμ(N)) is impossible.
3. (iii)
d∈/cl(Pμ(M) and e∈cl(Pμ(M),d)
Then b∈cl(Pμ(M),d). Hence gi(d)∈/cl(Pμ(N)) and gi(e)∈cl(Pμ(N),gi(d)) and
therefore c∈cl(Pμ(N),gi(d)). c∈cl(Pμ(N)) would imply gi(d)∈cl(Pμ(N)), a contradiction.
3. (c)
Ai+1 is a prealgebraic minimal strong extension of Ai, generated by an o-system bˉ
that is an o-system over Pμ(M): M⊨ψ(bˉ,cˉ), where ψ corresponds to a code formula
and cˉ is the canonical base algebra, geometrically independent from cl(Pμ(M)).
Then gi(cˉ) and all solutions dˉ of ψ(xˉ,gi(cˉ) are geometrically independent from
Pμ(N). Hence dˉ is an o-system over cl(Pμ(N)). (**) is true.
□
Corollary 15.9**.**
Let M be a 2×rich Lμ-structure. The code formulas φα(xˉ,b)
with b in Pμ(M)eq are strongly minimal.
Proof.
By Lemma 15.3 there are only finitely many
solutions in Pμ(M). Let B≤M be a strong subspace of
Pμ(M) such that b∈dcleq(B) and all these solutions in Pμ(M) are in B. We show
that any two solutions aˉ, cˉ that are not in
B have the same Lμ-type over B. Let aˉ and
cˉ be such solutions of φα(xˉ,b) not in B. By (C3) they are
generic over B. Then ⟨Ba⟩ and ⟨Bc⟩ with f(B)=B and f(a)=c fulfil the conditions in
Theorem 15.6. Hence tpLμ(a/B)=tpLμ(c/B).
∎
Lemma 15.10**.**
*For every good code α there is a Lμ-sentence χα such that for all Lμ-structures M where M↾L⊨T3, Pμ(M)≤M, and Pμ(M)∈Kμ we have :
M⊨χα if and only if every minimal prealgebraic extension of Pμ(M) given by φα(xˉ,b) with b∈Pμ(M)eq is not in Kμ.*
Proof.
We replace the formula for the code α by the corresponding L-formula and denote it
by φα(xˉ,yˉ)
Let aˉ be a solution of
φα(xˉ,bˉ) not in Pμ(M). By C(3)
aˉ is a generic solution. If ⟨Pμ(M)aˉ⟩ is not
in Kμ, then we have the cases a) or b) of Corollary 13.4. In
case a) ⟨Pμ(M)aˉ⟩ contains a
difference sequence for φα(xˉ,bˉ) of length μ(α)+1 for α. In
case b) there is a difference sequence of length μ(β)+1
for a good code β, which contains a subsequence …,eiˉ,… of length
μ∗(β) such that eiˉ is \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}}^{w}-generic over ⟨e0ˉ,…,ei−1ˉPμ(M)⟩. Hence
μ∗(β)nβ≤nα in this case. Since μ∗ is
finite-to-one, only a finite set Cα of codes β can
occur. Let Cα′=Cα∪{α}. Then Pμ(M) has
no prealgebraic minimal extensions in Kμ given by α
if and only if
[TABLE]
[TABLE]
W.l.o.g. φα(xˉ,yˉ) is in L. Note that the formula after ∃∞xˉ is in L and φα(xˉ,bˉ) is strongly minimal in M↾L. In this way we express ”for xˉ generic over Pμ(M)”, since by Lemma 15.3 φα(xˉ,bˉ) has only finitely many solutions in Pμ(M).
∎
16. Axiomatization of T3μ
By Corollary 15.7 T3μ
is a complete theory.
Using the Amalgamation Theorem 14.2 we get a countable Kμ-rich
subspace D≤C . Let Pμ(C) be D. Then
(C,Pμ(Cμ)) is a 2×-rich Lμ-structure. We call it our
standard model. The following is true in (C,Pμ(Cμ)). It can be
expressed in Lμ. Let M be a Lμ-structure:
[TABLE]
These sets of axioms are elementary. For T3μ1) this is
clear.
There is no problem to express T3μ2). For T3μ3) note that Pμ(M) is strong since it is closed under aclL. The absense of difference sequences for φα(xˉ,yˉ) of length μ(α)+1 in Pμ(M)
can be expressed by Theorem 12.16. For T3μ4) we use Lemma 15.10. Finally for all axioms we find Lμ-formulas.
It is clear that 2×-rich Lμ-structures satisfy T3μ1), T3μ2) and T3μ3). That they also satisfy T3μ4) is part of the following theorem:
Theorem 16.1**.**
An Lμ-structure M that satisfies T3μ1), T3μ2) and T3μ3) is 2×rich
if and only if it is an ω-saturated model of T3μ.
Proof.
First assume that M=(M↾L,Pμ(M)) is an ω-saturated
model of T3μ.
As a saturated model of T3 M↾L is rich in the sense of L.
We show that Pμ(M) is Kμ-rich. Let B⊆A be in Kμ. Assume B≤Pμ(M). W.l.o.g. A is a minimal strong extension of B. There are three cases:
- i)
If A=⟨Ba⟩ and a is algebraic over
B, then A is in Pμ(M) by T3μ2).
2. ii)
Let A
be a minimal prealgebraic extension of B: A=⟨Baˉ⟩ where aˉ is the generic solution of
some code formula φα(xˉ,b) where
b is in dcleq(B).
Let B≤D≤Pμ(M) in H3. By Theorem 14.2 an amalgam of D and A over B
exists
in Kμ
and can be embedded into M over D by the properties of T3.
If we consider all possible D and none of these amalgams can be embedded into
Pμ(M), then we get by ω-saturation some Pμ(M)⊗B⟨Baˉ⟩ in Kμ, a contradiction to axiom T3μ4).
3. iii)
A is a minimal transcendental extension.
Then Axiom Tμ2) ensures the assertion.
Now let M be a 2×rich Lμ-structure. M satisfies Tμ1)−Tμ3). We show Tμ4).
Let φα(xˉ,b) be a good code formula.
Choose a strong subspace B in Pμ(M) such that b∈dcleq(B). Assume there is a solution aˉ of φα(xˉ,b) generic over Pμ(M) such that ⟨Pμ(M),aˉ⟩ is in Kμ. Since M is Kμ-rich there is a strong copy A0⊇B of ⟨Baˉ⟩ over B in Pμ(M). In the next step we get a copy A1 of ⟨A0aˉ⟩ over A0 inside Pμ(M). We can continue this process as long as we want and get a contradiction to the fact that Pμ(M) is in Kμ.
By Corollary 14.4 there exists a 2×rich Lμ-structure.
Hence T3μ is
consistent and we have an ω-saturated model N of T3μ.
As shown above N is a 2×rich Lμ-structure. By
Theorem 15.6 M and N are
L∞,ωμ-equivalent. Hence M is an
ω-saturated model of T3μ.
∎
Corollary 16.2**.**
The deductive closure of Tμ1) – Tμ4) is the complete theory T3μ.
Proof.
This follows from Theorem 16.1 and
Corollary 15.7.
∎
Let Cμ be the monster model of T3μ where we work in.
Lemma 16.3**.**
Let M⪯Cμ be a model of T3μ.
- i)
Rμ(Cμ)* and R(M) are geometrically independent over Rμ(M).*
2. ii)
In Pμ(Cμ) cl(X) is part of aclμ(X).
3. iii)
For i=1,2 Riμ(x)=Rμ(x)∩Ui(x) is strongly minimal. Hence Rμ(x) has Morley rank 1 and Morley degree 2.
4. iv)
Pμ(x)* has Morley rank 3.*
Proof.
i) Let aˉ in R(M) be geometrically dependent over Rμ(M). Then “aˉ is geometrically independent over Rμ” is part of the Lμ-type of aˉ.
Since tpM(aˉ)=tpCμ(aˉ) it follows the assertion.
ii) W.l.o.g. we assume ⟨B⟩≤Pμ(Cμ), B⊆Rμ(Cμ) and a∈cl(B)∩Pμ(Cμ).
Then A=CSS(⟨Ba⟩)≤Pμ(Cμ).
By C(4) there is a geometrical construction from B to A, that
has only algebraic and prealgebraic steps. By Lemma 15.3 A⊆aclμ(B).
iii) To show the strong minimality of Riμ(x), we consider
again some ω saturated M⪯Cμ⊨Tμ and
a,c∈Riμ(Cμ)∖M. By ii) a and c are not in
cl(Rμ(M))∩Pμ(C). By i) they are both not in cl(M). By Lemma 15.5 every finite subspace of M is
contained in some A≤M that satisfies (∗). If we
define f=id on A and f(a)=c, then ⟨Aa⟩ and f satisfy the conditions of
Theorem 15.6. Hence tpLμ(A,a)=tpLμ(A,c) and therefore tpLμ(a/M)=tpLμ(c/M) as desired.
iv) Let a,b be two geometrically independnet elements of R1μ(Cμ). The function
[[a,b],x] gives a defiable bijection between R1μ(Cμ) and
Pμ(Cμ)3=⟨Rμ(Cμ)⟩3. Hence
Pμ(Cμ)3 is strongly minimal. Hence Pμ(x) has finite Morley
rank 3.
∎
Now we give another definition for the property (*) in Theorem 15.6.
Lemma 16.4**.**
- (1)
A finte strong substructure A∈H3 of Cμ satisfies () iff cl(Pμ(C))∩A=cl(Rμ(Cμ)∩A)∩A.*
2. (2)
We use (1) to define () for U≤Cμ in H3. Then () for U is equivalent to: For every A⊆U there is
some A⊆C≤Cμ, that fullfils ().*
3. (3)
If U≤Cμ and V≤Cμ are isomorphic
strong substructures in H3, that satisfy (),
then they have the same type.*
Theorem 16.5**.**
T3μ* is ω-stable.*
Proof.
Let M be a countable elementary submodel of Cμ. We show that there are only
countably many types tp(aˉ/M) where aˉ is a
finite tuple in Cμ . W.l.o.g. we can restrict us to
aˉ⊆R(Cμ). Furthermore we will consider finite
subspaces aˉ⊆A⊆R(C) with certain
properties only. For a given aˉ⊆R(Cμ)
it is easy to find a set XYZW of geometrically independent
elements (short geo. basis) such that the following is true:
- (0)
aˉ⊆cld(XYZW)
2. (1)
X⊆Rμ(M)
3. (2)
Y⊆R(M) is
geometrically independent over Rμ(M).
4. (3)
Z⊆Rμ(Cμ) (short Rμ) is geometrically independent over
Rμ(M).
5. (4)
W is geometrically independent over
⟨R(M),Rμ⟩.
By Lemma 16.3 i) Y is geometrically independent over
Rμ and Z over M. Now we choose any A such that
XYZW⊆A⊆cl(XYZW), aˉ⊆A
and A≤Cμ.
A is obtained by a sequence of minimal strong extensions over A∩M. We use (C2), (C3), and
(C4). Since d(A/M)=d(A/A∩M), Lemma 12.1 implies that ⟨MA⟩ is
strong in Cμ and it is obtained by the same sequence over M.
Note that ⟨MA⟩ satisfies (*). If A∩M=A′∩M, A and A′ are isomophic
over this intersection, and A′≤Cμ, then they have the same type over M
by Lemma 16.4. Hence there are only contably many types over M.
∎
17. A Lie algebra of finite Morley rank
Let Ti (i=0,1) be complete Li-theories. Let Δ be an
interpretation of the theory T0 in the theory T1. In [5]
is defined that Δ is an interpretation of T0 in T1
without new information, if for every M⊨T1 every subset
X of Δ(M)n defined in M by a L1-formula without
parameters is definable by a L0-formula without parameters. If
T1 is stable, then we have the same for formulas with
parameters. In [5] the following result of Lascar is
published:
Lemma 17.1** (Lascar).**
If T1 is stable and Δ is an interpetation of T0 in T1 without new information, then for every model N of T0 there is some model M⊨T1 such that Δ(M)≅N.
Definition 17.2**.**
If M is a model of T3μ, then let Γ(M) be the L-substructure of M with domain Pμ(M). Let Γ(T3μ) be the complete L-theory of all Γ(M) where M⊨T3μ.
Γ defined above is an interpetation. We get:
Theorem 17.3**.**
Every subset of
Pμ(Cμ)n 0-defined in Cμ is L-0-definable in
Γ(Cμ). Hence Γ is an interpretation without new
information and every model of Γ(Tμ) has the form
Γ(M) with M⊨Tμ.
Proof.
Let A and C be finite substructures of Pμ(C) in H3. It is sufficient to show:
If A and C have the same L-type in Γ(Cμ), then they have the same Lμ-type in Cμ.
By the assumption there is an L-isomorphism of A onto C, that can be extended to an isomorphism f of CSS(A) onto CSS(C) in Γ(Cμ). Since Pμ(Cμ)≤Cμ
the self-sufficient closure in Γ(Cμ) is the same as in Cμ. By Corollary 15.8
A and C have the same type in Cμ.
∎
Since T3μ is ω-stable we get:
Corollary 17.4**.**
Every subset of Pμ(Cμ)n defined in Cμ with parameters is definable in
Γ(Cμ).
Theorem 17.5**.**
For every suitable function μ
Γ(T3μ) is
uncountably categorical. R1(x) and R2(x) are a strongly minimal formulas in
this theory. The pregeometry of R is given by acl=cl. For models N of
Γ(T3μ) we have N=⟨R(N)⟩. The Morley rank of Γ(T3μ) is 3.
The geometry of the theory is not locally modular.
Proof.
Riμ(x) for i=1,2 are strongly minimal for Tμ by Lemma 16.3 iii). Hence Ri(x) is strongly minimal in Γ(Tμ). Since Γ(M)=⟨R1(Γ(M))⟩ we have that Γ(Tμ) is uncountably categorical. Since cl contains acl we get acl=cl by Lemma 15.3.
∎
Corollary 17.6**.**
Γ(T3μ)* is CM-trivial.*
It is not possible to interpret an infinite field in Γ(T3μ).
Proof.
We follow the proof of the CM-triviality for T3 inside Pμ(C). Especially we can use
modified versions of the Lemmas 8.3, 8.8 and 8.9.
∎
18. New uncoutably categorical groups
We assume that M is a graded Lie algebra over the field F(p), where p is a prime greater than 3 and F(p) is the field with p elements. The Baker-Campbell-Hausdorff-formula provides us a group multiplication on the domain of M:
[TABLE]
Normally we have an infinite sum and characteristic 0. Since M is 3-nilpotent the sum is finite. The usual proof works. In F(p) all coefficients in the considered finite series exists, since 3<p.
Let G(M) be the group defined above. [math] is the unit in this group. The inverse element of x is −x.
We compute the group commutator:
[TABLE]
[TABLE]
[TABLE]
Hence
[TABLE]
Note that rx is x∘x∘…∘x with r−1 use of ∘.
Then we get conversely
[TABLE]
Next we define x+y using only the group-multiplication. As shown above we can use the Lie multiplication and rx.
[TABLE]
If M is a free 3-nilpotent Lie algebra over F(p), then G(M) is free in the variety of 3-nilpotent groups of exponent p.
If M is generated by M1, then G(M) is generated by M1.
Let L− be the reduction of L, where the predicates Ui and the projections are canceled. Let M− be the corresponding L−-reduct of M. ∘ is definable in M−. Conversely the L−-reduct M− of M is definable using ∘ only, as shown above. Hence we can show:
Lemma 18.1**.**
The elementary theories of G(Γ(Cμ)) and (Γ(Cμ)− are binterpretable.
In fact the group G(M) can be considered as the L−-reduct of M.
Theorem 18.2**.**
The elementary theory of G(Γ(Cμ)) is uncountably categorical of Morley rank 3.
It is not one-based but CM-trivial.
Z1(G(Γ(Cμ))) is strongly minimal.
Proof.
We have the results for Γ(T3μ) in Theorem 17.5 and Corollary 17.6.
Then it follows for Γ(T3μ)−.
For CM-trivialty we can use H.Nübling’s result in [16]: Reducts of CM-trivial stable theories of finite Lascar rank are CM-trivial. By biinterpretability in Lemma 18.1 we get the desired properties for
G(Γ(T3μ)). For CM-triviality we can use [5].
∎
Theorem 18.3**.**
The elementary theory of G(Γ(Cμ)) does not allow the interpretation of an infinite field.
Proof.
Such an interpretation would imply an interpretation of that field in Γ(Cμ), a contradiction.
∎