Questions about the properties of vector spaces and linear transformations, including linear systems in general.

learn more… | top users | synonyms

2
votes
0answers
120 views

equalizing diagonals of a matrix inverse

Let $Z$ be a square matrix; denote by $\text{diag}_k(Z)$ the matrix containing the center $2k+1$ diagonals of $Z$; i.e., if $T=\text{diag}_k(Z)$, then $$T_{ij}=Z_{ij}, \;\mathrm{if}\; |i-j|\leq k, ...
6
votes
2answers
212 views

Powers of singular matrices and pairs of identical rows

Let $A$ be a square real or complex matrix. We’ll call $A$ special if among its rows (or among its columns) there are two identical ones, different from the zero vector, (Added:) and if it has no ...
11
votes
2answers
398 views

How to project a vector onto a very large, non-orthogonal subspace

I have a difficult problem. I have a very large, non-orthogonal matrix $A$ and need to project the vector $y$ onto the subspace spanning the columns of $A$. If this were a small matrix, I would use ...
2
votes
3answers
529 views

Are all (possibly infinite dimensional) irreducible representations of a commutative algebra one-dimensional?

If $A$ is a commutative algebra over an algebraically closed field $k$, and $\rho:A \rightarrow End(V)$ is an irreducible representation of $A$ (where, a priori, $V$ may be infinite dimensional), can ...
4
votes
1answer
217 views

The Maslov triple product is alternating in its entries

Let $(V,\omega)$ be a $2g$-dimensional symplectic vector space. I'm trying to understand the Maslov triple product. I know that it can be defined in a variety of ways, but for the applications I'm ...
5
votes
1answer
304 views

Can one characterize the category of finite-dimensional vector spaces? [duplicate]

Let $K$ be a field. Does the category of finitely generated $K$-modules have a nice characterization, for example as the unique abelian category satisfying a certain simple condition? For example, we ...
4
votes
0answers
68 views

Level sets of linear combinations of Gaussians

I am trying to work out whether level sets of linear combinations of Gaussian functions are unique. For a given integer $n\ge 1$, fix $n$ points $x_i\in\mathbb{R}^d$ and $\sigma>0$. Let ...
4
votes
1answer
105 views

Distribution of the spectrum of a perturbed matrix

Let $A$ be an $n\times n$ Hermitian matrix, with well-separated eigenvalues $\lambda_1 > \lambda_2 ... > \lambda_n$, with $|\lambda_i-\lambda_j|>\epsilon$, for all $i \neq j$. Let $G$ be a ...
2
votes
2answers
112 views

Given a subdomain of GL(n), when is the map from matrices to their matrices of eigenvectors a diffeomorphism?

I'm wondering if there are any general conditions on a subdomain of $GL(n)$, which would guarantee that the map from a matrix to its matrix of eigenvectors is a diffeomorphism. For example, given a ...
8
votes
3answers
1k views

How to solve this quadratic matrix equation?

I would like to solve for $X$ in the matrix equation $$ XCX + AX = I $$ where all the matrices are $n\times n$, have real components, $X$ is positive semidefinite and $C$ is symmetric. My (possibly ...
6
votes
4answers
460 views

A name for matrices with only simple eigenvalues?

I am constantly working with hermitian matrices without multiplicity in their spectrum. Since this hypothesis appear in several important problems, for instance perturbation theory, I looked in the ...
2
votes
1answer
155 views

positive semidefinite matrix condition

There is a great work of Alizadeh that in section 4 speaks about Minimizing sum of the first few(k-largest) eigenvalues of a symmetric matrix. Instead of a symmetric model we use the weighted ...
4
votes
0answers
99 views

Concept of eigenvector restricted to nonnegative entries

Let $X\in \mathbb{R}^{n\times n}$ be a positive semidefinite matrix. The leading eigenvector $v\in \mathbb{R}^n$ of $X$ is the solution to the problem $\arg \max_{v:\lVert v\rVert_2=1} \lambda\quad$ ...
2
votes
1answer
109 views

How to solve a matrix equation with both inverses and a hadamard product?

I have a matrix equation of the form: $$ A^{-1} = B + A \circ C $$ where $\circ$ denotes the Hadamard product (i.e., $(A\circ C)_{ij} = A_{ij}B_{ij}$). How can I determine if a solution for $A$ ...
3
votes
1answer
153 views

Fast algorithm for maximizing smallest eigenvalue of linear combination of hermitian matrices

I have an engineering back ground. Due to work, I came across this problem \begin{align} &\max_{\lambda,y_i\in \mathbb{R}}~\lambda \\\ ...
3
votes
1answer
117 views

Condition number of a random 0-1 matrix

Consider a 0-1 integer $n \times n$ matrix with coefficients chosen uniformly over $\{0,1\}$. The probability that it is singular is exponentially small, and so we expect that it has a well-defined ...
3
votes
1answer
117 views

Is there an algorithm to compute group presentations of or find generators for the centralizer of a matrix in $GL(n, \mathbb{Z})$?

Let $M \in H \leq GL(n, \mathbb{Z})$. Is there an algorithm that computes either matrix generators or even a group presentation for $C_H(M)$ given generators or a presentation of $H$? Also is ...
2
votes
1answer
137 views

When is there a solution to these coupled eigenvalue equations?

I am trying to find the fixed point of a dynamical system, which requires solving two coupled eigenvalue-like equations. These equations are, in general, overconstrained. I'd like to have a simple ...
5
votes
1answer
223 views

Does this cross-product norm inequality hold?

I asked this on MSE over a month ago, but the one answer I got doesn't seem to work. Let $\times$ denote the cross-product. $\;$ Is it the case that For all unit vectors $\:\mathbf{x}\hspace{.01 ...
14
votes
4answers
760 views

Condition for two matrices to share at least one eigenvector?

Suppose that I have two matrices $A$ and $B$, and I want them to share a common eigenvector $x$. For simplicity let's just assume that the eigenvalue associated with $x$ is $1$ for both matrices, so ...
5
votes
2answers
353 views

Conjugacy classes of PGL(3,Z)

We know that every $2\times 2$ matrix in $PGL(2, \mathbb{Z})$ of order $3$ is conjugate to the matrix $$ \left( \begin{array}{cc} 1 & -1 \\ 1 & 0 \end{array} \right) $$. I am interested in ...
2
votes
3answers
228 views

eigenvalue of Laplacian matrix

If we have a Laplacian matrix $\boldsymbol{A}$ such that \begin{align} &A_{ii} >0 \\ &A_{ii}=-\sum_{j\neq i}A_{ij} \end{align} with known eigenvalues $\lambda_i$. Define the matrix ...
2
votes
1answer
105 views

Does this solution guarantee $det(A)=0$ where $A\in M(R)$? [closed]

Suppose $R$ is a commutative ring with identity $1$ and the following matrix equation holds: $\begin{pmatrix} a_n & & \\ \vdots & \ddots & \\ a_1 ...
7
votes
2answers
163 views

Sum of Difference of anti-diagonal matrix elements

Let $A \in \mathbb{R}^{n \times n}$, with elements $a_{ij}$ What conditions on $A$ are required for the following to be true? There exists some vector $x \in \mathbb{R}^n_+$, $x \neq 0$ such that ...
23
votes
6answers
1k views

Does seeing beyond the course you teach matter? The case of linear algebra and matrices

This question is indeed very important for me. Thus I hope you bear with my subjective explanations for a few minutes. I am an "excellent" lecturer, at least according to course evaluation forms ...
3
votes
1answer
118 views

On matrices conjugated in a faithful representation

Let $k$ an algebraically closed field. Let $O=k[[\pi]]$ and $F=k((\pi))$ and $G\rightarrow GL_{n}$ a faithful representation of a semisimple group. Let $A, B\in G(O)\cap G(F)^{rs}$ (rs for regular ...
0
votes
0answers
163 views

Monomial ideals: isomorphism problem for commutative algebras?

Theorem 5.27 in Polytopes, Rings, and K-Theory (Bruns, Gubeladze - 2009 - Springer SMM) claims: Let $K$ be a field and $I\!\unlhd\!K[x]= K[x_1,\ldots,x_n]$ and ...
2
votes
0answers
68 views

The minor of a square matrix

Given a $n \times n$ matrix, the $(i, j)$ minor is the determinant of the submatrix formed by deleting the i-th row and j-th column. If the sum of all row vectors and the sum of all column vectors are ...
0
votes
0answers
88 views

Operator Adjoints and Non-Symmetric Inner Products

Let $V$ be a finite dimensional vector space (over $C$ if that makes a difference), and let $T$ be a linear operator on $V$. Now if $(\cdot,\cdot)$ is an inner product on $V$, then it is well-known ...
2
votes
0answers
128 views

Invariant subspaces of permutation matrix [closed]

Let $\sigma$ be a permutation matrix of order $n$. What are all the invariant subspaces of $\sigma$? (I can only find 1 and n-1 dimensional subspaces) Thanks in advance.
0
votes
1answer
136 views

Bounding the positive semi-definite matrix with its block diagonal matrix [closed]

Can we bound $\mathbf{A}$ with $\mathbf{A^*}$ as ${\bf{A}} \preceq {{\bf{A}}^*}$ where \begin{equation} {\bf{A}} = \left[ {\begin{array}{*{20}{c}} {{{\bf{A}}_{11}}}&{...}&{{{\bf{A}}_{1N}}}\\ ...
5
votes
0answers
191 views

Singularity of an $l\times l$ matrix whose entries are $2l$-th roots of unity

Let $l$ be a positive integer, $\zeta$ be a primitive $2l$-th root of unity in $\mathbb{C}$, and $\alpha,\beta$ be $\pm1$ sequences of length $l$, i.e. $\alpha_k=\pm1,\beta_k=\pm1$ for ...
3
votes
2answers
203 views

Looking for a reference: double orthogonal complement in $(\mathbb{Z}/q\mathbb{Z})^n$

I'm using the following result in a computer science paper: Let $V$ be a submodule of $(\mathbb{Z}/q\mathbb{Z})^n$ (n-tuples with addition and multiplication mod $q$). Let $$V^\perp = \{u \in ...
0
votes
0answers
155 views

Closed-form expressions for dual norms of real normed vector spaces

Didn't get any biters over at MSE, so I figure this place might be more appropriate... Say that $V$ is a finite-dimensional real normed vector space, where for some $v \in V$ the norm is notated by ...
5
votes
0answers
175 views

Hermitian forms over quaternion algebra

Notations: Let $Q=(a,b)$ be a quaternion algebra over a field of characteristic $\neq 2$, i.e. $i^2=a, j^2=b, k=ij, ij=-ji$. Consider $K=k(t)(\alpha)$, where $\alpha=\sqrt{at^2+b}$. Let ...
4
votes
0answers
94 views

Preconditioner for finding the smallest eigenpairs of a large, but structured, matrix

I'm trying to find the eigenvector corresponding to the second smallest eigenvalue of a large $(4,000,000 \times 4,000,000)$ matrix $L$. $L$ is a graph Laplacian, with the following structure: $L = D ...
3
votes
0answers
131 views

Compute the discriminant for reductive groups

Consider $G=GL_{2}$ and $F=k((\pi))$, and a diagonal matrix $t=\left(\begin{array}{cc}a&0\\0&b\end{array}\right)$. The characteristic polynomial of $t$ is $X^{2}-(a+b)X+ab$, and the ...
3
votes
3answers
161 views

On matrices in linear forms with vanishing determinant

This is a cross-post from my original question at math.se. I decided to post here because it seems more difficult than I originally thought. Let $R=\mathbb C[x_1,\ldots,x_r]$ be a polynomial ring. ...
2
votes
1answer
201 views

On a determinant inequality of positive definite matrices

Assume that $B$ and $A$ are two positive definite matrices. Take $B^*$ a block diagonal matrix with block $B_{11}$ and $B_{22}$ of $B$. This means the following: $$ B=\left[\begin{array}{ll} ...
0
votes
1answer
105 views

singular values function

Let $\mathbf{F}\in\mathbb{C}^{M\times M}$ and $\mathbf{D} = \operatorname{diag}(\mathbf{d})$ where $\mathbf{d}\in\mathbb{R}^M$. By SVD, ...
5
votes
2answers
280 views

How to calculate the determinant bundle

Maybe, this is a problem of linear algebra. But I do not know how to calculate it. Let $E$ be a vector bundle of rank $2$ over an algebraic surface. If $H=S^{2n}E\bigotimes (\operatorname{det} ...
3
votes
1answer
116 views

Linear Complex Structure and Kahler Angles

I am trying to read Donaldson's paper on symplectic submanifolds http://projecteuclid.org/DPubS?service=UI&version=1.0&verb=Display&handle=euclid.jdg/1214459407 and am getting a bit ...
0
votes
0answers
92 views

Perturbation of spectrum and eigenspaces

Let $A \in \mathbb{C}^{n \times n}$ be an $n \times n$ matrix. Consider the rank-$1$ perturbation $A'$ of $A$ given by replacing a column $v$ of $A$ by $\alpha \cdot v$, where $\alpha \in [0, 1)$. Can ...
0
votes
2answers
254 views

Kernel of AB if $[A,B]=0$ and $AB\neq0$? [closed]

I have found similar results here and mathematics stack exchange but they all imposed specific conditions that don't suit this problem in particular. The problem is as follows. Let A,B be square ...
18
votes
1answer
556 views

Linear Algebra without Choice

We consider the field of "usual" linear algebra. Q. Which aspects of it can be carried out without the Axiom of Choice? Q. Do interesting "exotic" phenomena appear in presence of (some instance of) ...
2
votes
1answer
227 views

Find the transformation $P$ that minimizes the following:

$$\displaystyle\min_{\mathbf{P}} \text{trace}(\mathbf{APP^HA^H}) \quad{} \text{subject to} \quad{} \text{trace}(\mathbf{(I-P)(I-P)^H})=\alpha, \alpha \geq0$$ Can also be rewritten as ...
1
vote
0answers
51 views

M-matrix with nonconstant entries properties

I have a matrix $J(x)$ with $J_{ij}(x)=f_{ij}(x)$ where vector $x$ is $x=x_1, x_2, ..., x_m$. I have shown that $J(x)$ is an M-matrix for all $x$. There is known review paper by Plemmons (1977) of 40 ...
0
votes
0answers
97 views

a very elementary question on the conjugated matrices

Let $A$ and $B$ two matrices in $GL_{n}(K[[\pi]])$, regular semisimple on $GL_{n}(K((\pi)))$, with $K$ an algebraically closed field of characteristic zero . We suppose that they have the same ...
0
votes
1answer
247 views

eigen-decomposition solution? is it unique?

Assume an N*N covariance matrix (Q) which is a positive definite matrix. The decoder X is assumed to be N*s, where s<=N. X is calculated to be s eigenvectors corresponding to s minimum eigenvalues. ...
3
votes
0answers
181 views

An optimization problem over real symmetric matrices

Given an $n\times s$ matrix $P$ of positive real numbers and $T\geq n$, find (either by a formula or an algorithm) the real symmetric $n\times n$ Z-matrix $A$ which maximizes $\min\limits_{1\leq ...