The rank of a block matrix as a function of the rank of its submatrice

GoodSpirit
Messages
18
Reaction score
0
Hello everyone,
I would like to post this problem here in this forum.
Having the following block matrix:

<br /> \begin{equation}<br /> M=\begin{bmatrix}<br /> S_1 &amp;C\\<br /> C^T &amp;S_2\\<br /> \end{bmatrix}<br /> \end{equation}<br />

I would like to find the function $f$ that holds rank(M)=f( rank(S1), rank(S2)).
S_1 and S_2 are covariance matrices-> symmetric and positive semi-definite.
C is the cross covariance that may be positive semi-definite.

Can you help me?

I sincerely thank you! :)

All the best

GoodSpirit
 
Last edited:
Physics news on Phys.org


Are you sure that this function exists?

<br /> \begin{equation}<br /> M=\begin{bmatrix}<br /> 1 &amp;1\\<br /> 1 &amp;1\\<br /> \end{bmatrix}<br /> \end{equation}<br />
=> rank(M)=1
<br /> \begin{equation}<br /> M=\begin{bmatrix}<br /> 1 &amp;.5\\<br /> .5 &amp;1\\<br /> \end{bmatrix}<br /> \end{equation}<br />
=> rank(M)=2
 


Hi mfb,

Thank you for answering! :)

True! it depends on something more!

M is also a covariance matrix so C is related to S1 and S2.

It is a good idea to make the rank M dependent of the C rank.

The rank of M may be dependent of the eigen values that are shared by S1 and S2

Thankk you again

All the best

GoodSpirit
 
Thread 'Determine whether ##125## is a unit in ##\mathbb{Z_471}##'
This is the question, I understand the concept, in ##\mathbb{Z_n}## an element is a is a unit if and only if gcd( a,n) =1. My understanding of backwards substitution, ... i have using Euclidean algorithm, ##471 = 3⋅121 + 108## ##121 = 1⋅108 + 13## ##108 =8⋅13+4## ##13=3⋅4+1## ##4=4⋅1+0## using back-substitution, ##1=13-3⋅4## ##=(121-1⋅108)-3(108-8⋅13)## ... ##= 121-(471-3⋅121)-3⋅471+9⋅121+24⋅121-24(471-3⋅121## ##=121-471+3⋅121-3⋅471+9⋅121+24⋅121-24⋅471+72⋅121##...
##\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...
Back
Top