Disconnected Sets .... Palka, Lemma 3.1 ....

  • Context: MHB 
  • Thread starter Thread starter Math Amateur
  • Start date Start date
  • Tags Tags
    Sets
Click For Summary
SUMMARY

The discussion centers on proving Lemma 3.1 from Bruce P. Palka's "An Introduction to Complex Function Theory," specifically regarding the non-emptiness and disjoint nature of the sets S and T. The sets S and T are defined as S = A ∩ U* and T = A ∩ V*, where U* and V* are disjoint open sets. The proof demonstrates that if z is in A ∩ U*, then it cannot be in A ∩ V*, confirming that S and T are non-empty and disjoint as required.

PREREQUISITES
  • Understanding of basic set theory and topology
  • Familiarity with the concepts of open sets in topology
  • Knowledge of the definitions of disconnected sets
  • Ability to follow mathematical proofs and logical reasoning
NEXT STEPS
  • Review the definitions and properties of disconnected sets in topology
  • Study the proof techniques used in complex analysis, particularly in Palka's work
  • Explore the implications of Lemma 3.1 in the context of complex function theory
  • Examine additional examples of non-empty disjoint sets in mathematical literature
USEFUL FOR

Mathematics students, particularly those studying complex analysis, as well as educators and researchers interested in topology and its applications in function theory.

Math Amateur
Gold Member
MHB
Messages
3,920
Reaction score
48
I am reading Bruce P. Palka's book: An Introduction to Complex Function Theory ...

I am focused on Chapter 2: The Rudiments of Plane Topology ...

I need help with some aspects of the proof of Lemma 3.1 ...

Lemma 3.1 and its proof read as follows:View attachment 7373
View attachment 7374

In the above text from Palka Section 2.2 we read the following:" ... ... The sets $$S$$ and $$T$$ are non-empty - $$S$$ contains $$A \cap U^*$$ and $$T$$ contains $$A \cap V^* $$ - and disjoint. ... ... "I am trying to show/demonstrate rigorously that the sets $$S$$ and $$T$$ are non-empty - $$S$$ contains $$A \cap U^*$$ and $$T$$ contains $$A \cap V^*$$ - and disjoint ... can someone please help ...?
Help will be much appreciated ...

Peter===================================================================================Readers of the above post will be assisted by having access to Palka's introduction to disconnected sets which includes the key definition ... so I am providing the same ... as follows ... :https://www.physicsforums.com/attachments/7375
 
Physics news on Phys.org
Peter said:
I am trying to show/demonstrate rigorously that the sets $$S$$ and $$T$$ are non-empty - $$S$$ contains $$A \cap U^*$$ and $$T$$ contains $$A \cap V^*$$ - and disjoint ... can someone please help ...?
If $z\in A\cap U^*$ (which is a nonempty set) then $z\notin A \cap U^*\cap V^*$ (because $A \cap U^*\cap V^*$ is empty). In particular, $z\notin V^*$. Therefore $z \in (A \cap U^*)\sim V^* \subseteq U^*\sim V^* = S.$ That shows that $A\cap U^*\subseteq S$, so that in particular $S$ is nonempty. The proof that $A\cap V^*\subseteq T$ is similar.

The fact that $S$ and $T$ are disjoint follows from their definitions: $S = U^*\sim V^*$, which is contained in $U^*$. But $T = V^*\sim U^*$, which is contained in the complement of $U^*$.
 
Opalg said:
If $z\in A\cap U^*$ (which is a nonempty set) then $z\notin A \cap U^*\cap V^*$ (because $A \cap U^*\cap V^*$ is empty). In particular, $z\notin V^*$. Therefore $z \in (A \cap U^*)\sim V^* \subseteq U^*\sim V^* = S.$ That shows that $A\cap U^*\subseteq S$, so that in particular $S$ is nonempty. The proof that $A\cap V^*\subseteq T$ is similar.

The fact that $S$ and $T$ are disjoint follows from their definitions: $S = U^*\sim V^*$, which is contained in $U^*$. But $T = V^*\sim U^*$, which is contained in the complement of $U^*$.
Thanks Opalg ... most helpful post!

Peter
 

Similar threads

Replies
2
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
Replies
2
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 2 ·
Replies
2
Views
1K
Replies
2
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
Replies
2
Views
2K