Let AN=∏m∈NAm be the infinite countably cartesian product of the sets Am. Let A′i be a subset of Ai for i=1,...,n. Is it true that A′1×A′2×...×A′n×AN∖{1,...,n} is equal to A′1×A′2×...×A′n×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}, A′m={0}.
Then, you can find (0,0,…,0⏟n 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 xj∈Aj:=A0 for all j≥n+1.
Then, you want to prove that X∈AN. This means : does the k-th component of X (k≥1) 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+1∈An+1=A0.
No comments:
Post a Comment