REVIEW 4 major objections 5 minor 9 references
Reduction of matrices over simple Ore domains
T0 review · 4 major / 5 minor · reviewed 2026-08-14 · deepseek-v4-flash
Pith's one-line read The paper establishes that every non-zero-divisor 2×2 matrix over a 2-simple Ore domain of stable range 1 is equivalent to diag(1,a), with extensions to larger matrices over (n+1)-simple Ore domains and to Bézout domains.
desk verdict A plausible extension of diagonal reduction to simple Ore domains, but the main theorem's proof contains an unproven right-diagonalization step and multiple errors; not publishable as is. read the letter →
The pith
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
The reading
What carries the argument
The load-bearing object is the n-simple ring: a simple ring R in which every nonzero a admits a two-sided expression sum_{i=1}^n u_i a v_i = 1 with u_i, v_i in R, and n minimal. Stable range n is the second ingredient: every unimodular (n+1)-row can be shortened to a unimodular n-row by adding a suitable multiple of the last entry. Lemma 1 converts n-simplicity into a two-sided linear combination for products a_1 ... a_n. Lemma 3 uses stable range 1 to turn a nonzero a into a unit of the form a + x a y, and Lemma 4 turns diag(a,a) into diag(1,b). For Theorem 2, the crucial step is equation (8): after right-multiplying A to a nonzero diagonal matrix, (n+1)-simplicity gives a rank-one identity u A w = 1, and stable range n lets the row u and column w be completed to invertible matrices, placing a 1 in the upper-left corner. This corner-1 creation is the mechanism that carries the whole argument.
What would settle it
Exhibit a 2-simple Ore domain R of stable range 1 and a non-zero-divisor 2×2 matrix A over R that is not equivalent to diag(1,a). A more direct test targets the unproved step in Theorem 2: find such R and A for which no matrix T makes AT diagonal; since the proof rests on that diagonal-multiple assertion, a single example of that kind would refute the reduction claim. Concretely, one could examine small Ore domains like skew polynomial rings with stable range 1 and enumerate 2×2 matrices to check whether every full matrix is equivalent to a two-term diagonal.
Extended reading notes
Core claim
The paper's core discovery is that n-simplicity and stable range n combine to place a 1 in the corner of any non-zero-divisor matrix, after which the matrix reduces to a simple block form. The main theorem (Theorem 3) reads: if R is a 2-simple Ore domain of stable range 1, then for every non-zero-divisor A in $R^{{2×2}}$ there exist invertible P,Q with PAQ = diag(1,a). Theorem 2 states the analogous result in dimension n+1: for an (n+1)-simple Ore domain of stable range n, any non-zero-divisor (n+1)×(n+1) matrix is equivalent to a block matrix (1 0; 0 A0) with A0 an n×n matrix. The paper also derives a consequence for Bézout domains (Theorem 4), where the reduction yields triangular blocks instead of diagonal ones.
Load-bearing premise
The proof of Theorem 2 assumes, without proof, that every non-zero-divisor (n+1)×(n+1) matrix A over an (n+1)-simple Ore domain of stable range n can be right-multiplied by some matrix T to become a nonzero diagonal matrix; if this assumption fails, Theorems 2 and 3 do not follow.
Editorial extensions
If this is right
- Over a 2-simple Ore domain of stable range 1, every non-zero-divisor 2×2 matrix has a two-term diagonal form diag(1,a), so such rings behave like noncommutative principal ideal domains at the 2×2 level.
- Theorem 1 gives the same conclusion for diagonal matrices diag(a,b) whenever ab ≠ 0 or ba ≠ 0 in a 2-simple ring of stable range 1, covering rings that need not be domains.
- Theorem 2 reduces non-zero-divisor (n+1)×(n+1) matrices over (n+1)-simple Ore domains of stable range n to a block form with a 1 in the corner, providing a uniform reduction in all dimensions.
- Theorem 4 shows that n-simple Bézout domains admit a block triangular reduction for every larger square matrix, with an identity block and n×n triangular blocks.
Reading between the lines
- If the missing assertion in the proof of Theorem 2 can be supplied, the same machinery might push diagonal reduction from 2×2 matrices to all full matrices over 2-simple Ore domains of stable range 1, not just the stated sizes.
- The unproved step—that A can be right-multiplied to a nonzero diagonal matrix—could be added as an explicit hypothesis to obtain a conditional theorem, in which case the paper's contribution would be the corner-1 reduction rather than the existence of diagonal multiples.
- A testable extension is to check small concrete Ore domains, such as skew polynomial rings or simple Artinian-like domains, for the n-simple and stable-range conditions and verify whether all full matrices reduce to diagonal form by explicit algorithms.
Signed reviews
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The paper studies diagonal reduction of matrices over simple Ore domains. It introduces the notion of n-simple rings and claims four theorems: Theorem 1 reduces diag(a,b) to diag(1,c) in a 2-simple ring of stable range 1; Theorem 2 asserts that every full (n+1)x(n+1) matrix over an (n+1)-simple Ore domain of stable range n is equivalent to a block matrix with a 1 in the upper-left corner; Theorem 3 specializes this to 2x2 matrices; and Theorem 4 extends the result to n-simple Bezout domains. The proof strategy is to use n-simplicity to construct a unimodular row, use stable range to complete it to an invertible matrix, and then eliminate off-diagonal entries by elementary transformations.
Significance. If the theorems were correct, Theorem 3 would provide a clean sufficient condition for diagonal reduction of 2x2 matrices over simple Ore domains, a result of genuine interest in noncommutative ring theory. The paper is rooted in established work by Cohn, Henriksen, and Zabavsky, and the overall strategy is plausible. However, the manuscript does not contain machine-checked proofs or reproducible code, and the proof of the central theorem contains unproved assertions and uses an inapplicable proposition; the claimed results are therefore not established by the present write-up.
major comments (4)
- [Section 3, Lemma 1] The proof of Lemma 1 does not verify identity (3) with the substitutions as written. For i=2, u2 a2 v2 = (x2 a2) a2 (a3...an y2) = x2 a2^2 a3...an y2, whereas the term needed to reconstruct the sum x2(a1...an)y2 is x2 a1 a2...an y2. The definition should have u2 := x2 a1, not u2 := x2 a2. As written, the displayed factorization fails in a noncommutative ring, so the proof of Theorem 1, which relies on Lemma 1, is not sound.
- [Section 3, Theorem 2] The proof begins with the assertion that AT = diag(epsilon_1,...,epsilon_{n+1}) is nonzero for some matrix T, but no proof or reference is given. This is a one-sided diagonal reduction of a full matrix and is not a formal consequence of (n+1)-simplicity and stable range n as stated; it is essentially a weak form of the diagonalization result being proved. The subsequent construction of u, v, and equation (8) depends entirely on this step. In addition, the definition of w just before (8) is incorrect: from AT = diag(epsilon_i) one needs w = T v, not w^T = T^T u^T, so the displayed identity (8) does not follow as written.
- [Section 3, Theorem 2 (Proposition 2(iv))] The proof invokes Proposition 2(iv) to complete the unimodular row (u1,...,u_{n+1}) and the column (w1,...,w_{n+1})^T to matrices in GE_m(R). However, Proposition 2(iv) is stated only for right Bezout rings of finite stable range, while the hypotheses of Theorem 2 assume only that R is an (n+1)-simple Ore domain. No argument is given that such an Ore domain is right Bezout, so the completion step is unsupported. Even if a stable-range completion to GL_{n+1}(R) were available, the proof as written relies on a proposition whose hypotheses are not met.
- [Section 3, Proof of Theorem 4] The proof of Theorem 4 consists of a single sentence asserting that each A_i is triangular because each commutative Bezout domain is a Hermite ring. This does not address the noncommutative setting of the theorem, and it does not explain how Theorem 2 yields the displayed block form with triangular blocks. The claimed result is therefore not proved.
minor comments (5)
- [Section 3, Lemma 4] The proof refers to 'Lemma 6', but no Lemma 6 exists; the intended reference is Lemma 3.
- [Section 3, Lemma 2, Case 2] The text assigns 'v1 := p12 and v1 := p22'; the second assignment should be v2 := p22. Additionally, in a domain with a nonzero, the equalities a p12 = a p22 = 0 force p12 = p22 = 0, contradicting the invertibility of P, so the case analysis needs to be revisited.
- [Section 3, Theorem 2] The displayed sum involving u1 epsilon1 v1 through u_{n+1} epsilon_{n+1} v_{n+1} is written as equal to 0; it should be equal to 1 for the subsequent conclusion to hold.
- [Section 2, Proposition 1] The term 'FI-ring' is used without definition, which makes Proposition 1 difficult to interpret.
- [Throughout] There are numerous typographical errors (e.g., 'Clorollary' in Proposition 2(iv), inconsistent renditions of 'Bezout'), and the citation '[9, p. 29-30]' in the proof of Theorem 4 is too vague to identify the relevant result.
Circularity Check
Theorem 2's proof assumes without justification that AT is a nonzero diagonal matrix, a one-sided diagonal reduction that carries the core content of Theorems 2 and 3.
-
self definitional
[Section 3, Proof of Theorem 2, first sentence after Lemma 5, before equation (8)]
"According to the restrictions imposed on R and A we have AT = diag(ε1, . . . , εn+1) ≠ 0 for some matrix T."
This sentence is not derived from any preceding lemma or citation for an (n+1)-simple Ore domain of stable range n. The existence of T with AT diagonal is itself a nontrivial one-sided diagonal reduction, and it is the step that makes equation (8) possible, produces the unimodular row and column, and triggers the completion to invertible U and W. For n=1 this is essentially the assertion that every full 2x2 matrix can be right-reduced to diagonal form, a substantial part of the two-sided reduction stated in Theorem 3. The proof never returns to justify AT=diag(...); it only manipulates this assumed diagonal form. Hence the central derivation is loaded with a strong form of the conclusion rather than derived from the hypotheses.
full rationale
The main circularity is located in the opening sentence of the proof of Theorem 2. The theorem's hypotheses are an (n+1)-simple Ore domain of stable range n and a full/non-zero-divisor matrix A; from these, the proof immediately asserts AT = diag(...) for some T, with no proof or reference. This is a one-sided reduction statement, and all subsequent arguments—the use of (n+1)-simplicity to get a unimodular row/column, the stable-range completion to invertible U,W, and the elementary transformations to the block form—depend on it. Theorems 2 and 3 therefore rest on an unproved assumption that already contains the core reduction. I did not count the later appeal to Proposition 2(iv) from the authors' monograph [9] as a separate circular step: although it is a self-citation and is applied to an Ore domain while the cited proposition is stated for right Bézout rings, that is a correctness/hypothesis-mismatch issue rather than an equation-level reduction to the paper's own inputs. Apart from this, the paper contains no fitted parameters or empirical predictions.
Assumptions & free parameters
assumptions (4)
- domain assumption The ring R is a domain with identity, and is both left and right Ore, so it embeds into a division ring.
- domain assumption The definition of n-simple ring: for every nonzero a, the two-sided ideal generated by a equals R, and there is a minimal n in equation (2).
- domain assumption The ring satisfies a stable range condition (stable range 1 in Theorems 1 and 3, stable range n in Theorem 2).
- standard math Cited results from the literature, including [3, Theorem 6.4] on FI-rings, [6, Theorem 3] on elementary divisor rings, and results from [9], are correct and applicable.
Cite this review
Pith. "Pith review of Reduction of matrices over simple Ore domains." pith.science (2026). https://pith.science/paper/VVRYQPQN
@misc{pith2026190804545,
author = {Pith},
title = {Pith review of: Reduction of matrices over simple Ore domains},
year = {2026},
howpublished = {\url{https://pith.science/paper/VVRYQPQN}},
note = {Machine review of arXiv:1908.04545}
}
read the original abstract
We study the theory of diagonal reductions of matrices over simple Ore domains of finite stable range. We cover the cases of 2-simple rings of stable range 1, Ore domains and certain cases of Bezout domains.
Reference graph
Works this paper leans on
-
[1]
S. A. Amitsur. Remarks on principal ideal rings. Osaka Math. J. , 15:59– 69, 1963
work page 1963
-
[2]
P. Ara, K. R. Goodearl, K. C. O’Meara, and E. Pardo. Diagon alization of matrices over regular rings. Linear Algebra Appl. , 265:147–163, 1997
work page 1997
-
[3]
P. Cohn. Svobodnye kol’tsa i ikh svyazi . Izdat. “Mir”, Moscow, 1975. Translated from the English by L. A. Bokut’
work page 1975
-
[4]
P. M. Cohn. Right principal Bezout domains. J. London Math. Soc. (2) , 35(2):251–262, 1987
work page 1987
-
[5]
P. M. Cohn and A. H. Schofield. Two examples of principal id eal domains. Bull. London Math. Soc. , 17(1):25–28, 1985
work page 1985
- [6]
-
[7]
P. Menal and J. Moncasi. On regular rings with stable rang e 2. J. Pure Appl. Algebra, 24(1):25–40, 1982
work page 1982
-
[8]
B. Stenstr¨ om. Rings and modules of quotients . Lecture Notes in Mathe- matics, Vol. 237. Springer-Verlag, Berlin-New York, 1971
work page 1971
Show all 9 references
-
[9]
Zabavsky
B. Zabavsky. Diagonal reduction of matrices over rings , volume 16 of Mathematical Studies Monograph Series . VNTL Publishers, Lviv, 2012. 9
2012
Reviewed August 14, 2026 · model on record in the stance chip above.
Discussion (0). Continue with ORCID to comment.