Standard fact about iterated forcing












3












$begingroup$


I'm studying Laver's proof of the consistency of Borel's conjecture and he says that the following is a standard fact about iterated forcing:






Define $mathbb{P}^{alpha beta}$ as the set of all functions $f$ with domain $[alpha, beta)$ such that $1_{alpha} cup f in mathbb{P}_{beta}$ and order $mathbb{P}^{alpha beta}$ in $mathfrak{M}[G_{alpha}]$ with:
$f le g longleftrightarrow (exists p in G_{alpha}) p cup f le pcup g$

Let $G_{beta}$ be generic over $mathbb{P}_{beta}$, then $mathfrak{M}[G_{beta}] = mathfrak{M}[G_{alpha}][G^{alpha beta}]$ where $G^{alpha beta}$ is $mathfrak{M}[G_{alpha}]text{-generic}$ over $mathbb{P}^{alpha beta}$.






My thoughts:

I tried to prove $G_{beta} = G_{alpha} * G^{alpha beta}$ and that $G^{alpha beta} = G^{beta}|_{[alpha, beta)}$ but i failed because $G^{alpha beta}$ is so random. I would be really glad if someone pointed me in the right direction.





Edit I: The definitions that i forgot:
$G_{alpha} = G_{beta} |_{alpha}$ and $1_{alpha}$ is the canonical name for the greatest element of $mathbb{P}_{alpha}$ and $mathbb{P}_{beta}$ is the $betatext{-th}$ stage iteration of Laver forcing.










share|cite|improve this question











$endgroup$








  • 3




    $begingroup$
    This is a fairly standard fact for iterations. But I agree, it can be tricky to figure out how to prove these things when you're just starting with forcing. The easiest way is to define the partial order of $Bbb P_alphaastBbb P^{alphabeta}$ and show it is isomorphic to $Bbb P_beta$, and that should do most of the job for you. The rest is done by noting that the isomorphism is in fact the identity on $Bbb P_alphaast{1_{alphabeta}}$.
    $endgroup$
    – Asaf Karagila
    Dec 11 '18 at 11:24








  • 1




    $begingroup$
    Oh right then by the two-step iteration lemma we are done, right?
    $endgroup$
    – Shervin Sorouri
    Dec 11 '18 at 11:30








  • 2




    $begingroup$
    Yes, pretty much.
    $endgroup$
    – Asaf Karagila
    Dec 11 '18 at 11:30
















3












$begingroup$


I'm studying Laver's proof of the consistency of Borel's conjecture and he says that the following is a standard fact about iterated forcing:






Define $mathbb{P}^{alpha beta}$ as the set of all functions $f$ with domain $[alpha, beta)$ such that $1_{alpha} cup f in mathbb{P}_{beta}$ and order $mathbb{P}^{alpha beta}$ in $mathfrak{M}[G_{alpha}]$ with:
$f le g longleftrightarrow (exists p in G_{alpha}) p cup f le pcup g$

Let $G_{beta}$ be generic over $mathbb{P}_{beta}$, then $mathfrak{M}[G_{beta}] = mathfrak{M}[G_{alpha}][G^{alpha beta}]$ where $G^{alpha beta}$ is $mathfrak{M}[G_{alpha}]text{-generic}$ over $mathbb{P}^{alpha beta}$.






My thoughts:

I tried to prove $G_{beta} = G_{alpha} * G^{alpha beta}$ and that $G^{alpha beta} = G^{beta}|_{[alpha, beta)}$ but i failed because $G^{alpha beta}$ is so random. I would be really glad if someone pointed me in the right direction.





Edit I: The definitions that i forgot:
$G_{alpha} = G_{beta} |_{alpha}$ and $1_{alpha}$ is the canonical name for the greatest element of $mathbb{P}_{alpha}$ and $mathbb{P}_{beta}$ is the $betatext{-th}$ stage iteration of Laver forcing.










share|cite|improve this question











$endgroup$








  • 3




    $begingroup$
    This is a fairly standard fact for iterations. But I agree, it can be tricky to figure out how to prove these things when you're just starting with forcing. The easiest way is to define the partial order of $Bbb P_alphaastBbb P^{alphabeta}$ and show it is isomorphic to $Bbb P_beta$, and that should do most of the job for you. The rest is done by noting that the isomorphism is in fact the identity on $Bbb P_alphaast{1_{alphabeta}}$.
    $endgroup$
    – Asaf Karagila
    Dec 11 '18 at 11:24








  • 1




    $begingroup$
    Oh right then by the two-step iteration lemma we are done, right?
    $endgroup$
    – Shervin Sorouri
    Dec 11 '18 at 11:30








  • 2




    $begingroup$
    Yes, pretty much.
    $endgroup$
    – Asaf Karagila
    Dec 11 '18 at 11:30














3












3








3





$begingroup$


I'm studying Laver's proof of the consistency of Borel's conjecture and he says that the following is a standard fact about iterated forcing:






Define $mathbb{P}^{alpha beta}$ as the set of all functions $f$ with domain $[alpha, beta)$ such that $1_{alpha} cup f in mathbb{P}_{beta}$ and order $mathbb{P}^{alpha beta}$ in $mathfrak{M}[G_{alpha}]$ with:
$f le g longleftrightarrow (exists p in G_{alpha}) p cup f le pcup g$

Let $G_{beta}$ be generic over $mathbb{P}_{beta}$, then $mathfrak{M}[G_{beta}] = mathfrak{M}[G_{alpha}][G^{alpha beta}]$ where $G^{alpha beta}$ is $mathfrak{M}[G_{alpha}]text{-generic}$ over $mathbb{P}^{alpha beta}$.






My thoughts:

I tried to prove $G_{beta} = G_{alpha} * G^{alpha beta}$ and that $G^{alpha beta} = G^{beta}|_{[alpha, beta)}$ but i failed because $G^{alpha beta}$ is so random. I would be really glad if someone pointed me in the right direction.





Edit I: The definitions that i forgot:
$G_{alpha} = G_{beta} |_{alpha}$ and $1_{alpha}$ is the canonical name for the greatest element of $mathbb{P}_{alpha}$ and $mathbb{P}_{beta}$ is the $betatext{-th}$ stage iteration of Laver forcing.










share|cite|improve this question











$endgroup$




I'm studying Laver's proof of the consistency of Borel's conjecture and he says that the following is a standard fact about iterated forcing:






Define $mathbb{P}^{alpha beta}$ as the set of all functions $f$ with domain $[alpha, beta)$ such that $1_{alpha} cup f in mathbb{P}_{beta}$ and order $mathbb{P}^{alpha beta}$ in $mathfrak{M}[G_{alpha}]$ with:
$f le g longleftrightarrow (exists p in G_{alpha}) p cup f le pcup g$

Let $G_{beta}$ be generic over $mathbb{P}_{beta}$, then $mathfrak{M}[G_{beta}] = mathfrak{M}[G_{alpha}][G^{alpha beta}]$ where $G^{alpha beta}$ is $mathfrak{M}[G_{alpha}]text{-generic}$ over $mathbb{P}^{alpha beta}$.






My thoughts:

I tried to prove $G_{beta} = G_{alpha} * G^{alpha beta}$ and that $G^{alpha beta} = G^{beta}|_{[alpha, beta)}$ but i failed because $G^{alpha beta}$ is so random. I would be really glad if someone pointed me in the right direction.





Edit I: The definitions that i forgot:
$G_{alpha} = G_{beta} |_{alpha}$ and $1_{alpha}$ is the canonical name for the greatest element of $mathbb{P}_{alpha}$ and $mathbb{P}_{beta}$ is the $betatext{-th}$ stage iteration of Laver forcing.







set-theory forcing






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Dec 12 '18 at 14:26









Asaf Karagila

305k33435765




305k33435765










asked Dec 11 '18 at 10:40









Shervin SorouriShervin Sorouri

519211




519211








  • 3




    $begingroup$
    This is a fairly standard fact for iterations. But I agree, it can be tricky to figure out how to prove these things when you're just starting with forcing. The easiest way is to define the partial order of $Bbb P_alphaastBbb P^{alphabeta}$ and show it is isomorphic to $Bbb P_beta$, and that should do most of the job for you. The rest is done by noting that the isomorphism is in fact the identity on $Bbb P_alphaast{1_{alphabeta}}$.
    $endgroup$
    – Asaf Karagila
    Dec 11 '18 at 11:24








  • 1




    $begingroup$
    Oh right then by the two-step iteration lemma we are done, right?
    $endgroup$
    – Shervin Sorouri
    Dec 11 '18 at 11:30








  • 2




    $begingroup$
    Yes, pretty much.
    $endgroup$
    – Asaf Karagila
    Dec 11 '18 at 11:30














  • 3




    $begingroup$
    This is a fairly standard fact for iterations. But I agree, it can be tricky to figure out how to prove these things when you're just starting with forcing. The easiest way is to define the partial order of $Bbb P_alphaastBbb P^{alphabeta}$ and show it is isomorphic to $Bbb P_beta$, and that should do most of the job for you. The rest is done by noting that the isomorphism is in fact the identity on $Bbb P_alphaast{1_{alphabeta}}$.
    $endgroup$
    – Asaf Karagila
    Dec 11 '18 at 11:24








  • 1




    $begingroup$
    Oh right then by the two-step iteration lemma we are done, right?
    $endgroup$
    – Shervin Sorouri
    Dec 11 '18 at 11:30








  • 2




    $begingroup$
    Yes, pretty much.
    $endgroup$
    – Asaf Karagila
    Dec 11 '18 at 11:30








3




3




$begingroup$
This is a fairly standard fact for iterations. But I agree, it can be tricky to figure out how to prove these things when you're just starting with forcing. The easiest way is to define the partial order of $Bbb P_alphaastBbb P^{alphabeta}$ and show it is isomorphic to $Bbb P_beta$, and that should do most of the job for you. The rest is done by noting that the isomorphism is in fact the identity on $Bbb P_alphaast{1_{alphabeta}}$.
$endgroup$
– Asaf Karagila
Dec 11 '18 at 11:24






$begingroup$
This is a fairly standard fact for iterations. But I agree, it can be tricky to figure out how to prove these things when you're just starting with forcing. The easiest way is to define the partial order of $Bbb P_alphaastBbb P^{alphabeta}$ and show it is isomorphic to $Bbb P_beta$, and that should do most of the job for you. The rest is done by noting that the isomorphism is in fact the identity on $Bbb P_alphaast{1_{alphabeta}}$.
$endgroup$
– Asaf Karagila
Dec 11 '18 at 11:24






1




1




$begingroup$
Oh right then by the two-step iteration lemma we are done, right?
$endgroup$
– Shervin Sorouri
Dec 11 '18 at 11:30






$begingroup$
Oh right then by the two-step iteration lemma we are done, right?
$endgroup$
– Shervin Sorouri
Dec 11 '18 at 11:30






2




2




$begingroup$
Yes, pretty much.
$endgroup$
– Asaf Karagila
Dec 11 '18 at 11:30




$begingroup$
Yes, pretty much.
$endgroup$
– Asaf Karagila
Dec 11 '18 at 11:30










0






active

oldest

votes











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%2f3035161%2fstandard-fact-about-iterated-forcing%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown

























0






active

oldest

votes








0






active

oldest

votes









active

oldest

votes






active

oldest

votes
















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%2f3035161%2fstandard-fact-about-iterated-forcing%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

Plaza Victoria

Puebla de Zaragoza

Musa