MHB Solving 2x2 Matrix Projection Problem: Strang's Approach

arrow27
Messages
7
Reaction score
0
Many important techniques in fields such as CT and MR imaging in medicine,
nondestructive testing and scientific visualization are based on trying
to recover a matrix from its projections. A small version of the problem
is given the sums of the rows and columns of a 2 x 2 matrix, determine the
elements of the matrix. Solve this problem or show why it cannot be solved(Strang)
 
Physics news on Phys.org
arrow27 said:
Many important techniques in fields such as CT and MR imaging in medicine,
nondestructive testing and scientific visualization are based on trying
to recover a matrix from its projections. A small version of the problem
is given the sums of the rows and columns of a 2 x 2 matrix, determine the
elements of the matrix. Solve this problem or show why it cannot be solved(Strang)
What have you tried so far? Have you looked at both possible outcomes? In other words, have you tried (a) to prove the result, and (b) to find a counterexample? A possible counterexample might consist of two different matrices with the same row sums and column sums.
 
##\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...
Back
Top