Models of ZFC & Club Sets.Weakly inaccessible cardinals and Discovering Modern Set TheoryUniverse cardinals and models for ZFCOn the number of countable models of complete theories of models of ZFCProof of “If $ZFC$ proves there is an inaccessible cardinal, then $ZFC$ is inconsistent”.Exercise with transitive models of ZFCHelp with a problem about club setsCan $V_alpha$ for a countable $alpha$ be a model of ZFC from Löwenheim–Skolem theorem?Proving/disproving that weakly inaccessible cardinals imply $V_kappa$ models ZFCWorldly vs Inaccessible Cardinals, why different?Existence of minimal transitive model of ZF(C).
How would I stat a creature to be immune to everything but the Magic Missile spell? (just for fun)
Would Slavery Reparations be considered Bills of Attainder and hence Illegal?
Mathematica command that allows it to read my intentions
Why do bosons tend to occupy the same state?
Could the museum Saturn V's be refitted for one more flight?
Personal Teleportation: From Rags to Riches
Plagiarism or not?
GFCI outlets - can they be repaired? Are they really needed at the end of a circuit?
Avoiding the "not like other girls" trope?
How to prevent "they're falling in love" trope
Do scales need to be in alphabetical order?
Reverse dictionary where values are lists
Determining Impedance With An Antenna Analyzer
Why is consensus so controversial in Britain?
Bullying boss launched a smear campaign and made me unemployable
Why is it a bad idea to hire a hitman to eliminate most corrupt politicians?
What mechanic is there to disable a threat instead of killing it?
Little known, relatively unlikely, but scientifically plausible, apocalyptic (or near apocalyptic) events
A category-like structure without composition?
Can a virus destroy the BIOS of a modern computer?
How can I determine if the org that I'm currently connected to is a scratch org?
CAST throwing error when run in stored procedure but not when run as raw query
When is человек used as the word man instead of человек
What reasons are there for a Capitalist to oppose a 100% inheritance tax?
Models of ZFC & Club Sets.
Weakly inaccessible cardinals and Discovering Modern Set TheoryUniverse cardinals and models for ZFCOn the number of countable models of complete theories of models of ZFCProof of “If $ZFC$ proves there is an inaccessible cardinal, then $ZFC$ is inconsistent”.Exercise with transitive models of ZFCHelp with a problem about club setsCan $V_alpha$ for a countable $alpha$ be a model of ZFC from Löwenheim–Skolem theorem?Proving/disproving that weakly inaccessible cardinals imply $V_kappa$ models ZFCWorldly vs Inaccessible Cardinals, why different?Existence of minimal transitive model of ZF(C).
$begingroup$
I need help with the following problem:
Let $kappa$ be a weakly inaccessible cardinal.
Show there exists a closed and unbounded set of $alpha < kappa$ such that $L_alphavDash ZFC$.
I know that if $kappa$ is weakly inaccessible then $L_kappa$ is a model of ZFC. But other than that I am not really sure now to proceed.
logic set-theory
$endgroup$
add a comment |
$begingroup$
I need help with the following problem:
Let $kappa$ be a weakly inaccessible cardinal.
Show there exists a closed and unbounded set of $alpha < kappa$ such that $L_alphavDash ZFC$.
I know that if $kappa$ is weakly inaccessible then $L_kappa$ is a model of ZFC. But other than that I am not really sure now to proceed.
logic set-theory
$endgroup$
add a comment |
$begingroup$
I need help with the following problem:
Let $kappa$ be a weakly inaccessible cardinal.
Show there exists a closed and unbounded set of $alpha < kappa$ such that $L_alphavDash ZFC$.
I know that if $kappa$ is weakly inaccessible then $L_kappa$ is a model of ZFC. But other than that I am not really sure now to proceed.
logic set-theory
$endgroup$
I need help with the following problem:
Let $kappa$ be a weakly inaccessible cardinal.
Show there exists a closed and unbounded set of $alpha < kappa$ such that $L_alphavDash ZFC$.
I know that if $kappa$ is weakly inaccessible then $L_kappa$ is a model of ZFC. But other than that I am not really sure now to proceed.
logic set-theory
logic set-theory
edited Mar 21 at 5:00
A. Collins
asked Mar 7 at 22:59
A. CollinsA. Collins
62
62
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
Hint: We have $L_kappa models mathrmZFC$ and $kappa$ is regular.
We will show something stronger, namely
$$
C := alpha < kappa mid L_alpha prec L_kappa
$$
is a club.
First show that $C$ is unbounded: Let $beta < kappa$. As in the proof of the Reflection Theorem recursively construct a strictly increasing sequence $(alpha_n mid n < omega)$ with $alpha_0 = beta$ such that $L_sup_n <omega alpha_n prec L_kappa$. Note that $beta < sup_n <omega alpha_n < kappa$.
Now show that $C$ is closed. This follows pretty much immediately from the Tarski-Vaught test (/ criterion):
Lemma. (Tarski-Vaught)
Let $M subseteq N$ be $mathcalL$-models for some first order language $mathcalL$. Then the following are equivalent:
$M prec N$ and- For every $x_0, ldots, x_n in M$ and every $mathcalL$-formula $phi$. If
$$
N models exists x colon phi(x, x_0, ldots, x_n),
$$
then there is some $x in M$ (!) such that
$$
N models phi(x, x_0, ldots, x_n)
$$
(You can find a proof of this here.)
Corollary. Let $N$ be a $mathcalL$ structure and $(M_n mid n < omega)$ be a strictly increasing sequence such that $M_n prec M_n+1 prec N$ for all $n < omega$. Then $M := bigcup_n < omega M_n prec N$.
Proof. Let $x_0, ldots, x_n in M$ and let $phi$ be a $mathcalL$-formula such that
$$
N models exists x colon phi(x, x_0, ldots, x_n).
$$
Fix $k$ large enough such that $x_0, ldots, x_n$ in $M_n$. Since $M_n prec N$ we have that there is some $x in M_n$ such that
$$
N models phi(x, x_0, ldots, x_n)
$$
But $x in M_n subseteq M$, hence the Tarski-Vaught criterion is satisfied and we have
$$
M prec N.
$$
Q.E.D.
Let us show that $C$ is closed: Fix a strictly increasing sequence $(alpha_beta mid beta < gamma)$ of $alpha_beta in C$, for some $gamma < kappa$. By definition of $C$ we have
$$
L_alpha_beta prec L_kappa
$$
for all $beta < gamma$.
Claim. We also have
$$L_alpha_beta prec L_alpha_beta^*$$
for $beta < beta^* < gamma$.
Proof.
For all $x_0, ldots, x_n in L_alpha_beta$, we have
$$L_alpha_beta models phi(x_0, ldots, x_n) iff L_kappa models phi(x_0, ldots, x_n) iff L_alpha_beta^* models phi(x_0, ldots, x_n)$$
Q.E.D.
It now follows from the corollary that
$$
L_sup_beta < gamma alpha_beta prec L_kappa,
$$
so that $sup_beta < gamma alpha_beta in C$, so that $C$ is indeed closed.
Since you don't know the reflection theorem (or rather its proof), you can also use the Tarski-Vaught criterion to show that $C$ is unbounded:
Let $beta_0 < kappa$. If $L_beta_0 prec L_kappa$, we are done. Otherwise fix a strict wellorder $<^*$ of $L_kappa$ and select, for all formulae $phi$ and all $x_0, ldots, x_n in L_beta_0$ the $<^*$-least $x_phi, x_0, ldots, x_n in L_kappa$ such that
$$
L_kappa models exists x phi(x,x_0, ldots, x_n) implies L_kappa models phi(x_phi, x_0, ldots, x_n,x_0, ldots, x_n).
$$
Let $beta_0 < beta_1$ be minimal such that $x_phi, x_0, ldots, x_n in L_beta_1$ for all $phi$ and all $x_0, ldots, x_n in L_beta_0$.
Now continue doing this (replacing $beta_0$ with $beta_1$ and creating $beta_2$ and so on) to produce an increasing sequence $(beta_k mid k < omega)$. Let $alpha := sup_k < omega beta_k$ and verify that $L_alpha prec L_kappa$ with Tarski-Vaught (the proof is basically the same as in the Corollary I've proved above).
$endgroup$
$begingroup$
Please excuse my incompetence, I am new to set theory/model theory. I don't follow the proof of unboundedness (as I do not know what the reflection theorem is). Could you also please also explain more on how the Tarski-Vaught test shows closure?
$endgroup$
– A. Collins
Mar 8 at 0:25
$begingroup$
@A.Collins Sure, I'll expand my answer.
$endgroup$
– Stefan Mesken
Mar 8 at 0:31
$begingroup$
@A.Collins Does the recent edit answer your questions?
$endgroup$
– Stefan Mesken
Mar 8 at 0:50
$begingroup$
Thank you for your expanded answer. I am slowing parsing my way thought it. I am not quite done yet, but I think it should.
$endgroup$
– A. Collins
Mar 8 at 1:10
$begingroup$
@A.Collins If you have further questions, just leave a comment. I may not answer quickly (because I'm currently traveling) but I (or maybe someone else) will address it eventually.
$endgroup$
– Stefan Mesken
Mar 8 at 1:17
|
show 2 more comments
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
);
);
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3139465%2fmodels-of-zfc-club-sets%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
$begingroup$
Hint: We have $L_kappa models mathrmZFC$ and $kappa$ is regular.
We will show something stronger, namely
$$
C := alpha < kappa mid L_alpha prec L_kappa
$$
is a club.
First show that $C$ is unbounded: Let $beta < kappa$. As in the proof of the Reflection Theorem recursively construct a strictly increasing sequence $(alpha_n mid n < omega)$ with $alpha_0 = beta$ such that $L_sup_n <omega alpha_n prec L_kappa$. Note that $beta < sup_n <omega alpha_n < kappa$.
Now show that $C$ is closed. This follows pretty much immediately from the Tarski-Vaught test (/ criterion):
Lemma. (Tarski-Vaught)
Let $M subseteq N$ be $mathcalL$-models for some first order language $mathcalL$. Then the following are equivalent:
$M prec N$ and- For every $x_0, ldots, x_n in M$ and every $mathcalL$-formula $phi$. If
$$
N models exists x colon phi(x, x_0, ldots, x_n),
$$
then there is some $x in M$ (!) such that
$$
N models phi(x, x_0, ldots, x_n)
$$
(You can find a proof of this here.)
Corollary. Let $N$ be a $mathcalL$ structure and $(M_n mid n < omega)$ be a strictly increasing sequence such that $M_n prec M_n+1 prec N$ for all $n < omega$. Then $M := bigcup_n < omega M_n prec N$.
Proof. Let $x_0, ldots, x_n in M$ and let $phi$ be a $mathcalL$-formula such that
$$
N models exists x colon phi(x, x_0, ldots, x_n).
$$
Fix $k$ large enough such that $x_0, ldots, x_n$ in $M_n$. Since $M_n prec N$ we have that there is some $x in M_n$ such that
$$
N models phi(x, x_0, ldots, x_n)
$$
But $x in M_n subseteq M$, hence the Tarski-Vaught criterion is satisfied and we have
$$
M prec N.
$$
Q.E.D.
Let us show that $C$ is closed: Fix a strictly increasing sequence $(alpha_beta mid beta < gamma)$ of $alpha_beta in C$, for some $gamma < kappa$. By definition of $C$ we have
$$
L_alpha_beta prec L_kappa
$$
for all $beta < gamma$.
Claim. We also have
$$L_alpha_beta prec L_alpha_beta^*$$
for $beta < beta^* < gamma$.
Proof.
For all $x_0, ldots, x_n in L_alpha_beta$, we have
$$L_alpha_beta models phi(x_0, ldots, x_n) iff L_kappa models phi(x_0, ldots, x_n) iff L_alpha_beta^* models phi(x_0, ldots, x_n)$$
Q.E.D.
It now follows from the corollary that
$$
L_sup_beta < gamma alpha_beta prec L_kappa,
$$
so that $sup_beta < gamma alpha_beta in C$, so that $C$ is indeed closed.
Since you don't know the reflection theorem (or rather its proof), you can also use the Tarski-Vaught criterion to show that $C$ is unbounded:
Let $beta_0 < kappa$. If $L_beta_0 prec L_kappa$, we are done. Otherwise fix a strict wellorder $<^*$ of $L_kappa$ and select, for all formulae $phi$ and all $x_0, ldots, x_n in L_beta_0$ the $<^*$-least $x_phi, x_0, ldots, x_n in L_kappa$ such that
$$
L_kappa models exists x phi(x,x_0, ldots, x_n) implies L_kappa models phi(x_phi, x_0, ldots, x_n,x_0, ldots, x_n).
$$
Let $beta_0 < beta_1$ be minimal such that $x_phi, x_0, ldots, x_n in L_beta_1$ for all $phi$ and all $x_0, ldots, x_n in L_beta_0$.
Now continue doing this (replacing $beta_0$ with $beta_1$ and creating $beta_2$ and so on) to produce an increasing sequence $(beta_k mid k < omega)$. Let $alpha := sup_k < omega beta_k$ and verify that $L_alpha prec L_kappa$ with Tarski-Vaught (the proof is basically the same as in the Corollary I've proved above).
$endgroup$
$begingroup$
Please excuse my incompetence, I am new to set theory/model theory. I don't follow the proof of unboundedness (as I do not know what the reflection theorem is). Could you also please also explain more on how the Tarski-Vaught test shows closure?
$endgroup$
– A. Collins
Mar 8 at 0:25
$begingroup$
@A.Collins Sure, I'll expand my answer.
$endgroup$
– Stefan Mesken
Mar 8 at 0:31
$begingroup$
@A.Collins Does the recent edit answer your questions?
$endgroup$
– Stefan Mesken
Mar 8 at 0:50
$begingroup$
Thank you for your expanded answer. I am slowing parsing my way thought it. I am not quite done yet, but I think it should.
$endgroup$
– A. Collins
Mar 8 at 1:10
$begingroup$
@A.Collins If you have further questions, just leave a comment. I may not answer quickly (because I'm currently traveling) but I (or maybe someone else) will address it eventually.
$endgroup$
– Stefan Mesken
Mar 8 at 1:17
|
show 2 more comments
$begingroup$
Hint: We have $L_kappa models mathrmZFC$ and $kappa$ is regular.
We will show something stronger, namely
$$
C := alpha < kappa mid L_alpha prec L_kappa
$$
is a club.
First show that $C$ is unbounded: Let $beta < kappa$. As in the proof of the Reflection Theorem recursively construct a strictly increasing sequence $(alpha_n mid n < omega)$ with $alpha_0 = beta$ such that $L_sup_n <omega alpha_n prec L_kappa$. Note that $beta < sup_n <omega alpha_n < kappa$.
Now show that $C$ is closed. This follows pretty much immediately from the Tarski-Vaught test (/ criterion):
Lemma. (Tarski-Vaught)
Let $M subseteq N$ be $mathcalL$-models for some first order language $mathcalL$. Then the following are equivalent:
$M prec N$ and- For every $x_0, ldots, x_n in M$ and every $mathcalL$-formula $phi$. If
$$
N models exists x colon phi(x, x_0, ldots, x_n),
$$
then there is some $x in M$ (!) such that
$$
N models phi(x, x_0, ldots, x_n)
$$
(You can find a proof of this here.)
Corollary. Let $N$ be a $mathcalL$ structure and $(M_n mid n < omega)$ be a strictly increasing sequence such that $M_n prec M_n+1 prec N$ for all $n < omega$. Then $M := bigcup_n < omega M_n prec N$.
Proof. Let $x_0, ldots, x_n in M$ and let $phi$ be a $mathcalL$-formula such that
$$
N models exists x colon phi(x, x_0, ldots, x_n).
$$
Fix $k$ large enough such that $x_0, ldots, x_n$ in $M_n$. Since $M_n prec N$ we have that there is some $x in M_n$ such that
$$
N models phi(x, x_0, ldots, x_n)
$$
But $x in M_n subseteq M$, hence the Tarski-Vaught criterion is satisfied and we have
$$
M prec N.
$$
Q.E.D.
Let us show that $C$ is closed: Fix a strictly increasing sequence $(alpha_beta mid beta < gamma)$ of $alpha_beta in C$, for some $gamma < kappa$. By definition of $C$ we have
$$
L_alpha_beta prec L_kappa
$$
for all $beta < gamma$.
Claim. We also have
$$L_alpha_beta prec L_alpha_beta^*$$
for $beta < beta^* < gamma$.
Proof.
For all $x_0, ldots, x_n in L_alpha_beta$, we have
$$L_alpha_beta models phi(x_0, ldots, x_n) iff L_kappa models phi(x_0, ldots, x_n) iff L_alpha_beta^* models phi(x_0, ldots, x_n)$$
Q.E.D.
It now follows from the corollary that
$$
L_sup_beta < gamma alpha_beta prec L_kappa,
$$
so that $sup_beta < gamma alpha_beta in C$, so that $C$ is indeed closed.
Since you don't know the reflection theorem (or rather its proof), you can also use the Tarski-Vaught criterion to show that $C$ is unbounded:
Let $beta_0 < kappa$. If $L_beta_0 prec L_kappa$, we are done. Otherwise fix a strict wellorder $<^*$ of $L_kappa$ and select, for all formulae $phi$ and all $x_0, ldots, x_n in L_beta_0$ the $<^*$-least $x_phi, x_0, ldots, x_n in L_kappa$ such that
$$
L_kappa models exists x phi(x,x_0, ldots, x_n) implies L_kappa models phi(x_phi, x_0, ldots, x_n,x_0, ldots, x_n).
$$
Let $beta_0 < beta_1$ be minimal such that $x_phi, x_0, ldots, x_n in L_beta_1$ for all $phi$ and all $x_0, ldots, x_n in L_beta_0$.
Now continue doing this (replacing $beta_0$ with $beta_1$ and creating $beta_2$ and so on) to produce an increasing sequence $(beta_k mid k < omega)$. Let $alpha := sup_k < omega beta_k$ and verify that $L_alpha prec L_kappa$ with Tarski-Vaught (the proof is basically the same as in the Corollary I've proved above).
$endgroup$
$begingroup$
Please excuse my incompetence, I am new to set theory/model theory. I don't follow the proof of unboundedness (as I do not know what the reflection theorem is). Could you also please also explain more on how the Tarski-Vaught test shows closure?
$endgroup$
– A. Collins
Mar 8 at 0:25
$begingroup$
@A.Collins Sure, I'll expand my answer.
$endgroup$
– Stefan Mesken
Mar 8 at 0:31
$begingroup$
@A.Collins Does the recent edit answer your questions?
$endgroup$
– Stefan Mesken
Mar 8 at 0:50
$begingroup$
Thank you for your expanded answer. I am slowing parsing my way thought it. I am not quite done yet, but I think it should.
$endgroup$
– A. Collins
Mar 8 at 1:10
$begingroup$
@A.Collins If you have further questions, just leave a comment. I may not answer quickly (because I'm currently traveling) but I (or maybe someone else) will address it eventually.
$endgroup$
– Stefan Mesken
Mar 8 at 1:17
|
show 2 more comments
$begingroup$
Hint: We have $L_kappa models mathrmZFC$ and $kappa$ is regular.
We will show something stronger, namely
$$
C := alpha < kappa mid L_alpha prec L_kappa
$$
is a club.
First show that $C$ is unbounded: Let $beta < kappa$. As in the proof of the Reflection Theorem recursively construct a strictly increasing sequence $(alpha_n mid n < omega)$ with $alpha_0 = beta$ such that $L_sup_n <omega alpha_n prec L_kappa$. Note that $beta < sup_n <omega alpha_n < kappa$.
Now show that $C$ is closed. This follows pretty much immediately from the Tarski-Vaught test (/ criterion):
Lemma. (Tarski-Vaught)
Let $M subseteq N$ be $mathcalL$-models for some first order language $mathcalL$. Then the following are equivalent:
$M prec N$ and- For every $x_0, ldots, x_n in M$ and every $mathcalL$-formula $phi$. If
$$
N models exists x colon phi(x, x_0, ldots, x_n),
$$
then there is some $x in M$ (!) such that
$$
N models phi(x, x_0, ldots, x_n)
$$
(You can find a proof of this here.)
Corollary. Let $N$ be a $mathcalL$ structure and $(M_n mid n < omega)$ be a strictly increasing sequence such that $M_n prec M_n+1 prec N$ for all $n < omega$. Then $M := bigcup_n < omega M_n prec N$.
Proof. Let $x_0, ldots, x_n in M$ and let $phi$ be a $mathcalL$-formula such that
$$
N models exists x colon phi(x, x_0, ldots, x_n).
$$
Fix $k$ large enough such that $x_0, ldots, x_n$ in $M_n$. Since $M_n prec N$ we have that there is some $x in M_n$ such that
$$
N models phi(x, x_0, ldots, x_n)
$$
But $x in M_n subseteq M$, hence the Tarski-Vaught criterion is satisfied and we have
$$
M prec N.
$$
Q.E.D.
Let us show that $C$ is closed: Fix a strictly increasing sequence $(alpha_beta mid beta < gamma)$ of $alpha_beta in C$, for some $gamma < kappa$. By definition of $C$ we have
$$
L_alpha_beta prec L_kappa
$$
for all $beta < gamma$.
Claim. We also have
$$L_alpha_beta prec L_alpha_beta^*$$
for $beta < beta^* < gamma$.
Proof.
For all $x_0, ldots, x_n in L_alpha_beta$, we have
$$L_alpha_beta models phi(x_0, ldots, x_n) iff L_kappa models phi(x_0, ldots, x_n) iff L_alpha_beta^* models phi(x_0, ldots, x_n)$$
Q.E.D.
It now follows from the corollary that
$$
L_sup_beta < gamma alpha_beta prec L_kappa,
$$
so that $sup_beta < gamma alpha_beta in C$, so that $C$ is indeed closed.
Since you don't know the reflection theorem (or rather its proof), you can also use the Tarski-Vaught criterion to show that $C$ is unbounded:
Let $beta_0 < kappa$. If $L_beta_0 prec L_kappa$, we are done. Otherwise fix a strict wellorder $<^*$ of $L_kappa$ and select, for all formulae $phi$ and all $x_0, ldots, x_n in L_beta_0$ the $<^*$-least $x_phi, x_0, ldots, x_n in L_kappa$ such that
$$
L_kappa models exists x phi(x,x_0, ldots, x_n) implies L_kappa models phi(x_phi, x_0, ldots, x_n,x_0, ldots, x_n).
$$
Let $beta_0 < beta_1$ be minimal such that $x_phi, x_0, ldots, x_n in L_beta_1$ for all $phi$ and all $x_0, ldots, x_n in L_beta_0$.
Now continue doing this (replacing $beta_0$ with $beta_1$ and creating $beta_2$ and so on) to produce an increasing sequence $(beta_k mid k < omega)$. Let $alpha := sup_k < omega beta_k$ and verify that $L_alpha prec L_kappa$ with Tarski-Vaught (the proof is basically the same as in the Corollary I've proved above).
$endgroup$
Hint: We have $L_kappa models mathrmZFC$ and $kappa$ is regular.
We will show something stronger, namely
$$
C := alpha < kappa mid L_alpha prec L_kappa
$$
is a club.
First show that $C$ is unbounded: Let $beta < kappa$. As in the proof of the Reflection Theorem recursively construct a strictly increasing sequence $(alpha_n mid n < omega)$ with $alpha_0 = beta$ such that $L_sup_n <omega alpha_n prec L_kappa$. Note that $beta < sup_n <omega alpha_n < kappa$.
Now show that $C$ is closed. This follows pretty much immediately from the Tarski-Vaught test (/ criterion):
Lemma. (Tarski-Vaught)
Let $M subseteq N$ be $mathcalL$-models for some first order language $mathcalL$. Then the following are equivalent:
$M prec N$ and- For every $x_0, ldots, x_n in M$ and every $mathcalL$-formula $phi$. If
$$
N models exists x colon phi(x, x_0, ldots, x_n),
$$
then there is some $x in M$ (!) such that
$$
N models phi(x, x_0, ldots, x_n)
$$
(You can find a proof of this here.)
Corollary. Let $N$ be a $mathcalL$ structure and $(M_n mid n < omega)$ be a strictly increasing sequence such that $M_n prec M_n+1 prec N$ for all $n < omega$. Then $M := bigcup_n < omega M_n prec N$.
Proof. Let $x_0, ldots, x_n in M$ and let $phi$ be a $mathcalL$-formula such that
$$
N models exists x colon phi(x, x_0, ldots, x_n).
$$
Fix $k$ large enough such that $x_0, ldots, x_n$ in $M_n$. Since $M_n prec N$ we have that there is some $x in M_n$ such that
$$
N models phi(x, x_0, ldots, x_n)
$$
But $x in M_n subseteq M$, hence the Tarski-Vaught criterion is satisfied and we have
$$
M prec N.
$$
Q.E.D.
Let us show that $C$ is closed: Fix a strictly increasing sequence $(alpha_beta mid beta < gamma)$ of $alpha_beta in C$, for some $gamma < kappa$. By definition of $C$ we have
$$
L_alpha_beta prec L_kappa
$$
for all $beta < gamma$.
Claim. We also have
$$L_alpha_beta prec L_alpha_beta^*$$
for $beta < beta^* < gamma$.
Proof.
For all $x_0, ldots, x_n in L_alpha_beta$, we have
$$L_alpha_beta models phi(x_0, ldots, x_n) iff L_kappa models phi(x_0, ldots, x_n) iff L_alpha_beta^* models phi(x_0, ldots, x_n)$$
Q.E.D.
It now follows from the corollary that
$$
L_sup_beta < gamma alpha_beta prec L_kappa,
$$
so that $sup_beta < gamma alpha_beta in C$, so that $C$ is indeed closed.
Since you don't know the reflection theorem (or rather its proof), you can also use the Tarski-Vaught criterion to show that $C$ is unbounded:
Let $beta_0 < kappa$. If $L_beta_0 prec L_kappa$, we are done. Otherwise fix a strict wellorder $<^*$ of $L_kappa$ and select, for all formulae $phi$ and all $x_0, ldots, x_n in L_beta_0$ the $<^*$-least $x_phi, x_0, ldots, x_n in L_kappa$ such that
$$
L_kappa models exists x phi(x,x_0, ldots, x_n) implies L_kappa models phi(x_phi, x_0, ldots, x_n,x_0, ldots, x_n).
$$
Let $beta_0 < beta_1$ be minimal such that $x_phi, x_0, ldots, x_n in L_beta_1$ for all $phi$ and all $x_0, ldots, x_n in L_beta_0$.
Now continue doing this (replacing $beta_0$ with $beta_1$ and creating $beta_2$ and so on) to produce an increasing sequence $(beta_k mid k < omega)$. Let $alpha := sup_k < omega beta_k$ and verify that $L_alpha prec L_kappa$ with Tarski-Vaught (the proof is basically the same as in the Corollary I've proved above).
edited Mar 8 at 2:28
answered Mar 7 at 23:27
Stefan MeskenStefan Mesken
14.8k32046
14.8k32046
$begingroup$
Please excuse my incompetence, I am new to set theory/model theory. I don't follow the proof of unboundedness (as I do not know what the reflection theorem is). Could you also please also explain more on how the Tarski-Vaught test shows closure?
$endgroup$
– A. Collins
Mar 8 at 0:25
$begingroup$
@A.Collins Sure, I'll expand my answer.
$endgroup$
– Stefan Mesken
Mar 8 at 0:31
$begingroup$
@A.Collins Does the recent edit answer your questions?
$endgroup$
– Stefan Mesken
Mar 8 at 0:50
$begingroup$
Thank you for your expanded answer. I am slowing parsing my way thought it. I am not quite done yet, but I think it should.
$endgroup$
– A. Collins
Mar 8 at 1:10
$begingroup$
@A.Collins If you have further questions, just leave a comment. I may not answer quickly (because I'm currently traveling) but I (or maybe someone else) will address it eventually.
$endgroup$
– Stefan Mesken
Mar 8 at 1:17
|
show 2 more comments
$begingroup$
Please excuse my incompetence, I am new to set theory/model theory. I don't follow the proof of unboundedness (as I do not know what the reflection theorem is). Could you also please also explain more on how the Tarski-Vaught test shows closure?
$endgroup$
– A. Collins
Mar 8 at 0:25
$begingroup$
@A.Collins Sure, I'll expand my answer.
$endgroup$
– Stefan Mesken
Mar 8 at 0:31
$begingroup$
@A.Collins Does the recent edit answer your questions?
$endgroup$
– Stefan Mesken
Mar 8 at 0:50
$begingroup$
Thank you for your expanded answer. I am slowing parsing my way thought it. I am not quite done yet, but I think it should.
$endgroup$
– A. Collins
Mar 8 at 1:10
$begingroup$
@A.Collins If you have further questions, just leave a comment. I may not answer quickly (because I'm currently traveling) but I (or maybe someone else) will address it eventually.
$endgroup$
– Stefan Mesken
Mar 8 at 1:17
$begingroup$
Please excuse my incompetence, I am new to set theory/model theory. I don't follow the proof of unboundedness (as I do not know what the reflection theorem is). Could you also please also explain more on how the Tarski-Vaught test shows closure?
$endgroup$
– A. Collins
Mar 8 at 0:25
$begingroup$
Please excuse my incompetence, I am new to set theory/model theory. I don't follow the proof of unboundedness (as I do not know what the reflection theorem is). Could you also please also explain more on how the Tarski-Vaught test shows closure?
$endgroup$
– A. Collins
Mar 8 at 0:25
$begingroup$
@A.Collins Sure, I'll expand my answer.
$endgroup$
– Stefan Mesken
Mar 8 at 0:31
$begingroup$
@A.Collins Sure, I'll expand my answer.
$endgroup$
– Stefan Mesken
Mar 8 at 0:31
$begingroup$
@A.Collins Does the recent edit answer your questions?
$endgroup$
– Stefan Mesken
Mar 8 at 0:50
$begingroup$
@A.Collins Does the recent edit answer your questions?
$endgroup$
– Stefan Mesken
Mar 8 at 0:50
$begingroup$
Thank you for your expanded answer. I am slowing parsing my way thought it. I am not quite done yet, but I think it should.
$endgroup$
– A. Collins
Mar 8 at 1:10
$begingroup$
Thank you for your expanded answer. I am slowing parsing my way thought it. I am not quite done yet, but I think it should.
$endgroup$
– A. Collins
Mar 8 at 1:10
$begingroup$
@A.Collins If you have further questions, just leave a comment. I may not answer quickly (because I'm currently traveling) but I (or maybe someone else) will address it eventually.
$endgroup$
– Stefan Mesken
Mar 8 at 1:17
$begingroup$
@A.Collins If you have further questions, just leave a comment. I may not answer quickly (because I'm currently traveling) but I (or maybe someone else) will address it eventually.
$endgroup$
– Stefan Mesken
Mar 8 at 1:17
|
show 2 more comments
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.
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3139465%2fmodels-of-zfc-club-sets%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
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