Dismiss Notice
Join Physics Forums Today!
The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

Homework Help: Hard question concerning denseness

  1. Nov 12, 2005 #1

    Let [itex]S = \{(x,y) \in \mathbb{R}^2\,:\,x\in[0,\pi],\,y\in[0,1]\}[/itex]. Deduce whether or not,

    [tex]\left\{\sum_{m,n=0}^M a_{m,n}\cos(mx)y^n\,:\,a_{m,n} \in \mathbb{R}\right\}[/tex]

    a subset of [itex]C(S,\mathbb{R})[/itex] is dense.

    I was thinking no. And this is not a guess.

    My reasoning is as follows. S can be thought of as some 'surface' whose projection onto the real plane is bounded by the rectangle [itex][0,\pi] \times [0,1][/itex].

    So, I was led to believe this is kind of like a Fourier analysis problem. Can I construct every possible surface, hence making it dense, using my subset. Well, obviously no, because, for example, I cannot approximate [itex]\sin[/itex] using just linear combinations of [itex]\cos[/itex].

    However, lets just say that our subset was

    [tex]\left\{\sum_{m=0}^M\sum_{n=0}^N\,a_{m,n}x^my^n\,:\,a_{m,n} \in \mathbb{R}\right\}[/tex]

    Then I can approximate, by sums, every possible 'surface', or polynomial using the given subset. So I would say that this particular subset IS dense in [itex]C(S,\mathbb{R})[/itex].

    Let's change it a little more. Consider the subset

    [tex]\left\{\sum_{m=0}^M\sum_{n=0}^N\,a_{m,n}x^{5m}y^{2n}\,:\,a_{m,n} \in \mathbb{R}\right\}[/tex]

    In this case, this subset is NOT dense in [itex]C(S,\mathbb{R})[/itex] because some terms are missing, i.e. 5 and 2 are coprime, so some combinations, i.e. [itex]x^4[/itex] can never be made. That is, this polynomial cannot approximate, by sums, every possible surface within the bounded region. Hence not dense.

    I know this is pretty complicated. But if anyone has the guts I would appreciate some feedback.
  2. jcsd
  3. Nov 12, 2005 #2


    User Avatar
    Science Advisor
    Homework Helper

    Well you have more than just linear combinations of cos. You can linear combinations of cos(mx). cos(2x) = cos²x - sin²x. It's got a 'sin' in there. Of course, it isn't sin itself but can you be sure that no linear combination of cos(mx)'s with m varying will not give you something close to sin? Also, what is M?

    For me, it seems like it might be tough to come up with a specific function in C(S,R) and show that none of the functions in your set approximate it. Maybe that's what you'll have to do. To show it's not dense, you want to show that:

    There exists f in C(S,R) such that there is an e > 0 such that for all g in your set, there is some x in S such that |f(x) - g(x)| > e.

    If you want to prove it dense:

    For each f in C(S,R) and for each e > 0, there is a g in your set such that for all x in S, |f(x) - g(x)| < e.

    Well how about this: I think I remember in my QM class saying that you could approximate any single-valued continuous function with the sum of a bunch of cos curves. And you can do any single-valued function with a polynomial. So maybe we should look for functions in C(S,R) that aren't of the form h(x)j(y). Try cos(xy). To be honest, though, I don't really know how to do this question.
Share this great discussion with others via Reddit, Google+, Twitter, or Facebook