Archive for the ‘Mathematics’ Category

A little (combinatorial) graph problem

Monday, July 14th, 2008

For what n is it possible to have a k-regular graph on n vertices?

I thought about this a little while last night: it’s equivalent to asking how many hollow (the diagonal is zero) symmetric binary n \times n matrices satisfy  \|Ae_i\|_1 = k for all i. I haven’t seen a way to exploit this equivalence, so maybe there is another approach that would be more fruitful.

A Sobolev inequality

Friday, July 11th, 2008

It turns out that if f is in W^{2,2}, \|Df\| \leq C \|D^2f\|^\alpha \|f\|^{1-\alpha} , where C,\alpha depend on the dimension. I have no idea how to prove this in general, and don’t really care.

BUT, it makes for a nice problem in the one-dimensional case. Show that if f \in W^{2,2}(\R) (i.e. its second derivative exists and both it and its first and second derivatives are square integrable), then \|f^\prime\| \leq C\|f^{\prime\prime}\|^\alpha \|f\|^{1-\alpha} , and find C,\alpha.

I haven’t a clue how to proceed, but it looks like mighty fun.

Update: the proof is, in retrospect (always in retrospect, damn it), obvious.

C[0,1] is not a metric space

Monday, July 7th, 2008

Show that there is no metric d on C[0,1] such that pointwise convergence and convergence in the metric coincide.

The Gelfand representation theorem

Friday, July 4th, 2008

I finally read up to the Gelfand representation theorem in Murphy’s book. This is such a beautiful mathematical result that I couldn’t resist the urge to share it. I tried to write this synopsis so anyone who understands the Banach-Alaoglu theorem should have no problem following the gist of it.

Recall that a (complex) Banach algebra is a (complex) Banach space with a multiplication operation which is continuous w.r.t. the norm. The Gelfand representation theorem says that we can represent an abelian Banach algebra A as the algebra of continuous functions on a locally compact Hausdorff space S. The important case to consider is that of a unital Banach algebra, one with an identity element; in this case, we can take the space to be compact. For the remainder, A will be a unital abelian complex Banach algebra.

The obvious question is, what is this space S? Can it be intrinsically connected to A, or is the proof nonconstructive? It turns out that S is a very natural space; in order to construct it, we need the concept of the spectrum of an algebra.

Let a \in A. We call the set  \sigma(a) = \{ \lambda \in \C : \lambda 1 - a \text{ is not invertible} \} the spectrum of a. One can think of the spectrum as a generalization of the eigenvalues of a square matrix or the range of a bounded function. Recall that a (continuous) homomorphism between two algebras is a linear map which preserves the multiplication operation. A character on A is a non-zero homomorphism between A and \C. Let \Omega(A) denote the set of characters on A; it turns out, magically, that \sigma(a) = \{ \tau(a) : \tau \in \Omega(A) \} for all a\in A.

One can show that \Omega(A) is a weak* closed subset of the unit ball of A*, and in fact if we give \Omega(A) the relative weak* topology, it is compact. From here it’s easy to guess that \Omega(A), the character space or spectrum of A, is the appropriate S. Given a \in A, define its Gelfand transform \hat{a} : \Omega(A) \rightarrow \C by \tau \mapsto \tau(a). By the choice of topology on the character space, each such functional is continuous (and in fact, vanishes at infinity).

The Gelfand representation theorem specialized to unital abelian complex Banach algebras then says

The map A \rightarrow C_0(\Omega(A)), \quad a \mapsto \hat{a} is a norm-decreasing homomorphism, and r(a) = \|\hat{a}\|_\infty for all a\in A. Furthermore, \sigma(a) = \hat{a}(\Omega(A)).

A Rademacher comparison theorem?

Monday, June 30th, 2008

Given Rademacher variables \epsilon_j , what can we say about
 \mathbb{E} \sup_{c > a_j \geq 0} \left|\sum_{i=1}^n \epsilon_j a_j \right| versus \mathbb{E} \sup_{c >a_j \geq 0} \sum_{i=1}^n \epsilon_j a_j ?

Anything?

Ideals in Banach algebras

Monday, June 30th, 2008

I came across the following statement while reading Murphy’s book (Theorem 1.3.1): “If I is a proper ideal in a Banach algebra, then \overline{I} is also proper.”

Quick recap: a Banach algebra is a Banach space with a multiplication operation, such that the norm is submultiplicative (\|ab\| \leq \|a\|\|b\|). A prototypical (non-abelian) finite dimensional Banach space is that of all n\times n matrices with the spectral norm, and a prototypical (abelian) infinite dimensional Banach space is that of all continuous functions on \R with the sup norm. An ideal is a vector subspace that ‘absorbs’ under multiplication: if a is in the space and b is in the ideal, both ab and ba are in the ideal. A proper ideal is one strictly contained in the ambient space.

This statement caught my eye because it gives a way in which ideals topologically differ from vector subspaces. It is easy to come up with examples of proper subspaces whose closures are the entire space; e.g. take the set of differentiable functions in the above infinite dimensional Banach space: every continuous function on \R is the uniform limit of differentiable functions, so the closure of this subspace is the space itself. It’s harder for me to come up with ideals nontrivially exemplifying the above statement.

The question is: exactly how does one use the multiplicative closure property of ideals to prove the above?

Some Schatten norm stuff

Tuesday, June 17th, 2008

Recall the Schatten p-norm of a matrix A:  \|A\|_p^p = \sum \sigma_i(A)^p, where \sigma_i(A) > \sigma_{i+1}(A) are the singular values of A. They’re interesting, among other reasons, because they’re unitarily invariant. Schatten and Von Neumann came up with these while investigating matrix analogues of the finite \ell_p spaces— they’re the \ell_p norms of the vectors of singular values.

Show that \|A\|_p^p = \text{trace}(|A|^p), where |A| = (A^\star A)^{(1/2)} is the modulus of the matrix.

Note that the Schatten 2-norm (aka Frobenius norm aka Hilbert-Schmidt norm) can be easily calculated \|A\|_2^2 = \sum_{i,j} |A_{ij}|^2, and is actually induced by the inner product \langle A, B \rangle = \text{trace}(A^\star B) . When A is positive, show that \|A\|_1 is also easily calculable: \|A\|_1 = \text{trace}(A).

Can you show that Schatten p-norms have the dual norms you’d expect from analogy with the usual \ell_p norms? It’s fun :)

Can you think of any other interesting properties of the Schatten norms?

Numerical Rank

Monday, June 16th, 2008

I spent today looking through several papers. Most of them were about finding graph sparsifiers by sampling– apparently this relates to a generalization of the sparsification problem I’ve been thinking about, where instead of looking for a sparsifier in the spectral norm, you look for one in the \infty \rightarrow 1 norm.

I snuck in a paper by Rudelson and Vershynin, to gain some familiarity with the more typical tools in this area, and came across the neat idea of the numerical rank of a matrix: r(A) = \frac{\|A\|_F^2}{\|A\|_2^2}. It’s clear that this satisfies 1/n \leq r(A) \leq \text{rank}(A), but it’s also stable in the sense that if A is close to a low rank matrix, then r(A) is also low. I’m looking forward to seeing how they use this quantity.

A polynomial inequality (and some whining)

Sunday, June 15th, 2008

Arghhh!!! I have a meeting tomorrow with my advisor to discuss my progress in research over the past month or so, and I have nothing interesting to mention– partly because I haven’t spent as much time as I could have, but mostly just because I’m slow and dense. I just gave up on the two problems I’ve been looking at, since I’ve gotten nowhere on those, and am now reading his paper on the linear independence of spikes and sines so I can work on another idea he suggested. Namely, to adapt the technique used in the paper to get a bound on the expected spectral norm of a random rectangular submatrix of the Fourier matrix. I can’t get anything done on this tonight besides reading, but it looks interesting.

Question of the night: Let  p(t) = \sum_{k=0}^r c_k t^k , show that the coefficients of the polynomial p satisfy the inequality
 |c_k| \leq \frac{r^k}{k!} \max_{|t| \leq 1} |p(t)| \leq e^r \max_{|t| \leq 1} |p(t)|.

It may help to look up Markov’s inequality for polynomials (bounding the derivatives of a polynomial in terms of the Chebyshev polynomials), and try to prove that.