How to solve a system with more unknowns than equations?

  • Thread starter Thread starter stonecoldgen
  • Start date Start date
  • Tags Tags
    System Unknowns
stonecoldgen
Messages
108
Reaction score
0
Because if you reduce to Row-Echelon form you don't end up with a triangulated form. Here is what I ended up with (How do I use Latex Reference to construct a Matrix? Can someone help me with that by the way please?)

1 -1 3 2 | 1
0 1 1 3 | -1
0 0 1 1 | -1
 
Physics news on Phys.org
stonecoldgen said:
Because if you reduce to Row-Echelon form you don't end up with a triangulated form. Here is what I ended up with (How do I use Latex Reference to construct a Matrix? Can someone help me with that by the way please?)

1 -1 3 2 | 1
0 1 1 3 | -1
0 0 1 1 | -1

Here is the LaTeX code:

\left(\begin{array}{cccc|c}<br /> 1 &amp; -1 &amp; 3 &amp; 2 &amp; 1\\<br /> 0 &amp; 1 &amp; 1 &amp; 3 &amp; -1\\<br /> 0 &amp; 0 &amp; 1 &amp; 1 &amp; -1<br /> \end{array}\right)

See our LaTeX tutorial: https://www.physicsforums.com/showpost.php?p=3977517&postcount=3

Anyway, to the math. In cases like this, you will not get a unique solution, you will get infinitely many solutions which depend on a free parameter. Let's first transfrom the system back to the usual form:

\left\{<br /> \begin{array}{l}<br /> x - y + 3z + 2t = 1\\<br /> y + z + 3t = -1\\<br /> z + t = -1<br /> \end{array}<br /> \right.

The idea is to write all variables in function of ##t## (or ##x## or whatever, it doesn't matter which one). We can certainly write ##z## in function of ##t## as follows:

z = -1 - t

Now, we know ##y + z + 3t = -1##, we can substitute the above version of ##z## into this equation and get

y + (-1 -t) + 3t = -1

Thus we can write ##y## in function of ##t##:

y = -2t

Finally, we can do the same for ##x##, we have the equation ##x - y + 3z + 2t = 1##. Substituting ##y## and ##z##, we get

x - (-2t) + 3(-1-t) + 2t = 1

Solving for ##x## gives us

x = 4-t

So we get the following solutions for the system:

x= 4-t,~y=-2t,~z=-1-t

This means that for every real number ##t## that we take, we get a solution for our system. For example, taking ##t=0##, we get ##(x,y,z,t) = (4,0,-1,0)##. On the other hand, taking ##t=1##, we get ##(x,y,z,t) = (3,-2,0,1)## as a solution. So we see that we have infinitely many solutions, one for each ##t##.
 
  • Like
Likes 1 person
##\textbf{Exercise 10}:## I came across the following solution online: Questions: 1. When the author states in "that ring (not sure if he is referring to ##R## or ##R/\mathfrak{p}##, but I am guessing the later) ##x_n x_{n+1}=0## for all odd $n$ and ##x_{n+1}## is invertible, so that ##x_n=0##" 2. How does ##x_nx_{n+1}=0## implies that ##x_{n+1}## is invertible and ##x_n=0##. I mean if the quotient ring ##R/\mathfrak{p}## is an integral domain, and ##x_{n+1}## is invertible then...
The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...
When decomposing a representation ##\rho## of a finite group ##G## into irreducible representations, we can find the number of times the representation contains a particular irrep ##\rho_0## through the character inner product $$ \langle \chi, \chi_0\rangle = \frac{1}{|G|} \sum_{g\in G} \chi(g) \chi_0(g)^*$$ where ##\chi## and ##\chi_0## are the characters of ##\rho## and ##\rho_0##, respectively. Since all group elements in the same conjugacy class have the same characters, this may be...

Similar threads

Replies
2
Views
3K
Replies
3
Views
1K
Replies
15
Views
2K
Replies
1
Views
1K
Replies
2
Views
3K
Replies
6
Views
3K
Back
Top