Purchase Solution

Power set of a countably infinite set

Not what you're looking for?

Ask Custom Question

For any set B, let P(B) denote the power set of B (the collection of all subsets of B):

P(B) = {E: E is a subset of B}

Let A be a countably infinite set (an infinite set which is countable), and do the following:

(a) Prove that there is a one-to-one correspondence between P(A) and the set S of all countably infinite sequences of 0's and 1's.

(b) Using the result of part (a) or otherwise, prove that P(A) is uncountable.

Attachments
Purchase this Solution
Solution Summary

The solution consists of a detailed, step-by-step proof of the following: For a countably infinite set A, (a) there is a one-to-one correspondence between the power set of A and the set S of all countably infinite sequences of 0's and 1's; (b) the power set of A is uncountable.

Solution Preview

(a) Since A is countably infinite, there is a one-to-one correspondence between A and the set N of all natural numbers; hence the elements of A can be listed as follows:

a_0, a_1, a_2, a_3, ..., a_n, ...

Let E be a subset of A, and let s_E be the countably infinite sequence (s_0, s_1, s_2, s_3, ..., s_n, ...) of 0's and 1's such that, for every natural number n,

s_n = 1 if a_n is an element of E

s_n = 0 if a_n is not an element of E

Since E is an ARBITRARY subset of A (hence an ARBITRARY element of P(A)), this gives us a mapping f: P(A) -> S that maps E to s_E.

To show that this mapping is a one-to-one correspondence, we have to show that f is one-to-one and onto.

--------------------------------------

Proof that f is one-to-one:

Assume that f(E_1) = f(E_2) for subsets E_1, E_2 of A. We will show that E_1 = E_2.

Let f(E_1) = (s_0, s_1, s_2, s_3, ..., s_n, ...) (= f(E_2)).

Then for every natural number ...

Solution provided by:
Georgia Martin, PhD
Education
  • AB, Hood College
  • PhD, The Catholic University of America
  • PhD, The University of Maryland at College Park
Recent Feedback
  • "Thanks for your assistance. "
  • "Thank you. I understand now."
  • "Super - Thank You"
  • "Very clear. I appreciate your help. Thank you."
  • "Great. thank you so much!"
Purchase this Solution
Free BrainMass Quizzes
Solving quadratic inequalities

This quiz test you on how well you are familiar with solving quadratic inequalities.

Graphs and Functions

This quiz helps you easily identify a function and test your understanding of ranges, domains , function inverses and transformations.

Know Your Linear Equations

Each question is a choice-summary multiple choice question that will present you with a linear equation and then make 4 statements about that equation. You must determine which of the 4 statements are true (if any) in regards to the equation.

Multiplying Complex Numbers

This is a short quiz to check your understanding of multiplication of complex numbers in rectangular form.

Probability Quiz

Some questions on probability

View More Free Quizzes
Related BrainMass Solutions

  • Cardinality, countability

    As we have seen, adding one new members to a countable infinity does not change the cardinal number of a set. Exercise 2-12. Prove that adding a finite number n of new members to a countably infinite set does not change its cardinal numbers.

  • Cartesian product proof

    (i) S is either finite or a countably infinite set. (ii) Either S = Null or there is a surjective map alpha: N ---> S. (iii) There is an injective map beta: S ---> N.

  • Discrete Mathematics : 11 Definitions - Boolean variable, Bit operation, Tautology, Contingency, Axiom, Paradox, Venn Diagram, Infinite Set, Domain of f, Codomain of f and Inverse of f

    An infinite set whose elements can be put into a 1-1 correspondence with N (natural numbers) is said to be countably infinite; otherwise, it is called uncountably infinite. 9.

  • Real Analysis Topology and Sigma-Algebra

    Prove that any sigma-algebra, which contains a finite number of members is also a topology. ( The Q in another words : to show that there exist a sequence of disjoint members of a sigma algebra which contains infinite no. of members). 2).

  • Increasing function on open interval

    Thus we have the following: (i) for every positive rational q, the set D_q is countable (ii) there are only countably many positive rational numbers Hence the set of points of discontinuity of f on the interval (a, b) is the union of countably

  • Important information about Homology group

    75953 Important information about Homology group Determine the structure of the homology group H_n(X), n >= 0, if X is (a) the set of rational numbers with their usual topology; (b) a countable, discrete set.

  • Elements in an Abelian group

    206800 Elements in an Abelian Group Let G be the direct sum of a countably infinite number of copies of Z. Find an element of End_Z(G) which has a left inverse, but is not a unit. Please explain in detail.

  • Eigenvalue proofs

    countably infinite number of eigenvalues, all the eigenvalues are simple roots.... see attachment This solution provides an example of solving for eigenvalues and then completing proofs about them.

  • Prove

    By using the fact that the set of all rational numbers is countable, and subsets of countable sets are at most countable, prove that every collection of non-empty disjoint open intervals in R is a collection of at most countably many intervals.

View More Related Solutions