Constant functions in set-theory












0












$begingroup$


I need some help with an exercise in set theory, which is about certain constant functions.



Let $S$ be a stationary subset of a regular uncountable cardinal $lambda$. Given an ordinal $alpha$, let $c_alpha^lambda$ denote the constant function with domain $lambda$ and range ${alpha}$.



Letting $psi,varphi$ range over all ordinal-valued functions with domain $lambda$, define $$varphi<_Spsimbox{ if and only if }{deltain Smid varphi(delta)≥psi(delta)}mbox{ is non-stationary}.$$ The relation $<_S$ is well-founded, so we can use it to define a rank $|cdot|_S$ by recursion as
$$ |psi|_S=bigcup{|varphi|_S+1mid varphi<_Spsi}. $$




How can we prove that, for all $alphain{rm Ord}$, $|c_alpha^lambda|_S gealpha$ holds?



How can we determine the value of $|c_alpha^lambda|_S$ for all $alpha<lambda$?



Can we prove that $|c_lambda^lambda|_S >lambda$?











share|cite|improve this question











$endgroup$












  • $begingroup$
    What have you tried? Where are you stuck?
    $endgroup$
    – John Coleman
    Jan 8 at 13:39






  • 1




    $begingroup$
    You might want to provide a definition of $|f|_S$ as well.
    $endgroup$
    – Asaf Karagila
    Jan 8 at 13:44










  • $begingroup$
    What precisely is difficult here?
    $endgroup$
    – Andrés E. Caicedo
    Jan 8 at 14:47










  • $begingroup$
    $||Ψ||_S= bigcup { ||φ||_S +1 | φ<_S Ψ}$ is the definition of the S-rank, with S being stationary and $φ<_S ψ $ iff $ {δ∈S|φ(δ)> ψ(δ)} ∈ NS_λ$ (NS is the Non-stationary ideal on λ). I just can't seem to figure out how I can determine the rank of the constant function, and thus don't know how to prove anything about it.
    $endgroup$
    – N. Leveling
    Jan 8 at 16:02












  • $begingroup$
    Do you see that $|c_alpha^lambda|_S$ is an ordinal for all $alpha$, and can you prove that $|c_alpha^lambda|_S>|c_beta^lambda|_S$ whenever $alpha>beta$?
    $endgroup$
    – Andrés E. Caicedo
    Jan 8 at 18:27
















0












$begingroup$


I need some help with an exercise in set theory, which is about certain constant functions.



Let $S$ be a stationary subset of a regular uncountable cardinal $lambda$. Given an ordinal $alpha$, let $c_alpha^lambda$ denote the constant function with domain $lambda$ and range ${alpha}$.



Letting $psi,varphi$ range over all ordinal-valued functions with domain $lambda$, define $$varphi<_Spsimbox{ if and only if }{deltain Smid varphi(delta)≥psi(delta)}mbox{ is non-stationary}.$$ The relation $<_S$ is well-founded, so we can use it to define a rank $|cdot|_S$ by recursion as
$$ |psi|_S=bigcup{|varphi|_S+1mid varphi<_Spsi}. $$




How can we prove that, for all $alphain{rm Ord}$, $|c_alpha^lambda|_S gealpha$ holds?



How can we determine the value of $|c_alpha^lambda|_S$ for all $alpha<lambda$?



Can we prove that $|c_lambda^lambda|_S >lambda$?











share|cite|improve this question











$endgroup$












  • $begingroup$
    What have you tried? Where are you stuck?
    $endgroup$
    – John Coleman
    Jan 8 at 13:39






  • 1




    $begingroup$
    You might want to provide a definition of $|f|_S$ as well.
    $endgroup$
    – Asaf Karagila
    Jan 8 at 13:44










  • $begingroup$
    What precisely is difficult here?
    $endgroup$
    – Andrés E. Caicedo
    Jan 8 at 14:47










  • $begingroup$
    $||Ψ||_S= bigcup { ||φ||_S +1 | φ<_S Ψ}$ is the definition of the S-rank, with S being stationary and $φ<_S ψ $ iff $ {δ∈S|φ(δ)> ψ(δ)} ∈ NS_λ$ (NS is the Non-stationary ideal on λ). I just can't seem to figure out how I can determine the rank of the constant function, and thus don't know how to prove anything about it.
    $endgroup$
    – N. Leveling
    Jan 8 at 16:02












  • $begingroup$
    Do you see that $|c_alpha^lambda|_S$ is an ordinal for all $alpha$, and can you prove that $|c_alpha^lambda|_S>|c_beta^lambda|_S$ whenever $alpha>beta$?
    $endgroup$
    – Andrés E. Caicedo
    Jan 8 at 18:27














0












0








0





$begingroup$


I need some help with an exercise in set theory, which is about certain constant functions.



Let $S$ be a stationary subset of a regular uncountable cardinal $lambda$. Given an ordinal $alpha$, let $c_alpha^lambda$ denote the constant function with domain $lambda$ and range ${alpha}$.



Letting $psi,varphi$ range over all ordinal-valued functions with domain $lambda$, define $$varphi<_Spsimbox{ if and only if }{deltain Smid varphi(delta)≥psi(delta)}mbox{ is non-stationary}.$$ The relation $<_S$ is well-founded, so we can use it to define a rank $|cdot|_S$ by recursion as
$$ |psi|_S=bigcup{|varphi|_S+1mid varphi<_Spsi}. $$




How can we prove that, for all $alphain{rm Ord}$, $|c_alpha^lambda|_S gealpha$ holds?



How can we determine the value of $|c_alpha^lambda|_S$ for all $alpha<lambda$?



Can we prove that $|c_lambda^lambda|_S >lambda$?











share|cite|improve this question











$endgroup$




I need some help with an exercise in set theory, which is about certain constant functions.



Let $S$ be a stationary subset of a regular uncountable cardinal $lambda$. Given an ordinal $alpha$, let $c_alpha^lambda$ denote the constant function with domain $lambda$ and range ${alpha}$.



Letting $psi,varphi$ range over all ordinal-valued functions with domain $lambda$, define $$varphi<_Spsimbox{ if and only if }{deltain Smid varphi(delta)≥psi(delta)}mbox{ is non-stationary}.$$ The relation $<_S$ is well-founded, so we can use it to define a rank $|cdot|_S$ by recursion as
$$ |psi|_S=bigcup{|varphi|_S+1mid varphi<_Spsi}. $$




How can we prove that, for all $alphain{rm Ord}$, $|c_alpha^lambda|_S gealpha$ holds?



How can we determine the value of $|c_alpha^lambda|_S$ for all $alpha<lambda$?



Can we prove that $|c_lambda^lambda|_S >lambda$?








set-theory






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Jan 8 at 19:50







N. Leveling

















asked Jan 8 at 13:36









N. LevelingN. Leveling

52




52












  • $begingroup$
    What have you tried? Where are you stuck?
    $endgroup$
    – John Coleman
    Jan 8 at 13:39






  • 1




    $begingroup$
    You might want to provide a definition of $|f|_S$ as well.
    $endgroup$
    – Asaf Karagila
    Jan 8 at 13:44










  • $begingroup$
    What precisely is difficult here?
    $endgroup$
    – Andrés E. Caicedo
    Jan 8 at 14:47










  • $begingroup$
    $||Ψ||_S= bigcup { ||φ||_S +1 | φ<_S Ψ}$ is the definition of the S-rank, with S being stationary and $φ<_S ψ $ iff $ {δ∈S|φ(δ)> ψ(δ)} ∈ NS_λ$ (NS is the Non-stationary ideal on λ). I just can't seem to figure out how I can determine the rank of the constant function, and thus don't know how to prove anything about it.
    $endgroup$
    – N. Leveling
    Jan 8 at 16:02












  • $begingroup$
    Do you see that $|c_alpha^lambda|_S$ is an ordinal for all $alpha$, and can you prove that $|c_alpha^lambda|_S>|c_beta^lambda|_S$ whenever $alpha>beta$?
    $endgroup$
    – Andrés E. Caicedo
    Jan 8 at 18:27


















  • $begingroup$
    What have you tried? Where are you stuck?
    $endgroup$
    – John Coleman
    Jan 8 at 13:39






  • 1




    $begingroup$
    You might want to provide a definition of $|f|_S$ as well.
    $endgroup$
    – Asaf Karagila
    Jan 8 at 13:44










  • $begingroup$
    What precisely is difficult here?
    $endgroup$
    – Andrés E. Caicedo
    Jan 8 at 14:47










  • $begingroup$
    $||Ψ||_S= bigcup { ||φ||_S +1 | φ<_S Ψ}$ is the definition of the S-rank, with S being stationary and $φ<_S ψ $ iff $ {δ∈S|φ(δ)> ψ(δ)} ∈ NS_λ$ (NS is the Non-stationary ideal on λ). I just can't seem to figure out how I can determine the rank of the constant function, and thus don't know how to prove anything about it.
    $endgroup$
    – N. Leveling
    Jan 8 at 16:02












  • $begingroup$
    Do you see that $|c_alpha^lambda|_S$ is an ordinal for all $alpha$, and can you prove that $|c_alpha^lambda|_S>|c_beta^lambda|_S$ whenever $alpha>beta$?
    $endgroup$
    – Andrés E. Caicedo
    Jan 8 at 18:27
















$begingroup$
What have you tried? Where are you stuck?
$endgroup$
– John Coleman
Jan 8 at 13:39




$begingroup$
What have you tried? Where are you stuck?
$endgroup$
– John Coleman
Jan 8 at 13:39




1




1




$begingroup$
You might want to provide a definition of $|f|_S$ as well.
$endgroup$
– Asaf Karagila
Jan 8 at 13:44




$begingroup$
You might want to provide a definition of $|f|_S$ as well.
$endgroup$
– Asaf Karagila
Jan 8 at 13:44












$begingroup$
What precisely is difficult here?
$endgroup$
– Andrés E. Caicedo
Jan 8 at 14:47




$begingroup$
What precisely is difficult here?
$endgroup$
– Andrés E. Caicedo
Jan 8 at 14:47












$begingroup$
$||Ψ||_S= bigcup { ||φ||_S +1 | φ<_S Ψ}$ is the definition of the S-rank, with S being stationary and $φ<_S ψ $ iff $ {δ∈S|φ(δ)> ψ(δ)} ∈ NS_λ$ (NS is the Non-stationary ideal on λ). I just can't seem to figure out how I can determine the rank of the constant function, and thus don't know how to prove anything about it.
$endgroup$
– N. Leveling
Jan 8 at 16:02






$begingroup$
$||Ψ||_S= bigcup { ||φ||_S +1 | φ<_S Ψ}$ is the definition of the S-rank, with S being stationary and $φ<_S ψ $ iff $ {δ∈S|φ(δ)> ψ(δ)} ∈ NS_λ$ (NS is the Non-stationary ideal on λ). I just can't seem to figure out how I can determine the rank of the constant function, and thus don't know how to prove anything about it.
$endgroup$
– N. Leveling
Jan 8 at 16:02














$begingroup$
Do you see that $|c_alpha^lambda|_S$ is an ordinal for all $alpha$, and can you prove that $|c_alpha^lambda|_S>|c_beta^lambda|_S$ whenever $alpha>beta$?
$endgroup$
– Andrés E. Caicedo
Jan 8 at 18:27




$begingroup$
Do you see that $|c_alpha^lambda|_S$ is an ordinal for all $alpha$, and can you prove that $|c_alpha^lambda|_S>|c_beta^lambda|_S$ whenever $alpha>beta$?
$endgroup$
– Andrés E. Caicedo
Jan 8 at 18:27










1 Answer
1






active

oldest

votes


















1












$begingroup$

Note that $alphamapsto|c_alpha^lambda|_S$ is strictly increasing (trivially): After all, $${deltain Smid c_beta^lambda(delta)ge c_alpha^lambda(delta)}={deltain Smidbetage alpha}=emptyset$$ if $beta<alpha$. This immediately gives that $|c_alpha^lambda|_Sgealpha$ for all $alpha$.



Suppose now that $f<c_alpha^lambda$. This means that ${deltain Smid f(delta)ge alpha}$ is non-stationary, or, what is the same, $f(delta)<alpha$ for almost every $deltain S$. If, in addition, $alpha<lambda$, then in fact $f(delta)<delta$ for almost every $deltain S$. Use Fodor's lemma to conclude that $f$ coincides with some $c_beta^lambda$ for some $beta<alpha$ ("coincides" in the sense of $=_S$, where $f=_S g$ implies in particular that $|f|_S=|g|_S$). This should give you that $|c_alpha^lambda|_S=alpha$ for all $alpha<lambda$.



Finally, check that the identity map is above all $c_alpha^lambda$, $alpha<lambda$, and below $c_lambda^lambda$.






share|cite|improve this answer









$endgroup$













  • $begingroup$
    Thank you very much! Just one more question: Why is the identity map below $c_λ^λ$? I don't understand this point
    $endgroup$
    – N. Leveling
    Jan 8 at 19:55










  • $begingroup$
    Use the definitions, it is just as immediate as the other properties we discussed in the comments above.
    $endgroup$
    – Andrés E. Caicedo
    Jan 8 at 19:57











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%2f3066174%2fconstant-functions-in-set-theory%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









1












$begingroup$

Note that $alphamapsto|c_alpha^lambda|_S$ is strictly increasing (trivially): After all, $${deltain Smid c_beta^lambda(delta)ge c_alpha^lambda(delta)}={deltain Smidbetage alpha}=emptyset$$ if $beta<alpha$. This immediately gives that $|c_alpha^lambda|_Sgealpha$ for all $alpha$.



Suppose now that $f<c_alpha^lambda$. This means that ${deltain Smid f(delta)ge alpha}$ is non-stationary, or, what is the same, $f(delta)<alpha$ for almost every $deltain S$. If, in addition, $alpha<lambda$, then in fact $f(delta)<delta$ for almost every $deltain S$. Use Fodor's lemma to conclude that $f$ coincides with some $c_beta^lambda$ for some $beta<alpha$ ("coincides" in the sense of $=_S$, where $f=_S g$ implies in particular that $|f|_S=|g|_S$). This should give you that $|c_alpha^lambda|_S=alpha$ for all $alpha<lambda$.



Finally, check that the identity map is above all $c_alpha^lambda$, $alpha<lambda$, and below $c_lambda^lambda$.






share|cite|improve this answer









$endgroup$













  • $begingroup$
    Thank you very much! Just one more question: Why is the identity map below $c_λ^λ$? I don't understand this point
    $endgroup$
    – N. Leveling
    Jan 8 at 19:55










  • $begingroup$
    Use the definitions, it is just as immediate as the other properties we discussed in the comments above.
    $endgroup$
    – Andrés E. Caicedo
    Jan 8 at 19:57
















1












$begingroup$

Note that $alphamapsto|c_alpha^lambda|_S$ is strictly increasing (trivially): After all, $${deltain Smid c_beta^lambda(delta)ge c_alpha^lambda(delta)}={deltain Smidbetage alpha}=emptyset$$ if $beta<alpha$. This immediately gives that $|c_alpha^lambda|_Sgealpha$ for all $alpha$.



Suppose now that $f<c_alpha^lambda$. This means that ${deltain Smid f(delta)ge alpha}$ is non-stationary, or, what is the same, $f(delta)<alpha$ for almost every $deltain S$. If, in addition, $alpha<lambda$, then in fact $f(delta)<delta$ for almost every $deltain S$. Use Fodor's lemma to conclude that $f$ coincides with some $c_beta^lambda$ for some $beta<alpha$ ("coincides" in the sense of $=_S$, where $f=_S g$ implies in particular that $|f|_S=|g|_S$). This should give you that $|c_alpha^lambda|_S=alpha$ for all $alpha<lambda$.



Finally, check that the identity map is above all $c_alpha^lambda$, $alpha<lambda$, and below $c_lambda^lambda$.






share|cite|improve this answer









$endgroup$













  • $begingroup$
    Thank you very much! Just one more question: Why is the identity map below $c_λ^λ$? I don't understand this point
    $endgroup$
    – N. Leveling
    Jan 8 at 19:55










  • $begingroup$
    Use the definitions, it is just as immediate as the other properties we discussed in the comments above.
    $endgroup$
    – Andrés E. Caicedo
    Jan 8 at 19:57














1












1








1





$begingroup$

Note that $alphamapsto|c_alpha^lambda|_S$ is strictly increasing (trivially): After all, $${deltain Smid c_beta^lambda(delta)ge c_alpha^lambda(delta)}={deltain Smidbetage alpha}=emptyset$$ if $beta<alpha$. This immediately gives that $|c_alpha^lambda|_Sgealpha$ for all $alpha$.



Suppose now that $f<c_alpha^lambda$. This means that ${deltain Smid f(delta)ge alpha}$ is non-stationary, or, what is the same, $f(delta)<alpha$ for almost every $deltain S$. If, in addition, $alpha<lambda$, then in fact $f(delta)<delta$ for almost every $deltain S$. Use Fodor's lemma to conclude that $f$ coincides with some $c_beta^lambda$ for some $beta<alpha$ ("coincides" in the sense of $=_S$, where $f=_S g$ implies in particular that $|f|_S=|g|_S$). This should give you that $|c_alpha^lambda|_S=alpha$ for all $alpha<lambda$.



Finally, check that the identity map is above all $c_alpha^lambda$, $alpha<lambda$, and below $c_lambda^lambda$.






share|cite|improve this answer









$endgroup$



Note that $alphamapsto|c_alpha^lambda|_S$ is strictly increasing (trivially): After all, $${deltain Smid c_beta^lambda(delta)ge c_alpha^lambda(delta)}={deltain Smidbetage alpha}=emptyset$$ if $beta<alpha$. This immediately gives that $|c_alpha^lambda|_Sgealpha$ for all $alpha$.



Suppose now that $f<c_alpha^lambda$. This means that ${deltain Smid f(delta)ge alpha}$ is non-stationary, or, what is the same, $f(delta)<alpha$ for almost every $deltain S$. If, in addition, $alpha<lambda$, then in fact $f(delta)<delta$ for almost every $deltain S$. Use Fodor's lemma to conclude that $f$ coincides with some $c_beta^lambda$ for some $beta<alpha$ ("coincides" in the sense of $=_S$, where $f=_S g$ implies in particular that $|f|_S=|g|_S$). This should give you that $|c_alpha^lambda|_S=alpha$ for all $alpha<lambda$.



Finally, check that the identity map is above all $c_alpha^lambda$, $alpha<lambda$, and below $c_lambda^lambda$.







share|cite|improve this answer












share|cite|improve this answer



share|cite|improve this answer










answered Jan 8 at 19:31









Andrés E. CaicedoAndrés E. Caicedo

65.5k8158249




65.5k8158249












  • $begingroup$
    Thank you very much! Just one more question: Why is the identity map below $c_λ^λ$? I don't understand this point
    $endgroup$
    – N. Leveling
    Jan 8 at 19:55










  • $begingroup$
    Use the definitions, it is just as immediate as the other properties we discussed in the comments above.
    $endgroup$
    – Andrés E. Caicedo
    Jan 8 at 19:57


















  • $begingroup$
    Thank you very much! Just one more question: Why is the identity map below $c_λ^λ$? I don't understand this point
    $endgroup$
    – N. Leveling
    Jan 8 at 19:55










  • $begingroup$
    Use the definitions, it is just as immediate as the other properties we discussed in the comments above.
    $endgroup$
    – Andrés E. Caicedo
    Jan 8 at 19:57
















$begingroup$
Thank you very much! Just one more question: Why is the identity map below $c_λ^λ$? I don't understand this point
$endgroup$
– N. Leveling
Jan 8 at 19:55




$begingroup$
Thank you very much! Just one more question: Why is the identity map below $c_λ^λ$? I don't understand this point
$endgroup$
– N. Leveling
Jan 8 at 19:55












$begingroup$
Use the definitions, it is just as immediate as the other properties we discussed in the comments above.
$endgroup$
– Andrés E. Caicedo
Jan 8 at 19:57




$begingroup$
Use the definitions, it is just as immediate as the other properties we discussed in the comments above.
$endgroup$
– Andrés E. Caicedo
Jan 8 at 19:57


















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%2f3066174%2fconstant-functions-in-set-theory%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

Human spaceflight

Can not write log (Is /dev/pts mounted?) - openpty in Ubuntu-on-Windows?

File:DeusFollowingSea.jpg