Search Results
Search type | Search syntax |
---|---|
Tags | [tag] |
Exact | "words here" |
Author |
user:1234 user:me (yours) |
Score |
score:3 (3+) score:0 (none) |
Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
Views | views:250 |
Code | code:"if (foo != bar)" |
Sections |
title:apples body:"apples oranges" |
URL | url:"*.example.com" |
Saves | in:saves |
Status |
closed:yes duplicate:no migrated:no wiki:no |
Types |
is:question is:answer |
Exclude |
-[tag] -apples |
For more details on advanced search visit our help page |
Questions about the properties of vector spaces and linear transformations, including linear systems in general.
6
votes
3
answers
648
views
Real orthogonal and sign [closed]
I came across the following conjecture, reading a recent paper in the Monthly, an orthogonal matrix of order $n\neq 0 \pmod 4$ has a nonnegative (up to a scalar) row vector.
It should be straight in …
6
votes
Accepted
Monotonicity of eigenvalues
The idea is to apply a unitary congruence $$U=\dfrac{1}{\sqrt{2}}\begin{pmatrix}I&-I\\I&I\end{pmatrix}.$$ I consider here $\mathcal{B}$ to be hermitian, $\mathcal{B}=\mathcal{B}^*$, whereas the genera …
6
votes
Accepted
Matrices with same eigenvalues
To answer say a previous question, call such tridiagonal matrix $T$; the matrices $T$ and $-T$ (of dimension $n$) are unitarily congruent (they have the same spectra), that is there is an 'alternating …
2
votes
2
answers
195
views
An $n$ eigenvalue multiplicity
Suppose we have $A_i$, $i=1\ldots n$, $n\times n$ complex matrices linearly independent. It may be conjectured that there exist $(a_1,\ldots,a_n) \in \mathbb{C}^n$ not all zero such that $\sum_{i=1}^ …
1
vote
1
answer
358
views
Unitary condition
I came across the following while doing some related proof;
It seems easy to prove. $\quad$
We are in ${\mathbb{M}}_n(\mathbb{C})$, $n>1$:
$1$) Given a unitary $n\times n$ matrix $U$, there is some …
1
vote
Support of eigenvectors
For fixed $N$ the answer is yes, the case $\lambda=0$ should be easy, for $\lambda\neq 0$ one can take the candidate eigenvector $v$ whose first entry is zero $v=(0;x_1;x_2;\ldots;x_N)$ $(x_1=1)$ and …
1
vote
On the bounds of the sum of the squares of spectral variation of two real symmetric matrices
A bound seems $4n(n-1)$, attained for $A=J-I$ and $B=-A$ (as in the comment) -edit- if we allow any ordering of the eigenvalues. First $$\sum_{i=1}^n\lambda_i(A)^2=\text{Tr}(A^2)=\sum_{i,j}|a_{i,j}|^2 …
1
vote
An inequality related to matrix trace
The inequality fails when we take non particular cases, for example non diagonal matrices. Say $U \Sigma U^T>0$, and $S=(U \Sigma U^T)^{-1}$. The inequality is equivalent to prove $$\text{Tr}(SB^T|B|) …
1
vote
1
answer
351
views
A sequence and majorization
For two positive vectors $a,b$ such that $a\prec b$, we know that there is an $m$ sequence of vectors $c^{(i)}$ such that $$a\prec c^{(1)}\prec \ldots \prec c^{(m)}\prec b$$ where each vector in the …
0
votes
A linear equation problem related to projection
I got to understand say $n=2$ and $s=d$, you are putting $\langle x_1;v_i\rangle=\langle x_2;v_i\rangle$ for all $i=1,\ldots, d$. This implies by linear combination, as $(v_1;\ldots;v_d)$ is a basis, …
0
votes
Transforming matrix to off-diagonal form
The $C$ is a particular block matrix, $C\in \mathbb{M}_3(\mathbb{M}_2(\mathbb{C}))$. For $V$ unitary let $V\begin{pmatrix}0&a\\\bar a&0\end{pmatrix}V^*=\begin{pmatrix}s&0\\0&-s\end{pmatrix}$, $P$ the …
0
votes
Property of positive semi-definite
I am just putting a long possible comment here. The following has many reformulations; the idea is to give a condition for which the two matrices $A$ and $M$ in the OP question are congruent by a unit …
0
votes
Lower bound on the rank of a graph
This could be proven as follows (if i understood).
Given a complex block matrix $M\in\mathbb{M}_m(\mathbb{M}_d)$ of dimension $n$ as $d\times m=n$. Assume that all diagonal entries of $M$ are not zero …
0
votes
Sum of squares of $k\times k$ cofactors is $1$ for an orthonormal matrix
I just want to add a proof that may be given independently:
Suppose we are given $k$ mutually orthogonal vectors in ${\mathbb{R}}^n\backslash\{0\}$; in matrix form this is a $k\times n$ matrix $A=[a_ …