I was solving a problem on spoj, the solution of that problem requires the assumtion that,
if we add the absolute value of 2 or more linear equation in x ( eg. f(x)=|5x-8| + |7x-1| + |12x-13| ) then it necessary that f(x) (note:here f(x) denotes the sum of those terms) would be montonically increasing as we go way from the optimal value of x (note: optimal value of x is the value at which f(x) is minimum) .
Just wanted to confirm if that statement is true or not?
This is a convex piecewise-linear function, which is weaker than what you state but perhaps still enough to prove the solution.
Let the terms turn to zero at points x1 ≤ x2 ≤ ... ≤ xn. Look at the derivative of this function. It can be trivially shown that for the term k of the form |akx + bk| we have xk = - bk / ak. For x < xk, the term contributes - ak to the derivative, and for x > xk, it contributes + ak. So, the derivative increases by 2ak at each xk.
I believe you meant that it is stronger than what author stated. Bitonicity (monotonic increase as we go away from the optimum point) follows from convexity, but not vice versa.
Yeah, it's stronger. Sorry, I've messed up the terms when reading.
thank you.