Zorn's Lemma implies Axiom of Choice
Zorn's Lemma implies Axiom of Choice
Does my attempt look fine or contain logical flaws/gaps? Any suggestion is greatly appreciated. Thank you for your help!
My attempt:
Let $S$ be a collection of nonempty sets and $F$ be the collection of all functions $f$ for which ${rm dom}(f) subseteq S$ and $f(X)in X$ for all $X in {rm dom}(f)$. The set $F$ is ordered by inclusion $subseteq$.
Assume that $C$ is a chain in $(F,subseteq)$. Let $f_0=bigcup C$. It is easy to verify that $f_0 in F$ and $f_0$ is an upper bound of $C$. Then $F$ has a maximal element $bar f$ by Zorn's Lemma. To accomplish the proof, we next show that ${rm dom}(bar f)=S$. If not, ${rm dom}(bar f) subsetneq S$ and thus $S setminus {rm dom}(bar f) neq emptyset$. Take some $bar X in S setminus {rm dom}(bar f)$ and $bar xin bar X$. Clearly, $bar f bigcup {(bar X,bar x)}in F$. This contradicts the minimality of $bar f$. This completes the proof.
proof-verification elementary-set-theory axiom-of-choice
add a comment |
Zorn's Lemma implies Axiom of Choice
Does my attempt look fine or contain logical flaws/gaps? Any suggestion is greatly appreciated. Thank you for your help!
My attempt:
Let $S$ be a collection of nonempty sets and $F$ be the collection of all functions $f$ for which ${rm dom}(f) subseteq S$ and $f(X)in X$ for all $X in {rm dom}(f)$. The set $F$ is ordered by inclusion $subseteq$.
Assume that $C$ is a chain in $(F,subseteq)$. Let $f_0=bigcup C$. It is easy to verify that $f_0 in F$ and $f_0$ is an upper bound of $C$. Then $F$ has a maximal element $bar f$ by Zorn's Lemma. To accomplish the proof, we next show that ${rm dom}(bar f)=S$. If not, ${rm dom}(bar f) subsetneq S$ and thus $S setminus {rm dom}(bar f) neq emptyset$. Take some $bar X in S setminus {rm dom}(bar f)$ and $bar xin bar X$. Clearly, $bar f bigcup {(bar X,bar x)}in F$. This contradicts the minimality of $bar f$. This completes the proof.
proof-verification elementary-set-theory axiom-of-choice
math.stackexchange.com/questions/2088040/…
– Asaf Karagila♦
Dec 7 at 7:15
add a comment |
Zorn's Lemma implies Axiom of Choice
Does my attempt look fine or contain logical flaws/gaps? Any suggestion is greatly appreciated. Thank you for your help!
My attempt:
Let $S$ be a collection of nonempty sets and $F$ be the collection of all functions $f$ for which ${rm dom}(f) subseteq S$ and $f(X)in X$ for all $X in {rm dom}(f)$. The set $F$ is ordered by inclusion $subseteq$.
Assume that $C$ is a chain in $(F,subseteq)$. Let $f_0=bigcup C$. It is easy to verify that $f_0 in F$ and $f_0$ is an upper bound of $C$. Then $F$ has a maximal element $bar f$ by Zorn's Lemma. To accomplish the proof, we next show that ${rm dom}(bar f)=S$. If not, ${rm dom}(bar f) subsetneq S$ and thus $S setminus {rm dom}(bar f) neq emptyset$. Take some $bar X in S setminus {rm dom}(bar f)$ and $bar xin bar X$. Clearly, $bar f bigcup {(bar X,bar x)}in F$. This contradicts the minimality of $bar f$. This completes the proof.
proof-verification elementary-set-theory axiom-of-choice
Zorn's Lemma implies Axiom of Choice
Does my attempt look fine or contain logical flaws/gaps? Any suggestion is greatly appreciated. Thank you for your help!
My attempt:
Let $S$ be a collection of nonempty sets and $F$ be the collection of all functions $f$ for which ${rm dom}(f) subseteq S$ and $f(X)in X$ for all $X in {rm dom}(f)$. The set $F$ is ordered by inclusion $subseteq$.
Assume that $C$ is a chain in $(F,subseteq)$. Let $f_0=bigcup C$. It is easy to verify that $f_0 in F$ and $f_0$ is an upper bound of $C$. Then $F$ has a maximal element $bar f$ by Zorn's Lemma. To accomplish the proof, we next show that ${rm dom}(bar f)=S$. If not, ${rm dom}(bar f) subsetneq S$ and thus $S setminus {rm dom}(bar f) neq emptyset$. Take some $bar X in S setminus {rm dom}(bar f)$ and $bar xin bar X$. Clearly, $bar f bigcup {(bar X,bar x)}in F$. This contradicts the minimality of $bar f$. This completes the proof.
proof-verification elementary-set-theory axiom-of-choice
proof-verification elementary-set-theory axiom-of-choice
edited Dec 7 at 6:37
Shaun
8,344113578
8,344113578
asked Dec 7 at 6:21
Le Anh Dung
9261421
9261421
math.stackexchange.com/questions/2088040/…
– Asaf Karagila♦
Dec 7 at 7:15
add a comment |
math.stackexchange.com/questions/2088040/…
– Asaf Karagila♦
Dec 7 at 7:15
math.stackexchange.com/questions/2088040/…
– Asaf Karagila♦
Dec 7 at 7:15
math.stackexchange.com/questions/2088040/…
– Asaf Karagila♦
Dec 7 at 7:15
add a comment |
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
});
}
});
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%2f3029560%2fzorns-lemma-implies-axiom-of-choice%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
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.
Some of your past answers have not been well-received, and you're in danger of being blocked from answering.
Please pay close attention to the following guidance:
- 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.
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%2f3029560%2fzorns-lemma-implies-axiom-of-choice%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
math.stackexchange.com/questions/2088040/…
– Asaf Karagila♦
Dec 7 at 7:15