Spivak's Calculus polynomial question

[scast]

Homework Statement

(This problem is from the Spivak 2nd Ed. I had to translate it from spanish since my book is in spanish)

If $$x_1, \ldots, x_n$$ are different numbers, find a polynomial function $$f_i$$ of $$n-1$$ degree that takes value 1 on $$x_i$$ and 0 in $$x_j$$ for $$j \neq i$$. Indication: the product of every $$(x-x_j)$$ for $$j \neq i$$ is 0 if $$j \neq i$$.

\prod_{j=1}^{n} (x-x_{j})

Homework Equations

$$\prod_{j=1}^{n} (x-x_{j})$$

The Attempt at a Solution

So far... Well so basically I stated all the known and unknown but I can't seem to get
past that. So here's what I have...

There is a set of $$x_1, \ldots, x_n$$
$$f_{i}$$ is of $$n-1$$ degree.

There's a function such

$$f_{i}(x) = a_{n-1}x^{n-1} + a_{n-2}x^{n-2} + \ldots + a_{1}x + a_{0}$$

There's a pair $$(x_{i}, f_{i}(x_{i})$$ such that

$$f_{i}(x_{i}) = a_{n-1}x_{i}^{n-1} + a_{n-2}x_{i}^{n-2} + \ldots + a_{1}x_{i} + a_{0} = 1$$

And there's also a pair $$(x_{j}, f_{i}(x_{j}))$$ such that

$$f_{i}(x_{j}) = a_{n-1}x_{j}^{n-1} + a_{n-2}x_{j}^{n-2} + \ldots + a_{1}x_{j} +a_{0} = 0$$

But I can't seem to connect the indication with the whole problem... any help? Oh, and I posted it in calculus but I am not quiet sure if this belongs in precalculus forum instead. I am sorry if this doesn't belong here.

Thanks for any advice in advance.

 

[xalvyn]

Try $$\prod_{k \neq i} (x-x_k)$$, a polynomial of degree n - 1, and divide this expression by an appropriate constant (try a product of factors). For more information, look up: Lagrange interpolation polynomials.

 

[Dafe]

First of all, I know that this thread is very old, but since I am working on this exact problem I assume it is better not to create a new thread. (+ it shows that I did a search :) )

Here's my attempt:

$$f_i(x) = \prod^n_{\frac{j=1}{j\neq i}} \frac{x-x_j}{x_i-x_j}$$

The next part of this problem is as follows.
Find a polynomial function $$f$$ of degree $$n-1$$ such that $$f(x_i)=a_i$$, where $$a_1,...a_n$$ are given numbers. (You should use the function $$f_1$$ from the first part. The formula you will obtain is called the "Lagrange interpolation formula".


$$f_i(x) = a_i\prod^n_{\frac{j=1}{j\neq i}} \frac{x-x_j}{x_i-x_j}$$
since the function from the previous problem was $$1$$ at $$x_i$$

I would appreciate it if someone could take a look at this and tell me if it is correct.
Thanks!

 

[wisvuze]

First of all, I know that this thread is very old, but since I am working on this exact problem I assume it is better not to create a new thread. (+ it shows that I did a search :) )

Here's my attempt:

$$f_i(x) = \prod^n_{\frac{j=1}{j\neq i}} \frac{x-x_j}{x_i-x_j}$$

The next part of this problem is as follows.
Find a polynomial function $$f$$ of degree $$n-1$$ such that $$f(x_i)=a_i$$, where $$a_1,...a_n$$ are given numbers. (You should use the function $$f_1$$ from the first part. The formula you will obtain is called the "Lagrange interpolation formula".$$f_i(x) = a_i\prod^n_{\frac{j=1}{j\neq i}} \frac{x-x_j}{x_i-x_j}$$
since the function from the previous problem was $$1$$ at $$x_i$$

I would appreciate it if someone could take a look at this and tell me if it is correct.
Thanks!

Close. It should be:

n
$$\Sigma$$ aifi(x)
i=1

where f(x) is your function above

you need a function such that fi(xi) = ai where xi = x1,x2,...,xn and ai = a1,a2,...,an.

The LATEX subscripting doesn't seem to work :S

 

[Dafe]

Ok, so my new function is,

$$f(x) = \sum^n_{i=1}a_if_i(x)$$

if I put $$x_i$$ into this new function, I would get:

$$f(x_i) = a_1+a_2+...+a_n$$

The problem asks for a function where $$f(x_1)=a_i$$. Does this imply a sum over the $$a_i$$'s?
By the way, I am in no way saying your answer is wrong. It fits nicely with my google search on lagrange interpolating polynomial :)

Thanks!

 

[HallsofIvy]

Ok, so my new function is,

$$f(x) = \sum^n_{i=1}a_if_i(x)$$

if I put $$x_i$$ into this new function, I would get:

$$f(x_i) = a_1+a_2+...+a_n$$

No. AT x_i, f_i will be 1, every other f_n will be 0. $f(x_i)= a_1(0)+ a_2(0)+ \cdot\cdot\cdot+ a_i (1)+ \cdot\cdot\cdot+ a_n(0)= a_i$.

The problem asks for a function where $$f(x_1)=a_i$$. Does this imply a sum over the $$a_i$$'s?
By the way, I am in no way saying your answer is wrong. It fits nicely with my google search on lagrange interpolating polynomial :)

Thanks!

 

[wisvuze]

Ok, so my new function is,

$$f(x) = \sum^n_{i=1}a_if_i(x)$$

if I put $$x_i$$ into this new function, I would get:

$$f(x_i) = a_1+a_2+...+a_n$$

The problem asks for a function where $$f(x_1)=a_i$$. Does this imply a sum over the $$a_i$$'s?
By the way, I am in no way saying your answer is wrong. It fits nicely with my google search on lagrange interpolating polynomial :)

Thanks!

This is why your function is wrong:

You need to find a single function that gives you certain numbers whenever you input certain numbers.

So at f(x1) you should get a1, at f(x2), you should get a2.. at f(xn) you should get an.

With your function, aifi(x) where fi(x) is the quotient function shown earlier - you cannot get anything other than 0 and whatever ai was supposed to be, unless you keep changing your function.

 

[Dafe]

Ah, now I get it :)
Thank you both very much!