MHB Confusion about the notation of transpose

alyafey22
Gold Member
MHB
Messages
1,556
Reaction score
2
Define the following

$$Z=
\begin{pmatrix}
0 & A \\
B^T & T
\end{pmatrix}$$

where we define $A$ and $B$ as $r \times m $ matrices and $T$ is an $m \times m$ matrix with nonzero distinct indeterminates at the diagonal, that is, $T_{i,i} = t_i$.

What is the meaning of $B^T$ ?
 
Last edited:
Physics news on Phys.org
ZaidAlyafey said:
Define the following

$$Z=
\begin{pmatrix}
0 & A \\
B^T & T
\end{pmatrix}$$

where we define $A$ and $B$ as $m \times r $ matrices and $T$ is is an $m \times m$ matrix with nonzero distinct indeterminates at the diagonal, that is, $T_{i,i} = t_i$.

What is the meaning of $B^T$ ?
$B^{\textsf{T}}$ denotes the transpose of $B$. So if $B$ is an $r\times m$ matrix with entries $b_{ij}$ then $B^{\textsf{T}}$ is an $m\times r$ matrix whose $(i,j)$-entry is $b_{ji}.$

Notice that $A$ and $B$ should be $r\times m$ matrices, not $m\times r$. That way, $A$ has the same number of columns as $T$, and $B^{\textsf{T}}$ has the same number of rows as $T$. To complete the partitioned matrix, the $0$ in the top left corner of $Z$ represents an $r\times r$ matrix consisting of all zeros.
 
Notice that $A$ and $B$ should be $r\times m$ matrices, not $m\times r$. That way, $A$ has the same number of columns as $T$, and $B^{\textsf{T}}$ has the same number of rows as $T$

You are correct , that was a typo. But my confusion is for using $T$ as a matrix and as a transpose. I know that $B^T$ normally defines the transpose of a matrix but is $T$ in the first place a matrix ? or just a notation ?
 
ZaidAlyafey said:
But my confusion is for using $T$ as a matrix and as a transpose. I know that $B^T$ normally defines the transpose of a matrix but is $T$ in the first place a matrix ? or just a notation ?
I hadn't even noticed that! It's just a case of bad notation. The $\textsf{T}$ that denotes the transpose is nothing to do with the $T$ that denotes the matrix. I'm glad that in my previous comment I automatically used different typefaces for them.
 
I found that construction in a published paper about Linear matroid parity. I am surprised that the authors are using such a bad notation :/
 
##\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