Author Archives: limsup

Topology: Subspaces

First, suppose (X, d) is a metric space. If Y is a subset of X, then one can restrict the metric to , i.e. for any , we set d’(y, y’) := d(y, y’). It’s not hard to show that the resulting function is a metric on Y. … Continue reading

Posted in Notes | Tagged , , , , , , , | Leave a comment

Topology: Bases and Subbases

Bases Recall that though a subring or ideal of a ring may be rather huge, it often suffices to specify just a few elements which will generate the subring or ideal. Likewise, in a topology,  one can specify a few … Continue reading

Posted in Notes | Tagged , , , , , , , | Leave a comment

Topology: Basic Definitions

Motivation and Definition While studying analysis, one notices that many important concepts can be defined in terms of “open sets”. One gets the inkling that this concept is critical in forming our notions of continuity, limits etc. In this article, we … Continue reading

Posted in Notes | Tagged , , , , , , , | Leave a comment

Burnside’s Lemma and Polya Enumeration Theorem (2)

[ Acknowledgement: all the tedious algebraic expansions in this article were performed by wolframalpha. ] Counting Graphs One of the most surprising applications of Burnside’s lemma and Polya enumeration theorem is in counting the number of graphs up to isomorphism. … Continue reading

Posted in Notes | Tagged , , , , , , , , | Leave a comment

Burnside’s Lemma and Polya Enumeration Theorem (1)

[ Note: this article assumes you know some rudimentary theory of group actions. ] Let’s consider the following combinatorial problem. Problem. ABC is a given equilateral triangle. We wish to colour each of the three vertices A, B and C by … Continue reading

Posted in Notes | Tagged , , , , , , , | Leave a comment

Basic Analysis: Closed Subsets and Uniform Continuity

Let’s consider another question: suppose f : D → R is continuous, where D is a subset of R. If (xn) is a sequence in D converging to some real L, is it true that (f(xn)) is also convergent? Now if L is in D, then we know that (f(xn)) → (f(L)). … Continue reading

Posted in Notes | Tagged , , , , , , | Leave a comment

Basic Analysis: Uniform Convergence

Once again, let be a subset. Suppose we now have a sequence of functions , where n = 1, 2, 3, … , such that for each x in D, the sequence converges to some real value. We’ll denote this value by f(x), thus … Continue reading

Posted in Notes | Tagged , , , , , , | 1 Comment

Basic Analysis: Differentiation (2)

Finding Extremum Points One of the most common applications of differentiation is in finding all local maximum and minimum points. Definition. We say f(x) has a local maximum (resp. minimum) at x=a, if there is an open interval (b, c) containing a, such … Continue reading

Posted in Notes | Tagged , , , , , | Leave a comment

Basic Analysis: Differentiation (1)

In this article, we’ll look at differentiation more rigourously and carefully. Throughout this article, we suppose f is a real-valued function defined on an open interval (b, c) containing a, i.e. f : (b, c) → R with b < a < c. Theorem. The derivative of f(x) at a is … Continue reading

Posted in Notes | Tagged , , , , , | Leave a comment

Basic Analysis: Limits and Continuity (3)

Let’s consider multivariate functions where . To that end, we need the Euclidean distance function on Rn. If x = (x1, x2, …, xn) is in Rn, we define: Note that |x| = 0 if and only if x is the zero vector 0. Now we are ready … Continue reading

Posted in Notes | Tagged , , , , , , , | Leave a comment