A question about the proof about strongly inaccessible cardinal
$begingroup$
My textbook Introduction to Set Theory by Hrbacek and Jech presents Theorem 3.13 and its corresponding proof as follows:
Since the authors refer to Theorem 2.2, I post it here for reference:
My question concerns Part (b) of Theorem 3.13
Let $kappa$ be a strongly inaccessible cardinal. If each $Xin S$ has cardinality $< kappa$ and $|S| < kappa$, then $bigcup S$ has cardinality $< kappa$.
Proof:
Let $lambda = |S|$ and $mu = sup {|X| mid X in S}$. Then (by Theorem 2.2(a)) $mu < kappa$ because $kappa$ is regular, and $|bigcup S| le lambda cdot mu <kappa$.
In fact, I can not understand how the authors apply Theorem 2.2(a) to finish the proof. On the other hand, I have figured out another way to accomplish it as follows:
Let $lambda = |S|$ and $mu = sup {|X| mid X in S}$. We have $forall X in S:|X| < kappa implies mu le kappa$.
I claim that $mu < kappa$. If not, $mu = kappa$ and thus ${|X| mid X in S}$ is cofinal in $kappa$. It follows that $operatorname{cf}(kappa) le |{|X| mid X in S}| le |S|< kappa$ and thus $operatorname{cf}(kappa) < kappa$. Then $kappa$ is singular, which contradicts the fact that $kappa$ is regular.
Hence $mu < kappa$. We have $|bigcup S| le lambda cdot mu =max{lambda, mu} <kappa$.
Could you please explain how the authors apply Theorem 2.2(a) to finish the proof and verify my approach?
Thank you for your help!
elementary-set-theory proof-explanation cardinals
$endgroup$
add a comment |
$begingroup$
My textbook Introduction to Set Theory by Hrbacek and Jech presents Theorem 3.13 and its corresponding proof as follows:
Since the authors refer to Theorem 2.2, I post it here for reference:
My question concerns Part (b) of Theorem 3.13
Let $kappa$ be a strongly inaccessible cardinal. If each $Xin S$ has cardinality $< kappa$ and $|S| < kappa$, then $bigcup S$ has cardinality $< kappa$.
Proof:
Let $lambda = |S|$ and $mu = sup {|X| mid X in S}$. Then (by Theorem 2.2(a)) $mu < kappa$ because $kappa$ is regular, and $|bigcup S| le lambda cdot mu <kappa$.
In fact, I can not understand how the authors apply Theorem 2.2(a) to finish the proof. On the other hand, I have figured out another way to accomplish it as follows:
Let $lambda = |S|$ and $mu = sup {|X| mid X in S}$. We have $forall X in S:|X| < kappa implies mu le kappa$.
I claim that $mu < kappa$. If not, $mu = kappa$ and thus ${|X| mid X in S}$ is cofinal in $kappa$. It follows that $operatorname{cf}(kappa) le |{|X| mid X in S}| le |S|< kappa$ and thus $operatorname{cf}(kappa) < kappa$. Then $kappa$ is singular, which contradicts the fact that $kappa$ is regular.
Hence $mu < kappa$. We have $|bigcup S| le lambda cdot mu =max{lambda, mu} <kappa$.
Could you please explain how the authors apply Theorem 2.2(a) to finish the proof and verify my approach?
Thank you for your help!
elementary-set-theory proof-explanation cardinals
$endgroup$
add a comment |
$begingroup$
My textbook Introduction to Set Theory by Hrbacek and Jech presents Theorem 3.13 and its corresponding proof as follows:
Since the authors refer to Theorem 2.2, I post it here for reference:
My question concerns Part (b) of Theorem 3.13
Let $kappa$ be a strongly inaccessible cardinal. If each $Xin S$ has cardinality $< kappa$ and $|S| < kappa$, then $bigcup S$ has cardinality $< kappa$.
Proof:
Let $lambda = |S|$ and $mu = sup {|X| mid X in S}$. Then (by Theorem 2.2(a)) $mu < kappa$ because $kappa$ is regular, and $|bigcup S| le lambda cdot mu <kappa$.
In fact, I can not understand how the authors apply Theorem 2.2(a) to finish the proof. On the other hand, I have figured out another way to accomplish it as follows:
Let $lambda = |S|$ and $mu = sup {|X| mid X in S}$. We have $forall X in S:|X| < kappa implies mu le kappa$.
I claim that $mu < kappa$. If not, $mu = kappa$ and thus ${|X| mid X in S}$ is cofinal in $kappa$. It follows that $operatorname{cf}(kappa) le |{|X| mid X in S}| le |S|< kappa$ and thus $operatorname{cf}(kappa) < kappa$. Then $kappa$ is singular, which contradicts the fact that $kappa$ is regular.
Hence $mu < kappa$. We have $|bigcup S| le lambda cdot mu =max{lambda, mu} <kappa$.
Could you please explain how the authors apply Theorem 2.2(a) to finish the proof and verify my approach?
Thank you for your help!
elementary-set-theory proof-explanation cardinals
$endgroup$
My textbook Introduction to Set Theory by Hrbacek and Jech presents Theorem 3.13 and its corresponding proof as follows:
Since the authors refer to Theorem 2.2, I post it here for reference:
My question concerns Part (b) of Theorem 3.13
Let $kappa$ be a strongly inaccessible cardinal. If each $Xin S$ has cardinality $< kappa$ and $|S| < kappa$, then $bigcup S$ has cardinality $< kappa$.
Proof:
Let $lambda = |S|$ and $mu = sup {|X| mid X in S}$. Then (by Theorem 2.2(a)) $mu < kappa$ because $kappa$ is regular, and $|bigcup S| le lambda cdot mu <kappa$.
In fact, I can not understand how the authors apply Theorem 2.2(a) to finish the proof. On the other hand, I have figured out another way to accomplish it as follows:
Let $lambda = |S|$ and $mu = sup {|X| mid X in S}$. We have $forall X in S:|X| < kappa implies mu le kappa$.
I claim that $mu < kappa$. If not, $mu = kappa$ and thus ${|X| mid X in S}$ is cofinal in $kappa$. It follows that $operatorname{cf}(kappa) le |{|X| mid X in S}| le |S|< kappa$ and thus $operatorname{cf}(kappa) < kappa$. Then $kappa$ is singular, which contradicts the fact that $kappa$ is regular.
Hence $mu < kappa$. We have $|bigcup S| le lambda cdot mu =max{lambda, mu} <kappa$.
Could you please explain how the authors apply Theorem 2.2(a) to finish the proof and verify my approach?
Thank you for your help!
elementary-set-theory proof-explanation cardinals
elementary-set-theory proof-explanation cardinals
edited Dec 30 '18 at 6:26
Holo
6,19721131
6,19721131
asked Dec 30 '18 at 6:08
Le Anh DungLe Anh Dung
1,2451621
1,2451621
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
Your way is just the way they use the theorem, all of $Xin S$ are bounded by $gamma_X$, if $sup|X|$ is unbounded, the sequence generated from $gamma_X$ is unbounded, but the sequence is of length $lambda<kappa$, which is contradiction
$endgroup$
$begingroup$
I seem to got it. Please check my reasoning! Assume the contrary that $mu = sup {|X| mid X in S} =kappa$ or equivalently ${|X| mid X in S}$ is unbounded in $kappa$. Then by every unbounded subset of $kappa$ has cardinality $kappa$ from Theorem 2.2(a), we have $|{|X| mid X in S}|=kappa$. On the other hand, $|{|X| mid X in S}| le |S|< kappa$. Thus $kappa < kappa$, which is a contradiction.
$endgroup$
– Le Anh Dung
Dec 30 '18 at 6:51
$begingroup$
@LeAnhDung yes, correct
$endgroup$
– Holo
Dec 30 '18 at 6:52
$begingroup$
Thank you so much for your prompt reply!
$endgroup$
– Le Anh Dung
Dec 30 '18 at 6:53
add a comment |
Your Answer
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%2f3056546%2fa-question-about-the-proof-about-strongly-inaccessible-cardinal%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$
Your way is just the way they use the theorem, all of $Xin S$ are bounded by $gamma_X$, if $sup|X|$ is unbounded, the sequence generated from $gamma_X$ is unbounded, but the sequence is of length $lambda<kappa$, which is contradiction
$endgroup$
$begingroup$
I seem to got it. Please check my reasoning! Assume the contrary that $mu = sup {|X| mid X in S} =kappa$ or equivalently ${|X| mid X in S}$ is unbounded in $kappa$. Then by every unbounded subset of $kappa$ has cardinality $kappa$ from Theorem 2.2(a), we have $|{|X| mid X in S}|=kappa$. On the other hand, $|{|X| mid X in S}| le |S|< kappa$. Thus $kappa < kappa$, which is a contradiction.
$endgroup$
– Le Anh Dung
Dec 30 '18 at 6:51
$begingroup$
@LeAnhDung yes, correct
$endgroup$
– Holo
Dec 30 '18 at 6:52
$begingroup$
Thank you so much for your prompt reply!
$endgroup$
– Le Anh Dung
Dec 30 '18 at 6:53
add a comment |
$begingroup$
Your way is just the way they use the theorem, all of $Xin S$ are bounded by $gamma_X$, if $sup|X|$ is unbounded, the sequence generated from $gamma_X$ is unbounded, but the sequence is of length $lambda<kappa$, which is contradiction
$endgroup$
$begingroup$
I seem to got it. Please check my reasoning! Assume the contrary that $mu = sup {|X| mid X in S} =kappa$ or equivalently ${|X| mid X in S}$ is unbounded in $kappa$. Then by every unbounded subset of $kappa$ has cardinality $kappa$ from Theorem 2.2(a), we have $|{|X| mid X in S}|=kappa$. On the other hand, $|{|X| mid X in S}| le |S|< kappa$. Thus $kappa < kappa$, which is a contradiction.
$endgroup$
– Le Anh Dung
Dec 30 '18 at 6:51
$begingroup$
@LeAnhDung yes, correct
$endgroup$
– Holo
Dec 30 '18 at 6:52
$begingroup$
Thank you so much for your prompt reply!
$endgroup$
– Le Anh Dung
Dec 30 '18 at 6:53
add a comment |
$begingroup$
Your way is just the way they use the theorem, all of $Xin S$ are bounded by $gamma_X$, if $sup|X|$ is unbounded, the sequence generated from $gamma_X$ is unbounded, but the sequence is of length $lambda<kappa$, which is contradiction
$endgroup$
Your way is just the way they use the theorem, all of $Xin S$ are bounded by $gamma_X$, if $sup|X|$ is unbounded, the sequence generated from $gamma_X$ is unbounded, but the sequence is of length $lambda<kappa$, which is contradiction
answered Dec 30 '18 at 6:24
HoloHolo
6,19721131
6,19721131
$begingroup$
I seem to got it. Please check my reasoning! Assume the contrary that $mu = sup {|X| mid X in S} =kappa$ or equivalently ${|X| mid X in S}$ is unbounded in $kappa$. Then by every unbounded subset of $kappa$ has cardinality $kappa$ from Theorem 2.2(a), we have $|{|X| mid X in S}|=kappa$. On the other hand, $|{|X| mid X in S}| le |S|< kappa$. Thus $kappa < kappa$, which is a contradiction.
$endgroup$
– Le Anh Dung
Dec 30 '18 at 6:51
$begingroup$
@LeAnhDung yes, correct
$endgroup$
– Holo
Dec 30 '18 at 6:52
$begingroup$
Thank you so much for your prompt reply!
$endgroup$
– Le Anh Dung
Dec 30 '18 at 6:53
add a comment |
$begingroup$
I seem to got it. Please check my reasoning! Assume the contrary that $mu = sup {|X| mid X in S} =kappa$ or equivalently ${|X| mid X in S}$ is unbounded in $kappa$. Then by every unbounded subset of $kappa$ has cardinality $kappa$ from Theorem 2.2(a), we have $|{|X| mid X in S}|=kappa$. On the other hand, $|{|X| mid X in S}| le |S|< kappa$. Thus $kappa < kappa$, which is a contradiction.
$endgroup$
– Le Anh Dung
Dec 30 '18 at 6:51
$begingroup$
@LeAnhDung yes, correct
$endgroup$
– Holo
Dec 30 '18 at 6:52
$begingroup$
Thank you so much for your prompt reply!
$endgroup$
– Le Anh Dung
Dec 30 '18 at 6:53
$begingroup$
I seem to got it. Please check my reasoning! Assume the contrary that $mu = sup {|X| mid X in S} =kappa$ or equivalently ${|X| mid X in S}$ is unbounded in $kappa$. Then by every unbounded subset of $kappa$ has cardinality $kappa$ from Theorem 2.2(a), we have $|{|X| mid X in S}|=kappa$. On the other hand, $|{|X| mid X in S}| le |S|< kappa$. Thus $kappa < kappa$, which is a contradiction.
$endgroup$
– Le Anh Dung
Dec 30 '18 at 6:51
$begingroup$
I seem to got it. Please check my reasoning! Assume the contrary that $mu = sup {|X| mid X in S} =kappa$ or equivalently ${|X| mid X in S}$ is unbounded in $kappa$. Then by every unbounded subset of $kappa$ has cardinality $kappa$ from Theorem 2.2(a), we have $|{|X| mid X in S}|=kappa$. On the other hand, $|{|X| mid X in S}| le |S|< kappa$. Thus $kappa < kappa$, which is a contradiction.
$endgroup$
– Le Anh Dung
Dec 30 '18 at 6:51
$begingroup$
@LeAnhDung yes, correct
$endgroup$
– Holo
Dec 30 '18 at 6:52
$begingroup$
@LeAnhDung yes, correct
$endgroup$
– Holo
Dec 30 '18 at 6:52
$begingroup$
Thank you so much for your prompt reply!
$endgroup$
– Le Anh Dung
Dec 30 '18 at 6:53
$begingroup$
Thank you so much for your prompt reply!
$endgroup$
– Le Anh Dung
Dec 30 '18 at 6:53
add a comment |
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%2f3056546%2fa-question-about-the-proof-about-strongly-inaccessible-cardinal%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

