Does Path Connectedness Imply Simply Connectedness in the Union of Two Subsets?

  • Context: Graduate 
  • Thread starter Thread starter jostpuur
  • Start date Start date
Click For Summary

Discussion Overview

The discussion revolves around the relationship between path connectedness and simply connectedness in the context of the union of two subsets within a metric space. Participants explore whether the path connectedness of the intersection of two simply connected sets implies that their union is also simply connected, particularly under various conditions such as openness and non-emptiness of the intersection.

Discussion Character

  • Debate/contested
  • Exploratory
  • Mathematical reasoning

Main Points Raised

  • Some participants assert that the union of two simply connected sets A and B is not necessarily simply connected, even if their intersection A ∩ B is path connected.
  • Examples are provided, such as considering A as a torus and B as a part of the torus, where the intersection is path connected but the union is not simply connected.
  • Concerns are raised about the implications of including the empty set in the discussion of path connectedness.
  • Participants propose that if both A and B are open and their intersection is non-empty, this might imply simply connectedness of the union, but there is uncertainty about how to prove this.
  • Counterexamples are discussed, including configurations of shapes in R² that demonstrate that the union can fail to be simply connected even when the intersection is path connected.
  • Some participants reference theorems related to fundamental groups and homotopies, suggesting that under certain conditions, the union could be simply connected.
  • There is mention of a theorem from Hatcher's book regarding the fundamental group of the union of two path connected open sets with a path connected intersection.

Areas of Agreement / Disagreement

Participants do not reach a consensus on whether path connectedness of the intersection guarantees simply connectedness of the union. Multiple competing views and examples are presented, indicating that the discussion remains unresolved.

Contextual Notes

Limitations include the dependence on definitions of path connectedness and simply connectedness, as well as the specific conditions under which the claims are made. Some examples provided may not meet the stated assumptions, leading to further complications in the discussion.

jostpuur
Messages
2,112
Reaction score
19
I know that just because A\subset X and B\subset X are simply connected in some metric space X, the union A \cup B is not neccecarely simply connected. However, the does path connectedness of A\cap B suffice for the union to become simply connected? If it does, is there easy proof?

Edit:

I don't change the original question, because it could make first replies seem strange, but anyway, the question that I'm now interested (after the first replies), is that is the claim true if we assume the intersection to be nonempty, and both A and B to be open.
 
Last edited:
Physics news on Phys.org
Well, let's imagine A is a torus, and B is a part of the torus. A intersect B is path connected, but A union B isn't simply connected.

I'm not that up on simply connected sets, but I'm pretty sure that's right?
 
Office_Shredder said:
Well, let's imagine A is a torus, and B is a part of the torus. A intersect B is path connected, but A union B isn't simply connected.

I'm not that up on simply connected sets, but I'm pretty sure that's right?

I meant that we also assume A and B both to be simply connected alone.
 
Office_Shredder said:
Well, let's imagine A is a torus, and B is a part of the torus. A intersect B is path connected, but A union B isn't simply connected.

I'm not that up on simply connected sets, but I'm pretty sure that's right?

A isn't simply connected if it's a torus, so it doesn't meet the hypothesis that both A and B are simply connected.

Is the empty set considered path connected? If so, we may simply choose some A and B which are some distance apart, and thus their union isn't even path connected.

If the empty set doesn't count (or you require their intersection to be non-empty), then consider set A to be a "C" shape (annulus with a slice missing), and B to be the missing slice, plus a bit more, so there is an overlap on one side but not on the other. Then their intersection is path connected, but their union (the annulus) is not simply connected.
 
Moo Of Doom said:
A isn't simply connected if it's a torus, so it doesn't meet the hypothesis that both A and B are simply connected.

Is the empty set considered path connected? If so, we may simply choose some A and B which are some distance apart, and thus their union isn't even path connected.

If the empty set doesn't count (or you require their intersection to be non-empty), then consider set A to be a "C" shape (annulus with a slice missing), and B to be the missing slice, plus a bit more, so there is an overlap on one side but not on the other. Then their intersection is path connected, but their union (the annulus) is not simply connected.

Okey, that was a counter example, but I naturally respond by toughening the assumtions :biggrin:

What if A and B are both open (or both closed)? And let us assume that the intersection is nonempty.

I'm asking this because it looks like these assumtions should imply simply connectedness of the union, but I'm not sure how.
 
Ok, right, that makes sense of course :blushing:

Imagine we're in R^2 then... a pair of rectangles that overlaps at a square is simply connected, right?

Something like:

http://pbskids.org/sesame/coloring/images/l_grover.gif

The L in that picture (it was the first L I could find, shut up...)

So take one of those with the length of each protrusion some length x, and the overlap a length y. Then take another such set, with one protrusion shortened by a length y, and lie them on top of each other so they overlap at a square and form a larger square with a square shaped hole in the middle. The intersection is a square, the union isn't simply connected, and each set is simply connected, right?
 
Last edited by a moderator:
Office_Shredder said:
So take one of those with the length of each protrusion some length x, and the overlap a length y. Then take another such set, with one protrusion shortened by a length y, and lie them on top of each other so they overlap at a square and form a larger square with a square shaped hole in the middle. The intersection is a square, the union isn't simply connected, and each set is simply connected, right?

If I get your picture, then either their intersection will not be connected (have some points in either corner), or there will be a tiny rip in the square with a hole in the middle, so that it's like a c-shape again, only with nearly touching ends. Remember that A and B both must be open, so they can't be touching without intersecting.

I think these (new) conditions are now sufficient. Time to start thinking of a proof. :)
 
jostpuur said:
I know that just because A\subset X and B\subset X are simply connected in some metric space X, the union A \cup B is not neccecarely simply connected. However, the does path connectedness of A\cap B suffice for the union to become simply connected?
Let X be the unit circle, let A be the restriction of X to the upper half plane, and let B = X\A. The intersection of A and B is empty, hence path connected trivially, and each A and B are simply connected, but their union is not. It's easy to modify B slightly so that it doesn't intersect B trivially but such that all the above conditions hold.
 
AKG said:
Let X be the unit circle, let A be the restriction of X to the upper half plane, and let B = X\A. The intersection of A and B is empty, hence path connected trivially, and each A and B are simply connected, but their union is not. It's easy to modify B slightly so that it doesn't intersect B trivially but such that all the above conditions hold.

Yes, but B is not open (or A isn't, depending on if we take the closed or open upper half-plane). The new conditions require both sets to be open. Your counterexample has already been brought up.
 
  • #10
Given the extra, new, assumptions, I think it is true, and can be obtained by considering homotopies of loops. The point is if we have any loop in AuB, it can be split into sections lying wholly in AnB, A\B and B\A, and the hypotheses now make it possible to deform this to the trivial loop, though I confess I haven't thought this through rigorously.
 
  • #11
i suggest looking at the basic theorem in fundamental groups, but i forget the name, seifert / van kampen?
 
  • #12
ok i looked it up in hatchers book available online for free, and it says if a space is the union of two path connected open sets and the intersection is path connected, and if the base point lies in the intersection, then the fundamental group of the union is a quotient of the free froduct of the fundamental groups of the twoorigianl sets.

so in particular a [quotient of the] free product of two trivial groups is trivial.does this do it for you? if not, matts description may be more clear. i.e. just visualize shrinking loops.
 
Last edited:
  • #13
mathwonk said:
ok i looked it up in hatchers book available online for free, and it says if a space is the union of two path connected open sets and the intersection is path connected, and if the base point lies in the intersection, then the fundamental group of the union is a quotient of the free froduct of the fundamental groups of the twoorigianl sets.

so in particular a [quotient of the] free product of two trivial groups is trivial.


does this do it for you? if not, matts description may be more clear. i.e. just visualize shrinking loops.

So it is then...

I've visualized incorrect claims also, so wasn't sure.
 
  • #14
see if you can believe it. try to visualize it.
 

Similar threads

  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 3 ·
Replies
3
Views
3K
  • · Replies 6 ·
Replies
6
Views
4K
  • · Replies 4 ·
Replies
4
Views
3K
  • · Replies 15 ·
Replies
15
Views
3K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 1 ·
Replies
1
Views
3K
  • · Replies 6 ·
Replies
6
Views
3K
  • · Replies 38 ·
2
Replies
38
Views
5K
  • · Replies 0 ·
Replies
0
Views
3K