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

learn more… | top users | synonyms

4
votes
0answers
69 views

Efficiently factorize a KKT system with block diagonal upper corner

I have a system resulting from a quadratic energy minimization with linear equality constraints enforced with Lagrange multipliers which has the form: \begin{equation} A = \left[\begin{array}{c|c} ...
2
votes
1answer
137 views

Symplectic block-diagonalization of a complex symmetric matrix

This is a follow-up question to the one asked here: Given a complex symmetric $2n\times2n$-matrix $A$, i.e., $A\in \mathbb{C}^{2n\times2n}$ with $A = A^T$. Is it possible, to block-diagonalize $A$ ...
1
vote
2answers
48 views

Linear Programm with matrix [closed]

Is there a name for problems like this min norm(Cx) Ax = b where C is a matrix and norm is the maximum norm. This is kind of like a linear Programm. Could this be rewritten as linear programm? Or Any ...
0
votes
1answer
133 views

Collecting terms of a linear expression with nested sums and combinatorics in coefficients

I need to collect the $\Pr(\cdot)$ terms of the following expression: $\sum_{m=3}^{n}\frac{g_{m}\left( \cdot \right) }{\left( \sqrt{\theta \left( 1-\theta \right) }\right) ^{m}}\left[ ...
10
votes
2answers
412 views

Codimension of the range of certain linear operators

Assume that $P(x,y), Q(x,y) \in \mathbb{R}[x,y]$ are two polynomials. We define a linear map $D$ on $\mathbb{R}[x,y]$ with $D(U)=PU_{x}+QU_{y}$. In fact $D$ is the derivational operator correspond ...
4
votes
1answer
113 views

variation of the Lieb concavity theorem

A special case of the well known Lieb concavity theorem states that the following function is concave on positive operators A and B: $$ (A,B) \to \text{Tr} \{A^s X B^{1-s} X^\dagger \} $$ for $s \in ...
1
vote
0answers
42 views

Injectivity of a linear logistic transform

The motivation for this question has to do with neural networks, but it is essentially a purely mathematical question. Suppose you have a perceptron with one hidden layer, a bias, and a logistic ...
6
votes
1answer
217 views

Sets of cardinalities of bases without choice

For a vector space $V$, let $BS(V)$ be the set of cardinalities (not necessarily $\aleph$s) of bases of $V$. Of course, in ZFC each $BS(V)$ is a singleton, but supposing the axiom of choice fails, it ...
0
votes
0answers
73 views

Inverse problem with a rank-1 update

I hope you can help me out with this. I have to find the solution x to an inverse system $$ x=A^{-1}b $$ This inverse problem is basically a least square problem with a rank-1 update. $$ ...
3
votes
0answers
204 views

Find the Range of Function

What is the range of the map $\mathbb{C}^m\to\mathbb{C}^m$, $$(z_1,\ldots,z_m)\mapsto (b_1,\ldots,b_m),$$ where $b_k=\prod_{j\neq k}(z_j-z_k)$ for $1\leq k\leq m$ ?
0
votes
1answer
82 views

Any generic way to move a psd matrix to its neighbors?

Given a two positive matrices $A,B$. For simplicity, let's assume that $Tr A=Tr B=1$. Assume that $\|A-B\|_1\leq\varepsilon$, for some small $\varepsilon>0$, where $\|\cdot\|_1$ is the $l_1$-norm, ...
0
votes
0answers
39 views

Multiplicity of Minimum Eigenvalue of a Convex Combination of Hermitian matrices?

Let $A_1,\dots,A_L$ be $N\times N$ hermitian matrices. Consider the problem \begin{align} \lambda^{\star}=\max_{}&\lambda_{min}\left(\sum_{i=1}^{L}r_iA_i\right) \\ &r_i\geq ...
4
votes
1answer
123 views

Characterization(?) of coersive(?) elements in the special linear group

Take your favorite matrix norm $\|\bullet\|$ (my favorite is the Frobenius norm $\|A\| = \sqrt{\operatorname{tr} A A^t}$). Now consider the set $S_x$ of matrices $A,$ such that $\|A\| < x$ and ...
9
votes
2answers
477 views

What are the invariants of $U\otimes V\otimes W$ under action of $GL(U)\times GL(V) \times GL(W)$

The tensor product of some (finite dimensional real) vector spaces is acted on by the direct product of their general linear groups. I would like to know if there are explicit invariants in the case ...
2
votes
0answers
69 views

Lanczos algorithm with thick restart on a dynamic matrix

currently, I'm working on a way to compute the 2 biggest eigenvalues of a real, symmetric, huge and sparse matrix that changes a few entries from time to time. The problem should be solved using an ...
14
votes
1answer
394 views

Lift chain complex from $\mathbb{F}_2$ to $\mathbb{Z}$

We start with a finite dimensional chain complex over $\mathbb{F}_2$, equipped with a basis. That is, we have finitely many finite dimensional $\mathbb{F}_2$-vector spaces $C_0,\dots,C_k$ with bases ...
1
vote
0answers
47 views

Bounding Rayleigh quotioent for stochastic matrix

Suppose you have an irreducible, stochastic matrix $A$ with left Perron-Frobenius eigenvector $v$ (corresponding to the eigenvalue $1$), and suppose the next largest eigenvalue for $A$ is $\lambda$. ...
3
votes
1answer
168 views

About partial uniqueness of SVD

In order to prove non-uniqueness of singular vectors when a repeated singular value is present, the book (Trefethen-Bau, considered the most authotitative book on the subject), argues as follows: Let ...
3
votes
0answers
42 views

successive schur complements

If I have a large (e.g. 6000x6000), sparse, positive definite matrix $M$ (which may have individual entries everywhere, but most non-zero entries are on / around the diagional). Divide $M$ into blocks ...
5
votes
0answers
257 views

Symmetric matrices with $\rho(A)\gg\|A\|_\infty$

For a symmetric real matrix $A$, denote by $\rho(A)$ the spectral radius of $A$, and by $\sigma(A)$ the largest absolute row sum of $A$; that is, $\sigma(A)=\max_i \sum_j |a_{ij}|$, where $a_{ij}$ are ...
2
votes
0answers
155 views

Norm bound of a complex resolvent

A well known result by Varah states that if $A$ is a strictly diagonally dominant matrix of dimension $n$, then $\|A^{-1}\|_{\infty} \le \max_i\frac{1}{|a_{kk}|-\sum_{j \neq k}|a_{kj}|}$, where the ...
5
votes
1answer
135 views

Simultaneous Tridiagonalization of a given set of hermitian matrices?

I have a set of $N\times N$ hermitian matrices $A_i,~i=1,\dots,M$. Are there any results on the possibility of simultaneously tridiagonalizing them?
5
votes
2answers
332 views

How to check whether a matrix is completely positive or not?

The definition: cone of completely positive matrices $\mathcal{C}=\{\sum_{i=1}^kx_ix_i^T:x_i\in\mathbb{R}^n_+\ for \ i=1,2,...,k\}$. I just don't knwo how to check whether a matrix belongs to ...
3
votes
1answer
111 views

submatrix of a given size with maximum frobenius norm

Let $I\subset \{1,2,\ldots,n\}$, and let $|I|$ denote its cardinality. Now given a Hermitian matrix $\mathbf{A}\in\mathbf{C}^{n\times n}$. I am interested in finding the subset $I$ that maximizes the ...
7
votes
0answers
103 views

When is a product of hyperbolic matrices hyperbolic?

Suppose $A_1,\ldots,A_n$ is a sequence of $2 \times 2$ complex matrices such that $| \det(A_j) | =1$ and $ | \mathrm{tr}(A_j) | > 2 $ for each $j$. What kinds of reasonable restrictions can one ...
1
vote
1answer
170 views

Distributing the Hodge map over the wedge product

Let $(V,\langle,\rangle)$ be a finite dimensional inner product space, $V^{\wedge}$ it exterior algebra, and $\ast$ the Hodge star arising from $\langle,\rangle$. Does there exist any formula to ...
0
votes
0answers
50 views

Compare full-rank probabilities of products of random matrices

Consider two matrices $C_1=A\times B_1$ and $C_2=A\times B_2$, where $A\in\mathbb{F}_q^{N\times K}$, $B_1\in\mathbb{F}_q^{K\times M}$ and $B_2\in\mathbb{F}_2^{K\times M}$; $M\leq N\leq K$. It is ...
0
votes
0answers
77 views

Complexity of turning a d-degree polynomial to 2-degree polynomial

For a very simple example, $(1+x)^4=x^4+4x^3+6x^2+4x+1$ is a 4 degree polynomial, and I want to change it to a 2-degree polynomial by add more variables, for this example, we can simply let $y=x^2$, ...
28
votes
0answers
874 views

a naive question about the second dual of a vector space

Let $K$ be a field. Are there non-scalar endomorphisms of the endofunctor $$ V\mapsto V^{**}/V $$ of the category of $K$-vector spaces? I asked a related question on Mathematics Stackexchange, but ...
3
votes
0answers
144 views

Is there such a matrix in $SO(n)$?

Given two $n$ dimensional positive definite matrices $A', B'$, is there a matrix $O \in SO(n)$ such that $A=O A', B=O B'$ and $$ \frac{A_{ij}}{\sqrt{A_{ii}A_{jj}}} = ...
6
votes
4answers
371 views

NP-hard problems in linear algebra and real analysis [closed]

I am curious about NP-hard problems in linear algebra and real analysis. An example in linear algebra would be the calculation of the permanent. I would thus like to collect in this thread a list of ...
3
votes
3answers
275 views

Square root of a complex matrix commuting with a given one

Assume two commuting $n\times n$ complex matrices $A$ and $B$ are given. Then it is in general false that if $C$ is a square root of $A$, i.e., if $C^2=A$, then $C$ commutes with $B$ (the simplest ...
0
votes
1answer
83 views

dual space of the quotient space of some locally convex topological space

I would like to a classical result about dual space. Let $E$ be a locally convex space and $F$ its closed linear subspace. If $E^{\ast}$ is the dual space of $E$, could some one affirm me that the ...
1
vote
0answers
70 views

What is the time complexity of approximated SVD

Full SVD, on an m*n matrix $A$, $[U,S,V] = svd(A)$, would cost $O(m^2n + mn^2 + n^3)$ time. But what is the time complexity if we only need the $k$ largest singular values, say, $[U_k,S_k,V_k] = ...
17
votes
1answer
256 views

Linear maps between arbitrarily chosen vectors of vector spaces $V$ and $W$

I recently came across this question: Is the axiom of choice needed to prove the following statement: Let $V, W$ be vector spaces, and suppose $V \neq \{0\}$. Let $v \in V$, $v \neq 0$, $w \in W$. ...
4
votes
1answer
200 views

The height of the Perron-Frobenius eigenvector

Does the height of a real symmetric matrix with non-negative entries control the height of its Perron-Frobenius eigenvector, under some reasonable definition of heights? Just as an example of what ...
2
votes
1answer
82 views

Existence of parametrizations of rational orthogonal matrices

I suppose that there are formulas which parametrize all the orthogonal matrices with rational coefficients. Does anyone know anything about it? And what are some publications that discuss this? ...
0
votes
0answers
84 views

Sparse matrix factorization of a rank deficient matrix by decomposition into linearly independent components

I've got a little conjecture I need to prove for a theoretical result related to causal Bayes net search with latent variables under sparsity constraints. If you're interested in the application ...
1
vote
1answer
104 views

Neighborhood overlap matrix for a bipartite graph

Let $G$ be an undirected, simple, bipartite graph with parts $V$ (having $n$ vertices) and $W$ (having $m$ vertices). Define the following $n$-by-$n$ matrix: for any $i,j \in V$, $$a_{ij} = |N_i \cap ...
2
votes
1answer
84 views

Known Results on Convexity of Numerical Range

Let $A_1,A_2,\dots,A_M$ be given $N\times N$ hermitian matrices. The numerical range is defined as the set \begin{align} \mathbb{S}=\{(u^HA_1u,\dots,u^HA_Mu)\in \mathbb{R}^M\mid u^Hu=1\} \end{align} ...
3
votes
1answer
143 views

A hyperplane inside another one

Let D be a divison ring, let V be a left vector space of over D, possibly infinite dimensional, and let F be the prime field of D. Is it true that every F-hyperplane of V contains a D-hyperplane of ...
6
votes
2answers
296 views

When are two subvarieties of matrices conjugate?

Let $X$ and $Y$ be two subvarieties of $n\times n$ matrices. My question is that is there any condition to guarantee that there exits some matrix $g$ such that $Y=g^{-1} X g$? If such $g$ exists, then ...
-1
votes
1answer
59 views

Dimension of some ideal in the group ring Z/p[Z/p]

Let I be the augmentation ideal of the group ring Z/p[Z/p] and I^n denotes the ideal generated by all possible products of n elements from I. Question: What is dimension of I^n as a vector subspace ...
0
votes
0answers
88 views

What are the properties of this linear operator?

Suppose $f(x)$ is a function which satisfies the following condition: $$f(x)=\sum_{k=0}^\infty G(2k)\frac{x^{2k}}{(2k)!}$$ Where the generating function $G(x)$ is a "natural" or "discrete-analytic" ...
3
votes
0answers
101 views

“Shifted” Vandermonde determinant is nonzero?

I have already posted this question at MSE here, but as it received a few upvotes, but no comments or answers I choose to cross-post it here. Let $P$ be a degree-two polynomial, with roots ...
6
votes
0answers
127 views

A variant of an Eventown problem for modulo a prime number

Consider the following problem, called the 'Eventown problem': In a town, residents can form different clubs. The town council establishes the following rules: 1) Every club must have an even ...
4
votes
0answers
155 views

Dimension of a commuting nilpotent variety

Fix $k$ an algebraically closed field, $n$ a natural number, and $\lambda=(\lambda_1,\ldots,\lambda_m)$ a partition of $n$. Let $A$ be any $n\times n$ nilpotent matrix with entries in $k$ whose ...
15
votes
5answers
2k views

Origin of exact sequences

I have seen exact sequences appearing a lot in algebraic texts with different purposes. But I've never seen names of the people associated with it. Also I don't understand what's so good about showing ...
1
vote
0answers
135 views

Bounding the norm of the Dirichlet kernel as a matrix function

Consider the Dirichlet kerel: $f(x) = 1+2\sum_{k=1}^{N}\cos(kx)$. Now, given a diagonalizable real matrix $A$, one can consider $f(A)$, using the standard notation of matrix functions. Namely, $f(A) ...
0
votes
0answers
81 views

The largest size of a boolean subgraph (a hypercube) of a given graph

Let $G(\mathbb{F}_2^n)$ denote the graph that represents the lattice of all subspaces of $\mathbb{F}_2^n$ (also called a Hasse diagram). I am interested in knowing if there exists a large hypercube ...