[Note: It’s been a while!  I’ve now completed most of my pre-research stuff for my degree, so now I can relax a bit and write up some topics.  This post will be relatively short just to “get back in the swing of things.”]


In Group Theory, the big question used to be, “Given such-and-such is a group, how can we tell which group it is?”




The Sylow Theorems (proved by Ludwig Sylow, above) provide a really nice way to do this for finite groups using prime decomposition.  In most cases, the process is quite easy.  We’ll state the theorems here in a slightly shortened form, but you can read about them here.  Note that subgroup which is of order p^{\beta} for some \beta is unsurprisingly called a p-subgroup. A p-subgroup of maximal order in G is called a Sylow p-subgroup.


Theorem (Sylow).  Let G be a group such that |G| = p^{\alpha}m for p\not| m.  Then,

  1. There exists at least one subgroup of order p^{\alpha}.
  2. The Sylow p-subgroups are conjugate to one-another; that is, if P,Q are Sylow p-subgroups, then there is some g\in G such that gPg^{-1} = Q.  Moreover, for all g\in G, we have that gPg^{-1} is a Sylow p-subgroup.
  3. The number of Sylow p-subgroups of G, denoted by n_{p}, is of the form n_{p} \equiv 1\mbox{ mod } p.  In other words, n_{p} divides m.


This first part says that the group of Sylow p-subgroups of G is not empty if p divides the order of G.  Note that this is slightly abbreviated (the second part is actually more general, and the third part has a few extra parts) but this will give us enough to work with.


Problem: Given a group  |G| = pq for p,q prime and p < q, is G ever simple (does it have any nontrivial normal subgroups)?  Can we say explicitly what G is?


We use the third part of the Sylow theorems above.  We note that n_{q} | p and n_{q} \equiv 1\mbox{ mod } q, but p < q so this immediately implies that n_{q} = 1 (why?).  So we have one Sylow q-subgroup; let’s call it Q.  Once we have this, we can use the second part of the Sylow theorem: since for each g\in G we have gQg^{-1} is a Sylow q-subgroup, but we’ve shown that Q is the only one there is!  That means that gQg^{-1} = Q; this says Q is normal in G.  We have, then, that G isn’t simple.  Bummer.

On the other hand, we can actually say what this group is.  So let’s try that.  We know the Sylow Q-subgroup, but we don’t know anything about the Sylow P-subgroups.  We know that n_{p} \equiv 1\mbox{ mod }p and n_{p} | q, but that’s about it.  There are two possibilities: either n_{p} = 1 or n_{p} = q.

For the first case, by using the modular relation, if p does not divide q-1 then this forces n_{p} = 1; this gives us a unique normal Sylow p-subgroup P.  Note that since the orders of our normal subgroups multiply up to the order of the group, we have PQ \cong P\times Q \cong G; in other words, G \cong {\mathbb Z}_{p}\times {\mathbb Z}_{q}.

For the second case, n_{p} = q.  We will have a total of q subgroups of order p and none of these are normal.   This part is a bit more involved (for example, see this post on it), but the punch line is that it will be the cyclic group {\mathbb Z}_{pq}.


I’ll admit that the last part is a bit hand-wavy, but this should at least show you the relative power of the Sylow theorems.  They also come in handy when trying to show something either does or does not have a normal subgroup.  Recall that a simple group has no nontrivial normal subgroups.


Question.  Is there any simple group with |G| = 165?


I just picked this number randomly, but it works pretty well for this example.  We note that |G| = 165 = 3\cdot 5\cdot 11.  Let’s consider, for kicks, n_{11}.  We know n_{11} must divide 3\cdot 5 = 15 and it must be the case that n_{11} \equiv 1\mbox{ mod } 11; putting these two facts together, we get n_{11} = 1.  This immediately gives us a normal subgroup of order 11, which implies there are no simple groups of order 165.


Question.  Is there any simple group with |G| = 777?


Alas, alack, you may say that 777 is too big of a number to do, but you’d be dead wrong.  Of course, 777 = 3\cdot 7\cdot 37.  Use the same argument as above to show there are no simple groups of this order.


Question.  Is there any simple group with |G| = 28?


Note that 28 = 2^{2}\cdot 7 so we need to do a little work, but not much.  Just for fun, let’s look at n_{7}.  We must have that it is 1 modulo 7 and it must divide 2^{2} = 4.  Hm.  A bit of thinking will give you that n_{7} = 1, which gives us the same conclusion as above.


Of course, there are examples where this doesn’t work nicely.  Think about the group of order 56, for example.  In order to work with these kinds of groups, one must do a bit more digging.  We will look into more of this later.


[Note: It’s been too long, mathblog!  I’ve been busy at school, but I have no plans to discontinue writing in this thing.  For longer posts, you’ll have to wait until I have some free time!]


You’ve probably seen a graph before: they’re collections of vertices and edges pieced together in some nice way.  Here’s some nice examples from wikipedia:

File:McGee graph.svg

File:Moser spindle.svg



One theorem that I constantly run into (mainly because it’s relevant to homology) is the following:


Theorem.  Given some connected finite graph G, there exists a spanning tree of G.


Note that such a tree is not generally unique.  You might want to find one or two in the graphs above to prove this to yourself!  Nonetheless, even though this proof seems like it would be a bit intimidating (or, at least, by some sort of tedious construction), it’s actually quite nice.  Let’s go through it.


Proof. We’ll prove this by the number of cycles in G.  If G has no cycles then it is, itself, a tree; hence, G is its own spanning tree.  Suppose now that any graph with n cycles has a maximum spanning tree.  Given some graph with n+1 cycles, take any one of these cycles and delete any edge (but not deleting the vertices!).  This reduces the number of cycles by (at least) one, so there is a spanning tree by induction.  In fact, since we have not deleted any vertices, we may replace the edge we removed and this tree will still span the graph.  \Box


A couple of questions about this for the eager reader.  Where did we use connectedness?  Where did we use finite-ness?  What if we were given an infinite graph?  Is there a nice notion of cycles for this kind of graph?  Draw some pictures and think about it!

While I’m finishing up the Baire Category post, let’s have a little fun.  Here’s a game I like to play when I’m in my office hours and have literally nothing else to do.  I call it, “Two Turtles Playing With A Hammer.” 

The game is simple.


  1. Pick a number (or, have a friend pick one for you!).  It’s more fun if you pick a number that’s a well-known irrational or transcendental number.  Let’s call this number \alpha
  2. Pick a natural number (for example, 4 or 12).  Usually, 2, 3, 4, or 6 give the nicest looking results.  Let’s call your number n.
  3. The point of the game is to approximate \alpha using a sequence that looks like this:


\displaystyle\frac{\pi^{n}}{b_{1}} + \frac{\pi^{n}}{b_{2}^{2}} + \frac{\pi^{n}}{b_{3}^{3}} + \dots


where all the b_{i}’s are natural numbers.  If this is not possible to do, you lose.  Else, you win!  [Of course, you can feel free to make your own game where this is an alternating sequence.]


An example.  Let’s just do one that I played around with a bit:


(\pi^4)/57 + (\pi^4)/67^2 + (\pi^4)/37^3 \approx \sqrt{3}.


Of course, the game is rather pointless, but you can say to your friends, “Look at this!  This crazy sum of stuff is pretty dang close to \frac{\sqrt{2}}{2}.”  They’ll be impressed.


[Note: It may be a good (undergraduate-level) exercise to think about the following: given that we only add terms, and given that the denominators must be elements of the naturals, then (given some n) what numbers can we make from these sequences?  What if we also set one of the b_{i}’s in the assumption (for example, making b_{3} = 5)?]


Edited: I fixed the note above.  Another good undergraduate-level question is: what if we allow only one term to be subtracted; can we make any real number?  If they’re particularly good at programming, you could ask them to write a program that approximates any number to some number of places with such a sequence (either from the game or using a single subtracted term).

Baire Category Theorem.

January 5, 2012

During one of my previous qualifying exams, one of the questions looked, at first, to be a basic Fourier Analysis question.  The hint, though, was to use the Baire Category Theorem.  The problem and hint looked so unrelated that the phrase has become somewhat of a running joke for some of us in the department (“How are we going to prove this is a cofibration?”  “Oh, easy, just use the Baire Category theorem.”).

The more I read about it, the more I realized that the Baire Category theorem pops up much more than I realized and in a number of surprising and diverse topics.  This post is just to introduce you to the BCT and to show off some of its raw power.  One of the results below is one that I genuinely don’t believe — that is, I know it has to be true (it was proved!) but it just seems so outrageous that I can’t being myself to believe it!  But, we’ll get to that.


Leading up to the Theorem.

There are a few different formulations of the theorem, so I’ll pick the one that turns out to be most common in what I’ve read.  First, let’s quickly define some terms.


Definition.  A complete metric space is a metric space where each Cauchy sequence converges to a point in the space.


For example, {\mathbb R} is complete, but {\mathbb Q} is not complete since in the latter space we can take a sequence like: 1, 1.4, 1.41, 1.414, … which are all rational numbers that converge to \sqrt{2}, but \sqrt{2} isn’t in the rational numbers.


Definition.  A subset of a space is dense if the closure of the subset is the entire space.


For example, {\mathbb Q} is dense in {\mathbb R} since the closure of {\mathbb Q} is {\mathbb R}.  The irrationals are also dense in {\mathbb R}.  The integers, {\mathbb Z}, are not dense in {\mathbb R} because the closure of the integers in {\mathbb R} is just {\mathbb Z} (why?).


Q: What are the dense subsets of a non-empty discrete space?  Does this make sense “visually”?


Definition.  The interior of a subset Y is the largest open set contained in Y.  In metric spaces, it’s the union of all the balls contained in Y.


The next definition might be a little strange if you haven’t seen it before and, in fact, there are two nice (equivalent) ways of thinking about this concept.  I’ll list both.


Definition.  A set Y is nowhere dense in some space X if either (and hence both):

  1. The interior of the closure of Y in X has empty interior.
  2. \overline{Y^{C}} = X; that is, the closure of the compliment of Y is dense in X.


This last definition might seem a bit strange to you, but the “image” of this is the following: a nowhere dense set is literally a set which is not dense anywhere — but what does that mean?  Density isn’t usually considered a local property.  How do we usually check density, though?  We take the closure of the set and if it’s the whole space then we say the set is dense.  If we wanted to make this more “local”, what we could say is that we don’t get any neighborhoods of the whole space.  This is the same as saying the closure of our subset has no open neighborhoods inside of it or that it has empty interior.  This givers us the first definition.  The second is a direct consequence which is sometimes more useful to think about depending on your original subset.


Example.  We have {\mathbb Z}\subseteq {\mathbb R} with the standard topology.  Is {\mathbb Z} nowhere dense in {\mathbb R}?  Note that \bar{{\mathbb Z}} = {\mathbb Z} and this has empty interior.  By the first definition, {\mathbb Z} must be nowhere dense in {\mathbb R}.  If we wanted to use the second definition, we could say that the compliment of {\mathbb Z} in {\mathbb R} is just everything but the integers; but the closure of this is {\mathbb R} which means the compliment of {\mathbb Z} is dense in {\mathbb R} giving us the same conclusion.  This is not surprising, since the elements of {\mathbb Z} are “pretty far apart” in {\mathbb R}.


Example.  Our favorite limit-point example, Y = \{\frac{1}{k}\,|\, k\in {\mathbb N}\} is a subset of {\mathbb R}.  Is it nowhere dense?  Using the first definition, the closure is just Y\cup \{0\} which has empty interior (why?).  With the second definition, the compliment of Y has closure equal to {\mathbb R} and so it is dense.  In either case, this proves that Y is nowhere dense in the reals.


Example.  The ball (0,1)\subseteq {\mathbb R}.  The closure of this set is [0,1] which has interior equal to (0,1).  Therefore, this set is not nowhere dense.  That’s a bit sad.  But you can see that this set really is “somewhere dense” visually.


Example.  The Cantor set is closed (there are a number of cute ways to prove this) so to show it is nowhere dense in [0,1] it suffices to show that it has empty interior by the first definition.  Prove it!


You may have been surprised with the last example, or even the \frac{1}{k} example.  For the latter one, it seems like the points are really “getting close” to 0, so maybe some density should occur; it’s not the case, though!  For the Cantor set, many points in this set can be “very close” to one-another so it is a bit surprising that this set is not dense anywhere.  If one goes through the construction slowly, you’ll see why the points are “just far enough apart” to reasonably be considered (that is, intuitively considered) nowhere dense.


The Theorem.

Why would we ever care about nowhere dense sets?  Well, they’re kind of crappy in the following sense: even if we unioned a countable number of nowhere dense subsets together, we could never recover the original set.  An analogy from anthropology would go like this: we might be able to find tons of copies of some ancient book, but if each of them are missing a whole lot (nowhere dense) then even combining them all together we can’t recover the original manuscript.


Oh.  And why do jigsaw puzzle makers make each of the puzzle pieces look like that?


Because if they made them nowhere dense, we would never be able to finish the puzzle.  Buh-dum-tsh.


Theorem (Baire Category Theorem).  A non-empty complete metric space is not the countable union of nowhere dense sets.


This shouldn’t be too scary to you at this point.  Let’s do some immediate consequence examples.


Example.  Do you think we could union a countable number of things that look like {\mathbb Z} together and get something like the real numbers?  That is, maybe we could take

{\mathbb Z} = \{\dots, -1,0,1,2,\dots\}

{\mathbb Z} + \frac{1}{2} = \{\dots, -\frac{1}{2}, \frac{1}{2}, \frac{3}{2}, \frac{5}{2},\dots\}

{\mathbb Z} + \frac{1}{3} = \{\dots, -\frac{2}{3}, \frac{1}{3}, \frac{4}{3}, \frac{7}{3},\dots\}

and so on, and union them all together to make {\mathbb R}.

Nope.  The BCT says to not even try.  Each of these translates of {\mathbb Z} is nowhere dense, so a countable union of them would not get you {\mathbb R}.


Non-Example.  What if we did the same thing as above, but we wanted to union them all together to get {\mathbb Q}, the rationals.  What would Baire say about that?  Probably, “Don’t use my theorem with this, because {\mathbb Q} isn’t a complete metric space.”


Non-Example.  What if we tried the same thing with the {\mathbb Z} translates above as subsets of {\mathbb R}, but we union them all and then union that with the irrational numbers.  In this case, too, we can’t use Baire, because the irrational numbers are actually dense in the reals; the BCT doesn’t say anything about unions with dense subsets.


Example.  What if we have a complete metric space with no isolated points?  Can it be countable?

(Recall, an isolated point is one which has a neighborhood not containing any other point of the space.  For example, if we took \{0\}\cup [1,2] in the subspace topology of the reals, then \{0\} is an isolated point of this subspace since it, itself, is open and it contains no other point of the subspace.)

In this case, we can cleverly use the BCT to show that every complete metric space with no isolated points is uncountable.  Suppose it were countable.  Then every point of the space is nowhere dense (!  Why is this the case?  What is the closure of a point?  What is its interior?  Does this argument show why we cannot have isolated points?).  But since our space is countable, it is the countable union of its points, each of which is nowhere dense.  Baire would have a real problem with that.  This contradicts BCT, so such a space must be uncountable.


Why is it called the “Category” theorem?

This “category” isn’t the same category as in category theory.  The term comes from the original language that the theorem was stated in.  It’s a bit ugly, so I’ve yet to mention it, but I might as well spell it out for you now:

  • We call a set of First Category if it can be written as a countable union of nowhere dense sets.  This is also called a meagre set.  (Amusingly, the meagre is also the name of a fish.)  Sometimes this is Americanized (that is, bastardized) and pronounced as “meager set” which would mean something like, “thin set” or “set having little substance” which is, intuitively, what this set should “look” like.
  • We call a set of Second Category if it is not of first category.


We also have what’s called a Baire Space, which is just a space where every non-empty open set is of second category.  This means, intuitively, that an open set needs to have some “density” to it.  The original Baire Category theorem stated that every complete metric space is a Baire Space.  This is “almost” equivalent to what we have above; see below.


Other Formulations of the BCT.

There are three distinct formulations of the BCT that are generally given (the texts  I have in my office give at most two, but the third is a consequence of the first so this is perhaps why).  Right above this, we give one of them.


BCT (1).  Every complete metric space is a Baire space; that is, every open subset in a complete metric space is not the countable union of nowhere dense sets.

BCT (3).  Every complete metric space is not the union of nowhere dense sets.


I list these together because it’s clear that the third is a consequence of the first.  (These numbers are because the second BCT is actually called “the second BCT” in a few places.)


BCT (2).  Every locally compact Hausdorff space is a Baire space.  Recall that locally compact means that every point of our space has a compact neighborhood.


Note that it’s not the case that the first BCT implies the second, and it’s not the case that the second implies the first.  It would be nice if there were some meta-BCT that implied both of them, but when we write down exactly what we need for something to be a Baire space, we’re left with a couple of choices; if you’re interested in this, you should check out the proofs for both of these theorems and see where we’re using locally compact verses where we’re using complete.

A Surprising Result.

One of the coolest results I’ve seen using the BCT (and, indeed, one of the coolest results I’ve seen perhaps in general) is the following.


Maybe, first, it’s nice to ask the following question (that you can even ask to your friends!): what’s your idea of a “general” continuous function?  That is, just think of the most generic continuous function you can.  Visualize it.  Maybe draw it.  What do you have?  Probably some sort of polynomial.  (When I do this, I actually draw fifth degree polynomials most of the time.)  Is this really so generic?


First, let’s just define exactly what we mean by “generic.”


Definition.  If A is a subset of some space X, the compliment of A is nowhere dense, and all points in A share some property, then we call this property generic of X.


This should be reasonable: something genertic should be representative of the whole.  That is, if something is not generic, then it should not happen very often; in our language, the set of non-generic things should be nowhere dense.


Theorem (Banach, Mazurkiewicz, 1931).  The generic (in the sense of the above definition) continuous function on a compact interval (that is, f\in C^{0}([a,b],{\mathbb R})) is nowhere differentiable, and not monotone on any subinterval of [a,b].


Just think about that for a second.  Let it sink in.  Nowhere differentiable is strange enough; we can (and will) use the BCT to talk about a nowhere differentiable function.  But, what’s more, it’s not monotone on any subinterval, no matter how small.  And, yes, this function is generic.  What.


As a note, somewhat strangely, because of the above definition of “generic” it is entirely possible to have two different kinds of “generic” things representing some space.  The definition doesn’t say anything about the generic property being unique and, in general, it isn’t.



BCT in Functional Analysis.

to do.

Whenever I talk to students who have had basic point-set topology, I’m not surprised if they haven’t seen the BCT; it’s near the end of the point-set part of Munkres, and one natural stopping point for a semester-long point-set class is Urysohn’s lemma which is done before BCT. I don’t remember learning the BCT in point-set when I took it and it wasn’t until Functional Analysis that I had to study it again. This is a shame for a few reasons, but I wanted to point out just two.

  1. This theorem is able to be proved (or at least stated) after complete metric spaces are defined and would take only around one lecture to do with applications. Depending on the speed of the professor and the way one works through the book, one probably gets to metric spaces around the middle of the semester. The students have had analysis, and are, therefore, familiar with completeness (or, at worst, they’re comfortable with Cauchy sequences!) so it is not difficult to define complete metric spaces. What else would we need? Nowhere-dense sets. That’s all.
  2. This can be a great “visual” theorem in some spaces. One common problem point-set topology students seem to have is that they will work through definitions without developing any kind of intuition behind what something is (eg, limit points). Therefore, it’s nice to learn properties of spaces we know and love. The BCT is easily applied to the reals, the irrationals, the rationals, and the cantor set. It also is a great brain-stretching exercise to think about how “close” points can be in a nowhere dense set on the real line.

This may be a non-issue for those of you whose point-set class included this, but I wanted to point is out nonetheless. I would go as far as saying that this is “more important” to cover in a first course in point-set than the proof of Urysohn’s lemma [which is the first “deep” result in Munkres]. Of course, the proof is important, but in an introductory course I feel that proving Urysohn’s lemma for metric spaces and stating it for general spaces is a better way to go. Feel free to disagree and yell at me!


Edit: This rant used to be part of the BCT post I made recently, but because it’s not really mathematics and more about teaching I decided to post it on its own so I don’t have to subject everyone to reading my rants. 

I’m going through a few books so that I can start doing lots and lots of problems to prepare for my quals.  I’ll be posting some of the “cuter” problems.


Here’s one that, on the surface, looks strange.  But ultimately, the solution is straightforward.


Problem.  Find an uncountable subset A\subseteq [0,1] such that A - A = \{a - b\,\mid\,\,a,b\in A\} has empty interior.


Read the rest of this entry »

I just saw this problem in a book of algebra problems, and I thought it was nice given one of the previous posts I had up here.


Problem.  Show that 11, 111, 1111, 11111, … are not squares.


You ought to think about this for a bit.  I started by supposing they were squares and attempting to work it out like that; unfortunately, there are some strange things that happen when we get bigger numbers.  But.  You should see a nice pattern with the last two digits.  Click below for the solution, but only after you’ve tried it!

Read the rest of this entry »

After proving this "Deep Result" [cf. Munkres] a professor will (hopefully) say something like: "Yes, the proof is important, but what does this theorem mean?  And what does it mean for spaces which are sufficiently nice, like metric spaces?"

Let’s state the result just so we’re all on the same page.


Theorem.   The topological space X is normal (that is, every pair of disjoint closed subsets A, B can separated by disjoint neighborhoods) if and only if any two disjoint closed sets can be separated by a function.


The proof of this is not obvious.  In fact, it is quite involved.  But if X happens to be a metric space, we can make the proof significantly easier by using a function that is similar to a distance function with a few minor modifications.  I call this function the standard Urysohn function for metric spaces for lack of a better (or shorter) name.  The function is as follows:

\displaystyle f(x) = \frac{d(x,A)}{d(x,A) + d(x,B)}

but before proving this theorem in the metric space setting, let’s look at this function.  If A,B are disjoint, then it is clear that the denominator is non-zero (why?) so this is defined everywhere.  If x\in A we have that this function evaluates to 0.  If x\in B then we have that this function evaluates to 1.  And the function (since the distance is always non-negative) achieves values in (0,1) for every point not in A or B (convince yourself that this function is continuous and only achieves the values 0 and 1 if the point is in either A or B respectively).  This function, therefore, separates A and B

The next thing you should think about is: what do the preimages of f look like?  Draw some pictures!  Here’s some pictures to start you off to get the idea.  The first is just in {\mathbb R} and the second is in the real plane.  Both have the standard topology.



This one is potentially not to scale, but you’ll see that we essentially have a linear relation (since the sum in the denominator will always be 1 in this case) except when we start looking at points that are less than all the points in A or greater than all the points in B.  What happens in those cases?



I’ve left this "face" as an exercise because when I did it I was kind of excited about the result.  What do the preimages look like?  Does this look like something you’ve seen before; maybe in physics?  Could you modify the Urysohn equation above to make it seem MORE like something in physics? 


So now that you’ve seen these pre-images, it should be relatively clear how to create neighborhoods around each of the open sets.  It still takes a bit of proof, but it’s nowhere near the difficulty of the standard Urysohn’s.


I encourage you, further, to draw some pictures.  My rule of thumb is: draw at least five different pictures; four easy ones and a hard one.  Find out where the preimages are in each of these.  Remember, too, that not every metric space looks the same; what would this look like, for example, in the taxi-cab space?  Or in some product space?  Or in the discrete space…?

Factorials and Exponentials.

November 6, 2011

I’ve been working on a problem (here is a partial paper with some ideas) that’s really easy for any calculus student to understand but quite difficult for even wolfram alpha to work out some cases.  Here’s the idea:

We know that \lim_{n\to\infty}\dfrac{e^n}{n!} = 0.  It’s not hard to reason this out (there are some relatively obvious inequalities, etc.), but I wanted to know what happened if we considered something like:


It turns out, this goes to infinity.  Maybe this is not so surprising.  But, to balance this out, I thought maybe I could add another factorial on the bottom.  What about


where this double factorial is just n! with another factorial at the end.  It turns out, this one goes to 0. 


The problem here is that after ((n!)!)!, Mathematica doesn’t seem to be able to handle the sheer size of these numbers.  Consequently, I only have a few values for this.  I’ve included everything I have in a google-doc PDF (the only way I can think to share this PDF), and I’m looking for suggestions.  Here’s some things I thought of:


  • Stirling’s formula.  Unfortunately, this starts to get very complicated very quickly, and if you consider subbing it in for even ((n!)!)! it can take up a good page of notes.  It also doesn’t reduce as nicely as I’d like.
  • Considering the Gamma function.  It may be easier to work with compositions of the gamma function since it is not discrete and we may be able to use some sort of calculus-type things on it.
  • Number Crunching.  For each of these cases, it seems like there is a point where either the numerator or the denominator "clearly" trumps over the other; this is not the "best" method to use, but it will give me some idea of which values potentially go to infinity and which go to zero.
  • Asymptotics.  I’m not so good at discrete math or asymptotics, so there may be some nice theorems (using convexity, maybe?) in that field that I’ve just never seen before.  Especially things like: if f\sim g then f\circ f \sim g\circ g under such-and-such a condition.


Feel free to comment below if you think of anything.

Nested Kind of Topology.

October 16, 2011

In the last post, I posted a topology on \{1,2,3,\dots, k-1\} where the open sets were

\{\emptyset , \{1\}, \{1,2\}, \{1,2,3\},\dots, \{1,2,3,\dots, k-1\}\}

You can check that this is, in fact, a topology and it, in fact, has exactly k elements.  But this is also a really nice topology for intro-topology students.  Why?  Because it has some strange properties which are easy to get your hands on and prove!  Let’s show some of these.  For the sake of brevity, let’s call this topology P.


P is not Hausdorff.

This is easy to see.  Pick the elements 1 and 2.  The only set which contains 1 but not 2 is \{1\}, but there is no set which contains 2 but not 1. 


P is T_{0}.

Two points are topologically indistinguishable if they have exactly the same neighborhoods; a T_{0} space is one where each point is topologically distinguishable.  It is trivial to check that this holds.


P is connected.  (!)

This is somewhat surprising to me (especially because of how disjoint it "seems"!) but if we attempt to find a separation we find that it is impossible: every open set contains 1 except the empty set, so, in particular, no two open sets have trivial intersection unless one is empty.


A function f:{\mathbb R}\rightarrow P is continuous if and only if the sets of all x which map to n\in \{1,2,3,\dots, k-1\} are open (in the standard topology on {\mathbb R}

This is simply taking preimages.  I mention it because actually DRAWING the function on the "plane" (where the "x-axis" is {\mathbb R} and the "y-axis" is \{1,2,3,\dots, k-1\} we get something which does not at all look continuous (unless it is constant —).  This is perhaps a good exercise for intro topology students to work out so that they can see that not all continuous maps "look" continuous.  Of course, there are many other ways to see this using other spaces.


Limits?  What about the sequences in this set?  Let’s remind ourselves what convergence is:  \{x_{n}\}\rightarrow x if for every open set U containing x there is some N such that for all n\geq N we have x_{n} \in U.  Note then that:

\{1,1,1,1,1,\dots\} converges to 1.

\{2,2,2,2,2,\dots\} converges to 2.

and so on.  But then we have

\{1,2,1,2,1,\dots\} which converges to 2, but not to 1 (why?).

\{1,2,3,1,2,3,\dots\} which converges to 3, but not to 2 or 1 (why?).

and so forth.  In fact, if we have an infinite number of the numbers n_{1}, n_{2}, \dots, n_{r}\in \{1,2,\dots, k-1\} then this sequence will only converge to \max(n_{1}, n_{2}, \dots, n_{r}) which is kind of a neat characterization.  In fact, this takes care of most (all?) of the sequences. 


Limit Points?  A limit point p of a subset A is a point such that for every open U containing p we have A \cap (U-\{p\}) \neq \emptyset

Consider the subset A = \{1\} and let’s see if there are any limit points.  What about 2?  Well, we have that \{1,2\} - \{2\} = \{1\} so the intersection of this with A is nontrivial.  Similarly, the other open sets containing 2 have nontrivial intersection with A which includes more than the element 2.  What about 3?  Same deal.  And 4?  Yes.  So we can now ask: what’s the closure of \{1\}

Consider A = \{1,2\} and we will start looking at the element 3.  Is 3 a limit point?  For the same reasons above, it is.  So what is the closure of this set? 

Let’s be a little adventurous and ask what about A = \{1, 3\}.  For the same reasons as above, 4,5,6\dots, k-1 are all limit points, but what about 2?  In fact, it is.

Last, (and this will complete our "characterization" of the closures of our subsets) what about A = \{2,3\}.  Clearly we will have 4, 5, 6, \dots, k-1 as limit points, but the odd one out is 1.  And 1 is not a limit point (why not?).  That’s a bit sad.  So, taking the least element in the subset allows us to describe the closure: it’s the set of every element greater than or equal to it.


Closed sets.  It’s a bit interesting to think up what sets we got from taking the closures of each subset, and then to just start with our open sets and take compliments.  Do we get the same thing?  Neato.


Compactness?  A bit trivial in this case.  Why?  (Maybe extending to infinite things would make this cooler…)


Here’s something weird, too: what is a path in this space?  What is a loop?  How could we construct something like the fundamental group for this?  Homology groups?  To those with more experience, these questions might be easy; but it is not obvious to me (at least at this point!) how these constructions should go.