Skip to main content

All Questions

Filter by
Sorted by
Tagged with
0 votes
0 answers
68 views

Meaning of $\langle M,\,M^{-1}\rangle$

For an $n\times n$ complex matrix $M$, is there a name for the expression $\langle M,\,M^{-1}\rangle$, where the inner product is the Frobenius one, $\langle A,\,B\rangle=\text{tr}(A^*B)$? Is there a ...
rikhavshah's user avatar
2 votes
0 answers
101 views

On the irreducible submodules of adjoint representations $\text{ad}^{0}$

Let $k$ be a finite field of characteristic $p$. Let $H$ be a subgroup of $\rm{GL}_{n}(k)$ of order prime to $p$ where $n\geq2$. Assume that the representation $H\hookrightarrow \rm{GL}_{n}(k)$ is ...
stupid boy's user avatar
0 votes
1 answer
310 views

Eigenvalues of $\operatorname{diag}({\bf v}) - {\bf v} {\bf v}^\top - \alpha({\bf v} - {\bf w})({\bf v} - {\bf w})^\top$

Given vectors ${\bf v}, {\bf w} \in [0,1]^n$ , where $n \in \mathbb{N} \setminus \{0\}$, and $\alpha > 0$, I would like to find the eigenvalues of the following matrix. $$\operatorname{diag}({\bf v}...
CereIssou's user avatar
2 votes
1 answer
117 views

When is a $p$-th order stationary point of a polynomial actually a local minimum?

Definition: For integer $p\geq 1$, we say $x\in \mathbb{R}^d$ is a $p$-th order stationary point of a function $f \colon \mathbb{R}^d \to \mathbb{R}$ if there exists a $C>0$ and an $\epsilon>0$ ...
ccriscitiello's user avatar
11 votes
2 answers
1k views

Is the eigenvalue map open?

The eigenvalue map in question is $\sigma: {\mathfrak gl}(\mathbb{C}, n) \to S_n \backslash \mathbb{C}^n$, from $n$ by $n$ complex matrices to $\mathbb{C}^n$ vectors modulo permutation of entries by $...
Lucas Seco's user avatar
  • 1,123
5 votes
1 answer
103 views

Interpolation between two matrices so that $L^p$ norm is controlled

Assume to have two square matrices $A$ and $B$ acting on $\mathbb{R}^n$ such that all their entries are in the interval $[0,1]$ and such that $||Ax||_1 = ||x||_1$ and $||Bx||_\infty \leq ||x||_\infty$....
tommy1996q's user avatar
0 votes
0 answers
123 views

Realizable singular value spectra of normalized finite frames

$\DeclareMathOperator\tr{tr}$Let $m, n \in \mathbb{N}$, $m \geq n$, and let $\{f_i\}$, $1 \leq i \leq m$, be $m$ unit vectors (wrt. 2-norm) in $\mathbb{R}^n$. Let $A = [f_1 \, \, \, f_2 \, \, \, \...
J. Zimmermann's user avatar
1 vote
1 answer
234 views

Zeroes of elementary polynomials without involving closed-form solutions

Consider the following two polynomials, where $n$ is an integer: $$ p_n(x) = x^3-\frac1nx-\frac2n, \\ q_n(x) = x^2-\frac2n. $$ For any $n$, let $x_p=x_p(n)$ and $x_q=x_q(n)$ be the unique positive ...
chrisv's user avatar
  • 21
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
2 votes
0 answers
81 views

Given a low-rank symmetric positive semidefinite matrix and a basis of its nullspace, is there a fast way to get the nonzero eigenvalues?

I have a (possibly dense) $k\times k$ real matrix $L = AA^T + B^T B$, a type of combinatorial Laplacian (self-adjoint, symmetric, positive semidefinite) of rank $(k-n)$ and possibly repeated nonzero ...
BenJones's user avatar
0 votes
1 answer
115 views

Loss of degree for polynomials

Let $q$ be a power of a prime $p$, $m$ be an integer greater than $0$. Does there exist polynomials $P_0,\cdots,P_m$ of $\mathbb F_q[T]$ not all in $\mathbb F_q$ such that there exist polynomials $Q_0,...
joaopa's user avatar
  • 3,998
36 votes
3 answers
2k views

Are large powers of polynomials linearly independent?

Let $P_1,\dots,P_k$ be polynomials over $\mathbf{C}$, no two of them being proportional. Does there exist an integer $N$ such that $P_1^N,\dots,P_k^N$ are linearly independent?
Guillaume Aubrun's user avatar
0 votes
0 answers
22 views

Eigenvalues of Composition of Hadamard Operations of Low Rank Matrices

I am interested in the eigenvalues of $$ee^T \oslash (aa^T - a^{\odot2}(a^{\odot2})^T )^{\odot \frac{1}{2}},$$ where $a \in \mathbb{R}^n$ and $e$ is the vector with all entries equal to one. Can we ...
gandalfbalrogslayer's user avatar
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
34 votes
8 answers
4k views

Uncountable counterexamples in algebra

In functional analysis, there are many examples of things that "go wrong" in the nonseparable setting. For instance, my favorite version of the spectral theorem only works for operators on a ...
1 vote
1 answer
48 views

Iteration matrix representation with complex conjugate operator

I am studying the convergence of a particular class of radial power flows, whose goal is to obtain the voltage solution for a given electric grid, i.e., a complex vector $\mathbf{V}$ that gives the ...
ElectricPhysiscist's user avatar
0 votes
2 answers
62 views

Nondegeneracy of dominant singular value and positivity of dominant singular vector of connected nonnegative matrix

Call a (not necessarily square) nonnegative matrix $M$ connected if there do not exist permutation matrices $P$ and $Q$ such that $PMQ=\begin{pmatrix}A&0\\0&B\end{pmatrix}$ for some $A$ and $B$...
David Bevan's user avatar
6 votes
2 answers
644 views

Sprinkling signs in unitary matrices

Let $A$, $B$ be $n\times n$ unitary complex matrices, such that for all indices $i,j$ we have $|a_{ij}|=|b_{ij}|$. Does there then exist diagonal unitary matrices $D,D’$ such that $DAD’=B$? This can ...
Chris H's user avatar
  • 1,949
4 votes
1 answer
507 views

Degree four polynomials with no real roots

Consider a degree four polynomial $$ f = a_4x^4 + a_3x^3 + a_2x^2 + a_1x+ a_0 \in \mathbb{R}[x] $$ with real coefficients. The discriminant $\Delta_f$ of $f$ is a homogeneous polynomials of degree six ...
Puzzled's user avatar
  • 8,998
2 votes
1 answer
423 views

Simple proof for convexity of a real valued matrix function

I am looking for a simple and short proof showing that $X \to \|X X^\top\|_F^2$ is a convex function where $\|\cdot\|_F$ is the Frobenius norm. I have one proof by showing that the derivative is ...
Titouan Vayer's user avatar
0 votes
0 answers
64 views

When is a symmetric block Toeplitz matrix invertible?

Let $$ Q = \begin{bmatrix} Q_0 & Q_1 & Q_2 & \cdots\\ Q_{-1} & Q_{0} & Q_1 & \cdots\\ Q_{-2} & Q_{-1} & Q_0 & \cdots\\ \vdots & \vdots & \vdots & \ddots ...
Benjamin Tennyson's user avatar
2 votes
0 answers
60 views

Basis vectors using anti-commuting operators?

Let $V$ be a finite-dimensional inner product space. Suppose $A_{1},...,A_{N}$ are anti-commuting operators, meaning that these are linear operators on $V$ that satisfy: $$A_{i}A_{j}+A_{j}A_{i} = A_{i}...
MathMath's user avatar
  • 1,305
1 vote
2 answers
360 views

Recurrence relation with two variables

I am stuck on a recurrence relation with two variables. I'm familiar with techniques to solve recurrence relations with one variable and looked into ways to solve recurrence relations with multiple ...
user675763's user avatar
2 votes
1 answer
264 views

Continuous path of unitary matrices with prescribed first column?

Consider a continuous curve $u \colon [0,1] \to \mathbb{C}^n$ where $u(t)$ is always a unit vector, $u(t)^* u(t) = 1$. Question 1: Does there exist a continuous curve $U \colon [0,1] \to \mathbb{C}^{n ...
ccriscitiello's user avatar
0 votes
1 answer
127 views

update rule for the inverse after a rank-1 update plus scaled identity

Is there an update rule for $$\left(\tilde{X}^T\tilde{X}+\alpha\cdot I\right)^{-1}$$ with $\tilde{X}=[X\;\; a]$ as a function of $A\triangleq (X^TX)^{-1}$, $X$ and $a$? I know that when $\alpha=0$ we ...
Student88's user avatar
  • 503
45 votes
11 answers
23k views

real symmetric matrix has real eigenvalues - elementary proof

Every real symmetric matrix has at least one real eigenvalue. Does anyone know how to prove this elementary, that is without the notion of complex numbers?
marjeta's user avatar
  • 579
0 votes
1 answer
142 views

Matrix-order derivatives (differentiating a function a matrix number of times)

I have been exploring methods of generalizing the order of derivatives to a broader range of inputs (such as real numbers, complex, and now matrices). We are very well familiar with integer-order ...
charlesalexanderlee's user avatar
2 votes
0 answers
200 views

Is there a geometric or calculus-based reason why the following system of equations should have only one solution?

Let $x_1,x_2,x_3,x_4>0$. Consider the following cyclic system of equations: $$ 2 + x_2 + x_3 + x_4 + x_2 x_3 x_4 - 2 \left( \frac{x_2}{ \sqrt{x_1 x_2}} + \frac{x_3}{ \sqrt{x_1 x_3}} + \frac{x_4}{ \...
matilda's user avatar
  • 90
0 votes
1 answer
91 views

Matrix quantization and effect on singular values

Let $A$ and $B$ be an $N\times n$ matrix with $n\le N$, and let $\sigma_1(X),\dots \sigma_n(X)$ denote the singular values of $X\in \{A,B\}$. Do we have upper and lower bounds for $$ \| \sigma_i(A)-\...
ABIM's user avatar
  • 5,405
5 votes
0 answers
137 views

Given a collection of vectors $x_1,\ldots,x_k$, which inner products $\langle x_i,x_j\rangle$ are needed to uniquely determine all inner products

Given a collection of vectors $x_1,\ldots,x_k$, which inner products $\langle x_i,x_j\rangle$ need to be known to uniquely determine all inner products? I'll begin with the specific case I am ...
RandomTensor's user avatar
109 votes
19 answers
38k views

Why were matrix determinants once such a big deal?

I have been told that the study of matrix determinants once comprised the bulk of linear algebra. Today, few textbooks spend more than a few pages to define it and use it to compute a matrix inverse. ...
0 votes
0 answers
43 views

Inertia indices in GAP

Not sure that this is the right place, but I could not find a GAP specific forum. Does anyone know if there is a built-in function in GAP to find the inertia indices of a symmetric matrix, say, over ...
Alex Degtyarev's user avatar
1 vote
0 answers
73 views

What is the closed form of a polyhedral cone's dual cone?

A polyhedral cone can be defined as $$ \mathcal{K} = \{x~|~Ax\preceq 0\}, $$ where $A \in \mathbb{R}^{m \times n}$, $x\in \mathbb{R}^n$ and $\preceq$ denotes component-wise less than and equal to. The ...
zhamao dra's user avatar
27 votes
2 answers
1k views

Uniquely reconstruct a matrix $M$ from its inverse $M^{-1}$ if $n$ elements of $M^{-1}$ are unknown and $n$ elements of $M$ are given

This question was motivated by a recent MO post. You know $n$ elements of the $N\times N$ matrix $M$ and you do not know $n$ elements of the inverse $M^{-1}$ (but you know the other $N^2-n$ elements ...
Carlo Beenakker's user avatar
3 votes
1 answer
233 views

On infinity-morphisms between algebras over algebraic operads

I posted this question in the "Mathematics" stack exchange, but it hasn't got much attention... I hope it will get more here. Let $P$ be a Koszul operad. In the book of Loday-Vallette "...
groupoid's user avatar
  • 215
4 votes
0 answers
262 views

Two questions about three circulant matrices

Consider the following matrix equation in $n \times n$ circulant $\pm 1$ matrices $A$, $B$, $C$ $$2AA^T+BB^T+CC^T=(4n+4)I-4J$$ where $I$ is the $n \times n$ identity matrix and $J$ is the $n×n$ matrix ...
user369335's user avatar
0 votes
0 answers
32 views

Eliminating nullity for enhanced non-singularity

If we have an $n\times n$ matrix $A$ with entries either $0$ or $1$, where all diagonal entries are $0$ and the rank is $k<n$, can we reach full rank by changing exactly $n-k$ zero off-diagonal ...
ABB's user avatar
  • 4,058
0 votes
1 answer
88 views

Find efficiently greatest difference between $2$ vectors from set of vectors [closed]

Let us have a list of vectors in a $3$D space. Is there a more efficient way to find the greatest difference between any two of them than combining each, computing the size of their difference, and ...
Honza S.'s user avatar
  • 109
12 votes
2 answers
1k views

Prove/disprove a linear algebra inequality

Setting: Suppose $\{u_i\}_{i=1}^n \subset R^d$ is a collection of unit vectors such that $u_i^Tu_j < 0$ for all $i\neq j$, and $w$ is a unit vector such that $u_i^T w> 0$ for all $i=1,\dotsc,n$. ...
Chen Zeno's user avatar
  • 115
2 votes
0 answers
153 views

Spectrum of an almost Hamiltonian matrix

I have a complex-valued block matrix $N=\begin{bmatrix} A & B \\ C & -A^* \end{bmatrix}$, where $A$ is diagonal, $B=B^*$, and $C$ is rank-1 but not Hermitian. If $C$ were Hermitian, $N$ would ...
mathamphetamine's user avatar
21 votes
2 answers
1k views

Closed subspaces of Banach spaces

Is it true that, assuming the Axiom of Choice, every infinite-dimensional Banach space has an infinite-dimensional closed subspace with infinite codimension? Note that this is different from the ...
Bruce Blackadar's user avatar
3 votes
0 answers
83 views

A stochastic matrix $B = \lambda(\lambda I - A)^{-1}$ such that $B-B^2$ has a non-negative diagonal

I apologize if this is too elementary a question, but I have not been able to make much progress. Consider a real matrix $A$ with $A_{ij} >0$ for $i \ne j$ and $\sum_{j} A_{ij} = 0$ for each $j$. ...
user133281's user avatar
3 votes
1 answer
332 views

Sparse representation for continuous function?

I recently came across the field of "Sparse representation". A talk is given here : https://www.youtube.com/watch?v=2bW4TkfTk-M. The goal of sparse representation is taking a signal and ...
user8469759's user avatar
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
1 vote
0 answers
45 views

Rank of Hadamard product of column-wise polynomial evaluations and row-wise exponential evaluations

Consider the Hadamard product $A \odot B$ between two special matrices $A,B \in \mathbb{R}^{n \times m}$. The columns of $A$ are evaluations of polynomials, while the rows of $B$ are evaluations of ...
user31127'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
6 votes
2 answers
539 views

Conditions for including cones

Consider $N$ $n$-dimensional vectors, where the angle between any two vectors is acute and their starting point is at the origin. Can we rotate these vectors together so that the coordinate components ...
dzk's user avatar
  • 61
4 votes
0 answers
140 views

Does an instance of this generalisation of the determinant exist?

Let $n$ be composite, $d$ a divisor greater than $1$ and $m=n/d$. Does anybody know if there is a general mapping $T$ from $n×n$ matrices to $m×m$ matrices that preserves the determinant? Over a field ...
Maarten Havinga's user avatar
5 votes
1 answer
304 views

Recover unknown vector through shifted argmax queries

$\DeclareMathOperator*{\argmax}{arg\,max}$ I am interested in finding an efficient algorithm for the following problem: Let $x \in [0,1]^n$ be some vector, with $x_n = 1$. We want to recover $x$, ...
Florian Tramèr's user avatar
0 votes
0 answers
180 views

Proof that the zeroes of certain polynomials are increasing with respect to degree

Choose $k+1$ positive integers $d_j\in\{0,1,2,3,\ldots\}$ and let $d=(d_1,\ldots,d_k)$. Consider the following polynomial equation over the positive reals: $$ \sum_{j=1}^{k}\frac1{x^{d_j}} = x^{d_{k+1}...
chrisv's user avatar
  • 21

1
5 6
7
8 9
121