On the sum powers of matrices (Q3778080)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4037944
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the sum powers of matrices |
scientific article; zbMATH DE number 4037944 |
Statements
On the sum powers of matrices (English)
0 references
1987
0 references
matrix rings
0 references
sums of squares
0 references
0.8939233422279358
0 references
0.8490445613861084
0 references
0.8478639721870422
0 references
0.843008816242218
0 references
This paper gives three theorems about matrices as sums of squares, and one about \(k\)th powers: Theorem 1. Let \(R\) be a ring with 1 and \(A\in M_n(R)\) with \(n\geq 2\). Then \(A\) is a sum of squares in \(M_n(R)\) iff \(\operatorname{tr}(A)\) is a sum of squares \(\mod 2R\). Let \(P(R)\) denote the smallest \(s\) such that every sum of squares in \(R\) is a sum of \(s\) squares (or \(P(R)=\infty\) if there is no such \(s)\). Then: Theorem 2. Let \(R\) be a ring with 1 such that \(P(R/2R)=m < \infty\). Then \(P(M_nR) \leq 5+[(m+1)/2]\) for \(n\geq 2\) and \(P(M_nR)\leq 7\) for \(n\geq 2m+2\). Theorem 3. Let \(R\) be commutative with 1 (so \(P(R/2R)=m\leq 1)\) and \(n\geq 2\); then \(P(M_nR)\leq 6\), \(P(M_nR)\leq 5\) for \(n\) even, \(P(M_4R)\leq 4\), \(P(M_3R)\leq 4\) and \(P(M_2R)\leq 3\). Theorem 4. Given \(k\) there exists \(n(k)\) such that \(n\ge n(k)\) implies every matrix in \(M_n{\mathbb{Z}}\) is a sum of 10 \(k\)th powers.
0 references