Prove Lagrange Polynomials Basis of $\mathbb{R}_{n}[X]

  • Context: Graduate 
  • Thread starter Thread starter God's Pen
  • Start date Start date
  • Tags Tags
    Lagrange Polynomials
Click For Summary

Discussion Overview

The discussion revolves around the proof that the set of Lagrange polynomials \( (P_1, P_2, \ldots, P_{n+1}) \) forms a basis for the space of polynomials \( \mathbb{R}_{n}[X] \). Participants explore the linear independence of these polynomials and clarify specific aspects of the proof, including the use of indices in summation and the evaluation of polynomials at certain points.

Discussion Character

  • Technical explanation
  • Conceptual clarification
  • Debate/contested

Main Points Raised

  • One participant presents the definition of Lagrange polynomials and outlines the requirement to show linear independence to establish that they form a basis.
  • Another participant explains that the choice of indices \( i \) and \( j \) in the summation is arbitrary, as they are dummy variables, but emphasizes the importance of keeping track of their roles in the proof.
  • There is a discussion about evaluating \( P_j(a_i) \) and \( P_i(a_i) \), where one participant clarifies that \( P_i(a_i) = 1 \) and \( P_j(a_i) = 0 \) for \( i \neq j \) due to the structure of the Lagrange polynomials.
  • Further clarification is provided regarding the definition of \( P_i(X) \) and how the product in the polynomial excludes the term corresponding to its own index, leading to the conclusion that evaluating at \( a_i \) yields a non-zero result while evaluating at \( a_j \) (for \( j \neq i \)) results in zero.

Areas of Agreement / Disagreement

Participants generally agree on the definitions and properties of the Lagrange polynomials, but there is some confusion regarding the notation and the implications of using different indices in the proof. The discussion remains somewhat unresolved as participants seek further clarification on these points.

Contextual Notes

The discussion highlights the nuances of polynomial evaluation and index notation, which may depend on the specific context of the proof being discussed. There are unresolved questions about the implications of using different indices in the summation and how this affects the proof of linear independence.

God's Pen
Messages
12
Reaction score
0
hello everyone:smile:
for [tex] i=1,2,...,(n+1)[/tex] let [tex]P_{i}(X)=\frac{\prod_{1\leq j\leq n+1,j\neq i}(X-a_j)}{\prod_{1\leq j\leq n+1,j\neq i}(a_i-a_j)}[/tex]
prove that [tex] (P_1,P_2,...P_{n+1})[/tex] is basis of [tex] \mathbb{R}_{n}[X][/tex].
i already have an answer but i don't understand some of it.
...
we have [tex]B=\{P_1, \cdots , P_{n+1} \} \subset \mathbb{R}_n[x][/tex] and [tex]\dim_{\mathbb{R}} \mathbb{R}[x]=n+1.[/tex] so, in order to show that [tex]B[/tex] is a basis for [tex]\mathbb{R}_n[x],[/tex] we only need

to show that [tex]B[/tex] is linearly independent.for any [tex]i[/tex] we have [tex]P_i(a_i)=1[/tex] and [tex]P_j(a_i)=0,[/tex] for [tex]i \neq j.[/tex] now, to show that [tex]B[/tex] is linearly independent, suppose that [tex]\sum_{j=1}^{n+1}c_j P_j(x)=0,[/tex] for some
[tex]c_j \in \mathbb{R}.[/tex] put [tex]x=a_i[/tex] to get [tex]c_i=0. \ \Box[/tex]
...
what i don't understand,
why should we have [tex]P_j(X)[/tex] and not [tex]P_i(X)[/tex]
why we had to find [tex]P_j(a_i)[/tex] ?
and why we have [tex]\sum_{j=1}^{n+1}[/tex] and not [tex]\sum_{i=1}^{n+1}[/tex] ?
thank you so much.
 
Physics news on Phys.org
Hmmm..er...I don't know if I have understood your question properly ...but let me try to answer...


Your question is..why have we used j instead of i in the summation? Well..as far as I can see...i and j are just dummy variables ..it does not matter whether you use i or j or k...

You can very well use i if you want...but then you have to always remember that i denotes a general element...then..to prove the coefficients as zero, you can't put x=a_(i) as i is now reserved for the general element..you have to use some other letter in that case...


Now, as for the question as to why we had to find P_(j)(a_i)...by putting x=a_(i), you are reducing all elements of the sum to zero except the term with index j=i. This term is
c_i * P_(i)(a_i)=c_i.
 
krishna mohan said:
Hmmm..er...I don't know if I have understood your question properly ...but let me try to answer...


Your question is..why have we used j instead of i in the summation? Well..as far as I can see...i and j are just dummy variables ..it does not matter whether you use i or j or k...

You can very well use i if you want...but then you have to always remember that i denotes a general element...then..to prove the coefficients as zero, you can't put x=a_(i) as i is now reserved for the general element..you have to use some other letter in that case...


Now, as for the question as to why we had to find P_(j)(a_i)...by putting x=a_(i), you are reducing all elements of the sum to zero except the term with index j=i. This term is
c_i * P_(i)(a_i)=c_i.

thank you.
but if i and j are just dummy variables and it doesn't matter which one we put.
how could we have [tex]P_i(a_i)=1[/tex] and [tex]P_j(a_i)=0[/tex] ??
?
 
Welll...first thing you should realize is that even if you use i or j or k or a or b or c, the two expressions are fundamentally different...


[tex]P_{i}(a_{i})[/tex] has the the index for [tex]P[/tex] and [tex]a[/tex] as the same..

[tex]P_{j}(a_{i})[/tex] has the the index for [tex]P[/tex] and [tex]a[/tex] as different..of course, the assumption here being that, whatever i and j are, they are not equal..i.e if we put i=1, then j cannot be 1...


See the definition of [tex]P_{i}(X)[/tex]...In the numerator, there is a product...the product contains all terms of the form [tex]X-a_{j}[/tex] such that j is not equal to i...

Like, if i=3, then the product contains [tex](X-a_{1}),(X-a_{2}),(X-a_{4}),(X-a_{5}) etc[/tex] but not [tex](X-a_{3})[/tex]...


Then, you can see why putting [tex]X=a_{3}[/tex] won't make the expression to zero..but [tex]X=a_{j}[/tex]... such that j is not three...will reduce the whole term to zero...
 
krishna mohan said:
Welll...first thing you should realize is that even if you use i or j or k or a or b or c, the two expressions are fundamentally different...


[tex]P_{i}(a_{i})[/tex] has the the index for [tex]P[/tex] and [tex]a[/tex] as the same..

[tex]P_{j}(a_{i})[/tex] has the the index for [tex]P[/tex] and [tex]a[/tex] as different..of course, the assumption here being that, whatever i and j are, they are not equal..i.e if we put i=1, then j cannot be 1...


See the definition of [tex]P_{i}(X)[/tex]...In the numerator, there is a product...the product contains all terms of the form [tex]X-a_{j}[/tex] such that j is not equal to i...

Like, if i=3, then the product contains [tex](X-a_{1}),(X-a_{2}),(X-a_{4}),(X-a_{5}) etc[/tex] but not [tex](X-a_{3})[/tex]...


Then, you can see why putting [tex]X=a_{3}[/tex] won't make the expression to zero..but [tex]X=a_{j}[/tex]... such that j is not three...will reduce the whole term to zero...

i think I'm getting somewhere,thank u so mush for your help.
:smile:
 

Similar threads

  • · Replies 15 ·
Replies
15
Views
2K
  • · Replies 3 ·
Replies
3
Views
3K
  • · Replies 52 ·
2
Replies
52
Views
4K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 23 ·
Replies
23
Views
2K
Replies
10
Views
2K
  • · Replies 8 ·
Replies
8
Views
3K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 9 ·
Replies
9
Views
2K