Results 1 to 2 of 2

Thread: proof

  1. #1


    Let x1, x2,... be an enumeration of the jump points. Show that each jump is associated with a subinterval of [f(a), f(b)]. What are the endpoints of the ith jump subinterval.
    Show all jump subintervals are either disjoint or at most share an endpoint.

    Let [a1, b1], [a2, b2], ...[an, bn]be the first n jump intervals. We may relabel them so that a1<b1<a2<b2< So the sum of the lengths of the first n – subintervals is (b1-a1)+(b2-a2)+...+(bn-an)<=(a2-a1)+(a3-a2)+...+(f(b)-an)
    finish the proof from here.
    Follow Math Help Forum on Facebook and Google+

  2. #2
    Global Moderator

    Nov 2005
    New York City
    Can you give an example of just you are doing?
    Suppose for example,
    $\displaystyle \tan x$ its jump points can be enumerated. Now what?
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. Replies: 5
    Last Post: Oct 19th 2010, 10:50 AM
  2. Replies: 0
    Last Post: Jun 29th 2010, 08:48 AM
  3. [SOLVED] direct proof and proof by contradiction
    Posted in the Number Theory Forum
    Replies: 2
    Last Post: Feb 27th 2010, 10:07 PM
  4. Proof with algebra, and proof by induction (problems)
    Posted in the Discrete Math Forum
    Replies: 8
    Last Post: Jun 8th 2008, 01:20 PM
  5. proof that the proof that .999_ = 1 is not a proof (version)
    Posted in the Advanced Applied Math Forum
    Replies: 4
    Last Post: Apr 14th 2008, 04:07 PM

/mathhelpforum @mathhelpforum