MHB Solve System of Equations: Unique Solution & Geometric Explanation

Guest2
Messages
192
Reaction score
0
I'm trying to answer the question below in the attachment. Could someone please check my answer to part (c), as I'm not sure. Is it correct? Is that that the right geometric explanation for the planes?

(a) The equation is $\begin{pmatrix}1 & -1& 2& 1 \\ 2 & 1 & 1 & -1 \\ 1 & -2 & \lambda & 3 \end{pmatrix} $

(b) $\begin{pmatrix}1 & -1& 2& 1 \\ 2 & 1 & 1 & -1 \\ 1 & -2 & \lambda & 3 \end{pmatrix} \to \begin{pmatrix}1 & -1& 2& 1 \\ 0 & 3 & -3 & -3\\ 0 & -1 & \lambda -2 & 2 \end{pmatrix} \to \begin{pmatrix}1 & -1& 2& 1 \\ 0 & 1 & -1 & -1\\ 0 & 0 & \lambda -3 & 1 \end{pmatrix}$.

Thus the condition for the system to have a unique solution is $\lambda - 3 \ne 0 \implies \lambda \ne 3$.

And if $\lambda \ne 3$ then $ z = \frac{1}{\lambda-3}$ then $y = \frac{1}{\lambda-3}-1$ and $x = -\frac{1}{\lambda-3}$ is the unique solution to the system.

(c) If $\lambda = 3$ then the system has no solution. For all other values of $\lambda$ there's exactly one unique solution (given above). Geometrically it means their intersection is a point.
 

Attachments

  • Screen Shot 2016-03-09 at 17.58.57.png
    Screen Shot 2016-03-09 at 17.58.57.png
    30.6 KB · Views: 120
Physics news on Phys.org
Guest said:
(a) The equation is $\begin{pmatrix}1 & -1& 2& 1 \\ 2 & 1 & 1 & -1 \\ 1 & -2 & \lambda & 3 \end{pmatrix} $
An equation must have the $=$ sign. In this case it is
\[
\begin{pmatrix}1 & -1& 2\\ 2 & 1 & 1 \\ 1 & -2 & \lambda \end{pmatrix}
\begin{pmatrix}x\\y\\z\end{pmatrix}=
\begin{pmatrix}1\\-1\\3\end{pmatrix}.
\]
The matrix you wrote is the augmented matrix of the system of equations.

Guest said:
(c) If $\lambda = 3$ then the system has no solution. For all other values of $\lambda$ there's exactly one unique solution (given above). Geometrically it means their intersection is a point.
Whose intersection? It is clear from the question that you mean the planes defined by the equations, but I would not use only a pronoun in the answer.

You should also probably say explicitly that having infinitely many solutions is not possible. (It would be if the right-hand side of the last equation were 0.) If $\lambda\ne3$, then the tree planes intersect in a single point, and if $\lambda=3$, then the third plane is parallel to the intersection line of the first two planes, so the intersection of all three planes is empty.
 
I asked online questions about Proposition 2.1.1: The answer I got is the following: I have some questions about the answer I got. When the person answering says: ##1.## Is the map ##\mathfrak{q}\mapsto \mathfrak{q} A _\mathfrak{p}## from ##A\setminus \mathfrak{p}\to A_\mathfrak{p}##? But I don't understand what the author meant for the rest of the sentence in mathematical notation: ##2.## In the next statement where the author says: How is ##A\to...
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