How can you prove that a Cartesian product of compact sets is compact?

In summary: E and F are compact, so E\times F is also compact. The continuity of projection maps preserves boundedness, and the fact that E and F are both closed means that any sequence of points in E\times F converges to a point (x,y) = (x_1,x_2,\ldots,x_d,y_1,y_2,\ldots,y_d).
  • #1
AxiomOfChoice
533
1
I'm talking about [itex]E \times F[/itex], where [itex]E,F \subseteq \mathbb{R}^d[/itex]. If you know [itex]E[/itex] and [itex]F[/itex] are compact, you know they're both closed and bounded. But how do you define "boundedness" - or "closed", for that matter - for a Cartesian product of subsets of Euclidean [itex]d[/itex]-space?

The only idea I've had is viewing [itex]E\times F[/itex] as a subset of [itex]\mathbb{R}^{2d}[/itex]. If this is a legitimate thing to do, boundedness is certainly preserved. Also, since [itex]E[/itex] and [itex]F[/itex] were both closed, any sequence of points in [itex]E\times F[/itex] that converges necessarily converges to a point [itex](x,y) = (x_1,x_2,\ldots,x_d,y_1,y_2,\ldots,y_d)[/itex]. Does this look right?
 
Last edited:
Physics news on Phys.org
  • #2
AxiomOfChoice said:
I'm talking about [itex]E \times F[/itex], where [itex]E,F \subseteq \mathbb{R}^d[/itex]. If you know [itex]E[/itex] and [itex]F[/itex] are compact, you know they're both closed and bounded. But how do you define "boundedness" - or "closed", for that matter - for a Cartesian product of subsets of Euclidean [itex]d[/itex]-space?

The only idea I've had is viewing [itex]E\times F[/itex] as a subset of [itex]\mathbb{R}^{2d}[/itex]. If this is a legitimate thing to do, boundedness is certainly preserved. Also, since [itex]E[/itex] and [itex]F[/itex] were both closed, any sequence of points in [itex]E\times F[/itex] that converges necessarily converges to a point [itex](x,y) = (x_1,x_2,\ldots,x_d,y_1,y_2,\ldots,y_d)[/itex]. Does this look right?

This is avoiding your question a little but if you think of compact to mean that every open cover has a finite sub-cover then one should be able to argue this from inverse images of the projection maps onto the two factors E and F.

But I think you can use the continuity of the projections to do it the close and bounded way as well.
 
  • #3
You are quite right. If [itex]E, F \subset \mathbb{R}^d[/itex], then [itex]E \times F \subset \mathbb{R}^{2d}[/itex] .
 

1. What is a Cartesian product of compact sets?

A Cartesian product of compact sets is a set containing all possible ordered pairs of elements from two or more compact sets. It is denoted by A x B, where A and B are the compact sets.

2. What does it mean for a set to be compact?

A set is considered compact if it is closed, bounded, and every open cover has a finite subcover. In simpler terms, it means that the set contains all of its limit points and can be covered by a finite number of open sets.

3. How can we prove that a Cartesian product of compact sets is compact?

To prove that a Cartesian product of compact sets is compact, we can use the Tychonoff's theorem. This theorem states that the Cartesian product of any collection of compact sets is also compact. Therefore, a Cartesian product of compact sets is compact.

4. Can you provide an example of a Cartesian product of compact sets?

Yes, an example of a Cartesian product of compact sets is the set of real numbers [-1, 1] x [-1, 1]. Both [-1, 1] and [-1, 1] are compact sets, and the Cartesian product of these sets would be the unit square on the xy-plane.

5. Why is it important to prove that a Cartesian product of compact sets is compact?

Proving that a Cartesian product of compact sets is compact is important because it allows us to generalize the concept of compactness to higher dimensions. It also enables us to use the powerful Tychonoff's theorem to prove the compactness of more complex sets. This is crucial in many areas of mathematics, such as topology and functional analysis.

Similar threads

Replies
3
Views
1K
  • Linear and Abstract Algebra
Replies
17
Views
1K
Replies
5
Views
2K
  • Topology and Analysis
2
Replies
44
Views
5K
  • Set Theory, Logic, Probability, Statistics
Replies
1
Views
1K
  • Set Theory, Logic, Probability, Statistics
Replies
2
Views
1K
  • Topology and Analysis
Replies
6
Views
5K
Replies
2
Views
1K
  • Math Proof Training and Practice
3
Replies
100
Views
7K
  • Calculus and Beyond Homework Help
Replies
11
Views
2K
Back
Top