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 | |
Results tagged with matrices
Search options not deleted
user 2530
Questions where the notion matrix has an important or crucial role (for the latter, note the tag matrix-theory for potential use). Matrices appear in various parts of mathematics, and this tag is typically combined with other tags to make the general subject clear, such as an appropriate top-level tag ra.rings-and-algebras, co.combinatorics, etc. and other tags that might be applicable. There are also several more specialized tags concerning matrices.
3
votes
Accepted
Existence of a linear map resulting in the determinant being an elementary symmetric polynomial
Such a map $\Phi$ does not exist for $n=5$ and $k=2$.
Let me in fact show a stronger claim: There exists no $\mathbb{R}$-linear map $\Phi : \mathbb{R}^5 \to \mathbb{C}^{2\times 2}$ such that every
fiv …
- 33.8k
8
votes
3
answers
418
views
Smallest faithful representation of an upper-triangular matrix quotient
Let $J$ be the subset of $F^{n \leq n}$ that consists of all such matrices that satisfy $a_{i,j} = 0$ for all $\left(i,j\right) \neq \left(1,n\right)$. … Thus, a quotient $F$-algebra $F^{n \leq n} / J$ is defined (and its elements can be thought of as upper-triangular matrices whose northeasternmost entry is undetermined).
Question. …
- 26.5k
3
votes
On similar matrices and polynomial matrices
I have now expanded this proof at
Darij Grinberg, Similar matrices and equivalent polynomial matrices.
(Mostly written up to have a readable reference around next time I need the result in a class.) …
- 33.8k
8
votes
0
answers
296
views
How to check two matrices for similitude over $\mathbb{Z}$?
I am particularly interested in two special matrices, more on which below. … Indeed, a proof of this fact has been
sketched in on similar matrices and polynomial matrices for any commutative ring
instead of $\mathbb{Z}$. …
- 12.9k
14
votes
3
answers
1k
views
"Conjugacy rank" of two matrices over field extension
\end{align}
We can call this number $\rho_{S}\left( A,B\right)$ the "conjugacy rank" of the matrices $A$ and $B$ over the field $S$. … matrices $A$ and $B$ are conjugate to each other in the ring $\operatorname{M}_{n}\left( S\right)$.) …
- 33.8k
4
votes
Accepted
$2$-adic valuation of Schur $P$-functions in the power-sum basis
Here is a proof of the generalization suggested by Richard Stanley in the
comments and even of a more general result (with "odd" replaced by "not
divisible by a given prime $q$"). It is completely dif …
- 33.8k
19
votes
Jacobi's equality between complementary minors of inverse matrices
All matrices that appear in the
following are matrices over $\mathbb{K}$.
Let $\mathbb{N}=\left\{ 0,1,2,\ldots\right\} $. …
- 33.8k
7
votes
Product of Positive Matrices
Let $A\in k^{n\times n}$ and $B\in k^{n\times n}$ be two symmetric nonnegative-definite matrices. Then, $\operatorname{Tr}\left(AB\right)\geq 0$.
Proof of Corollary 2. … Consider the Kronecker product $A\otimes B\in k^{n^2\times n^2}$ of the two matrices $A$ and $B$. …
CommunityBot
- 1
9
votes
Vandermonde matrix is totally positive
The minors of a Vandermonde matrix are known as alternants. Their positivity follows from the fact that they are products of the Vandermonde determinant of the variables involved with a Schur function …
- 33.8k
5
votes
Accepted
Determinants: periodic entries $0,1,2,3$
Yes, it is true. More generally, the entries $1,2,3,0$ can be replaced by arbitrary numbers $a,b,c,d$, in which case the determinant of $M_n$ can be computed in terms of the four numbers $u = d-b$, $v …
- 33.8k
3
votes
Accepted
A direct proof of a property of symmetric 2x2-determinants
Here is a direct proof: Simple computations show that
$$f\left(x_1+x_2,y_1+y_2,z_1+z_2\right) = f\left(x_1,y_1,z_1\right) + f\left(x_2,y_2,z_2\right) + \left(x_1z_2+x_2z_1-2y_1y_2\right).$$
It thus …
- 14k
5
votes
Accepted
On a determinantal equality
Let me prove a slightly more general claim.
Theorem 1. Let $\mathbb{K}$ be a commutative ring. Let $R$ be a set. Let
$n\in\mathbb{N}$ (where $\mathbb{N}=\left\{ 0,1,2,\ldots\right\} $). Set
…
- 33.8k
8
votes
Accepted
Why does this antisymmetric product factor out a determinant?
This shows that $N_{i}S_{i}^{\prime}=I_{n-1}$, and thus $S_{i}^{\prime}
=N_{i}^{-1}$ (since $N_{i}$ and $S_{i}^{\prime}$ are $\left( n-1\right)
\times\left( n-1\right) $-matrices). …
- 33.8k
11
votes
Accepted
A question about symmetric matrix
The Birkhoff-von Neumann theorem yields that it is a convex combination of permutation matrices. Take any permutation matrix which enters into this combination with a nonzero coefficient. …
- 33.8k
14
votes
Cayley-Hamilton revisited
Am I missing something or is Ilya Bogdanov's elimination of $A_0$ trick more or less a proof in itself?
Assume that $f\left(B\right) = 0_n$. Then, $0_n = f\left(B\right) = A_kB^k + A_{k-1}B^{k-1} + . …
- 33.8k