Minimum Value of Absolute Deviation

Click For Summary
SUMMARY

The minimum value of the absolute deviation sum, S = ∑|X_i - a|, occurs when 'a' is the median of the random sample X_1, ..., X_n. This conclusion is supported by the property that the median balances the number of observations on either side, ensuring equal distribution. A rigorous proof can be approached through contradiction, demonstrating that any deviation from the median results in a higher sum of absolute deviations.

PREREQUISITES
  • Understanding of statistical concepts such as median and absolute deviation
  • Familiarity with random sampling techniques
  • Knowledge of proof techniques, particularly proof by contradiction
  • Basic algebraic manipulation skills
NEXT STEPS
  • Study the properties of the median in statistical analysis
  • Learn about absolute deviation and its applications in statistics
  • Explore proof techniques in mathematics, focusing on proof by contradiction
  • Investigate the implications of median versus mean in data analysis
USEFUL FOR

Statisticians, data analysts, and students in mathematics or statistics who are interested in understanding the properties of the median and absolute deviation in data sets.

maverick280857
Messages
1,774
Reaction score
5
Hi,

How can I rigorously prove that the quantity

S = \sum_{i=1}^{n}|X_{i} - a|

(where X_{1},\ldots,X_{n} is a random sample and a is some real number) is minimum when a is the median of the X_{i}'s?

Thanks.
 
Last edited:
Physics news on Phys.org
Ok I think I got it. If a is the median, then there are just as many numbers less than it than there are greater than it...but how do I write the median in terms of the random sample?
 
maverick280857 said:
Ok I think I got it. If a is the median, then there are just as many numbers less than it than there are greater than it...but how do I write the median in terms of the random sample?

There's no simple way to write it like you can with, say, the mean. What you can do is re-order the sample in increasing order, such that X_1 \leq \ldots \leq X_{n/2} \leq a \leq X_{n/2 + 1} \leq \ldots \leq X_n. For the actual proof, you might try working by contradiction: assume some other value of a results in the lowest value for the sum, and then show that you can construct an even lower value by moving a towards the median.
 

Similar threads

  • · Replies 5 ·
Replies
5
Views
3K
  • · Replies 8 ·
Replies
8
Views
1K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 8 ·
Replies
8
Views
2K
  • · Replies 42 ·
2
Replies
42
Views
4K
  • · Replies 21 ·
Replies
21
Views
2K
  • · Replies 12 ·
Replies
12
Views
2K
  • · Replies 17 ·
Replies
17
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 13 ·
Replies
13
Views
3K