Sparse Matrix transformation to locate columns containing zeros

taknevski
Messages
1
Reaction score
0
Suppose I have a MxN matrix and each column may contain exactly 1 zero or
no zeros. Is there a transformation that when applied to this matrix will
return another 1xN matrix with a 0 in the corresponding column if that
column in the original matrix contains a 0 or a 1 in the column position if
that column in the original matrix contains no zeros.

For example if the 4x4 original matrix is

1 1 8 9
2 0 7 2
3 2 9 6
4 5 0 2

is there a transformation that will give me

1 0 0 1

since the 2nd and 3rd column contain a zero and the 1st and 4th columns
contain no zeros?
 
Physics news on Phys.org
No. Your matrix has full rank and is invertible. You cannot reduce it to one row. But as it is invertible, you can solve
$$
\begin{bmatrix}1&1&8&9\\2&0&7&2\\3&2&9&6\\4&5&0&2\end{bmatrix}\cdot \begin{bmatrix}x_1\\x_2\\x_3\\x_4\end{bmatrix}= \begin{bmatrix}1\\0\\0\\1 \end{bmatrix}
$$
 
##\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