MHB Determine the solution set of the system using the echelon form

mathmari
Gold Member
MHB
Messages
4,984
Reaction score
7
Hey! :o

Let $\displaystyle{a:=\begin{pmatrix}2 & 1 & 0 & 5 \\ 1 & 0 & 1 & 1 \\ 4 & 1 &2 & 7\end{pmatrix}\in \mathbb{R}^{3\times4}}$ and $\displaystyle{b_1:=\begin{pmatrix}1 \\ 1 \\ 1\end{pmatrix} , \ b_2:=\begin{pmatrix}-2 \\ 1 \\ 0\end{pmatrix} \in \mathbb{R}^3}$.

I applied the Gauss algorithm to get the echelon form of the matrix $a$ :
\begin{align*}\begin{pmatrix}2 & 1 & 0 & 5 \\ 1 & 0 & 1 & 1 \\ 4 & 1 &2 & 7\end{pmatrix} & \ \overset{R_2:R_2-\frac{1}{2}\cdot R_1}{\longrightarrow} \ \begin{pmatrix}2 & 1 & 0 & 5 \\ 0 & -\frac{1}{2} & 1 & -\frac{3}{2} \\ 4 & 1 &2 & 7\end{pmatrix} \\ &\ \overset{R_3:R_2-2\cdot R_1}{\longrightarrow} \ \begin{pmatrix}2 & 1 & 0 & 5 \\ 0 & -\frac{1}{2} & 1 & -\frac{3}{2} \\ 0 & -1 &2 & -3\end{pmatrix}\\ &\ \overset{R_3:R_2-2\cdot R_2}{\longrightarrow} \ \begin{pmatrix}2 & 1 & 0 & 5 \\ 0 & -\frac{1}{2} & 1 & -\frac{3}{2} \\ 0 & 0 &0 & 0\end{pmatrix}\end{align*}

Then I want to determine the solution set of the system $ax=b_i$ using the echelon form for $i=1$ and $i=2$.

Does this mean that we can use the echelon form of $a$ to calculate the solution or do we use the echelon form of the extended matrix $(a\mid b_i)$ ? (Wondering)
 
Physics news on Phys.org
mathmari said:
Then I want to determine the solution set of the system $ax=b_i$ using the echelon form for $i=1$ and $i=2$.

Does this mean that we can use the echelon form of $a$ to calculate the solution or do we use the echelon form of the extended matrix $(a\mid b_i)$ ?

Hey mathmari!

I'm afraid that we'll have to use the echelon form of the extended matrix $(a\mid b_i)$. (Thinking)

Alternatively we could use the echelon form of the extended matrix $(a\mid I_3)$ where $I_3$ is the 3x3 identity matrix. (Thinking)
 
You can do both problems at once by row reducing
\begin{pmatrix}2 & 1 & 0 & 5 & 1 & -2 \\ 1 & 0 & 1 & 1 & 1 & 1 \\ 4 & 1 & 2 & 7 & 1 & 0\end{pmatrix} where the last two columns are b_1 and b_2.

Klas Van Aarsen's suggestion that you row reduce
\begin{pmatrix}2 & 1 & 0 & 5 & 1 & 0 & 0 \\ 1 & 0 & 1 & 1 & 0 & 1 & 0\\ 4 & 1 & 2 & 7 & 0 & 0 & 1 \end{pmatrix}
uses the fact that once you have row reduced A, the same operations will have converted the identity matrix to A^{-1}.
 
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...
Back
Top