Monday, 27 November 2017

elementary set theory - infinite countably cartesian product



Let AN=mNAm be the infinite countably cartesian product of the sets Am. Let Ai be a subset of Ai for i=1,...,n. Is it true that A1×A2×...×An×AN{1,...,n} is equal to A1×A2×...×An×AN ?
For me the answer is yes because an infinite countably set minus a finite set is still infinite countably but I don't know how formally using this to solve the problem. Thank you very much.


Answer



Hint : consider Am={0,1,,m}, Am={0}.





Then, you can find (0,0,,0n times,n+1,n+1,) in the first product, but not in the second one (because the n+1-th component in the second product is A0={0}).




However, if all the Am are equal, then it is true : it is sufficient to prove that AN{1,...,n}=AN



To do this, pick X=(xn+1,xn+2,)AN{1,...,n}, that means xjAj:=A0 for all jn+1.



Then, you want to prove that XAN. This means : does the k-th component of X (k1) belong to Ak=A0 ? Does every component of X belong to A0 ?




Then, X belongs to AN simply because all its components belong to A0... Even if I denoted the first component of X by xn+1, this doesn't really matter because what is important is that xn+1An+1=A0.


No comments:

Post a Comment

real analysis - How to find limhrightarrow0fracsin(ha)h

How to find limh0sin(ha)h without lhopital rule? I know when I use lhopital I easy get $$ \lim_{h\rightarrow 0}...