1. Limited time only! Sign up for a free 30min personal tutor trial with Chegg Tutors
    Dismiss Notice
Dismiss Notice
Join Physics Forums Today!
The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

Basic proof

  1. Aug 4, 2009 #1
    Hi, I need to show this:

    [tex]b_m \geq\sum_{i=1}^n b_i^2[/tex]

    given these three conditions:

    [tex]b_m \geq b_i[/tex], for [tex]i=1..n[/tex] (in other words [tex]b_m = max(b_i)[/tex]) and

    [tex]0 \leq b_i \leq 1[/tex] for [tex]i=1..n[/tex] and

    [tex]\sum_{i=1}^n b_i=1[/tex]

    I've been working for hours in this without results...Any clue would be really appreciated

    (this is not a homework exercise. I'm just trying to convince myself that the bayes decision error bound is a lower bound for the nearest neighbor rule error bound, and to convince myself of that I've arrived at the conclusion that I have to show the above).


  2. jcsd
  3. Aug 4, 2009 #2


    User Avatar
    Gold Member

    Maybe this will help . . .

    [tex]0 \leq b_{i}^2 \leq b_i \leq 1[/tex], this implies that [tex]\sum_{i = 1}^n b_{i}^2 \leq \sum_{i = 1}^n b_i = 1[/tex].
Share this great discussion with others via Reddit, Google+, Twitter, or Facebook