Prob. 8 (b), Sec. 10, in Munkres' TOPOLOGY, 2nd ed: The union of any collection of disjoint well-ordered sets...
$begingroup$
Here is Prob. 8, Sec. 10, in the book Topology by James R. Munkres, 2nd edition:
Problem 8 (a):
Let $A_1$ and $A_2$ be disjoint sets, well-ordered by $<_1$ and $<_2$, respectively. Define an order relation on $A_1 cup A_2$ by letting $a < b$ either if $a, b in A_1$ and $a <_1 b$, or if $a, b in A_2$ and $a <_2 b$, or if $a in A_1$ and $b in A_2$. Show that this is a well-ordering.
Problem 8 (b):
Generalize (a) to an arbitrary family of disjoint well-ordered sets, indexed by a well-ordered set.
I think I'm clear as to the proof required in Prob. 8 (a).
My Attempt at Prob. 8 (b):
Let $J$ be a (non-empty) well ordered set; let $$left{ A_alpha colon alpha in J right}$$ be a collection of non-empty, (pairwise) disjoint well-ordered sets indexed by set $J$; and let $$ A colon= bigcup_{alpha in J} A_alpha. $$
For each $alpha in J$, let $<_alpha$ denote the well-ordering relation on the set $A_alpha$.
For any two elements $a, b in A$, let us define $a < b$ to mean the following:
Either $a, b in A_alpha$ for some $alpha in J$ and $a <_alpha b$, or $a in A_alpha$, $b in A_beta$ for some $alpha, beta in J$ such that $alpha <_J beta$.
Then the set $A$ is a well-ordered set.
Is this statement correct?
If so, then here is my proof:
Let $S$ be a non-empty subset of the set $A = bigcup_{alpha in J} A_alpha$. Let $J_0$ be the following subset of $J$.
$$ J_0 colon= left{ alpha in J colon S cap A_alpha neq emptyset right}. $$
Then the set $J_0$ is non-empty, and as such it has a smallest element, say $alpha_0$. Then $alpha_0 in J$ and $S cap A_{alpha_0}$ is a non-empty subset of $A_{alpha_0}$ and so has a smallest element $a_{alpha_0}$, which is also the smallest of $S$ with respect to the order relation on $A$.
Is this proof correct? If so, then is my presentation accessible enough? If not, then where have I erred?
elementary-set-theory proof-verification logic order-theory well-orders
$endgroup$
add a comment |
$begingroup$
Here is Prob. 8, Sec. 10, in the book Topology by James R. Munkres, 2nd edition:
Problem 8 (a):
Let $A_1$ and $A_2$ be disjoint sets, well-ordered by $<_1$ and $<_2$, respectively. Define an order relation on $A_1 cup A_2$ by letting $a < b$ either if $a, b in A_1$ and $a <_1 b$, or if $a, b in A_2$ and $a <_2 b$, or if $a in A_1$ and $b in A_2$. Show that this is a well-ordering.
Problem 8 (b):
Generalize (a) to an arbitrary family of disjoint well-ordered sets, indexed by a well-ordered set.
I think I'm clear as to the proof required in Prob. 8 (a).
My Attempt at Prob. 8 (b):
Let $J$ be a (non-empty) well ordered set; let $$left{ A_alpha colon alpha in J right}$$ be a collection of non-empty, (pairwise) disjoint well-ordered sets indexed by set $J$; and let $$ A colon= bigcup_{alpha in J} A_alpha. $$
For each $alpha in J$, let $<_alpha$ denote the well-ordering relation on the set $A_alpha$.
For any two elements $a, b in A$, let us define $a < b$ to mean the following:
Either $a, b in A_alpha$ for some $alpha in J$ and $a <_alpha b$, or $a in A_alpha$, $b in A_beta$ for some $alpha, beta in J$ such that $alpha <_J beta$.
Then the set $A$ is a well-ordered set.
Is this statement correct?
If so, then here is my proof:
Let $S$ be a non-empty subset of the set $A = bigcup_{alpha in J} A_alpha$. Let $J_0$ be the following subset of $J$.
$$ J_0 colon= left{ alpha in J colon S cap A_alpha neq emptyset right}. $$
Then the set $J_0$ is non-empty, and as such it has a smallest element, say $alpha_0$. Then $alpha_0 in J$ and $S cap A_{alpha_0}$ is a non-empty subset of $A_{alpha_0}$ and so has a smallest element $a_{alpha_0}$, which is also the smallest of $S$ with respect to the order relation on $A$.
Is this proof correct? If so, then is my presentation accessible enough? If not, then where have I erred?
elementary-set-theory proof-verification logic order-theory well-orders
$endgroup$
3
$begingroup$
The statement is correct. Further you described correctly how to find the least element of $S$. It should be followed by proving that it really is the least element of $S$: just let $sin S$ and prove that indeed $a_{alpha_0}leq s$.
$endgroup$
– drhab
Jan 1 '18 at 11:39
add a comment |
$begingroup$
Here is Prob. 8, Sec. 10, in the book Topology by James R. Munkres, 2nd edition:
Problem 8 (a):
Let $A_1$ and $A_2$ be disjoint sets, well-ordered by $<_1$ and $<_2$, respectively. Define an order relation on $A_1 cup A_2$ by letting $a < b$ either if $a, b in A_1$ and $a <_1 b$, or if $a, b in A_2$ and $a <_2 b$, or if $a in A_1$ and $b in A_2$. Show that this is a well-ordering.
Problem 8 (b):
Generalize (a) to an arbitrary family of disjoint well-ordered sets, indexed by a well-ordered set.
I think I'm clear as to the proof required in Prob. 8 (a).
My Attempt at Prob. 8 (b):
Let $J$ be a (non-empty) well ordered set; let $$left{ A_alpha colon alpha in J right}$$ be a collection of non-empty, (pairwise) disjoint well-ordered sets indexed by set $J$; and let $$ A colon= bigcup_{alpha in J} A_alpha. $$
For each $alpha in J$, let $<_alpha$ denote the well-ordering relation on the set $A_alpha$.
For any two elements $a, b in A$, let us define $a < b$ to mean the following:
Either $a, b in A_alpha$ for some $alpha in J$ and $a <_alpha b$, or $a in A_alpha$, $b in A_beta$ for some $alpha, beta in J$ such that $alpha <_J beta$.
Then the set $A$ is a well-ordered set.
Is this statement correct?
If so, then here is my proof:
Let $S$ be a non-empty subset of the set $A = bigcup_{alpha in J} A_alpha$. Let $J_0$ be the following subset of $J$.
$$ J_0 colon= left{ alpha in J colon S cap A_alpha neq emptyset right}. $$
Then the set $J_0$ is non-empty, and as such it has a smallest element, say $alpha_0$. Then $alpha_0 in J$ and $S cap A_{alpha_0}$ is a non-empty subset of $A_{alpha_0}$ and so has a smallest element $a_{alpha_0}$, which is also the smallest of $S$ with respect to the order relation on $A$.
Is this proof correct? If so, then is my presentation accessible enough? If not, then where have I erred?
elementary-set-theory proof-verification logic order-theory well-orders
$endgroup$
Here is Prob. 8, Sec. 10, in the book Topology by James R. Munkres, 2nd edition:
Problem 8 (a):
Let $A_1$ and $A_2$ be disjoint sets, well-ordered by $<_1$ and $<_2$, respectively. Define an order relation on $A_1 cup A_2$ by letting $a < b$ either if $a, b in A_1$ and $a <_1 b$, or if $a, b in A_2$ and $a <_2 b$, or if $a in A_1$ and $b in A_2$. Show that this is a well-ordering.
Problem 8 (b):
Generalize (a) to an arbitrary family of disjoint well-ordered sets, indexed by a well-ordered set.
I think I'm clear as to the proof required in Prob. 8 (a).
My Attempt at Prob. 8 (b):
Let $J$ be a (non-empty) well ordered set; let $$left{ A_alpha colon alpha in J right}$$ be a collection of non-empty, (pairwise) disjoint well-ordered sets indexed by set $J$; and let $$ A colon= bigcup_{alpha in J} A_alpha. $$
For each $alpha in J$, let $<_alpha$ denote the well-ordering relation on the set $A_alpha$.
For any two elements $a, b in A$, let us define $a < b$ to mean the following:
Either $a, b in A_alpha$ for some $alpha in J$ and $a <_alpha b$, or $a in A_alpha$, $b in A_beta$ for some $alpha, beta in J$ such that $alpha <_J beta$.
Then the set $A$ is a well-ordered set.
Is this statement correct?
If so, then here is my proof:
Let $S$ be a non-empty subset of the set $A = bigcup_{alpha in J} A_alpha$. Let $J_0$ be the following subset of $J$.
$$ J_0 colon= left{ alpha in J colon S cap A_alpha neq emptyset right}. $$
Then the set $J_0$ is non-empty, and as such it has a smallest element, say $alpha_0$. Then $alpha_0 in J$ and $S cap A_{alpha_0}$ is a non-empty subset of $A_{alpha_0}$ and so has a smallest element $a_{alpha_0}$, which is also the smallest of $S$ with respect to the order relation on $A$.
Is this proof correct? If so, then is my presentation accessible enough? If not, then where have I erred?
elementary-set-theory proof-verification logic order-theory well-orders
elementary-set-theory proof-verification logic order-theory well-orders
asked Jan 1 '18 at 11:29
Saaqib MahmoodSaaqib Mahmood
7,99442581
7,99442581
3
$begingroup$
The statement is correct. Further you described correctly how to find the least element of $S$. It should be followed by proving that it really is the least element of $S$: just let $sin S$ and prove that indeed $a_{alpha_0}leq s$.
$endgroup$
– drhab
Jan 1 '18 at 11:39
add a comment |
3
$begingroup$
The statement is correct. Further you described correctly how to find the least element of $S$. It should be followed by proving that it really is the least element of $S$: just let $sin S$ and prove that indeed $a_{alpha_0}leq s$.
$endgroup$
– drhab
Jan 1 '18 at 11:39
3
3
$begingroup$
The statement is correct. Further you described correctly how to find the least element of $S$. It should be followed by proving that it really is the least element of $S$: just let $sin S$ and prove that indeed $a_{alpha_0}leq s$.
$endgroup$
– drhab
Jan 1 '18 at 11:39
$begingroup$
The statement is correct. Further you described correctly how to find the least element of $S$. It should be followed by proving that it really is the least element of $S$: just let $sin S$ and prove that indeed $a_{alpha_0}leq s$.
$endgroup$
– drhab
Jan 1 '18 at 11:39
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
Yes, your statement and proof are correct, although I agree with drhab that you might want to say a few words explaining why $a_{alpha_0}$ actually is the smallest element of $S$. For this, I would replace the last sentence with:
Then $alpha_0in J$ and $Scap A_{alpha_0}$ is a non-empty subset of $A_{alpha_0}$, and so has a smallest element $a_{alpha_0}$. This is because, given any other element $sin S$, either $sin A_{alpha_0}$, $sin A_beta$ for some other $beta$. In the first case $a_{alpha_0}<s$ by definition; in the second, $alpha_0<_Jbeta$ by definition of $alpha_0$ and so $alpha_0<s$.
$endgroup$
$begingroup$
This answer exists to remove the question from the Unanswered queue; please upvote or give Best Answer to complete this process.
$endgroup$
– aleph_two
Dec 24 '18 at 4:18
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%2f2587442%2fprob-8-b-sec-10-in-munkres-topology-2nd-ed-the-union-of-any-collection%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$
Yes, your statement and proof are correct, although I agree with drhab that you might want to say a few words explaining why $a_{alpha_0}$ actually is the smallest element of $S$. For this, I would replace the last sentence with:
Then $alpha_0in J$ and $Scap A_{alpha_0}$ is a non-empty subset of $A_{alpha_0}$, and so has a smallest element $a_{alpha_0}$. This is because, given any other element $sin S$, either $sin A_{alpha_0}$, $sin A_beta$ for some other $beta$. In the first case $a_{alpha_0}<s$ by definition; in the second, $alpha_0<_Jbeta$ by definition of $alpha_0$ and so $alpha_0<s$.
$endgroup$
$begingroup$
This answer exists to remove the question from the Unanswered queue; please upvote or give Best Answer to complete this process.
$endgroup$
– aleph_two
Dec 24 '18 at 4:18
add a comment |
$begingroup$
Yes, your statement and proof are correct, although I agree with drhab that you might want to say a few words explaining why $a_{alpha_0}$ actually is the smallest element of $S$. For this, I would replace the last sentence with:
Then $alpha_0in J$ and $Scap A_{alpha_0}$ is a non-empty subset of $A_{alpha_0}$, and so has a smallest element $a_{alpha_0}$. This is because, given any other element $sin S$, either $sin A_{alpha_0}$, $sin A_beta$ for some other $beta$. In the first case $a_{alpha_0}<s$ by definition; in the second, $alpha_0<_Jbeta$ by definition of $alpha_0$ and so $alpha_0<s$.
$endgroup$
$begingroup$
This answer exists to remove the question from the Unanswered queue; please upvote or give Best Answer to complete this process.
$endgroup$
– aleph_two
Dec 24 '18 at 4:18
add a comment |
$begingroup$
Yes, your statement and proof are correct, although I agree with drhab that you might want to say a few words explaining why $a_{alpha_0}$ actually is the smallest element of $S$. For this, I would replace the last sentence with:
Then $alpha_0in J$ and $Scap A_{alpha_0}$ is a non-empty subset of $A_{alpha_0}$, and so has a smallest element $a_{alpha_0}$. This is because, given any other element $sin S$, either $sin A_{alpha_0}$, $sin A_beta$ for some other $beta$. In the first case $a_{alpha_0}<s$ by definition; in the second, $alpha_0<_Jbeta$ by definition of $alpha_0$ and so $alpha_0<s$.
$endgroup$
Yes, your statement and proof are correct, although I agree with drhab that you might want to say a few words explaining why $a_{alpha_0}$ actually is the smallest element of $S$. For this, I would replace the last sentence with:
Then $alpha_0in J$ and $Scap A_{alpha_0}$ is a non-empty subset of $A_{alpha_0}$, and so has a smallest element $a_{alpha_0}$. This is because, given any other element $sin S$, either $sin A_{alpha_0}$, $sin A_beta$ for some other $beta$. In the first case $a_{alpha_0}<s$ by definition; in the second, $alpha_0<_Jbeta$ by definition of $alpha_0$ and so $alpha_0<s$.
answered Dec 24 '18 at 4:17
community wiki
aleph_two
$begingroup$
This answer exists to remove the question from the Unanswered queue; please upvote or give Best Answer to complete this process.
$endgroup$
– aleph_two
Dec 24 '18 at 4:18
add a comment |
$begingroup$
This answer exists to remove the question from the Unanswered queue; please upvote or give Best Answer to complete this process.
$endgroup$
– aleph_two
Dec 24 '18 at 4:18
$begingroup$
This answer exists to remove the question from the Unanswered queue; please upvote or give Best Answer to complete this process.
$endgroup$
– aleph_two
Dec 24 '18 at 4:18
$begingroup$
This answer exists to remove the question from the Unanswered queue; please upvote or give Best Answer to complete this process.
$endgroup$
– aleph_two
Dec 24 '18 at 4:18
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%2f2587442%2fprob-8-b-sec-10-in-munkres-topology-2nd-ed-the-union-of-any-collection%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
3
$begingroup$
The statement is correct. Further you described correctly how to find the least element of $S$. It should be followed by proving that it really is the least element of $S$: just let $sin S$ and prove that indeed $a_{alpha_0}leq s$.
$endgroup$
– drhab
Jan 1 '18 at 11:39