SearcharxivSearch

arXiv · 2602.21208

Non-commutative rings with infinitely many maximal subrings

Abstract

We study rings with infinitely (only finitely) many maximal subrings. We prove that if $M$ is a maximal left/right ideal of a ring $T$ which is not an ideal of $T$, and $R$ is the idealizer of $M$, then $T$ has at least $|R/M|+1$ maximal left/right ideals which are not an ideal of $T$; in particular $T$ has at least $|R/M|+1$ distinct maximal subrings. Moreover, if $T$ is a $K$-algebra over an infinite field $K$, then either $T$ has infinitely many maximal subrings or $T$ is a quasi duo ring with certain algebraic properties similar to commutative rings. We prove that for a simple ring $R$, the ring $R\times R$ has only finitely many maximal subrings if and only if $R$ is finite. Also we study rings which are integral over their centers and have only finitely many maximal subrings. We prove that if $T$ is integral over its center and $T$ has more than $2^{\aleph_0}$ maximal (left/right) ideals, then $T$ has infinitely many maximal subrings. In particular, we see that if a $J$-semisimple ring $T$ is integral over its center and has only finitely many maximal subrings, then $T$ embeds in $S\times \prod_{i\in I}E_i$, where each $E_i$ is an absolutely algebraic field and $S$ is a finite semisimple ring. We see that if $T$ is a left Noetherian algebraic $K$-algebra over an infinite field $K$ and $T$ has only finitely many maximal subrings, then $T$ is a countable left Artinian ring which is integral over $\mathbb{Z}_p$, where $p=Char(K)$. We exactly determine when $T=\prod_{i\in I}\mathbb{M}_{n_i}(E_i)$, where each $E_i$ is a field and $n_i\in\mathbb{N}$, has only finitely many maximal subrings. We see that if $R$ is an infinite Artinian ring, then $\mathbb{M}_n(R)$, $n>1$, and $R\times R$ have infinitely many maximal subrings.

Explore related subjects

Keep this discovery

BibTeXRIS

Alborz Azarang. 2026-01-07. Non-commutative rings with infinitely many maximal subrings. https://arxiv.org/abs/2602.21208

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Invariants of Nilpotent Lie Algebras via Geometry and Algebra with a Focus on Computation

We consider the problem of computing rational invariants of nilpotent Lie algebras. We compare two methods that are commonly used for this task: the method of integral curves and the Dixmier map. Given a derivation of a rational function field with polynomial coefficients, we formulate a condition under which the kernel can be recovered from a family of rational integral curves, and we show that triangular derivations satisfy this hypothesis. This yields an explicit description of the kernel as a purely transcendental extension and produces algebraically independent generators. We also show that, in the triangular case, the resulting generators agree with those obtained from the Dixmier map via a local slice. A careful analysis of the generating set obtained from this method leads to an algorithm for computing generators of the rational invariant field of a nilpotent Lie algebra. An implementation of the methods is available in the SageMath system.

math.RA

Quasilinear multiplication in the real Cayley--Dickson tower

Direct evaluation of the defining product in the real Cayley--Dickson algebra $A_n$, of dimension $N=2^n$, has quadratic arithmetic complexity. This paper gives a uniform algorithm for multiplication using $O(N\log N)$ real arithmetic operations and $O(N)$ auxiliary storage. The algorithm reduces multiplication to the alternating product on the imaginary subspace, then evaluates that product by a two-call recursion over one fixed quadratic coefficient extension. For $n\ge1$, the resulting bilinear algorithm uses at most $(9n-15)2^{n-1}+10$ input-dependent real multiplications, and for $n\ge3$, the specified arithmetic schedule uses $(34n-83)2^{n-1}+50$ real operations in total. Under this counting convention, the quasilinear schedule uses fewer operations than direct multiplication for $N\ge16$ and than the uniform Cariow--Cariowa method for $N\ge32$. The algorithm is implemented in the MIT-licensed C11 library fastCD, with a NumPy-backed Python interface, and its results are checked against an independent implementation of the defining recursion. In single-core benchmarks against direct multiplication and the uniform Cariow--Cariowa method, the quasilinear implementation had the lowest mean time of the three at every tested dimension $N\ge32$, for both single and batched products, and was roughly $16$ times faster than direct multiplication at $N=1024$.

math.RA

Graded classification of Leavitt path algebras in terms of strong shift equivalence

Given two finite essential adjacency matrices $A$ and $B$, Hazrat's graded classification conjectures posit that an order preserving $\mathbb{Z}[x,x^{-1}]$-module isomorphism of $K_0$ groups implies graded Morita equivalence of the Leavitt path algebras of $A$ and $B$, while the pointed version predicts a graded isomorphism of the Leavitt path algebras when the $K_0$ group isomorphism additionally preserves the class of the regular module. For any field $k$, we show that the Leavitt path algebras over $k$ of $A$ and $B$ are graded Morita equivalent if and only if $A$ and $B$ are strong shift equivalent. By appealing to counterexamples of Kim and Roush from symbolic dynamics, this shows that Hazrat's graded classification conjectures are false.

math.RA