Finding the Minimum Value of a Summation with a Constant Term

Click For Summary

Discussion Overview

The discussion centers on finding the minimum value of the summation $\sum_{i=1}^{n}(x-a_i)^2$, exploring the mathematical steps involved in expanding and minimizing the expression. Participants engage in a mix of theoretical reasoning and mathematical manipulation, with a focus on the implications of the quadratic form of the function.

Discussion Character

  • Mathematical reasoning, Technical explanation, Conceptual clarification

Main Points Raised

  • One participant expresses uncertainty about how to approach the problem, suggesting that $x-a_i=0$ might be a consideration, but doubts its applicability since $x$ is constant.
  • Another participant suggests expanding the summand and using the linearity of the summation operator as a starting point.
  • Participants discuss the expansion of the summation and derive a quadratic expression in terms of $x$, leading to the formulation of $f(x)=nx^2-2\sum_{i=1}^{n}(a_i)x+\sum_{i=1}^{n}(a_i^2)$.
  • There is a discussion about finding the critical value of $x$ that minimizes the function, with one participant proposing that $x=\frac{\sum_{i=1}^{n}(a_i)}{n}$ is the critical point.
  • Another participant questions how to confirm that this critical point corresponds to a minimum without using calculus, suggesting that the function's behavior at the boundaries indicates it is a minimum.
  • One participant elaborates on the form of the quadratic function and discusses completing the square to find the minimum value, relating it back to the average of the $a_i$ values.
  • There is a final inquiry about the equivalence of two expressions derived from the completed square method and the summation, indicating ongoing exploration of the topic.

Areas of Agreement / Disagreement

Participants generally agree on the approach to expanding the summation and identifying the critical point. However, there is no consensus on the final simplification or whether the derived expressions are equivalent, indicating that the discussion remains unresolved in that aspect.

Contextual Notes

Some participants express uncertainty about the implications of their mathematical manipulations and whether certain steps are valid, highlighting the complexity of the problem and the need for careful consideration of assumptions.

Who May Find This Useful

This discussion may be useful for individuals interested in mathematical optimization, particularly in the context of quadratic functions and summations, as well as those looking to understand the nuances of deriving minimum values in mathematical expressions.

Dethrone
Messages
716
Reaction score
0
Given $a_1,...,a_n$, find the minimum value of $\sum_{i}^{n}(x-a_i)^2$

No idea how to do it. I was thinking maybe when $x-a_i=0$, but I think $x$ is constant so it won't work...unless the series $a_n$ is constant too...Tiny hint please :D?
 
Physics news on Phys.org
Okay, a tiny hint:

Begin by expanding the summand and exploiting the linearity of the summation operator.
 
Umm...(Wondering)

Expanding the summand:
$$\sum_{i}^{n}(x-a_i)^2=(x-a_1)^2+(x-a_2)^2+(x-a_3)^2+...+(x-a_n)^2$$

Not sure how to exploit it...just a guess:
$$=nx^2-2x(a_1+a_2+...+a_n)+(a_1^2+a_2^2+...+a_n^2)$$
 
You are moving in the right direction, although you have an error (that you have since fixed). But, what I meant is to write:

$$f(x)=\sum_{i=1}^{n}\left[\left(x-a_1\right)^2\right]$$

Now, expand the summand:

$$f(x)=\sum_{i=1}^{n}\left[x^2-2a_ix+a_i^2\right]$$

Exploit the linearity of the summation operator:

$$f(x)=\sum_{i=1}^{n}\left[x^2\right]+\sum_{i=1}^{n}\left[-2a_ix\right]+\sum_{i=1}^{n}\left[a_i^2\right]$$

Factor out those factors not dependent on the index of summation, to get a quadratic in $x$:

$$f(x)=x^2\sum_{i=1}^{n}\left[1\right]-2\sum_{i=1}^{n}\left[a_i\right]x+\sum_{i=1}^{n}\left[a_i^2\right]$$

$$f(x)=nx^2-2\sum_{i=1}^{n}\left[a_i\right]x+\sum_{i=1}^{n}\left[a_i^2\right]$$

Now, minimize...

Note: every summand is enclosed by square brackets, but they do not display properly for some reason. :D
 
Oh! I was going to write something similar to that, but I thought it was being a bit fancy for something that could be potentially wrong. (Dull)

$$\displaystyle f(x)=nx^2-2\sum_{i=1}^{n}\left[a_i\right]x+\sum_{i=1}^{n}\left[a_i^2\right]$$
$$f'(x)=2nx-2\sum_{i=1}^{n}\left[a_i\right]$$
Setting equal to zero:
$$x=\frac{\sum_{i=1}^{n}\left[a_i\right]}{n}$$

Is that right?
 
Yes, that is your critical value. How do you know this is at the minimum without using calculus?
 
I like that question! :D

Can I simply say that because there is only one critical number and the function tends to infinity as you approach its boundaries, then the extrenum must be a minimum? The function being a positive quadratic should be just enough, actually.
 
The function you are minimizing is of the form $f(x) = nx^2 - 2Ax + B$. Since $n > 0$, if we find $x$ that min $f(x)$, it will also min $x^2 - \frac{2A}n x + \frac Bn$. We can then just complete the square:

$x^2 - \frac{2A}n x + \frac{A^2}{n^2} - \frac{A^2}{n^2} + \frac Bn = \left( x - \frac An \right)^2 - \frac{A^2}{n^2} + \frac Bn$.

With $A,B,n$ fixed, the smallest value can be attain when that square is $0$,
or $x = \frac{A}n$. In the case of this problem, it is $\frac 1n \sum_i a_i$, which we note is the average of the $a_i$'s.
 
Rido12 said:
...The function being a positive quadratic should be just enough, actually.

That's what I was hinting at, you have an upward opening parabola, so the critical value must be at the minimum.

Now, the question asks you to find the minimal value, so what do you get?
 
  • #10
Hi Mark! (Wave)

So plugging $x$ in, we get:

$$\sum_{i=1}^{n}\left(\frac{\sum_{i=1}^{n}\left[a_i\right]}{n}-a_i\right)^2$$

Not sure if it is wise to simplify further. Looking back at magneto's method of completing the square, I see $- \frac{A^2}{n^2} + \frac Bn$, which also should be the minimum value.
$$- \frac{A^2}{n^2} + \frac Bn=-\frac{\left(\sum_{i=1}^{n}[a_i]\right)^2}{n^2}+\frac{\sum_{i=1}^{n}[a_i^2]}{n}$$

Are these statements equivalent?
 

Similar threads

  • · Replies 7 ·
Replies
7
Views
3K
  • · Replies 5 ·
Replies
5
Views
3K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 12 ·
Replies
12
Views
3K
  • · Replies 10 ·
Replies
10
Views
3K
  • · Replies 2 ·
Replies
2
Views
1K
  • · Replies 3 ·
Replies
3
Views
4K
  • · Replies 20 ·
Replies
20
Views
2K
  • · Replies 3 ·
Replies
3
Views
1K
  • · Replies 3 ·
Replies
3
Views
12K