The notion of independance of equations

  • Context: Graduate 
  • Thread starter Thread starter quasar987
  • Start date Start date
Click For Summary
SUMMARY

The discussion centers on the independence of equations in classical mechanics, specifically defined by the rank of the matrix \( A_{\alpha i} = \left(\frac{\partial f_{\alpha}}{\partial x_i}\right) \). The equations are deemed independent when this rank equals \( k \), indicating that the only solution to the system of equations is the trivial one. This aligns with the linear algebra concept of independence, where a unique solution exists only if the coefficient matrix has full rank. The discussion also emphasizes the necessity of an invertible matrix to avoid non-zero perturbations near a solution point.

PREREQUISITES
  • Understanding of classical mechanics and its equations
  • Familiarity with linear algebra concepts, particularly matrix rank
  • Knowledge of partial derivatives and their applications
  • Basic comprehension of perturbation theory in mathematical analysis
NEXT STEPS
  • Study the concept of matrix rank in linear algebra
  • Explore perturbation theory and its implications in classical mechanics
  • Learn about the applications of the Implicit Function Theorem in solving equations
  • Investigate the relationship between linear independence and system solvability
USEFUL FOR

Students and professionals in physics, particularly those focused on classical mechanics, as well as mathematicians interested in the application of linear algebra to physical systems.

quasar987
Science Advisor
Homework Helper
Gold Member
Messages
4,796
Reaction score
32
I got here in my classical mechanics textbook a set of k equations

[tex]f_{\alpha}(x_1,...,x_N)=0, \ \ \ \ \ \ \alpha=1,...,k[/tex]

and it is said that these k equations are independent when the rank of the matrix

[tex]A_{\alpha i}=\left(\frac{\partial f_{\alpha}}{\partial x_i}\right)[/tex]

is maximal, i.e. equals k.

Could someone explain why this definition makes sense. I.e. why does it meet the intuitive notion of independence, and exactly what this notion of independence is when we're talking about equations. Some references would be nice to!

Thank you all.
 
Physics news on Phys.org
Let us assume that there exists a continuous set of solutions about a solution point [itex]\vec{x}_{0}[/tex]<br /> <br /> Then, we would have for some perturbation vector [itex]d\vec{x}[/itex] that <br /> [tex]f_{\alpha}(\vec{x}_{0}+d\vec{x})=0[/tex]<br /> Now, rewriting the left-hand side we get in the limit of a tiny perturbation:<br /> [tex]f_{\alpha}(\vec{x}_{0})+A_{\alpha{i}}dx_{i}=0\to{A}_{\alpha{i}}dx_{i}=0[/tex]<br /> <br /> Thus, if we are to ensure that there does NOT exist some non-zero perturbation vector in the neighbourhood of a solution [itex]\vec{x}_{0}[/itex], we must require that A is invertible.<br /> This is in tune with standard ideas of linear independence.[/itex]
 
I'm not sure what you mean by the "intuitive notion" of independence but the standard definition (from linear algebra) is that the only way we can have [itex]a_1f_1(x_1,...,x_N)+ a_2f_2(x_1,...,x_N)+ \cdot\cdot\cdot+ a_kf_k(x_1,...x_N)= 0[/itex] for all values of [itex]x_1,...,x_N[/itex] is to have [itex]a_1= a_2= \cdot\cdot\cdot= a_k= 0[/itex]. That is the same as saying that the only solution to the system of equations
[itex]a_1f_1(x_1,...,x_N)+ a_2f_2(x_1,...,x_N)+ \cdot\cdot\cdot+ a_kf_k(x_1,...x_N)= 0[/itex]
[itex]a_1f_1_{x_1}(x_1,...,x_N)+ a_2f_2_{x_1}(x_1,...,x_N)+ \cdot\cdot\cdot+ a_kf_k_{x_1}(x_1,...x_N)= 0[/itex]
...
[itex]a_1f_1_{x_N}(x_1,...,x_N)+ a_2f_2_{x_N}(x_1,...,x_N)+ \cdot\cdot\cdot+ a_kf_k_{x_N}(x_1,...x_N)= 0[/itex]
for any specific values of the xs has a unique solution. That is true if and only if the coefficient matrix, which is just the matrix you cite, has rank k.

I believe that is pretty much what arildno is saying from a slightly different point of view.
 

Similar threads

Replies
4
Views
2K
  • · Replies 9 ·
Replies
9
Views
1K
  • · Replies 17 ·
Replies
17
Views
3K
  • · Replies 8 ·
Replies
8
Views
2K
  • · Replies 27 ·
Replies
27
Views
3K
  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 7 ·
Replies
7
Views
6K
  • · Replies 2 ·
Replies
2
Views
1K
  • · Replies 12 ·
Replies
12
Views
3K