SearcharxivSearch

arXiv · 2410.09051

Maximal subrings of division rings

Abstract

The structure and the existence of maximal subrings in division rings are investigated. We see that if $R$ is a maximal subring of a division ring $D$ with center $F$ and $N(R)\neq U(R)\cup \{0\}$, where $N(R)$ is the normalizer of $R$ in $D$, then either $R$ is a division ring with $[D:R]_l=[D:R]_r$ is finite or $R$ is an Ore $G$-domain with certain properties. In particular, if $F\subsetneq C_D(R)$, the centralizer of $R$ in $D$, then $R=C_D(\beta)$ is a division ring, for each $\beta\in C_R(R)\setminus F$, $[D:R]_l$ is finite if and only if $\beta$ is algebraic over $F$, $[D:R]_l=[D:R]_r=[F[\beta]:F]$ and $C_R(R)=F[\beta]$. On the other hand if $R$ does not contains $F$, then $R\cap F=C_R(R)$ is a maximal subring of $F$. Consequently, if a division ring $D$ has a noncentral element which is algebraic over the center of $D$, then $D$ has a maximal subring. In particular, we prove that if $D$ is a non-commutative division ring with center $F$, then either $D$ has a maximal subring or $dim_F(D)\geq |F|$. We study when a maximal subring of a division ring is a left duo ring or certain valuation rings. Finally, we prove that if $D$ is an existentially complete division ring over a field $K$, then $D$ has a maximal subring of the form $C_D(x)$ where $D$ is finite over it. Moreover, if $R$ is a maximal subring of $D$ with $K\subsetneq C_R(R)$, then $R=C_D(x)$ for some $x\in D\setminus K$, which is algebraic over $K$.

Explore related subjects

Keep this discovery

BibTeXRIS

Alborz Azarang. 2024-09-12. Maximal subrings of division rings. https://arxiv.org/abs/2410.09051

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