SearcharxivSearch

arXiv subjects

Laura Cossu

Publications and source records attributed to Laura Cossu.

14 recordsLinked to original sources

Categorical Algebra of Atomic Monoids: Presentability, Regularity, and Pretorsion Theories

We study the category $\mathsf{AtoMon}$ of atomic monoids and atom-preserving homomorphisms. We prove that $\mathsf{AtoMon}$ is locally finitely presentable by exhibiting a strong generator consisting of compact objects. We show that $\mathsf{AtoMon}$ admits (regular epi, mono)-factorizations but that it is not a regular category: we construct a regular epimorphism which is not pullback-stable. We also establish adjunctions for the group of units and explicitly construct the ``cofree atomic monoid'' over an arbitrary monoid. Finally, we exhibit a way to lift torsion theories of $\mathsf{Grp}$ to pretorsion theories of $\mathsf{AtoMon}$ and extend this construction to a more general setting.

math.CT

On the arithmetic of polynomial ideals

This paper investigates atomic factorizations in the monoid $\mathcal I(R)$ of nonzero ideals of a multivariate polynomial ring $R$, under ideal multiplication. Building on recent advances in factorization theory for unit-cancellative monoids, we extend techniques from the paper [Geroldinger and Khadam, Ark. Mat. 60 (2022), 67-106] to construct new families of atoms in $\mathcal I(R)$, leading to a deeper understanding of its arithmetic. We further analyze the submonoid $\mathcal M\rm{on}(R)$ of nonzero monomial ideals, deriving arithmetic properties and computing sets of lengths for specific classes of ideals. The results advance the extensive study of ideal monoids within a classical algebraic framework.

math.AC

On the arithmetic of power monoids

Given a monoid $H$ (written multiplicatively), the family $\mathcal{P}_{\mathrm{fin},1}(H)$ of all non-empty finite subsets of $H$ containing the identity element $1_H$ is itself a monoid, called the reduced finitary power monoid of $H$, under the operation of setwise multiplication induced by $H$. We investigate the arithmetic of $\mathcal P_{\mathrm{fin},1}(H)$ from the perspective of minimal factorizations into irreducibles, paying particular attention to the potential presence of non-trivial idempotents. Among other results, we provide necessary and sufficient conditions on $H$ for $\mathcal P_{\mathrm{fin},1}(H)$ to admit unique minimal factorizations. Our results generalize and shed new light on recent developments on the topic.

math.RA

The Category of Atomic Monoids: Universal Constructions and Arithmetic Properties

We introduce and investigate the category $\mathsf{AtoMon}$ of atomic monoids and atom-preserving monoid homomorphisms, which is a (non-full) subcategory of the usual category of monoids. In particular, we compute all limits and colimits, showing that $\mathsf{AtoMon}$ is a complete and cocomplete category. We also address certain arithmetic properties of products and coproducts, providing explicit formulas for some fundamental invariants associated with factorization lengths in atomic monoids.

math.RA

Realization of spaces of commutative rings

Motivated by recent work on the use of topological methods to study collections of rings between an integral domain and its quotient field, we examine spaces of subrings of a commutative ring, where these spaces are endowed with the Zariski or patch topologies. We introduce three notions to study such a space $X$: patch bundles, patch presheaves and patch algebras. When $X$ is compact and Hausdorff, patch bundles give a way to approximate $X$ with topologically more tractable spaces, namely Stone spaces. Patch presheaves encode the space $X$ into stalks of a presheaf of rings over a Boolean algebra, thus giving a more geometrical setting for studying $X$. To both objects, a patch bundle and a patch presheaf, we associate what we call a patch algebra, a commutative ring that efficiently realizes the rings in $X$ as factor rings, or even localizations, and whose structure reflects various properties of the rings in $X$.

math.AC

Some applications of a new approach to factorization

As highlighted in a series of recent papers by Tringali and the author, fundamental aspects of the classical theory of factorization can be significantly generalized by blending the languages of monoids and preorders. Specifically, the definition of a suitable preorder on a monoid allows for the exploration of decompositions of its elements into (more or less) arbitrary factors. We provide an overview of the principal existence theorems in this new theoretical framework. Furthermore, we showcase additional applications beyond classical factorization, emphasizing its generality. In particular, we recover and refine a classical result by Howie on idempotent factorizations in the full transformation monoid of a finite set.

math.RA

On the finiteness of certain factorization invariants

Let $H$ be a monoid, $\mathscr F(X)$ be the free monoid on a set $X$, and $\pi_H$ be the unique extension of the identity map on $H$ to a monoid homomorphism $\mathscr F(H) \to H$. Given $A \subseteq H$, an $A$-word $\mathfrak z$ (i.e., an element of $\mathscr F(A)$) is minimal if $\pi_H(\mathfrak z) \ne \pi_H(\mathfrak z')$ for every permutation $\mathfrak z'$ of a proper subword of $\mathfrak z$. The minimal $A$-elasticity of $H$ is then the supremum of all rational numbers $m/n$ with $m, n \in \mathbb N^+$ such that there exist minimal $A$-words $\mathfrak a$ and $\mathfrak b$ of length $m$ and $n$, resp., with $\pi_H(\mathfrak a) = \pi_H(\mathfrak b)$. Among other things, we show that if $H$ is commutative and $A$ is finite, then the minimal $A$-elasticity of $H$ is finite. This yields a non-trivial generalization of the finiteness part of a classical theorem of Anderson et al. from the case where $H$ is cancellative, commutative, and finitely generated (f.g.) modulo units and $A$ is the set $\mathscr A(H)$ of its atoms. We also check that commutativity is somewhat essential here, by proving the existence of an atomic, cancellative, f.g. monoid with trivial group of units whose minimal $\mathscr A(H)$-elasticity is infinite.

math.RA

Factorization under Local Finiteness Conditions

It has been recently observed that fundamental aspects of the classical theory of factorization can be greatly generalized by combining the languages of monoids and preorders. This has led to various theorems on the existence of certain factorizations, herein called $\preceq$-factorizations, for the $\preceq$-non-units of a (multiplicatively written) monoid $H$ endowed with a preorder $\preceq$, where an element $u \in H$ is a $\preceq$-unit if $u \preceq 1_H \preceq u$ and a $\preceq$-non-unit otherwise. The ``building blocks'' of these factorizations are the $\preceq$-irreducibles of $H$ (i.e., the $\preceq$-non-units $a \in H$ that cannot be written as a product of two $\preceq$-non-units each of which is strictly $\preceq$-smaller than $a$); and it is interesting to look for sufficient conditions for the $\preceq$-factorizations of a $\preceq$-non-unit to be bounded in length or finite in number (if measured or counted in a suitable way). This is precisely the kind of questions addressed in the present work, whose main novelty is the study of the interaction between minimal $\preceq$-factorizations (i.e., a refinement of $\preceq$-factorizations used to counter the ``blow-up phenomena'' that are inherent to factorization in non-commutative or non-cancellative monoids) and some finiteness conditions describing the ``local behaviour'' of the pair $(H, \preceq)$. Besides a number of examples and remarks, the paper includes many arithmetic results, a part of which are new already in the basic case where $\preceq$ is the divisibility preorder on $H$ (and hence in the setup of the classical theory).

math.RA

Abstract Factorization Theorems with Applications to Idempotent Factorizations

Let $\preceq$ be a preorder on a monoid $H$ and $s$ be an integer $\ge 2$. The $\preceq$-height of an $x \in H$ is the sup of the integers $k \ge 1$ for which there is a (strictly) $\preceq$-decreasing sequence $x_1,\ldots,x_k$ of $\preceq$-non-units of $H$ with $x_1 = x$ (with $\sup\emptyset:=0$), where $u\in H$ is a $\preceq$-unit if $u\preceq 1_H\preceq u$ and a $\preceq$-non-unit otherwise. We say $H$ is $\preceq$-artinian if there exists no $\preceq$-decreasing sequence $x_1,x_2,\ldots$ of elements of $H$; and strongly $\preceq$-artinian if the $\preceq$-height of each element is finite. We establish that, if $H$ is $\preceq$-artinian, then each $\preceq$-non-unit $x\in H$ factors through the $\preceq$-irreducibles of degree $s$, where a $\preceq$-irreducible of degree $s$ is a $\preceq$-non-unit $a\in H$ that cannot be written as a product of $s$ or fewer $\preceq$-non-units each of which is (strictly) smaller than $a$ with respect to $\preceq$. In addition, we show that, if $H$ is strongly $\preceq$-artinian, then $x$ factors through the $\preceq$-quarks of $H$, where a $\preceq$-quark is a $\preceq$-min $\preceq$-non-unit. In the process, we also obtain upper bounds for the length of a shortest factorization of $x$ (into either $\preceq$-irreducible of degree $s$ or $\preceq$-quarks) in terms of its $\preceq$-height. Next, we specialize these abstract results to the case in which $H$ is the multiplicative submonoid of a ring $R$ formed by the zero divisors and the identity $1_R$, and $\preceq$ is the preorder on $H$ defined by $a\preceq b$ iff $r_R(1_R-b)\subseteq r_R(1_R-a)$, where $r_R(\cdot)$ denotes a right annihilator. We can thus recover and improve on classical theorems of J.A. Erdos (1967), R.J.H. Dawlings (1981), and J. Fountain (1991) on idempotent factorizations in the endomorphism ring of a free module of finite rank over a skew field or a commutative DVD.

math.RA

Idempotent factorization of matrices over a Pr\"ufer domain of rational functions

We consider the smallest subring $D$ of $\mathbb{R}(X)$ containing every element of the form $1/(1+x^2)$, with $x\in \mathbb{R}(X)$. $D$ is a Pr\"ufer domain called the minimal Dress ring of $\mathbb{R}(X)$. In this paper, addressing a general open problem for Pr\"ufer non B\'ezout domains, we investigate whether $2\times 2$ singular matrices over $D$ can be decomposed as products of idempotent matrices. We show some conditions that guarantee the idempotent factorization in $M_2(D)$.

math.AC

Idempotent factorizations of singular $2\times 2$ matrices over quadratic integer rings

Let $D$ be the ring of integers of a quadratic number field $\mathbb{Q}[\sqrt{d}]$. We study the factorizations of $2 \times 2$ matrices over $D$ into idempotent factors. When $d < 0$ there exist singular matrices that do not admit idempotent factorizations, due to results by Cohn (1965) and by the authors (2019). We mainly investigate the case $d > 0$. We employ Vaser\v{s}te\u{\i}n's result (1972) that $SL_2(D)$ is generated by elementary matrices, to prove that any $2 \times 2$ matrix with either a null row or a null column is a product of idempotents. As a consequence, every column-row matrix admits idempotent factorizations.

math.AC

PRINC domains and comaximal factorization domains

The notion of PRINC domain was introduced by Salce and Zanardo (2014), motivated by the investigation of the products of idempotent matrices with entries in a commutative domain. An integral domain R is a PRINC domain if every two-generated invertible ideal of R is principal. PRINC domains are closely related to the notion of unique comaximal factorization domain, introduced by McAdam and Swan (2004). In this article, we prove that there exist large classes of PRINC domains which are not comaximal factorization domains, using diverse kinds of constructions. We also produce PRINC domains that are neither comaximal factorization domains nor projective-free.

math.AC

Minimal Pr\"ufer-Dress rings and products of idempotent matrices

We investigate a special class of Pr\"ufer domains, firstly introduced by Dress in 1965. The {\it minimal Dress ring} $D_K$, of a field $K$, is the smallest subring of $K$ that contains every element of the form $1/(1+x^2)$, with $x\in K$. We show that, for some choices of $K$, $D_K$ may be a valuation domain, or, more generally, a B\'ezout domain admitting a weak algorithm. Then we focus on the minimal Dress ring $D$ of $\mathbb{R}(X)$: we describe its elements, we prove that it is a Dedekind domain and we characterize its non-principal ideals. Moreover, we study the products of $2\times 2$ idempotent matrices over $D$, a subject of particular interest for Pr\"ufer non-B\'ezout domains.

math.AC

Factorizations into idempotent factors of matrices over Pr\"ufer domains

A classical problem, that goes back to the 1960's, is to characterize the integral domains R satisfying the property (IDn): "every singular nxn matrix over R is a product of idempotent matrices". Significant results, which describe this property in the class of B\'ezout domain, motivated a natural conjecture, proposed by Salce and Zanardo in 2014: (C) "an integral domain R satisfying (ID2) is necessarily a B\'ezout domain". Unique factorization domains, projective-free domains and PRINC domains verify the conjecture. We prove that an integral domain R satisfying (ID2) must be a Pr\"ufer domain in which every invertible 2x2 matrix is a product of elementary matrices. Then we show that a large class of coordinate rings of plane curves and the ring of integer-valued polynomials Int(Z) verify an equivalent formulation of (C).

math.AC