- Trending Categories
- Data Structure
- Networking
- RDBMS
- Operating System
- Java
- iOS
- HTML
- CSS
- Android
- Python
- C Programming
- C++
- C#
- MongoDB
- MySQL
- Javascript
- PHP
- Physics
- Chemistry
- Biology
- Mathematics
- English
- Economics
- Psychology
- Social Studies
- Fashion Studies
- Legal Studies

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

# Prove that the Cartesian product of a finite number of countable sets is countable?

### Problem

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

### Solution

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.

- Related Articles
- Show that the set of all languages that are not recursively enumerable on {a} is not countable?
- Cartesian product of two sets in JavaScript
- Dash separated cartesian product of any number of arrays in JavaScript
- Prove that the product of two consecutive positive integers is divisible by 2.
- Prove that the product of three consecutive positive integers is divisible by 6.
- Cartesian product of multiple arrays in JavaScript
- Prove that if a number is tripled, then its cube is 27times the cube of the given number.
- Prove that if a number is trebled then its cube is 27 times the cube of the given number.
- Python program to find Cartesian product of two lists
- Compute cartesian product of elements in an array in JavaScript
- Multiply 210125 by the smallest number so that the product is a perfect cube. Also, find out the cube root of the product.
- Evaluate a 2-D polynomial on the Cartesian product of x and y in Python
- Evaluate a 2D Legendre series on the Cartesian product of x and y in Python
- Prove that under root 2 is not a rational number.
- Prove that the following number is irrational.$4+sqrt{2}$