Abel's Lemma: Direct and Induction Proof

  • Context: Graduate 
  • Thread starter Thread starter Integral
  • Start date Start date
  • Tags Tags
    Direct proof Proof
Click For Summary
SUMMARY

Abel's Lemma provides a formula for the sum of products of sequences defined by elements of a field. Specifically, it states that for sequences \(a_k\) and \(b_k\), the equation \(\sum^n_{k=m} a_k b_k = \sum^{n-1}_{k=m} (b_k - b_{k+1}) s_k + b_n s_n - b_m s_{m-1}\) holds true. The proof involves expanding the terms and using induction to validate the relationship for all positive integers \(n\) and \(m\). The discussion emphasizes the importance of using induction for clarity and generalization.

PREREQUISITES
  • Understanding of sequences and series in mathematics
  • Familiarity with the concept of induction proofs
  • Knowledge of fields in abstract algebra
  • Ability to manipulate summations and algebraic expressions
NEXT STEPS
  • Study the principles of mathematical induction in detail
  • Explore the properties of fields in abstract algebra
  • Learn about advanced summation techniques and their applications
  • Investigate other lemmas related to series and sequences, such as Cauchy's or Cesàro's summation
USEFUL FOR

Mathematicians, students studying advanced algebra, educators teaching proof techniques, and anyone interested in the applications of summation in mathematical analysis.

Integral
Staff Emeritus
Science Advisor
Homework Helper
Gold Member
Messages
7,232
Reaction score
66
Abel’s Lemma,
Let [itex]a_0,a_1,a_2,\cdots[/itex] and [itex]b_0,b_1,b_2,\cdots[/itex] be elements of a field;
let[itex]s_k = a_0 + a_1 + a_2 + \cdots + a_k[/itex] k= 0,1,2,… And s-1 =0.

Then for any positive real integer n and for m= 0,1,2,…,n-1,

[tex]\sum^n _{k=m} a_k b_k = \sum ^{n-1}_{k=m} (b_k - b_{k+1}) s_k + b_n s_n - b_m s_{m-1}[/tex]



Proof:

Expanding the terms of the sum gives

[tex](b_m - b_{m+1})s_m + (b_{m+1} - b_{m+2} )s_{m+1} + \cdots + (b_{n-1} - b_n) s_{n-1} + b_n s_n - b_m s_{m-1}[/tex]

By the definition of sk we have sk+1 = sk + ak+1

Now for the expansion of the sum we can write:

[tex](b_m s_m - b_{m+1} s_m + b_{m+1} s_{m+1} - b_{m+2} s_{m+1} + \cdots + b_{n-1} s_n - b_n s_{n-1} + b_n s_n - b_m s_{m-1}[/tex]


[tex]b_m a_m + b_m s_{m-1} - b_{m+1} s_m + b_{m+1} s_m + b_{m+1} a_{m+1} - b_{m+2} s_{m+1} + \cdots + b_{n-1} s_n - b_n s_{n-1} + b_n s_n - b_m s_{m-1}[/tex]

Now group canceling terms:

[tex]b_m a_m + ( b_m s_{m-1} -b_m s_{m-1}) + ( - b_{m+1} s_m + b_{m+1} s_{m}) + b_{m+1} a_{m+1} + \cdots + b_{n-1} a_{n-1} + b_{n-1} s_n - b_n s_{n-1} + b_n s_n[/tex]

All that remains is

[tex]\sum _{k=m} ^ n a_k b_k[/tex]

Is this proof sufficient or do I need do an induction proof?
 
Last edited:
Physics news on Phys.org
It's sufficient. But my teacher would say it's too suggestive with those dots.
Use induction. It's much neater.
 
OK, let me see if I can do the induction proof.
The part that has bothered me is the m, not clear to me what this buys? I guess it it a bit more generalized, don't have to start at zero.

For the induction proof I need to show that the relatationship is ture for n=1 and m=0

[tex]\sum _ {k=0}^1 a_k b_k = a_0 b_0 + a_1 b_1[/tex]

for the RHS I have

[tex]\sum ^0 _ {k=0} (b_k - b_{k+1})s_k + b_n s_n - b_m s_{m-1}= (b_0 - b_1)s_0 + b_0 s_0 + b_1 a_0 + b_1 a_1 - b_0 s_{-1}[/tex]
[tex]= b_0 a_0 - b_1 a_0 + b_0 a_0 + b_1 a_0 + b_1 a_1 - 0[/tex]
[tex]= b_0 a_0 + a_1 b_1[/tex]

So the statement is valid for n=1, now assume that the general statement for is true n= N.

Let n= N+1

[tex]\sum^{N+1} _{k=m} a_k b_k = \sum ^N_{k=m} (b_k - b_{k+1}) s_k + b_{N+1} s_{N+1} - b_m s_{m-1}[/tex]
For the RHS we have

[tex]\sum^{N+1} _{k=m} a_k b_k = \sum ^{N-1}_{k=m} (b_k - b_{k+1}) s_k + b_{N+1} s_{N+1} - b_m s_{m-1}+( b_{N} - b_{N+1})s_N[/tex]


[tex]= \sum ^{N-1}_{k=m} (b_k - b_{k+1}) s_k + b_{N+1} s_{N} + b_{N+1}a_{N+1} - b_m s_{m-1}+ b_{N}s_N - b_{N+1}s_N[/tex]

[tex]= \sum ^{N-1}_{k=m} (b_k - b_{k+1}) s_k + b_Na_N - b_m s_{m-1}+ b_{N+1}a_{N+1}[/tex]

[tex]= \sum ^N_{k=m} a_k b_k + a_{N+1}b_{N+1}[/tex]

[tex]= \sum^{N+1}_{k+m} a_k b_k[/tex]
QED
 

Similar threads

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