Can a subbasis help determine which topology is finer?

  • Thread starter Thread starter Bashyboy
  • Start date Start date
Bashyboy
Messages
1,419
Reaction score
5

Homework Statement


If two different topologies on a given space ##X## are given by a basis, then we have the following criteria for determining which topology is finer:

Let ##\mathcal{B}## and ##\mathcal{B}'## be bases for the for topologies ##\tau## and ##\tau'##, respectively, on ##X##. Then the following are equivalent:

(1) ##\tau \subseteq \tau'##

(2) For each ##x \in X## and each basis element ##B \in \mathcal{B}##, there is a basis element ##B' \in \mathcal{B}'## such that ##x \in B' \subseteq B##.

Homework Equations

The Attempt at a Solution



I am wondering, do we have a similar criteria if the two topologies are given by a subbasis ##\mathcal{S}## and ##\mathcal{S}'##? My motivation for asking this question is that I am trying to show that ##\{Y \cap S ~|~ S \in S \}## forms a subbasis for the subspace topology on ##Y \subseteq X##, and I thought that it might help me in proving this.
 
Physics news on Phys.org
Do you mean by subbasis ##\mathcal{S}## a basis of the from ##(X,\mathcal{B})## induced topology of ##Y##?
 
Here is the definition of subbasis with which I am working:

A subbasis ##\mathcal{S}## for a topology on ##X## is a collection of subsets of ##X## whose union equals ##X##. The topology generated by the subbasis ##\mathcal{S}## is defined to be the collection ##\tau## of all unions of finite intersections of elements in ##\mathcal{S}##.
 
I can't see any problems. The topology generated by the sets of ##\mathcal{S}## is the least finest topology which contains these sets. Refinements thus should be possible to define analogously if everything is done with rigor. (But as topology is notoriously strange, I would be delighted to learn something new.)
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...

Similar threads

Back
Top