\(\tau\)-categories. II: Nakayama pairs and rejective subcategories. (Q2644165)

Two important concepts are introduced in the paper: Nakayama pairs, and rejective subcategories. For an order \(\Lambda\) over a complete discrete valuation domain \(R\), it is well-known that each indecomposable projective \(\Lambda\)-lattice \(P\) corresponds to an indecomposable injective \(\Lambda\)-lattice \(\nu(P)\) via the Nakayama correspondence \(\nu\). In case \(\Lambda\) is representation-finite, the author observes that the arrow \(\text{Rad\,}P\to P\) is connected by its dual \(\nu(P)\to(\text{Rad\,}P)^*\) by a finite ladder of Auslander-Reiten squares. Accordingly, a pair of objects like \(P\) and \(\nu(P)\) which gives rise to such a ladder is called a Nakayama pair. It is quite remarkable that such a ladder can be described in a purely combinatorial fashion. Therefore, the theory of Nakayama pairs developed in the paper under review forms an essential step toward the main object of the trilogy of papers on \(\tau\)-categories [part I, ibid. 8, No. 3, 297-321 (2005; Zbl 1093.16015), part III, ibid. 8, No. 5, 601-619 (2005; Zbl 1091.16012)], namely, the combinatorial characterization of all finite Auslander-Reiten quivers arising from \(R\)-orders \(\Lambda\). The second important concept introduced in the paper is that of a rejective subcategory. Rejective subcategories are reflective and coreflective subcategories such that the unit is epic and the counit is monic. With minor changes, this concept arises in several parts of mathematics. For orders \(\Lambda\), rejective subcategories of \(\Lambda\text{-lat}\) correspond to generalized overorders of \(\Lambda\) in the sense of \textit{Yu. A. Drozd} and \textit{V. V. Kirichenko} [Izv. Akad. Nauk SSSR, Ser. Mat. 36, 328-370 (1972; Zbl 0234.13009)]. In this context, rejective subcategories thus provide a categorical description of generalized overorders. If the unit and counit are both monic and epic, these subcategories correspond to the usual overorders. Since a chain of overorders is always finite, the use of rejective subcategories allows a finite induction, making them an important tool for representation-theoretic purposes. With a similar technique, which equally well applies to Artinian algebras, the author was able to kill two birds with one stone: He proved the second Solomon conjecture on the zeta function of orders and showed that Auslander's representation-dimension of a finite dimensional algebra over a field is always finite [Fields Inst. Commun. 40, 45-64 (2004; Zbl 1056.16012)]. In this application, the relationship to quasi-hereditary algebras is quite apparent. The indecomposable \(\Lambda\)-lattices which belong to the complement of a rejective subcategory form a so-called rejectable subcategory. Classical examples are Drozd and Kirichenko's original one-point rejection, and the four-point rejection of \textit{H. Hijikata} and \textit{K. Nishida} [J. Algebra 192, No. 2, 592-640 (1997; Zbl 0877.16007)]. Rejectable subcategories have a very nice Auslander-Reiten quiver. For instance, the hammocks introduced by S. Brenner are of that type. For all these and other applications, the theoretical foundation is laid in this important paper.