Q: convexity of level sets
Tuesday, January 29th, 2008When are the levels sets of an arbitrary function the boundary of some convex set? I.e. if I give you the level set
, what kind of conditions on
and
guarantee this?
I’ve been spending a lot of time looking at the equation
lately. From Mathematica’s implicit plot, it sure looks like an ellipse (locally). So I’m wondering what kind of results you can get about level sets.
Thinking out loud, for one dimensional level sets in 2d, one condition that looks like it might be necessary and sufficient if you assume the level set is a smooth manifold is that the gradient on the level set has to be a one to one function onto the unit circle. I say this because it looks like you could stretch the unit circle onto the boundary of an arbitrary convex set by just growing it at different rates in the direction of its outward normal.
On a related note, are there higher dimensional analogs to the Jordan Curve Theorem: if it’s hard to show that a simple closed curve separates the plane into two disjoint regions, is it harder to show compact submanifolds do the same to space? I’ve not actually seen the proof of the JCT, so I don’t know if the arguments used are intrinsic to the plane, or more generally applicable.
. Show that the mapping
given by
is onto.
be a stationary Gaussian r.v.. Find the expected number of zero crossings in a unit interval. I’ll give you a hint: it can be expressed in terms of the second and zeroth moments of the signal’s spectrum. And I have no idea how to be about it 