The cornerstone definition in Abstract Elementary Classes












1












$begingroup$


In the first paragraph of p.41 of Introduction to: classification theory for abstract elementary class, Shelah gives the following definition of (Galois) type.




For $Mpreceq N_ell$ and $a_ellin N_ell setminus M$, $mathbf {tp}(a_1,M,N_1)=mathbf{tp}(a_2,M,N_2)$ iff for some $preceq$-extension $N_3$ of $N_2$ there is a $preceq$-embedding of $N_1$ into $N_3$ over $M$ which maps $a_1$ to $a_2$, recalling that $mathfrak K_lambda$ has amalgamation.




I have omitted references in the notation to the AEC $mathfrak{K}_lambda$ in which this is taking place.



How do I see that this definition is equivalent to the following definition?




For $Mpreceq N_ell$ and $a_ellin N_ell setminus M$, $mathbf {tp}(a_1,M,N_1)=mathbf{tp}(a_2,M,N_2)$ iff there exist $preceq$-embeddings $h: N_1to N_3$ and $g:N_2to N_3$ such that the resulting square commutes and $h(a_1) = g(a_2)$.




Also:




  1. Why does Shelah write "recalling that $mathfrak K_lambda$ has amalgamation" after his definition?


  2. In the definition, why does Shelah write $mathbf{tp}_{mathfrak{K}_lambda}(a_1,M,N_1)=mathbf{tp}_{mathfrak{K}}(a_2,M,N_2)$? (Note: there is no $lambda$ in the r.h.s.,but there is one in the l.h.s.)


  3. In the second definition, do we assume that $g$ and $h$ fix $M$?











share|cite|improve this question











$endgroup$












  • $begingroup$
    I don't understand your question - you're asking how to see that something from the first paragraph on p. 41 is equivalent to "that definition using two maps..." but it's not clear what. Could write out in detail the two statements/definitions that you want to show are equivalent?
    $endgroup$
    – Alex Kruckman
    Dec 17 '18 at 17:38












  • $begingroup$
    @AlexKruckman Please, see EDIT in my OQ.
    $endgroup$
    – user122424
    Dec 17 '18 at 18:03












  • $begingroup$
    The question was still a total mess, so I edited it. This involved a bit of interpretation, so please make sure I maintained the intention of the question.
    $endgroup$
    – Alex Kruckman
    Dec 17 '18 at 19:16
















1












$begingroup$


In the first paragraph of p.41 of Introduction to: classification theory for abstract elementary class, Shelah gives the following definition of (Galois) type.




For $Mpreceq N_ell$ and $a_ellin N_ell setminus M$, $mathbf {tp}(a_1,M,N_1)=mathbf{tp}(a_2,M,N_2)$ iff for some $preceq$-extension $N_3$ of $N_2$ there is a $preceq$-embedding of $N_1$ into $N_3$ over $M$ which maps $a_1$ to $a_2$, recalling that $mathfrak K_lambda$ has amalgamation.




I have omitted references in the notation to the AEC $mathfrak{K}_lambda$ in which this is taking place.



How do I see that this definition is equivalent to the following definition?




For $Mpreceq N_ell$ and $a_ellin N_ell setminus M$, $mathbf {tp}(a_1,M,N_1)=mathbf{tp}(a_2,M,N_2)$ iff there exist $preceq$-embeddings $h: N_1to N_3$ and $g:N_2to N_3$ such that the resulting square commutes and $h(a_1) = g(a_2)$.




Also:




  1. Why does Shelah write "recalling that $mathfrak K_lambda$ has amalgamation" after his definition?


  2. In the definition, why does Shelah write $mathbf{tp}_{mathfrak{K}_lambda}(a_1,M,N_1)=mathbf{tp}_{mathfrak{K}}(a_2,M,N_2)$? (Note: there is no $lambda$ in the r.h.s.,but there is one in the l.h.s.)


  3. In the second definition, do we assume that $g$ and $h$ fix $M$?











share|cite|improve this question











$endgroup$












  • $begingroup$
    I don't understand your question - you're asking how to see that something from the first paragraph on p. 41 is equivalent to "that definition using two maps..." but it's not clear what. Could write out in detail the two statements/definitions that you want to show are equivalent?
    $endgroup$
    – Alex Kruckman
    Dec 17 '18 at 17:38












  • $begingroup$
    @AlexKruckman Please, see EDIT in my OQ.
    $endgroup$
    – user122424
    Dec 17 '18 at 18:03












  • $begingroup$
    The question was still a total mess, so I edited it. This involved a bit of interpretation, so please make sure I maintained the intention of the question.
    $endgroup$
    – Alex Kruckman
    Dec 17 '18 at 19:16














1












1








1





$begingroup$


In the first paragraph of p.41 of Introduction to: classification theory for abstract elementary class, Shelah gives the following definition of (Galois) type.




For $Mpreceq N_ell$ and $a_ellin N_ell setminus M$, $mathbf {tp}(a_1,M,N_1)=mathbf{tp}(a_2,M,N_2)$ iff for some $preceq$-extension $N_3$ of $N_2$ there is a $preceq$-embedding of $N_1$ into $N_3$ over $M$ which maps $a_1$ to $a_2$, recalling that $mathfrak K_lambda$ has amalgamation.




I have omitted references in the notation to the AEC $mathfrak{K}_lambda$ in which this is taking place.



How do I see that this definition is equivalent to the following definition?




For $Mpreceq N_ell$ and $a_ellin N_ell setminus M$, $mathbf {tp}(a_1,M,N_1)=mathbf{tp}(a_2,M,N_2)$ iff there exist $preceq$-embeddings $h: N_1to N_3$ and $g:N_2to N_3$ such that the resulting square commutes and $h(a_1) = g(a_2)$.




Also:




  1. Why does Shelah write "recalling that $mathfrak K_lambda$ has amalgamation" after his definition?


  2. In the definition, why does Shelah write $mathbf{tp}_{mathfrak{K}_lambda}(a_1,M,N_1)=mathbf{tp}_{mathfrak{K}}(a_2,M,N_2)$? (Note: there is no $lambda$ in the r.h.s.,but there is one in the l.h.s.)


  3. In the second definition, do we assume that $g$ and $h$ fix $M$?











share|cite|improve this question











$endgroup$




In the first paragraph of p.41 of Introduction to: classification theory for abstract elementary class, Shelah gives the following definition of (Galois) type.




For $Mpreceq N_ell$ and $a_ellin N_ell setminus M$, $mathbf {tp}(a_1,M,N_1)=mathbf{tp}(a_2,M,N_2)$ iff for some $preceq$-extension $N_3$ of $N_2$ there is a $preceq$-embedding of $N_1$ into $N_3$ over $M$ which maps $a_1$ to $a_2$, recalling that $mathfrak K_lambda$ has amalgamation.




I have omitted references in the notation to the AEC $mathfrak{K}_lambda$ in which this is taking place.



How do I see that this definition is equivalent to the following definition?




For $Mpreceq N_ell$ and $a_ellin N_ell setminus M$, $mathbf {tp}(a_1,M,N_1)=mathbf{tp}(a_2,M,N_2)$ iff there exist $preceq$-embeddings $h: N_1to N_3$ and $g:N_2to N_3$ such that the resulting square commutes and $h(a_1) = g(a_2)$.




Also:




  1. Why does Shelah write "recalling that $mathfrak K_lambda$ has amalgamation" after his definition?


  2. In the definition, why does Shelah write $mathbf{tp}_{mathfrak{K}_lambda}(a_1,M,N_1)=mathbf{tp}_{mathfrak{K}}(a_2,M,N_2)$? (Note: there is no $lambda$ in the r.h.s.,but there is one in the l.h.s.)


  3. In the second definition, do we assume that $g$ and $h$ fix $M$?








logic model-theory






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Dec 18 '18 at 5:15









Asaf Karagila

306k33438769




306k33438769










asked Dec 17 '18 at 16:08









user122424user122424

1,1582717




1,1582717












  • $begingroup$
    I don't understand your question - you're asking how to see that something from the first paragraph on p. 41 is equivalent to "that definition using two maps..." but it's not clear what. Could write out in detail the two statements/definitions that you want to show are equivalent?
    $endgroup$
    – Alex Kruckman
    Dec 17 '18 at 17:38












  • $begingroup$
    @AlexKruckman Please, see EDIT in my OQ.
    $endgroup$
    – user122424
    Dec 17 '18 at 18:03












  • $begingroup$
    The question was still a total mess, so I edited it. This involved a bit of interpretation, so please make sure I maintained the intention of the question.
    $endgroup$
    – Alex Kruckman
    Dec 17 '18 at 19:16


















  • $begingroup$
    I don't understand your question - you're asking how to see that something from the first paragraph on p. 41 is equivalent to "that definition using two maps..." but it's not clear what. Could write out in detail the two statements/definitions that you want to show are equivalent?
    $endgroup$
    – Alex Kruckman
    Dec 17 '18 at 17:38












  • $begingroup$
    @AlexKruckman Please, see EDIT in my OQ.
    $endgroup$
    – user122424
    Dec 17 '18 at 18:03












  • $begingroup$
    The question was still a total mess, so I edited it. This involved a bit of interpretation, so please make sure I maintained the intention of the question.
    $endgroup$
    – Alex Kruckman
    Dec 17 '18 at 19:16
















$begingroup$
I don't understand your question - you're asking how to see that something from the first paragraph on p. 41 is equivalent to "that definition using two maps..." but it's not clear what. Could write out in detail the two statements/definitions that you want to show are equivalent?
$endgroup$
– Alex Kruckman
Dec 17 '18 at 17:38






$begingroup$
I don't understand your question - you're asking how to see that something from the first paragraph on p. 41 is equivalent to "that definition using two maps..." but it's not clear what. Could write out in detail the two statements/definitions that you want to show are equivalent?
$endgroup$
– Alex Kruckman
Dec 17 '18 at 17:38














$begingroup$
@AlexKruckman Please, see EDIT in my OQ.
$endgroup$
– user122424
Dec 17 '18 at 18:03






$begingroup$
@AlexKruckman Please, see EDIT in my OQ.
$endgroup$
– user122424
Dec 17 '18 at 18:03














$begingroup$
The question was still a total mess, so I edited it. This involved a bit of interpretation, so please make sure I maintained the intention of the question.
$endgroup$
– Alex Kruckman
Dec 17 '18 at 19:16




$begingroup$
The question was still a total mess, so I edited it. This involved a bit of interpretation, so please make sure I maintained the intention of the question.
$endgroup$
– Alex Kruckman
Dec 17 '18 at 19:16










1 Answer
1






active

oldest

votes


















2












$begingroup$

These definitions are saying almost exactly the same thing. They really only differ in whether they require $N_2$ to be a substructure of $N_3$, or just embedded into it.



Suppose $mathbf{tp}(a_1,M,N_1) = mathbf{tp}(a_2,M,N_2)$ in the sense of the first definition. Then we have an extension $N_2preceq N_3$ and a $preceq$-embedding $hcolon N_1to N_3$ over $M$ such that $h(a_1) = a_2$. Taking $g$ to be the inclusion $N_2to N_3$, we find that the square commutes: for all $min M$, $h(m) = m = g(m)$. [This is what it means to say that $h$ is a map over $M$.] And $h(a_1) = a_2 = g(a_2)$. So $mathbf{tp}(a_1,M,N_1) = mathbf{tp}(a_2,M,N_2)$ in the sense of the second definition.



Conversely, suppose $mathbf{tp}(a_1,M,N_1) = mathbf{tp}(a_2,M,N_2)$ in the sense of the second definition. Then we have $preceq$-embeddings $hcolon N_1to N_3$ and $gcolon N_2to N_3$ such that the resulting square commutes and $h(a_1) = g(a_2)$. Now we may assume that $N_2preceq N_3$ and $g$ is the inclusion mapping, by replacing $N_3$ with an isomorphic copy. And then $h(a_1) = g(a_2) = a_2$, so $mathbf{tp}(a_1,M,N_1) = mathbf{tp}(a_2,M,N_2)$ in the sense of the first definition.



For your additional questions:




  1. It's because a more complicated definition of Galois type turns out to be necessary in AECs without amalgamation. If the AEC lacks amalgamation, then the relation $text{tp}(a_1,M,N_1) = text{tp}(a_2,M,N_2)$ defined in the question (in either of the equivalent ways) might not be transitive, and hence not an equivalence relation on triples $(a,M,N)$. I believe the usual fix is just to take the transitive closure of this relation.

  2. My best guess is that it's a typo.

  3. I don't know what this means. We have $Msubseteq N_1$ and $hcolon N_1to N_3$. Since $M$ is not assumed to be a subset of $N_3$, $h$ can't fix $M$. Certainly definition 2 assumes that for all $min M$, $h(m) = g(m)$, which is exactly what it means to say the square commutes.






share|cite|improve this answer











$endgroup$













  • $begingroup$
    Could you please correct your 4th line in which there is an incomplete notation $(a_1)=a_2$ ?
    $endgroup$
    – user122424
    Dec 18 '18 at 17:03










  • $begingroup$
    @user122424 Done
    $endgroup$
    – Alex Kruckman
    Dec 18 '18 at 17:05










  • $begingroup$
    How do we find that the squares commutes in your sentence "Taking $g$ to be the inclusion $N_2→N_3$, we find that the square commutes: for all $m∈M$, $h(m)=m=g(m)$." ? More precisely how can I justify $h(m)=m$, the second equality is clear to me.
    $endgroup$
    – user122424
    Dec 18 '18 at 17:51












  • $begingroup$
    @user122424 I already explained in the bracketed comment. To say $hcolon N_1 to N_3$ is a map over $M$ is to say that $h$ is the identity when restricted to $M$, i.e. $h(m) = m$ for all $min M$. (Of course this only makes sense when $Msubseteq N_1$ and $Msubseteq N_3$).
    $endgroup$
    – Alex Kruckman
    Dec 18 '18 at 18:26












  • $begingroup$
    But in the -3rd line in your item $3.$ you write $M$ is not assumed to be a subset of $N_3$ and in the above comment you write "(Of course this only makes sense when $M⊆N_1$ and $M⊆N_3$)".
    $endgroup$
    – user122424
    Dec 18 '18 at 20:38











Your Answer





StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");

StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "69"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);

StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});

function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});


}
});














draft saved

draft discarded


















StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3044120%2fthe-cornerstone-definition-in-abstract-elementary-classes%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown

























1 Answer
1






active

oldest

votes








1 Answer
1






active

oldest

votes









active

oldest

votes






active

oldest

votes









2












$begingroup$

These definitions are saying almost exactly the same thing. They really only differ in whether they require $N_2$ to be a substructure of $N_3$, or just embedded into it.



Suppose $mathbf{tp}(a_1,M,N_1) = mathbf{tp}(a_2,M,N_2)$ in the sense of the first definition. Then we have an extension $N_2preceq N_3$ and a $preceq$-embedding $hcolon N_1to N_3$ over $M$ such that $h(a_1) = a_2$. Taking $g$ to be the inclusion $N_2to N_3$, we find that the square commutes: for all $min M$, $h(m) = m = g(m)$. [This is what it means to say that $h$ is a map over $M$.] And $h(a_1) = a_2 = g(a_2)$. So $mathbf{tp}(a_1,M,N_1) = mathbf{tp}(a_2,M,N_2)$ in the sense of the second definition.



Conversely, suppose $mathbf{tp}(a_1,M,N_1) = mathbf{tp}(a_2,M,N_2)$ in the sense of the second definition. Then we have $preceq$-embeddings $hcolon N_1to N_3$ and $gcolon N_2to N_3$ such that the resulting square commutes and $h(a_1) = g(a_2)$. Now we may assume that $N_2preceq N_3$ and $g$ is the inclusion mapping, by replacing $N_3$ with an isomorphic copy. And then $h(a_1) = g(a_2) = a_2$, so $mathbf{tp}(a_1,M,N_1) = mathbf{tp}(a_2,M,N_2)$ in the sense of the first definition.



For your additional questions:




  1. It's because a more complicated definition of Galois type turns out to be necessary in AECs without amalgamation. If the AEC lacks amalgamation, then the relation $text{tp}(a_1,M,N_1) = text{tp}(a_2,M,N_2)$ defined in the question (in either of the equivalent ways) might not be transitive, and hence not an equivalence relation on triples $(a,M,N)$. I believe the usual fix is just to take the transitive closure of this relation.

  2. My best guess is that it's a typo.

  3. I don't know what this means. We have $Msubseteq N_1$ and $hcolon N_1to N_3$. Since $M$ is not assumed to be a subset of $N_3$, $h$ can't fix $M$. Certainly definition 2 assumes that for all $min M$, $h(m) = g(m)$, which is exactly what it means to say the square commutes.






share|cite|improve this answer











$endgroup$













  • $begingroup$
    Could you please correct your 4th line in which there is an incomplete notation $(a_1)=a_2$ ?
    $endgroup$
    – user122424
    Dec 18 '18 at 17:03










  • $begingroup$
    @user122424 Done
    $endgroup$
    – Alex Kruckman
    Dec 18 '18 at 17:05










  • $begingroup$
    How do we find that the squares commutes in your sentence "Taking $g$ to be the inclusion $N_2→N_3$, we find that the square commutes: for all $m∈M$, $h(m)=m=g(m)$." ? More precisely how can I justify $h(m)=m$, the second equality is clear to me.
    $endgroup$
    – user122424
    Dec 18 '18 at 17:51












  • $begingroup$
    @user122424 I already explained in the bracketed comment. To say $hcolon N_1 to N_3$ is a map over $M$ is to say that $h$ is the identity when restricted to $M$, i.e. $h(m) = m$ for all $min M$. (Of course this only makes sense when $Msubseteq N_1$ and $Msubseteq N_3$).
    $endgroup$
    – Alex Kruckman
    Dec 18 '18 at 18:26












  • $begingroup$
    But in the -3rd line in your item $3.$ you write $M$ is not assumed to be a subset of $N_3$ and in the above comment you write "(Of course this only makes sense when $M⊆N_1$ and $M⊆N_3$)".
    $endgroup$
    – user122424
    Dec 18 '18 at 20:38
















2












$begingroup$

These definitions are saying almost exactly the same thing. They really only differ in whether they require $N_2$ to be a substructure of $N_3$, or just embedded into it.



Suppose $mathbf{tp}(a_1,M,N_1) = mathbf{tp}(a_2,M,N_2)$ in the sense of the first definition. Then we have an extension $N_2preceq N_3$ and a $preceq$-embedding $hcolon N_1to N_3$ over $M$ such that $h(a_1) = a_2$. Taking $g$ to be the inclusion $N_2to N_3$, we find that the square commutes: for all $min M$, $h(m) = m = g(m)$. [This is what it means to say that $h$ is a map over $M$.] And $h(a_1) = a_2 = g(a_2)$. So $mathbf{tp}(a_1,M,N_1) = mathbf{tp}(a_2,M,N_2)$ in the sense of the second definition.



Conversely, suppose $mathbf{tp}(a_1,M,N_1) = mathbf{tp}(a_2,M,N_2)$ in the sense of the second definition. Then we have $preceq$-embeddings $hcolon N_1to N_3$ and $gcolon N_2to N_3$ such that the resulting square commutes and $h(a_1) = g(a_2)$. Now we may assume that $N_2preceq N_3$ and $g$ is the inclusion mapping, by replacing $N_3$ with an isomorphic copy. And then $h(a_1) = g(a_2) = a_2$, so $mathbf{tp}(a_1,M,N_1) = mathbf{tp}(a_2,M,N_2)$ in the sense of the first definition.



For your additional questions:




  1. It's because a more complicated definition of Galois type turns out to be necessary in AECs without amalgamation. If the AEC lacks amalgamation, then the relation $text{tp}(a_1,M,N_1) = text{tp}(a_2,M,N_2)$ defined in the question (in either of the equivalent ways) might not be transitive, and hence not an equivalence relation on triples $(a,M,N)$. I believe the usual fix is just to take the transitive closure of this relation.

  2. My best guess is that it's a typo.

  3. I don't know what this means. We have $Msubseteq N_1$ and $hcolon N_1to N_3$. Since $M$ is not assumed to be a subset of $N_3$, $h$ can't fix $M$. Certainly definition 2 assumes that for all $min M$, $h(m) = g(m)$, which is exactly what it means to say the square commutes.






share|cite|improve this answer











$endgroup$













  • $begingroup$
    Could you please correct your 4th line in which there is an incomplete notation $(a_1)=a_2$ ?
    $endgroup$
    – user122424
    Dec 18 '18 at 17:03










  • $begingroup$
    @user122424 Done
    $endgroup$
    – Alex Kruckman
    Dec 18 '18 at 17:05










  • $begingroup$
    How do we find that the squares commutes in your sentence "Taking $g$ to be the inclusion $N_2→N_3$, we find that the square commutes: for all $m∈M$, $h(m)=m=g(m)$." ? More precisely how can I justify $h(m)=m$, the second equality is clear to me.
    $endgroup$
    – user122424
    Dec 18 '18 at 17:51












  • $begingroup$
    @user122424 I already explained in the bracketed comment. To say $hcolon N_1 to N_3$ is a map over $M$ is to say that $h$ is the identity when restricted to $M$, i.e. $h(m) = m$ for all $min M$. (Of course this only makes sense when $Msubseteq N_1$ and $Msubseteq N_3$).
    $endgroup$
    – Alex Kruckman
    Dec 18 '18 at 18:26












  • $begingroup$
    But in the -3rd line in your item $3.$ you write $M$ is not assumed to be a subset of $N_3$ and in the above comment you write "(Of course this only makes sense when $M⊆N_1$ and $M⊆N_3$)".
    $endgroup$
    – user122424
    Dec 18 '18 at 20:38














2












2








2





$begingroup$

These definitions are saying almost exactly the same thing. They really only differ in whether they require $N_2$ to be a substructure of $N_3$, or just embedded into it.



Suppose $mathbf{tp}(a_1,M,N_1) = mathbf{tp}(a_2,M,N_2)$ in the sense of the first definition. Then we have an extension $N_2preceq N_3$ and a $preceq$-embedding $hcolon N_1to N_3$ over $M$ such that $h(a_1) = a_2$. Taking $g$ to be the inclusion $N_2to N_3$, we find that the square commutes: for all $min M$, $h(m) = m = g(m)$. [This is what it means to say that $h$ is a map over $M$.] And $h(a_1) = a_2 = g(a_2)$. So $mathbf{tp}(a_1,M,N_1) = mathbf{tp}(a_2,M,N_2)$ in the sense of the second definition.



Conversely, suppose $mathbf{tp}(a_1,M,N_1) = mathbf{tp}(a_2,M,N_2)$ in the sense of the second definition. Then we have $preceq$-embeddings $hcolon N_1to N_3$ and $gcolon N_2to N_3$ such that the resulting square commutes and $h(a_1) = g(a_2)$. Now we may assume that $N_2preceq N_3$ and $g$ is the inclusion mapping, by replacing $N_3$ with an isomorphic copy. And then $h(a_1) = g(a_2) = a_2$, so $mathbf{tp}(a_1,M,N_1) = mathbf{tp}(a_2,M,N_2)$ in the sense of the first definition.



For your additional questions:




  1. It's because a more complicated definition of Galois type turns out to be necessary in AECs without amalgamation. If the AEC lacks amalgamation, then the relation $text{tp}(a_1,M,N_1) = text{tp}(a_2,M,N_2)$ defined in the question (in either of the equivalent ways) might not be transitive, and hence not an equivalence relation on triples $(a,M,N)$. I believe the usual fix is just to take the transitive closure of this relation.

  2. My best guess is that it's a typo.

  3. I don't know what this means. We have $Msubseteq N_1$ and $hcolon N_1to N_3$. Since $M$ is not assumed to be a subset of $N_3$, $h$ can't fix $M$. Certainly definition 2 assumes that for all $min M$, $h(m) = g(m)$, which is exactly what it means to say the square commutes.






share|cite|improve this answer











$endgroup$



These definitions are saying almost exactly the same thing. They really only differ in whether they require $N_2$ to be a substructure of $N_3$, or just embedded into it.



Suppose $mathbf{tp}(a_1,M,N_1) = mathbf{tp}(a_2,M,N_2)$ in the sense of the first definition. Then we have an extension $N_2preceq N_3$ and a $preceq$-embedding $hcolon N_1to N_3$ over $M$ such that $h(a_1) = a_2$. Taking $g$ to be the inclusion $N_2to N_3$, we find that the square commutes: for all $min M$, $h(m) = m = g(m)$. [This is what it means to say that $h$ is a map over $M$.] And $h(a_1) = a_2 = g(a_2)$. So $mathbf{tp}(a_1,M,N_1) = mathbf{tp}(a_2,M,N_2)$ in the sense of the second definition.



Conversely, suppose $mathbf{tp}(a_1,M,N_1) = mathbf{tp}(a_2,M,N_2)$ in the sense of the second definition. Then we have $preceq$-embeddings $hcolon N_1to N_3$ and $gcolon N_2to N_3$ such that the resulting square commutes and $h(a_1) = g(a_2)$. Now we may assume that $N_2preceq N_3$ and $g$ is the inclusion mapping, by replacing $N_3$ with an isomorphic copy. And then $h(a_1) = g(a_2) = a_2$, so $mathbf{tp}(a_1,M,N_1) = mathbf{tp}(a_2,M,N_2)$ in the sense of the first definition.



For your additional questions:




  1. It's because a more complicated definition of Galois type turns out to be necessary in AECs without amalgamation. If the AEC lacks amalgamation, then the relation $text{tp}(a_1,M,N_1) = text{tp}(a_2,M,N_2)$ defined in the question (in either of the equivalent ways) might not be transitive, and hence not an equivalence relation on triples $(a,M,N)$. I believe the usual fix is just to take the transitive closure of this relation.

  2. My best guess is that it's a typo.

  3. I don't know what this means. We have $Msubseteq N_1$ and $hcolon N_1to N_3$. Since $M$ is not assumed to be a subset of $N_3$, $h$ can't fix $M$. Certainly definition 2 assumes that for all $min M$, $h(m) = g(m)$, which is exactly what it means to say the square commutes.







share|cite|improve this answer














share|cite|improve this answer



share|cite|improve this answer








edited Dec 18 '18 at 17:05

























answered Dec 17 '18 at 19:38









Alex KruckmanAlex Kruckman

28k32658




28k32658












  • $begingroup$
    Could you please correct your 4th line in which there is an incomplete notation $(a_1)=a_2$ ?
    $endgroup$
    – user122424
    Dec 18 '18 at 17:03










  • $begingroup$
    @user122424 Done
    $endgroup$
    – Alex Kruckman
    Dec 18 '18 at 17:05










  • $begingroup$
    How do we find that the squares commutes in your sentence "Taking $g$ to be the inclusion $N_2→N_3$, we find that the square commutes: for all $m∈M$, $h(m)=m=g(m)$." ? More precisely how can I justify $h(m)=m$, the second equality is clear to me.
    $endgroup$
    – user122424
    Dec 18 '18 at 17:51












  • $begingroup$
    @user122424 I already explained in the bracketed comment. To say $hcolon N_1 to N_3$ is a map over $M$ is to say that $h$ is the identity when restricted to $M$, i.e. $h(m) = m$ for all $min M$. (Of course this only makes sense when $Msubseteq N_1$ and $Msubseteq N_3$).
    $endgroup$
    – Alex Kruckman
    Dec 18 '18 at 18:26












  • $begingroup$
    But in the -3rd line in your item $3.$ you write $M$ is not assumed to be a subset of $N_3$ and in the above comment you write "(Of course this only makes sense when $M⊆N_1$ and $M⊆N_3$)".
    $endgroup$
    – user122424
    Dec 18 '18 at 20:38


















  • $begingroup$
    Could you please correct your 4th line in which there is an incomplete notation $(a_1)=a_2$ ?
    $endgroup$
    – user122424
    Dec 18 '18 at 17:03










  • $begingroup$
    @user122424 Done
    $endgroup$
    – Alex Kruckman
    Dec 18 '18 at 17:05










  • $begingroup$
    How do we find that the squares commutes in your sentence "Taking $g$ to be the inclusion $N_2→N_3$, we find that the square commutes: for all $m∈M$, $h(m)=m=g(m)$." ? More precisely how can I justify $h(m)=m$, the second equality is clear to me.
    $endgroup$
    – user122424
    Dec 18 '18 at 17:51












  • $begingroup$
    @user122424 I already explained in the bracketed comment. To say $hcolon N_1 to N_3$ is a map over $M$ is to say that $h$ is the identity when restricted to $M$, i.e. $h(m) = m$ for all $min M$. (Of course this only makes sense when $Msubseteq N_1$ and $Msubseteq N_3$).
    $endgroup$
    – Alex Kruckman
    Dec 18 '18 at 18:26












  • $begingroup$
    But in the -3rd line in your item $3.$ you write $M$ is not assumed to be a subset of $N_3$ and in the above comment you write "(Of course this only makes sense when $M⊆N_1$ and $M⊆N_3$)".
    $endgroup$
    – user122424
    Dec 18 '18 at 20:38
















$begingroup$
Could you please correct your 4th line in which there is an incomplete notation $(a_1)=a_2$ ?
$endgroup$
– user122424
Dec 18 '18 at 17:03




$begingroup$
Could you please correct your 4th line in which there is an incomplete notation $(a_1)=a_2$ ?
$endgroup$
– user122424
Dec 18 '18 at 17:03












$begingroup$
@user122424 Done
$endgroup$
– Alex Kruckman
Dec 18 '18 at 17:05




$begingroup$
@user122424 Done
$endgroup$
– Alex Kruckman
Dec 18 '18 at 17:05












$begingroup$
How do we find that the squares commutes in your sentence "Taking $g$ to be the inclusion $N_2→N_3$, we find that the square commutes: for all $m∈M$, $h(m)=m=g(m)$." ? More precisely how can I justify $h(m)=m$, the second equality is clear to me.
$endgroup$
– user122424
Dec 18 '18 at 17:51






$begingroup$
How do we find that the squares commutes in your sentence "Taking $g$ to be the inclusion $N_2→N_3$, we find that the square commutes: for all $m∈M$, $h(m)=m=g(m)$." ? More precisely how can I justify $h(m)=m$, the second equality is clear to me.
$endgroup$
– user122424
Dec 18 '18 at 17:51














$begingroup$
@user122424 I already explained in the bracketed comment. To say $hcolon N_1 to N_3$ is a map over $M$ is to say that $h$ is the identity when restricted to $M$, i.e. $h(m) = m$ for all $min M$. (Of course this only makes sense when $Msubseteq N_1$ and $Msubseteq N_3$).
$endgroup$
– Alex Kruckman
Dec 18 '18 at 18:26






$begingroup$
@user122424 I already explained in the bracketed comment. To say $hcolon N_1 to N_3$ is a map over $M$ is to say that $h$ is the identity when restricted to $M$, i.e. $h(m) = m$ for all $min M$. (Of course this only makes sense when $Msubseteq N_1$ and $Msubseteq N_3$).
$endgroup$
– Alex Kruckman
Dec 18 '18 at 18:26














$begingroup$
But in the -3rd line in your item $3.$ you write $M$ is not assumed to be a subset of $N_3$ and in the above comment you write "(Of course this only makes sense when $M⊆N_1$ and $M⊆N_3$)".
$endgroup$
– user122424
Dec 18 '18 at 20:38




$begingroup$
But in the -3rd line in your item $3.$ you write $M$ is not assumed to be a subset of $N_3$ and in the above comment you write "(Of course this only makes sense when $M⊆N_1$ and $M⊆N_3$)".
$endgroup$
– user122424
Dec 18 '18 at 20:38


















draft saved

draft discarded




















































Thanks for contributing an answer to Mathematics Stack Exchange!


  • Please be sure to answer the question. Provide details and share your research!

But avoid



  • Asking for help, clarification, or responding to other answers.

  • Making statements based on opinion; back them up with references or personal experience.


Use MathJax to format equations. MathJax reference.


To learn more, see our tips on writing great answers.




draft saved


draft discarded














StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3044120%2fthe-cornerstone-definition-in-abstract-elementary-classes%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown





















































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown

































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown







Popular posts from this blog

Le Mesnil-Réaume

Ida-Boy-Ed-Garten

web3.py web3.isConnected() returns false always