How can one prove that every connected subset of a T1 space is infinite?

  • Thread starter Thread starter radou
  • Start date Start date
  • Tags Tags
    Space Topological
Click For Summary

Homework Help Overview

The discussion revolves around proving that every connected subset of a T1 space is infinite. The original poster presents a proof attempt involving a connected subset of a T1 space and explores the implications of assuming the subset is finite.

Discussion Character

  • Exploratory, Conceptual clarification, Mathematical reasoning, Problem interpretation

Approaches and Questions Raised

  • The original poster attempts to demonstrate a contradiction by assuming a finite connected subset and analyzing the separation of points. Some participants question the validity of the separation argument, suggesting that both sets being open is not generally true. Others propose an induction approach to find additional distinct points within the connected set.

Discussion Status

The discussion is ongoing, with participants exploring different angles of the proof. Some guidance has been offered regarding the conditions for connectedness and the implications of separation, but no consensus has been reached on the validity of the original proof attempt.

Contextual Notes

Participants are considering the definitions and properties of T1 spaces and connectedness, and there is an acknowledgment of potential gaps in the original proof's reasoning.

radou
Homework Helper
Messages
3,149
Reaction score
8

Homework Statement



Let X be a non empty T1 space (i.e. such one that for every two distinct points each one of them has a neighborhood which doesn't contain the other one). One needs to show that every connected subset of X, containing more than one element, is infinite.

The Attempt at a Solution



Let A be a connected subset of X containing more than one element. Assume A is finite, with cardinality k, so A = {x1, ..., xk}. Take any element from A, let's say xi. I claim that then the sets {xi} and A\{xi} are two non-empty separate sets whose union is A, which is a contradiction with the fact that A is connected. (Two sets A and B are separate if Cl(A)[tex]\cap[/tex]B = A[tex]\cap[/tex]Cl(B) = [tex]\emptyset[/tex]). The proof of this claim is the part I'm not quite sure about: Since X is T1, {xi} is a closed set, so Cl({xi})[tex]\cap[/tex]A\{xi} = [tex]\emptyset[/tex]. Now, to fulfill the other requirement for separation, I need to show that xi is not in the closure of A\{xi}. If it would be, then every neighborhood of xi would intersect A\{xi}. But then X\(A\{xi}) is a neighborhood of xi which doesn't intersect A\{xi}, so {xi}[tex]\cap[/tex]Cl(A\{xi})= [tex]\emptyset[/tex].

Perhaps there's a more easy way to prove it, but I didn't manage to do so, if this works at all.
 
Physics news on Phys.org
radou said:
I claim that then the sets {xi} and A\{xi} are two non-empty separate sets whose union is A, which is a contradiction with the fact that A is connected.

This would only contradict the fact that [itex]A[/itex] is connected if both [itex]\{x_i\}[/itex] and [itex]A\setminus\{x_i\}[/itex] were open; this is clearly not true in general.

I'd suggest trying induction. Specifically, given k distinct points [itex]x_1,\ldots,x_k[/itex] in a connected set [itex]A\subseteq X[/itex], try and find a point [itex]x_{k+1}\in A[/itex] which is distinct from all the other [itex]x_i[/itex]'s.
 
foxjwill said:
This would only contradict the fact that [itex]A[/itex] is connected if both [itex]\{x_i\}[/itex] and [itex]A\setminus\{x_i\}[/itex] were open; this is clearly not true in general.

My proof is based on a theorem which states that the following statements are equivalent:

(i) X is connected
(ii) if X is the union of two separate sets A and B, then either A or B is empty.

In our case, I have shown that A is the union of two separate non-empty sets, so it can't be connected.

Perhaps I'm really missing something here.
 
Any further thoughts?
 

Similar threads

  • · Replies 12 ·
Replies
12
Views
3K
Replies
20
Views
5K
Replies
1
Views
2K
  • · Replies 2 ·
Replies
2
Views
5K
Replies
2
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 11 ·
Replies
11
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K