Tychonoff theorem and Zorn's lemma

  • Thread starter Fernsanz
  • Start date
  • Tags
    Theorem
In summary, the Zorn's lemma is needed to prove the Tychonoff theorem -the product of compact spaces is compact-. The proof in the book from Bachman-Narici based on the technic of Finite Intersection Property uses the Zorn's lemma.
  • #1
Fernsanz
57
0
Hi.

I'm trying to understand why is the Zorn's lemma needed to prove the Tychonoff theorem -the product of compact spaces is compact-.

Specifically my question is about the proof in the book from Bachman-Narici based on the technic of Finite Intersection Property that you can find here:
http://books.google.es/books?id=wCH...resnum=1&ved=0CBcQ6AEwAA#v=onepage&q&f=false"

Why can not we just carry over the proof of the finite case? I mean, once the point [tex]\hat{x}[/tex] has been proposed as the common adherence point and bearing in mind the basis for the topology of [tex]X[/tex] consists of the sets
[tex]\prod V_{\alpha}[/tex] where [tex]V_{\alpha}[/tex] is an open set [tex]V_{\alpha} \subset X_{\alpha}[/tex] for finitely many [tex]\alpha[/tex] and [tex]X_{\alpha}[/tex] for the rest, it is obvious that any of these basis set containing [tex]\hat{x}[/tex] will also intersect all of [tex]E^{\gamma}[/tex]. So, where and why is the Zorn's lemma needed?

Thanks in advance.
 
Last edited by a moderator:
Physics news on Phys.org
  • #2
Too many people have viewed that page, no more allowed...
Presumably "choice" is used to define the point [itex]\hat{x}[/itex]
 
  • #3
g_edgar said:
Too many people have viewed that page, no more allowed...
Presumably "choice" is used to define the point [itex]\hat{x}[/itex]

That would be more logical for me, but no proof mention the "choice" to define the point [itex]\hat{x}[/itex] even though, in mi opinion, if one is to use the Axiom of Choice/Zorn lemma this is the step to mention it. By contrast, all proofs use the AC/Zorn after the point have been selected to deduce that it is a common adherence point; to me, this fact seems obvious by the very definition of the product topology base without relying on any other argument.
 
  • #4
g_edgar said:
Too many people have viewed that page, no more allowed...
You can view the page if you just change the country code in the URL. I changed .es (Spain) to .se (Sweden) and it worked fine.
 
  • #5
No answers?
 
  • #6
Nope, but by coincidence I'm studying the proof of Tychonoff's theorem right now, so I might have something profound to say tomorrow. What I can say right now is that I think you would like the discussion preceding the proof at the start of chapter 5 of Munkres.

Edit: Here's a quote from the bottom of page 230 (the first page of chapter 5), regarding the approach that's used in the finite case:

It's quite tricky to make this approach work for an arbitrary product of compact spaces; one must well-order the index set and use transfinite induction. (See exercise 5). An alternate approach is [...] using Zorn's lemma.​

So it seems that it is possible to do it in a way that's similar to the proof of the finite case, without using Zorn, but using the well-ordering theorem and transfinite induction instead. I'm thinking that the proof based on Zorn is probably more popular because more people are familiar with Zorn's lemma.
 
Last edited:
  • #7
I understand the proof in Munkres now. I only had a very quick look at the proof in Bachman & Narici. It appears to be the same. If you want to understand why we need to make the family of sets with the finite intersection property maximal (the existence of the maximal family is what Zorn is used for), the discussion preceding the theorem in Munkres will definitely help. It includes an example of how this method of proof can fail when we try to use a family that isn't maximal.
 
Last edited:

Related to Tychonoff theorem and Zorn's lemma

1. What is the Tychonoff theorem and Zorn's lemma?

The Tychonoff theorem, also known as the Tychonoff product theorem, is a fundamental result in topology that states that the Cartesian product of any collection of compact topological spaces is itself compact. Zorn's lemma is a principle in set theory that states that if every chain in a partially ordered set has an upper bound, then the set has a maximal element.

2. How are the Tychonoff theorem and Zorn's lemma related?

The Tychonoff theorem is often used in conjunction with Zorn's lemma to prove the existence of maximal elements in various mathematical structures. This is because Zorn's lemma provides a necessary condition for the existence of maximal elements, while the Tychonoff theorem ensures that the product space is compact, which is a crucial property for many mathematical constructions.

3. What is the significance of the Tychonoff theorem and Zorn's lemma in mathematics?

The Tychonoff theorem and Zorn's lemma are powerful tools that have applications in a wide range of mathematical fields, including topology, functional analysis, and algebraic geometry. They are often used to prove important theorems and to establish the existence of certain mathematical objects that would otherwise be difficult to construct.

4. Are there any generalizations or extensions of the Tychonoff theorem and Zorn's lemma?

Yes, there are several generalizations and extensions of the Tychonoff theorem and Zorn's lemma. For example, the Tychonoff theorem can be extended to non-compact spaces by using the concept of compactifications. Zorn's lemma also has various generalizations, such as the Axiom of Choice and the Well-Ordering Principle.

5. Are there any applications of the Tychonoff theorem and Zorn's lemma outside of mathematics?

Yes, the Tychonoff theorem and Zorn's lemma have applications in other fields such as computer science, physics, and economics. In computer science, the Tychonoff theorem is used in the study of computational complexity, while Zorn's lemma has been used in game theory and decision-making processes. These principles have also been applied in various engineering and optimization problems.

Similar threads

  • Topology and Analysis
Replies
7
Views
2K
Replies
13
Views
5K
  • Set Theory, Logic, Probability, Statistics
Replies
6
Views
1K
  • Calculus and Beyond Homework Help
Replies
3
Views
1K
  • Differential Geometry
Replies
2
Views
4K
  • Topology and Analysis
Replies
6
Views
3K
  • Differential Geometry
Replies
2
Views
7K
  • Topology and Analysis
Replies
5
Views
2K
Replies
2
Views
2K
  • Differential Geometry
Replies
11
Views
4K
Back
Top