Prove that if set A is denumerable and x∉A then A∪{x} is denumerable.
See if my solution works:
Since A is denumerable, there exists f:N→A such that f is a bijection.
Define g:N→A, g(n)={x,if n=1,f(n), if n≠1
Claim: g is also bijective.
Let n1,n2∈N such that g(n1)=g(n2).
If g(n1)=x, then n=1. If g(n1)≠g(n2), then g(n1)=f(n1)=g(n2)=f(n2). We have f(n1)=f(n2). Since f is a bijection, then n1=n2. Therefore g is injective.
Let b∈A∪{x}. There exists n=1 such that g(n)=x=b. If n≠1, then there exists m∈N such that g(m)=f(m)=b. Since f is bijective, there exists m∈N such that f(m)=b=g(m). So g is surjective.
Therefore g is bijective.
Therefore A∪{x} is denumerable.
Answer
If A is denumerable then it has the form
A={a1,a2,...,an,...},
so A∪{x} can be written as
A={x,a1,a2,...,an,...},
then, if we write b1=x, b2=a1, ... , bn=an−1, ... ,
we have
A={b1,b2,...,bn,...}, which is a denumerable set
No comments:
Post a Comment