Search arXivSearch

arXiv · 2512.22074

Semiperfect rings with a Nakayama permutation: A survey of Double annihilator property and Size condition

Abstract

For a semiperfect ring with essential socles, the Double annihilator property encodes that the top and socle have anti-isomorphic lattices of submodules, whereas the Size condition encodes that they are isomorphic as modules. Interest in both concepts, particularly for finite rings, was revived by coding theory, where they characterise QF rings and Frobenius rings, respectively. However, their shared origins date back to the work of T. Nakayama. We study these concepts through the lens of the Nakayama permutation, an invariant initially used to define (quasi-)Frobenius rings. We propose semiperfect rings as the setting for this study, treating them as the natural generalisation of finite rings, because they possess the characteristic decomposition of unity preserved by projection onto a semisimple top. This allows us to extend the utility of the Nakayama permutation beyond the classical Artinian setting. By analysing the Nakayama permutation in this broader context, we show that many classical properties of (quasi-)Frobenius rings are not exclusive to the finite case, but are special cases of the general behaviour of semiperfect rings with essential socles. We illustrate these results using B. J. Müller's representation of semiperfect rings as rings of formal matrices. The clear description of socles and tops in this setting provides a straightforward method for constructing counterexamples, such as quasi-Frobenius rings that are not Frobenius.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Dominik Krasula. 2025-12-26. Semiperfect rings with a Nakayama permutation: A survey of Double annihilator property and Size condition. https://arxiv.org/abs/2512.22074

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

KEEP EXPLORING

Related papers

On solutions of singular Sylvester equations in quaternions

The quaternionic equations ax-xb=0 and ax-xb=c are investigated, which are called homogeneous and inhomogeneous Sylvester equations, respectively. Conditions for the existence of solutions are provided. In addition, the general and nonzero solutions to these equations are derived applying quaternion square roots.

math.RA

Positivity preservers over finite fields II

We say that a matrix over a finite field $\mathbb{F}_q$ is positive definite if it is symmetric and each of its leading principal minors is a nonzero square in $\mathbb{F}_q$. In previous work of the authors [J. Algebra, 2025], the entrywise positivity preservers on $M_n(\mathbb{F}_q)$ were classified in every case except when $n=2$, $q\equiv1\pmod4$, and $q$ is not a square. We settle this remaining case, thereby completing the classification of entrywise positivity preservers over every finite field and in every dimension $n\ge2$. Our proof is based on a novel idempotent reduction that not only resolves the remaining case but also yields a self-contained proof of the complete classification, while avoiding several technical results used in the earlier arguments. As a further application of the same reduction, we classify the entrywise preservers of strongly nonsingular matrices, i.e., matrices whose leading principal minors are all nonzero. We also prove a more general theorem in odd characteristic: for every prescribed sign pattern of nonzero leading principal minors of matrices of a fixed dimension $n\ge2$, the entrywise preservers are precisely the positive scalar multiples of field automorphisms. Thus, in odd characteristic, preserving any nonzero leading-principal-minor sign pattern surprisingly forces the preservation of every such sign pattern.

math.RA

Graphs of Moore-Penrose inverse of matrices possessing the treeangle property

It is known that the inverse of an invertible real square matrix satisfying the treeangle property, is a treediagonal matrix. A converse statement also holds. We show that the verbatim analogues are not true for the Moore-Penrose inverse, and obtain the precise structure of graphs corresponding to the Moore-Penrose inverse of matrices possessing the treeangle property.

math.RA