MHB How does the row picture differ from the column picture in linear systems?

otownsend
Messages
12
Reaction score
0
Hi,

I hope someone can help. I'm wanting to get a better grasp on the connection between the row picture v.s. the column picture of linear systems and their solutions. In the picture below, the row picture are the three graphs on the top and their corresponding column pictures are below them:

View attachment 7384

Clearly there is a pattern here in terms of what to expect the linear system of equations to look like graphically when it is represented in row form v.s. column form.

What I would like help on is the how a column picture like the one below would be represented as a row picture (sorry for it being a bit fuzzy):

View attachment 7386

I know that this solution exists and that there are infinite solutions, however I have no clue how this would be represented in the form of a column picture. I hope this makes sense.

If someone could explain this while also mentioning how this relates to linear independence and dependence that would be great.
 

Attachments

  • Screen Shot 2017-10-15 at 8.42.49 PM.png
    Screen Shot 2017-10-15 at 8.42.49 PM.png
    9.3 KB · Views: 134
  • 22522357_1555394117850010_897099085_o.jpg
    22522357_1555394117850010_897099085_o.jpg
    108.4 KB · Views: 110
Last edited:
Physics news on Phys.org
Hi otownsend! Welcome to MHB!

In the row graph the intersection has coordinates x and y.
That corresponds to the column graph where $\mathbf b$ is a linear combination of $\mathbf a_1$ and $\mathbf a_2$ with factors x respectively y.

If we have a unique solution, the lines in the row graph intersect, and $\mathbf a_1$ and $\mathbf a_2$ are independent in the column graph, so that they can construct $\mathbf b$.

If there is no solution, either the lines in the row graph are parallel and do not coincide, or one of the equations does not have a solution at all, meaning it has no graph.
And $\mathbf a_1$ and $\mathbf a_2$ are on the same line while $\mathbf b$ is not on that line, meaning it can't be constructed, or one of $\mathbf a_1$ and $\mathbf a_2$ is zero, while $\mathbf b$ is not.

If there are infinitely many solutions, we can have coinciding lines, or one of the equations has infinitely many solutions, while the other has at least 1 solution.
I'll leave it up to you to figure out what that means for the columns graph. (Wink)
 
##\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

Back
Top