Matching works

2 works

math.RT — Representation Theory

Reduction of the Gorenstein symmetry conjecture to finite rings

Contributed by Qiyue Tang

We prove that the Gorenstein symmetry conjecture for Artin algebras is equivalent to its restriction to finite rings of prime-power cardinality, preserving the finite self-injective dimension of a counterexample. For finite-dimensional algebras over fields, the conjecture reduces to finite prime fields. In characteristic zero, a counterexample yields counterexamples of one fixed dimension over every prime field outside a finite set.

A mix of human-written and AI-generated textHuman understanding: some partsGorenstein symmetry conjecture
Oct 20, 202621 pages
PDFView work

math.RT — Representation Theory

Reflexive equivalence and reflexive-minimal algebras

Contributed by Haruhisa Enomoto

Let AA be a finite-dimensional algebra over a field. A finite-dimensional algebra BB over the same field is called reflexively equivalent to AA if their categories of reflexive modules are equivalent. We prove that there is a basic algebra Amin⁡A_{\min}, unique up to isomorphism, such that BB is reflexively equivalent to AA if and only if B≅End⁡Amin⁡(Amin⁡⊕X)B\cong\operatorname{End}_{A_{\min}}(A_{\min}\oplus X) for some reflexive Amin⁡A_{\min}-module XX. Moreover, we compute Amin⁡A_{\min} explicitly. We extend these results to module-finite algebras over henselian local rings of dimension at most one under a dominant dimension condition at minimal primes. We also introduce reflexive modules over additive categories and prove that taking reflexive modules is idempotent: the reflexive modules over the category of reflexive modules form an equivalent category. As an application, we show that reflexive equivalence classes of algebras with finitely many indecomposable reflexive modules correspond bijectively to Morita equivalence classes of algebras whose reflexive modules are projective.

Primarily AI-generated textHuman understanding: some parts
Oct 03, 202628 pages
PDFView work

Advanced search

Text
Human understanding
Linked formalizations