Is There a General Way to Format a Counterexample for Diagonal Matrices?

  • Thread starter Thread starter jsgoodfella
  • Start date Start date
  • Tags Tags
    Matrices Product
jsgoodfella
Messages
6
Reaction score
0
If we take an nxn diagonal matrix, and multiply it by an nxn matrix C such that AC=CA, will C be diagonal? I know, for instance, if C is a matrix with ones in every entry, AC=CA holds. But is there a more general way to format such a counterexample, or have I already provided a sufficient "proof"?



Thanks in advance. This isn't a homework question.
 
Physics news on Phys.org
jsgoodfella said:
If we take an nxn diagonal matrix, and multiply it by an nxn matrix C such that AC=CA, will C be diagonal? I know, for instance, if C is a matrix with ones in every entry, AC=CA holds. But is there a more general way to format such a counterexample, or have I already provided a sufficient "proof"?



Thanks in advance. This isn't a homework question.


\left(\begin{array}{cc}2&0\\0&2\end{array}\right) \left(\begin{array}{cc}1&1\\0&1\end{array}\right)=\left(\begin{array}{cc}2&2\\0&2\end{array}\right)=\left(\begin{array}{cc}1&1\\0&1\end{array}\right) \left(\begin{array}{cc}2&0\\0&2\end{array}\right)
DonAntonio
 
When you disprove a statement by providing a counter-example, one counter-example is sufficient. There is no need to provide more.
 
phyzguy said:
When you disprove a statement by providing a counter-example, one counter-example is sufficient. There is no need to provide more.



Yes, of course. Whom are you addressing and why?

DonAntonio
 
DonAntonio said:
Yes, of course. Whom are you addressing and why?

DonAntonio

The OP asked whether he had already provided a sufficient proof. The answer is yes - since had already provided one counter-example, this is sufficient to disprove the original statement. That's all I'm saying.
 
phyzguy said:
The OP asked whether he had already provided a sufficient proof. The answer is yes - since had already provided one counter-example, this is sufficient to disprove the original statement. That's all I'm saying.



Good. This time you provide a quote of whom you're addressing and thus we know. The last time we, or at least I, didn't know.

DonAntonio
 
##\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