Proving a basis is a basis for homogeneous linear differential equation with constant (complex) coefficients

  • Context: Undergrad 
  • Thread starter Thread starter psie
  • Start date Start date
  • Tags Tags
    Linear algebra Ode
Click For Summary
SUMMARY

This discussion focuses on proving that the set of functions $$S=\{e^{c_1t},te^{c_1t},\ldots,t^{n_1-1}e^{c_1t},\ldots,e^{c_kt},te^{c_kt},\ldots,t^{n_k-1}e^{c_kt}\}$$ forms a basis for the null space of the differential operator $$\mathsf D$$ associated with a homogeneous linear differential equation with constant complex coefficients. The polynomial $$p(t)=(t-c_1)^{n_1} (t-c_2)^{n_2}\cdots (t-c_k)^{n_k}$$ plays a crucial role in this context. The user is employing mathematical induction to establish linear independence, having successfully proven the base case and seeking guidance on the induction step involving the operator $$(\mathsf D-c_m\mathsf I)^{n_m}$$ applied to a linear combination of the basis functions.

PREREQUISITES
  • Understanding of homogeneous linear differential equations with constant complex coefficients
  • Familiarity with the concept of basis in vector spaces
  • Knowledge of polynomial factorization and its implications in differential equations
  • Proficiency in mathematical induction techniques
NEXT STEPS
  • Study the application of differential operators in solving linear differential equations
  • Learn about the implications of the Wronskian determinant in establishing linear independence
  • Explore advanced techniques in polynomial factorization related to differential equations
  • Investigate the role of the exponential function in the solutions of linear differential equations
USEFUL FOR

Mathematicians, students of differential equations, and researchers focusing on linear algebra and its applications in solving homogeneous linear differential equations.

psie
Messages
315
Reaction score
40
TL;DR
I'm working an exercise to prove a certain theorem in my linear algebra book. I'm stuck with a computation of verifying linear independence.
I struggle with a certain computation. Consider a homogeneous linear differential equation with constant (complex) coefficients. Such an equation is associated with a polynomial ##p(t)##, which we can write $$p(t)=(t-c_1)^{n_1} (t-c_2)^{n_2}\cdots (t-c_k)^{n_k},$$where ##n_1,n_2,\ldots,n_k## are positive integers and ##c_1,c_2,\ldots,c_k## are distinct complex numbers. A basis for the solution space is $$S=\{e^{c_1t},te^{c_1t},\ldots,t^{n_1-1}e^{c_1t},\ldots,e^{c_kt},te^{c_kt},\ldots,t^{n_k-1}e^{c_kt}\}.$$ I'm in the process of proving that ##S## is indeed a basis for the null space of ##p(\mathsf D)##, where ##\mathsf D## is the differential operator. I want to proceed by induction on ##k## to prove linear independence. I can prove the base case but am stuck on the induction step. Suppose ##S## is linearly independent for all ##k<m## and suppose $$\sum_{i=1}^m\sum_{j=0}^{n_i-1}b_{ij}t^je^{c_it}=0.\tag1$$We want to show ##b_{ij}=0## for all ##i,j##. Now I've received a hint to apply ##(\mathsf D-c_m\mathsf I)^{n_m}## to ##(1)##, i.e. $$(\mathsf D-c_m\mathsf I)^{n_m}\left( \sum_{i=1}^m\sum_{j=0}^{n_i-1}b_{ij}t^je^{c_it}\right)=0.$$Any tips and tricks on how to proceed? I struggle with how to simplify the above.
 
Physics news on Phys.org
This might be a silly question, but what you have is ##\sum n_i ## many terms all of the form ##t^ke^{ct}.## Every constellation ##b_1t^ke^{ct}+b_2t^me^{dt}=0## yields ##b_1=b_2=0## by substituting ##t\in \{0,1\}## except for the case ##c=d## and ##k=m.##

The induction step is accordingly.
 
  • Like
Likes   Reactions: psie
The point here is that (D - c_mI)^{n_m} is the zero map on the subspace E_m spanned by \{ t^ke^{c_mt} : k = 0, 1 , \dots, n_m - 1 \}. This is so because <br /> (D - c_mI)(t^ke^{c_mt}) = kt^{k-1}e^{c_mt} and thus D - c_mI maps everything in E_m to zero in at most n_m iterations.
 
  • Like
Likes   Reactions: psie

Similar threads

  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 23 ·
Replies
23
Views
2K
  • · Replies 3 ·
Replies
3
Views
3K
  • · Replies 2 ·
Replies
2
Views
3K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 0 ·
Replies
0
Views
1K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 3 ·
Replies
3
Views
1K