SearcharxivSearch

arXiv · 2205.02032

Relative Gorenstein flat modules and Foxby classes and their model structures

Abstract

A model structure on a category is a formal way of introducing a homotopy theory on that category, and if the model structure is abelian and hereditary, its homotopy category is known to be triangulated. So a good way to both build and model a triangulated category is to build a hereditary abelian model structure. Given a ring $R$ and a (non necessarily semidualizing) left $R$-module $C$, we introduce and study new concepts of relative Gorenstein cotorsion and cotorsion modules: $\rm G_C$-cotorsion and (strongly) $\mathcal{C}_C$-cotorsion. As an application, we prove that there is a unique hereditary abelian model structure on the category of left $R$-modules, in which the cofibrations are the monomorphisms with $\rm G_C$-flat cokernel and the fibrations are the epimorphisms with $\mathcal{C}_C$-cotorsion kernel belonging to the Bass class $\mathcal{B}_C(R)$. In the second part, when $C$ is a semidualizing $(R,S)$-bimodule, we investigate the existence of abelian model structures on the category of left (resp., right) $R$-modules where the cofibrations are the epimorphisms (resp., monomorphisms) with kernel (resp., cokernel) belonging to the Bass (resp., Auslander) class $\mathcal{B}_C(R)$ (resp., $\mathcal{A}_C(R)$). We also study the class of $\rm G_C$-flat modules and the Bass class from the Auslander-Buchweitz approximation theory point of view. We show that they are part of weak AB-contexts. As the concept of weak AB-context can be dualized, we also give dual results that involve the class of $\rm G_C$-cotorsion modules and the Auslander class.

Explore related subjects

Keep this discovery

BibTeXRIS

Driss Bennis, Rachid El Maaouy, Juan Ramón García Rozas, Luis Oyonarte. 2022-05-04. Relative Gorenstein flat modules and Foxby classes and their model structures. https://doi.org/10.1142/s0219498825501944

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