- Related Questions & Answers
- Cartesian product of two sets in JavaScript
- Show that the set of all languages that are not recursively enumerable on {a} is not countable?
- Dash separated cartesian product of any number of arrays in JavaScript
- Cartesian product of multiple arrays in JavaScript
- Compute cartesian product of elements in an array in JavaScript
- Explain cartesian product in relational algebra (DBMS)?
- Prove that the Hamiltonian Path is NP-Complete in TOC
- Prove that the vertex cover is NP complete in TOC
- How to prove that only one instance of the object is created for static class?
- Maximize the product of four factors of a Number in C++
- Recursive product of all digits of a number - JavaScript
- Given an array of integers, find the pair of adjacent elements that has the largest product and return that product JavaScript
- Prove that the interface for a primitive type is an empty array in Java
- Product of factors of number in C++
- Product sum difference of digits of a number in JavaScript

- Selected Reading
- UPSC IAS Exams Notes
- Developer's Best Practices
- Questions and Answers
- Effective Resume Writing
- HR Interview Questions
- Computer Glossary
- Who is Who

We have to prove that the cartesian product of a finite number of countable sets is countable.

Let the X1, X2 ,…….. Xn be the countable sets.

Yk= X1 * X2 * …….* Xk when k =1……. N). Thus,

Yn := X1 * X2 * · · · * Xn

**Proof**

Using the induction −

In case k = 1 then Y1 = X1 is countable.

Assuming that Yk (k ∈ n, 1 ≤ k < n) is countable;

Then Yk+1 = ( X1 * X2 * …….* Xk) * Xk+1 = Yk * Xk+1 where the Yk and the Xk+1 can be called countable. Hence the cartesian product of the countable set is always countable. So, Yk+1 is countable.

**In the same way, let's prove that the cartesian product of a finite number of countable infinite sets is countably infinite.**

**Proof**

Let the X1, X2 ,…….. Xn be the countable infinite sets.

Define Yk= X1 * X2 * …….* Xk when k =1……. N). Thus

Thus, Yn := X1 * X2 * · · · * Xn

First we need to prove that Yn is countable.

**By induction method**

If k=1, then the set Y1=X1 is countable infinite.

Assume that Yk( K☐N, 1<=K<N) is countable infinite.

Then,

Yk+1=(X1 * X2 *....Xk) * Xk+1

Yk+1=Yk * Xk+1

Where, Yk and Xk+1 are both countable infinite, we know that the cartesian product of countable sets is countable.

Therefore, Yk+1 is countable infinite.

We concluded that X1 * X2 *.....Xn is countable infinite.

Therefore, the cartesian product of a finite number of countable infinite sets is countable infinite.

Advertisements