Skip to main content

All Questions

Filter by
Sorted by
Tagged with
1 vote
0 answers
79 views

A general theory of pairings

Bilinear forms and bilinear maps for vector spaces over a field are standard material for an introductory course in linear algebra. There are also text books for bilinear forms and related quadratic ...
Thomas Preu's user avatar
5 votes
1 answer
210 views

Relation between row space and column space resp. null space and left null space over general rings

Let $R$ be a ring and $M\in\text{Mat}(R,m\times n)$ a matrix for $m,n\in\mathbb{N}$. What results are known about the relation between column space (cs, image) and row space (rs), resp. null space (...
Thomas Preu's user avatar
3 votes
1 answer
198 views

Do radially bounded sets form a bornology?

We call a subset $A$ in a real vector space $E$ radially bounded if it intersects every ray emanating from $0$ via a bounded set. It is easy to see that radially bounded sets in $E$ form a bornology, ...
erz's user avatar
  • 5,529
1 vote
0 answers
134 views

Matrix valued word embeddings for natural language processing

In natural language processing, an area of machine learning, one would like to represent words as objects that can easily be understood and manipulated using machine learning. A word embedding is a ...
Joseph Van Name's user avatar
15 votes
2 answers
1k views

Positive quadratic polynomial

Let $S$ be solutions of a system of quadratic polynomials on $\mathbb{R}^n$. Suppose $q$ is another quadratic polynomial such that $q|_S\geqslant 0$. Is it possible to find a polynomial $\tilde q$ ...
Anton Petrunin's user avatar
0 votes
0 answers
164 views

How to prove negativity of a $3\times3$ determinant whose elements involve trigamma, tetragamma, and pentagamma functions?

The classical Euler gamma function can be defined by the integral \begin{equation*} \Gamma(z)=\int_0^{\infty}t^{z-1}\operatorname{e}^{-t}\operatorname{d}t, \quad \Re(z)>0. \end{equation*} Its ...
qifeng618's user avatar
  • 1,091
2 votes
0 answers
200 views

On the inequality-integer system [closed]

I need to prove this inequality, but I do not have a good background in algebra, if you can guide me: We have: $$ p_1 + 2p_2 + \ldots +kp_k < q_1 + 2q_2 + \ldots +kq_k+(k+1)q_{k+1}+\ldots+tq_t $$ ...
BADJARA Mohamed el Amine's user avatar
0 votes
1 answer
171 views

Prime index subgroups of $\langle Q^{i}(\mathbb Z^{2}) \mid i \in \mathbb Z \rangle$ that is invariant under matrix $Q$

Let $Q $ be a matrix in $ \operatorname{GL}(2, \mathbb{Q}) $ and consider the group $G = \langle Q^{i}(\mathbb Z^{2}) \mid i \in \mathbb Z \rangle := \langle Q^{i}(v) \mid i \in \mathbb Z, v \in \...
ghc1997's user avatar
  • 823
3 votes
0 answers
79 views

When can the eigenvalues be constrained to the right half plane as a result of column permutations?

Suppose we have a real square matrix. Under what conditions is it possible to permute the columns of the matrix such that all eigenvalues of the resulting matrix have nonnegative real part?
Max Aifer's user avatar
7 votes
1 answer
633 views

Given a rational matrix $Q$, can we generate $\langle Q^{i}(v)\mid i\in\mathbb Z,v\in\mathbb Z^{2}\rangle$ using only non-negative powers of a matrix?

I have copied this question from StackExchange, thank you to those who helped me to improve the question. (apology if you have seen this question already) Let $Q $ be a matrix in $ \operatorname{GL}(...
ghc1997's user avatar
  • 823
0 votes
2 answers
131 views

Reshaping data vector into a matrix for deconvolution using a circulant matrix

Suppose we have a circulant matrix S made from pseudorandom binary sequence of length $N$ consisting of $0$'s or/and $1$'s. $1$ means that we can inject something for chemical analysis and $0$ means ...
ACR's user avatar
  • 879
2 votes
1 answer
200 views

An inequality related to matrix trace

$$Tr(A|A^T U \Sigma U^T|) \leq Tr(AA^T U \Sigma U^T)$$ where $A \in \mathbb{R}^{m\times n}$ is a real rectangular matrix, $U \in \mathbb{R}^{n \times n}$ is a orthonormal matrix and $\Sigma$ is a ...
Wayne's user avatar
  • 21
4 votes
0 answers
219 views

Map $\operatorname{Sym}^{mp}(V^*) \longrightarrow K^{q}$ defined by $q$ points in $\operatorname{Sym}^p(V)$

EDIT : I have edited the question and made it more specific with respect to the kind of answer I expect. Let $V$ be a finite dimensional $K$-vector space and let $x_1, \dotsc, x_q \in V$ be $q$ points,...
Libli's user avatar
  • 7,300
2 votes
1 answer
247 views

Linear system with matrix as a variable

I have the following two linear systems: $$\begin{bmatrix} u_{11} & u_{12} \end{bmatrix} A = 0$$ $$\begin{bmatrix} u_{21} & u_{22} \end{bmatrix} B = 0$$ Both $A,B$ are $2 \times 2$ matrices ...
NYG's user avatar
  • 129
0 votes
0 answers
92 views

Norm of matrix product sum

Given matrices $A_{n\times n}, B_{n\times m}, C_{m\times m}$ such that $A^iBC^{N-i}$ is matrix with all zeros except upper right element for all $i$ from $0$ to $N$, what can we say about Frobenius ...
D.Ult's user avatar
  • 159
0 votes
0 answers
68 views

Optimal top-k column subset

Let $V$ be a set of vectors over $\mathbb{R}^l$, $l\ge 1$, $\pi_i(V)$ be the permutation of vectors in $V$ such that they are ordered by their $i$th component (descending) in order for $\pi_i(V)(\...
Eli Bixby's user avatar
  • 101
0 votes
1 answer
67 views

Multivariate random variable problem [closed]

I'm stuck on this problem: Let a random vector $X$ be given in $\mathbb{R^{10}}$ with the standard scalar product. It is known that $\mathbb{E}[XX^T] = 5I_{10}$, $I_{10}$ – identity matrix of order 10....
Andrew's user avatar
  • 69
2 votes
0 answers
424 views

Functional continuity of eigenvalues?

We have the following theorems! Corollary VI.1.6 [Bhatia: Matrix Analysis]: Let $a_j(t)$, where $1\leq j \leq n$ be continuous complex valued functions defined on an interval $I$. Then there exists ...
VSP's user avatar
  • 233
5 votes
0 answers
138 views

Rings over which free modules of a certain rank are reflexive (satisfy Specker's theorem)

Following this question about the case of $\mathbb{Z}_{(p)}$, I've got to ask what is known more generally about rings and dimensions for which Specker's theorem holds. Let me make the following ...
Gro-Tsen's user avatar
  • 32.5k
0 votes
0 answers
43 views

Intersection of subspace of cyclical rotations with orthant

In an $N$-dimensional real Euclidian space, let an orthant be specified by a vector $\underline{x}_0 = \{x_1, x_2, \dots, x_N\}$ where the components $x_k$ are binary in the sense that $x_k = \pm 1$...
Andreas's user avatar
  • 101
3 votes
0 answers
125 views

Computing Grothendieck group of coherent sheaves of affine toric 3-fold from a simplicial cone

Let $k$ be an algebraically closed field of characteristic zero. Let $\sigma$ be a 3-dimensional simplicial cone in $\mathbb{R}^3$. Let $X=\operatorname{Spec}(k[\sigma^{\vee}\cap\mathbb{Z}^3])$ be the ...
Boris's user avatar
  • 639
3 votes
0 answers
136 views

Unitary operators with the same inner product as vectors

Suppose we have a set of real unit vectors $v_1,\ldots,v_m \in \mathbb{R}^n$. We can always find a set of unitary operators $U_1,\ldots,U_m$ acting on $\mathbb{C}^N$ (for $N$ that is possibly much ...
user3826143's user avatar
3 votes
0 answers
49 views

Which invertible linear maps preserve the set of Hurwitz stable matrices?

Let $V = M_n(\mathbb{R})$ be the set of all $n\times n$ matrices with real elements and $V_{-}$ be a subset of Hurwitz stable matrices, i.e. matrices such that all their eigenvalues have strictly ...
Fiktor's user avatar
  • 1,284
8 votes
0 answers
170 views

Random walk on matrix until singularity

Consider a random walk on matrices, where one starts with the matrix $M=I_n$ and at each step randomly chooses an entry of $M$ to increase by $1$. I’m interested in two things about this walk: What’s ...
TheBestMagician's user avatar
2 votes
0 answers
137 views

Decompose a rational matrix as an integer matrix and an inverse of integer matrix

Suppose we have a non-singular rational matrix $Q$, consider the the $\mathbb{Z}$-span of the columns of $Q$ and $Q^{-1}$, denote it as $H = {\rm Span}_{\mathbb Z} \{ Q(\mathbb Z^{n}), Q^{-1}(\...
ghc1997's user avatar
  • 823
1 vote
2 answers
137 views

Methods to solve for a matrix whose entries satisfy certain properties

(This question is a repost of a deleted question I asked, because the previous version had several elements missing) Setting For fixed $N \in \mathbb{N}$, I wish to compute the entries of a matrix $...
algebroo's user avatar
  • 135
1 vote
0 answers
224 views

General linear group in infinite dimensions

Let $V$ be a vector space over the field $k$. Upon assuming the Axiom of Choice, we know that $V$ has a well-defined dimension $N$, and hence a well-defined basis $B$. Suppose that $N$ is not finite. ...
THC's user avatar
  • 4,547
3 votes
1 answer
83 views

Detecting linear operator from actions of powers on subspace

Say I have a sequence of linear operators $A_1,...,A_n$ on a (real) vector space $V_1$. I suspect that there's a second vector space $V_2$, and an operator $A$ on $V_1\oplus V_2$, such that $A_i=(\...
Dror Speiser's user avatar
  • 4,593
2 votes
1 answer
299 views

Product of a vector by an inverse of Toeplitz matrix

It is well known that using fast Fourier transform it's possible to multiply a vector by a Toeplitz matrix $A \cdot v = w$ in $n\cdot\log(n)$ operations. I read somewhere that also the product of a ...
Enea Olati's user avatar
10 votes
2 answers
895 views

What norms can be "universally" defined on any real vector space with a fixed basis?

Let $V$ be a real vector space and let $B = (b_\lambda)_{\lambda \in \Lambda}$ be a basis. So every $v \in V$ can be written uniquely as a linear combination $$ v = c_{\lambda_1} b_{\lambda_1} + c_{\...
AlpinistKitten's user avatar
5 votes
0 answers
202 views

Difficulty of solving $Ax=b$ in terms of limiting spectral density of $A$?

Suppose $A$ is a random real-valued $n\times n$ matrix and we want to know the difficulty of solving $Ax=b$ when entries of $b$ are sampled IID from Normal$(0,1)$. Can we say anything about the ...
Yaroslav Bulatov's user avatar
1 vote
0 answers
35 views

Are there any known lower complexity bounds on solving positive semidefinite or positive semidefinite feasibility problems?

I've been trying to attack the problem posted here, about quickly checking if a matrix has any positive semidefinite completions. I suspect that the answer to the question is "no", because ...
seed's user avatar
  • 111
5 votes
2 answers
508 views

Is there a name for this family of matrices?

Let $0<a_1<a_2<\cdots<a_n$ and let $A$ be the symmetric $n\times n$ matrix with ${ij}^\text{th}$ entry $A_{ij}=\min\{a_i,a_j\}$. For example, if $a_i=i$ for each $i\le n=5$ then $$A=\begin{...
bldavies's user avatar
3 votes
1 answer
272 views

Enumerating possible number of satisfied linear equations

Consider a system of linear equations of variable $x=(x_1,\cdots,x_n)$ where each $x_i\in\{ 0,1,\cdots,L-1 \}$. Clearly, there are $\frac{n(n-1)}{2}$ number of equations in the system. $$x_i-x_j=0, \ \...
tony's user avatar
  • 405
1 vote
1 answer
425 views

How to represent infinite matrices in Mathematica?

I asked this question on Mathematica site and the answer was basically "it is impossible". So, some math theory needs to be thrown in besides coding. Let us represent infinite matrices as ...
Anixx's user avatar
  • 10.1k
1 vote
0 answers
181 views

Least square with Frobenius norm regularization

$$ \begin{align} f_i &= \operatorname*{argmin}_f \| Af - d \| ^2_{l2} + λ \| P_X(f) - L_r(P_X(f_{i-1})) \|_F^2 \\[8pt] &=M_4^{-1}(A^Hd+\lambda P_X^*(L_r(P_X(f_{i-1})))) \end{align} $$ where $$ ...
Mark Hayes's user avatar
3 votes
1 answer
148 views

Spectrum of the adjacency matrix of certain directed graphs

For an undirected graph $G$, its adjacency matrix $A_G$ is symmetric, and by the (consequence of) spectral theorem, each of its Jordan blocks has size $1$. This is not true for a general directed ...
F J's user avatar
  • 161
20 votes
7 answers
5k views

Why do infinite-dimensional vector spaces usually have additional structure?

On Mathematics Stack Exchange, I asked the following question: Why are infinite-dimensional vector spaces usually equipped with additional structure? Although it received one good answer, I feel that ...
Joe Lamond's user avatar
1 vote
1 answer
252 views

Smith normal form and last invariant factor of certain matrices

I've copied over this question from what I asked on Mathematics Stack Exchange, in the hope that some experts can provide some relevant insight. Suppose we have row vectors $x_1$, $x_2$ , $y_1$ , $y_2 ...
ghc1997's user avatar
  • 823
1 vote
0 answers
24 views

One-step vectorial recurrence into multi-step scalar recurrence on commutative rings with boundary conditions

Introduction over unbounded domain Consider the forward time shift $\mathsf{z}$ acting on a discrete function of time (sequence) $f=(f^n)_{n\in\mathbb{N}}$ as $(\mathsf{z} f)^{n} = f^{n+1}$. Also ...
94thomas's user avatar
1 vote
0 answers
44 views

Characterizing some similarity invariant homogeneous log-superharmonic functions of matrices

Let $L:M_n(\mathbb{C})^r\rightarrow[0,\infty)$ be a function that satisfies the following properties: $\log(L)$ is plurisubharmonic. $L$ is homogeneous in the sense that $L(\lambda A_1,\dots,\lambda ...
Joseph Van Name's user avatar
1 vote
0 answers
155 views

Some kind of product of two 2d tensors to create a 3d tensor?

I recently need to apply the following concept of product of two 2d tensors to create a 3d tensor (tensors understood as generalized arrays): given two 2d tensors $A_{m\times n}$ and $B_{n\times p}$, ...
Min Wu's user avatar
  • 461
1 vote
1 answer
145 views

Is $A^2 + (A^2)^t$ Positive Semidefinite? [closed]

Given a matrix $A$ of size $n\times n$, which need not be symmetric, $A^2 + (A^2)^t$ (where $t$ denotes transpose) is certainly symmetric. Is it positive semidefinite?
Roh S's user avatar
  • 19
1 vote
1 answer
141 views

Minimal number of linearly dependent rank-1 projectors

What is the minimal number of linearly dependent rank-1 projectors $\vec v \vec v^t$ in dimension n, under the condition that every set of n column vectors $\vec v$ is linearly independent. PS: the ...
Alm's user avatar
  • 1,207
3 votes
0 answers
452 views

Dimension of a subspace of $n\times n$ real symmetric matrices

Let $n\in \mathbb N.$ Let $W$ be a non-trivial subspace of $n\times n$ symmetric matrices such that for every $x\in \mathbb R^n\setminus \{0\}$ there exists $a_x\in \mathbb R^n\setminus \{0\}$ such ...
mathew's user avatar
  • 49
2 votes
0 answers
237 views

matrices with all maximal minors non-singular

I encountered a sequence of matrices whose maximal minors seem to be all non-singular. In other words, suppose that we have an $m\times n$ matrix with $m \leq n$, then any choice of $m$ columns is ...
Martin Rubey's user avatar
  • 5,822
4 votes
1 answer
385 views

Can the ring of symmetric polynomials be generated by powers of symmetric polynomials of degree 1?

I'm making a research on Galois theory, and found something interesting regarding the ring of symmetric polynomials: At least up to 5 variables, we can rewrite the elementary symmetric polynomials ...
Simón Flavio Ibañez's user avatar
9 votes
2 answers
953 views

Direct proof of unique invariant distribution for ergodic, positive-recurrent Markov chain

I posted the following question on MSE, feeling that it perhaps isn't research level mathematics, but didn't get any bites. So, I am crossposting here. The following ergodic theorem is well known. ...
user24601's user avatar
  • 165
6 votes
2 answers
254 views

Eigenvalues of polynomials of two matrices

In this question, the matrices are square and real and the polynomials have real coefficients, but feel free to mention other fields if that is interesting. Let $\chi(M)$ denote the characteristic ...
Brendan McKay's user avatar
0 votes
0 answers
99 views

Efficient method to determine minimum eigenvalue of $2 \times 2$ block diagonal matrix

Suppose $H$ is a $2 \times 2$ block-diagonal symmetric matrix in $\mathbb{R}^{2^N \times 2^N} $. That is $$ H = \begin{pmatrix} A_1 & 0 & \cdots & 0\\ 0 & A_2 & \cdots & 0 \\ ...
KAJ226's user avatar
  • 131

1
7 8
9
10 11
119