Non homogeneous system question

Click For Summary
SUMMARY

The discussion centers on the system of equations represented as Ax=b, where A is a kxn matrix and x and b are vectors. It is established that if k>n, the system has infinitely many solutions due to the presence of free variables. Conversely, if k=n and Ax=b has a unique solution, then any system Ax=c will also have a solution, as the row operations applied to A to solve for b can be replicated for any vector c.

PREREQUISITES
  • Understanding of linear algebra concepts, specifically matrix operations.
  • Familiarity with the rank-nullity theorem and its implications on solution sets.
  • Knowledge of row reduction techniques for solving systems of equations.
  • Proficiency in working with vector spaces and linear transformations.
NEXT STEPS
  • Study the implications of the rank-nullity theorem on solution existence.
  • Learn about row reduction and Gaussian elimination techniques in detail.
  • Explore the concept of free variables in linear systems and their impact on solution sets.
  • Investigate the properties of unique solutions in square systems of equations.
USEFUL FOR

Students and professionals in mathematics, particularly those studying linear algebra, as well as engineers and data scientists working with systems of equations and matrix analysis.

nhrock3
Messages
403
Reaction score
0
there is a system Ax=b (x and b are vectors)
A is a system of kxn type
the system has at leas one solution:
1.
if k>n does the system has endless solutions
??
2.
if k=n and Ax=b has a single solution then for any system Ax=c has a solution
??


for 1:
i don't know why we need the other data k<n means we have free variables so its endless solutions

for 2:
i don't know what's c
 
Physics news on Phys.org
For 1, you are answering a different question than the one given.

For 2, if you are given that k = n and Ax = b has a unique solution, how would you find this solution? How would you find the solution to Ax = c?
 
Last edited:
one of the ways i think about part 2 is that if Ax=b has a unique solution, then if we take the matrix A and augment it with b, then A can row reduce down to a nxn identity matrix. the augmented part depends on b, certainly, but if A reduces down, then b doesn't really matter, at least considering the row operations required to get the identity. So if we keep track of the row operations we performed on A to get the solution for b, we can perform those same row operations on just any vector c to get the appropriate solution.
 

Similar threads

  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 14 ·
Replies
14
Views
3K
  • · Replies 3 ·
Replies
3
Views
2K
Replies
12
Views
2K
Replies
6
Views
1K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
Replies
6
Views
2K