Take the 2-minute tour ×
MathOverflow is a question and answer site for professional mathematicians. It's 100% free, no registration required.

I came accross the following

Theorem: If $A$ is an $\aleph_0$- categorical structure, then the algebraically closed substructures of $A$ satisfy the strong amalgamation principle. (for definitions look at the end).

My questions are:

(1) If $T$ is an $\aleph_0$- categorical theory and $B$ is a model of $T$, not necessarily countable, do the algebraically closed substructures of $B$ satisfy strong amalgamation?

If $B_0,B_1,B_2$ are substructures of $B$ such that $B_0\subset B_1,B_2$, I am interested in particular in the case that $B_0,B_1$ (not $B_2$) are finitely generated.

(2) The terms disjoint and strong amalgamation, do they refer to the same property?

(3) Does anyone know a reference to the above theorem?

Definitions: If $A$ is a structure and $A_0\subset A$, $A_0$ is $algebraically\;\; closed$ if every finite set $B$ that is definable with parameters from $A_0$ is a subset of $A_0$.

If $A_0\subset A_1,A_2$, the triple $(A_0,A_1,A_2)$ have the $strong\; amalgamation \; property$, if there is a structure $A_3$ and embeddings $f:A_1\rightarrow A_3$ and $g:A_2\rightarrow A_3$ such that $f[x]=g[x]$, for all $x\in A_0$ and $f[A_1]\cap g[A_2]=f[A_0]$.

share|improve this question
    
In your question (2), do you mean the "joint embedding property" instead of "disjoint"? –  Tom De Medts Mar 16 '11 at 18:51
    
No. The Joint Embedding Property (JEP) is different than Amalgamation. Consulting with professor Baldwin (from UIC) and looking around a few papers, I came to the conclusion that disjoint Amalgamation and strong Amalgamation (as defined here at least) refer to the same thing. Some other authors may define strong amalgamation differently. However, disjoint amalgamation seems to be standard terminology these days. –  Ioannis Souldatos Mar 31 '11 at 20:14
    
The substructures in the theorem could be infinite? If so, could you please let me know where you came across it? –  Jizhan Hong May 15 '11 at 15:35
    
No, I am pretty sure the theorems are about algebraically closed substructures that are finite. I will look the references and post a more detailed comment. –  Ioannis Souldatos May 16 '11 at 18:57
add comment

3 Answers

If your $f$ and $g$ are partial elementary maps, i.e. they preserve formulas, and if their images in $A_3$ are independent over the image of $A_0$ then your "stong amalgamation property" looks like a property more widely known as "2-existence". It holds in stable theories as follows from stationarity of types over algebraically closed sets (at this point one must either require elimination of imaginaries or mean the algebraic closure to be the algebraic closure in $M^{eq}$). 3-existence over models is a defining property of the so-called simple theories. It is hard to point to a particular reference as these properties are pervasive (and the notion of amalgamation was introduced long time ago by Shelah, if I am not mistaken).

I do not know much about $\aleph_0$-categorical theories, but the book by Cherlin and Hrushovski "Finite structures with few types" proves type amalgamation for a similar kind of structures (Chapter 5).

share|improve this answer
    
I think 2-existence is stronger than DAP/SAP. –  Jizhan Hong May 15 '11 at 15:42
    
yes, n-amalgamation problems also require that the images of the embeddings be independent in the "amalgam". I actually wonder where this definition of "strong amalgamation problem" comes from. –  Dima Sustretov May 15 '11 at 21:14
add comment

This is only a partial answer (now that you said the substructures are finite):

(2) As you said, they are the same. See for example ,

D.Macpherson, A Survey of Homogeneous Structures. (you can just google to get it.)

(3) A reference for the proof of the theorem you mentioned is Lemma 2.8 of the following:

David Evans, Examples of $\aleph_0$-categorical strucutres, in the book Automorphisms of first order structures (1994, Oxford Univ. Press) Edited by R. Kaye and D.Macpherson

Essentially what you need is a so-called "Separation Lemma" from permutation group theory. In this article, he also proved a converse. The article mentioned in (2) also provides a reference for it. (In Lemma 2.1.4, but I didn't check it.)

I also think (1) is probably false in general.

share|improve this answer
    
Your references are very useful. I looked them up. So, this answers (2) and (3). –  Ioannis Souldatos May 16 '11 at 20:38
    
Being a little more careful, let me rephrase (1): Let $T$ be an $\aleph_0$-categorical theory and $B$ a model of $T$, not necessarily countable, but assume it is atomic. If $B_0,B_1,B_2$ are algebraically closed substructures of $B$ such that $B_0\subset B_1,B_2$ and $B_0,B_1$ are finite (while $B_2$ is allowed to be infinite), does the triple $(B_0,B_1,B_2)$ satisfy SAP/DAP? –  Ioannis Souldatos May 16 '11 at 21:45
add comment

Here are a couple of references for "Strong Amalgamation". Most of them are from older papers/books and I thought that the terminology might have changed.

1) Paper: Decidability and $\aleph_0$-Categoricity of Theories of Partially Ordered Sets, James H. Schmerl, The Journal of Symbolic Logic, Vol. 45, No. 3 (Sep., 1980), pp. 585-611

Lemma 2.6 reads: Suppose $A$ is $\aleph_0$-categorical and admits quantifier elimination. Let K be the class of (isomorphs of) the finite algebraically closed substructures of $A$. Then K has the strong amalgamation property (SAP).

Schmerl defines SAP as: "K has the strong amalgamation property (SAP) if whenever $A_0,A_1\in K$ are such that $A_0\cap A_1\in K$, then there is $A\in K$ such that $A_0,A_1\subset A$.

Comments: (a) If $A$ is $\aleph_0$-categorical, then it has only an atomic model and quantifier elimination gives that all substructures are elementary. (b) This definition is equivalent to the one posted above, at least for finite algebraically closed substructures. (c) Schmerl does not prove the theorem, but he mentions a couple of references that do prove the theorem. So, the theorem is older than 1980. One of the references that I looked is the following book:

2) J. CROSSLEY and A. NERODE, Combinatorial functors, Ergebnisse Mathematische Grenzgebiete, Band 81, Springer, New York, 1974.

Lemma 5.5 (Duplication Lemma) states: Let $M$ be an atomic model. Let $A,B$ be finite algebraically closed subsets of $M$ and $p:A\rightarrow B$ an elementary isomorphism. Let $N$ be a finite subset of $M$ such that $N\cap B=\emptyset$. If $A'$ is a finite algebraically closed set containing A, then there an algebraically closed $B'\supset B$ such that $B'\cap N=\emptyset$ and an elementary isomorphism $p'$ extensing $p$ such that $p':A'\cong B'$. Moreover, there are infinitely many such $B'$ such that the intersection of any two distinct ones is $B$.

If $p:A\rightarrow B$ is a 1-1 and onto function, Crossley and Nerode define $p$ to be an elementary isomorphism if moreover, for all $a_0,\ldots,a_{n-1}\in A$ and for all formulas $\phi$, $$A\models\phi(a_0,\ldots,a_{n-1})\Leftrightarrow B\models\phi(p(a_0),\ldots,p(a_{n-1})).$$ I guess we would just say isomorphism today, rather than elementary isomorphism.

share|improve this answer
    
Going through Hodges's "A Shorter Model Theory" I realized that he is also referring to Strong Amalgamation Property. In page 138, after theorem 5.3.3 he mentions "Amalgams with his minimum-overlap property are said to be strong." –  Ioannis Souldatos May 16 '11 at 20:35
    
Although not mentioned explicitly in the the Duplication Lemma, the authors state at the beginning of the section that they consider only countable models. I will have to go through the proof to see if they use this assumption at all or not. –  Ioannis Souldatos May 16 '11 at 21:24
add comment

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.