A certain step in a proof of König's theorem from Hrbacek-Jech “Introduction to Set Theoryâ€

Multi tool use
Clash Royale CLAN TAG#URR8PPP
up vote
2
down vote
favorite
I'm trying to understand the proof of König's theorem in set theory using Hrbacek's and Jech's book "Introduction to Set Theory".
In the end, the proof ÑÂomes down to a certain result or lemma, which I'm having a trouble with understanding.
Let $(Y_i)_i in I$ be indexed family. Then there can be no indexed family $(Z_i)_i in I$ so that
$(forall i,j in I)(i neq j Longrightarrow Z_icap Z_j = varnothing),$
$(forall i in I)(|Z_i| < |Y_i|),$
$bigcup_i in I Z_i = prod_i in I Y_i$.
Hrbacek and Jech proceed the following way. They defined a new family $(A_i)_i in I$ so that $A_i$ is the subset of $Y_i$ of all elements $y$ for which there is a function $fcolon Itobigcup_i in I Y_i$ in $Z_i$ so that $y = f(i)$. Then they claim that for any $i in I$, $A_i subsetneq Y_i$ since $|A_i| leq |Z_i| < |Y_i|$. This is where is stumble: I don't understand why we have $|A_i| leq |Z_i|$ for each $i in I$.
elementary-set-theory
add a comment |Â
up vote
2
down vote
favorite
I'm trying to understand the proof of König's theorem in set theory using Hrbacek's and Jech's book "Introduction to Set Theory".
In the end, the proof ÑÂomes down to a certain result or lemma, which I'm having a trouble with understanding.
Let $(Y_i)_i in I$ be indexed family. Then there can be no indexed family $(Z_i)_i in I$ so that
$(forall i,j in I)(i neq j Longrightarrow Z_icap Z_j = varnothing),$
$(forall i in I)(|Z_i| < |Y_i|),$
$bigcup_i in I Z_i = prod_i in I Y_i$.
Hrbacek and Jech proceed the following way. They defined a new family $(A_i)_i in I$ so that $A_i$ is the subset of $Y_i$ of all elements $y$ for which there is a function $fcolon Itobigcup_i in I Y_i$ in $Z_i$ so that $y = f(i)$. Then they claim that for any $i in I$, $A_i subsetneq Y_i$ since $|A_i| leq |Z_i| < |Y_i|$. This is where is stumble: I don't understand why we have $|A_i| leq |Z_i|$ for each $i in I$.
elementary-set-theory
add a comment |Â
up vote
2
down vote
favorite
up vote
2
down vote
favorite
I'm trying to understand the proof of König's theorem in set theory using Hrbacek's and Jech's book "Introduction to Set Theory".
In the end, the proof ÑÂomes down to a certain result or lemma, which I'm having a trouble with understanding.
Let $(Y_i)_i in I$ be indexed family. Then there can be no indexed family $(Z_i)_i in I$ so that
$(forall i,j in I)(i neq j Longrightarrow Z_icap Z_j = varnothing),$
$(forall i in I)(|Z_i| < |Y_i|),$
$bigcup_i in I Z_i = prod_i in I Y_i$.
Hrbacek and Jech proceed the following way. They defined a new family $(A_i)_i in I$ so that $A_i$ is the subset of $Y_i$ of all elements $y$ for which there is a function $fcolon Itobigcup_i in I Y_i$ in $Z_i$ so that $y = f(i)$. Then they claim that for any $i in I$, $A_i subsetneq Y_i$ since $|A_i| leq |Z_i| < |Y_i|$. This is where is stumble: I don't understand why we have $|A_i| leq |Z_i|$ for each $i in I$.
elementary-set-theory
I'm trying to understand the proof of König's theorem in set theory using Hrbacek's and Jech's book "Introduction to Set Theory".
In the end, the proof ÑÂomes down to a certain result or lemma, which I'm having a trouble with understanding.
Let $(Y_i)_i in I$ be indexed family. Then there can be no indexed family $(Z_i)_i in I$ so that
$(forall i,j in I)(i neq j Longrightarrow Z_icap Z_j = varnothing),$
$(forall i in I)(|Z_i| < |Y_i|),$
$bigcup_i in I Z_i = prod_i in I Y_i$.
Hrbacek and Jech proceed the following way. They defined a new family $(A_i)_i in I$ so that $A_i$ is the subset of $Y_i$ of all elements $y$ for which there is a function $fcolon Itobigcup_i in I Y_i$ in $Z_i$ so that $y = f(i)$. Then they claim that for any $i in I$, $A_i subsetneq Y_i$ since $|A_i| leq |Z_i| < |Y_i|$. This is where is stumble: I don't understand why we have $|A_i| leq |Z_i|$ for each $i in I$.
elementary-set-theory
elementary-set-theory
asked Sep 10 at 8:20
Jxt921
959616
959616
add a comment |Â
add a comment |Â
2 Answers
2
active
oldest
votes
up vote
1
down vote
accepted
For each $yin A_i,$ by definition, there is a function $fin Z_i$ such that $y=f(i);$ choose such an $f$ and call it $f_y.$ (Axiom of choice used here.) The inequality $|A_i|le|Z_i|$ follows from the fact that $ymapsto f_y$ is an injective map from $A_i$ to $Z_i.$ Namely, if $y,zin A_i$ and $f_y=f_z,$ then $y=f_y(i)=f_z(i)=z.$
add a comment |Â
up vote
0
down vote
So, in a formula: $A_i=yin Y_i:(exists fin Z_i)(y=f(i))$, or a bit shorter: $A_i=f(i): fin Z_i$. The last formulation shows that $A_i$ is the image of $Z_i$ under the map $fmapsto f(i)$. In general: if $g:Pto Q$ is any map then $|g[P]|le|P|$ (this uses a bit of AC).
But how do we know that $A_i$ if the image of $Z_i$ under this map and not simply a set containing the image. That is, how to we know that the map $fmapsto f(i)$ is surjective?
– Jxt921
Sep 10 at 9:30
By the very definition of $A_i$ as <b>the</b> set of all elements of the form $f(i)$ for some $fin Z_i$.
– hartkp
Sep 11 at 11:34
add a comment |Â
2 Answers
2
active
oldest
votes
2 Answers
2
active
oldest
votes
active
oldest
votes
active
oldest
votes
up vote
1
down vote
accepted
For each $yin A_i,$ by definition, there is a function $fin Z_i$ such that $y=f(i);$ choose such an $f$ and call it $f_y.$ (Axiom of choice used here.) The inequality $|A_i|le|Z_i|$ follows from the fact that $ymapsto f_y$ is an injective map from $A_i$ to $Z_i.$ Namely, if $y,zin A_i$ and $f_y=f_z,$ then $y=f_y(i)=f_z(i)=z.$
add a comment |Â
up vote
1
down vote
accepted
For each $yin A_i,$ by definition, there is a function $fin Z_i$ such that $y=f(i);$ choose such an $f$ and call it $f_y.$ (Axiom of choice used here.) The inequality $|A_i|le|Z_i|$ follows from the fact that $ymapsto f_y$ is an injective map from $A_i$ to $Z_i.$ Namely, if $y,zin A_i$ and $f_y=f_z,$ then $y=f_y(i)=f_z(i)=z.$
add a comment |Â
up vote
1
down vote
accepted
up vote
1
down vote
accepted
For each $yin A_i,$ by definition, there is a function $fin Z_i$ such that $y=f(i);$ choose such an $f$ and call it $f_y.$ (Axiom of choice used here.) The inequality $|A_i|le|Z_i|$ follows from the fact that $ymapsto f_y$ is an injective map from $A_i$ to $Z_i.$ Namely, if $y,zin A_i$ and $f_y=f_z,$ then $y=f_y(i)=f_z(i)=z.$
For each $yin A_i,$ by definition, there is a function $fin Z_i$ such that $y=f(i);$ choose such an $f$ and call it $f_y.$ (Axiom of choice used here.) The inequality $|A_i|le|Z_i|$ follows from the fact that $ymapsto f_y$ is an injective map from $A_i$ to $Z_i.$ Namely, if $y,zin A_i$ and $f_y=f_z,$ then $y=f_y(i)=f_z(i)=z.$
answered Sep 10 at 8:39
bof
47k349114
47k349114
add a comment |Â
add a comment |Â
up vote
0
down vote
So, in a formula: $A_i=yin Y_i:(exists fin Z_i)(y=f(i))$, or a bit shorter: $A_i=f(i): fin Z_i$. The last formulation shows that $A_i$ is the image of $Z_i$ under the map $fmapsto f(i)$. In general: if $g:Pto Q$ is any map then $|g[P]|le|P|$ (this uses a bit of AC).
But how do we know that $A_i$ if the image of $Z_i$ under this map and not simply a set containing the image. That is, how to we know that the map $fmapsto f(i)$ is surjective?
– Jxt921
Sep 10 at 9:30
By the very definition of $A_i$ as <b>the</b> set of all elements of the form $f(i)$ for some $fin Z_i$.
– hartkp
Sep 11 at 11:34
add a comment |Â
up vote
0
down vote
So, in a formula: $A_i=yin Y_i:(exists fin Z_i)(y=f(i))$, or a bit shorter: $A_i=f(i): fin Z_i$. The last formulation shows that $A_i$ is the image of $Z_i$ under the map $fmapsto f(i)$. In general: if $g:Pto Q$ is any map then $|g[P]|le|P|$ (this uses a bit of AC).
But how do we know that $A_i$ if the image of $Z_i$ under this map and not simply a set containing the image. That is, how to we know that the map $fmapsto f(i)$ is surjective?
– Jxt921
Sep 10 at 9:30
By the very definition of $A_i$ as <b>the</b> set of all elements of the form $f(i)$ for some $fin Z_i$.
– hartkp
Sep 11 at 11:34
add a comment |Â
up vote
0
down vote
up vote
0
down vote
So, in a formula: $A_i=yin Y_i:(exists fin Z_i)(y=f(i))$, or a bit shorter: $A_i=f(i): fin Z_i$. The last formulation shows that $A_i$ is the image of $Z_i$ under the map $fmapsto f(i)$. In general: if $g:Pto Q$ is any map then $|g[P]|le|P|$ (this uses a bit of AC).
So, in a formula: $A_i=yin Y_i:(exists fin Z_i)(y=f(i))$, or a bit shorter: $A_i=f(i): fin Z_i$. The last formulation shows that $A_i$ is the image of $Z_i$ under the map $fmapsto f(i)$. In general: if $g:Pto Q$ is any map then $|g[P]|le|P|$ (this uses a bit of AC).
answered Sep 10 at 8:38
hartkp
42123
42123
But how do we know that $A_i$ if the image of $Z_i$ under this map and not simply a set containing the image. That is, how to we know that the map $fmapsto f(i)$ is surjective?
– Jxt921
Sep 10 at 9:30
By the very definition of $A_i$ as <b>the</b> set of all elements of the form $f(i)$ for some $fin Z_i$.
– hartkp
Sep 11 at 11:34
add a comment |Â
But how do we know that $A_i$ if the image of $Z_i$ under this map and not simply a set containing the image. That is, how to we know that the map $fmapsto f(i)$ is surjective?
– Jxt921
Sep 10 at 9:30
By the very definition of $A_i$ as <b>the</b> set of all elements of the form $f(i)$ for some $fin Z_i$.
– hartkp
Sep 11 at 11:34
But how do we know that $A_i$ if the image of $Z_i$ under this map and not simply a set containing the image. That is, how to we know that the map $fmapsto f(i)$ is surjective?
– Jxt921
Sep 10 at 9:30
But how do we know that $A_i$ if the image of $Z_i$ under this map and not simply a set containing the image. That is, how to we know that the map $fmapsto f(i)$ is surjective?
– Jxt921
Sep 10 at 9:30
By the very definition of $A_i$ as <b>the</b> set of all elements of the form $f(i)$ for some $fin Z_i$.
– hartkp
Sep 11 at 11:34
By the very definition of $A_i$ as <b>the</b> set of all elements of the form $f(i)$ for some $fin Z_i$.
– hartkp
Sep 11 at 11:34
add a comment |Â
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
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2911663%2fa-certain-step-in-a-proof-of-k%25c3%25b6nigs-theorem-from-hrbacek-jech-introduction-to%23new-answer', 'question_page');
);
Post as a guest
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
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
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