$K\Lambda\simeq K\otimes_{R}\Lambda$ , and let Ind $\Lambda$ denote the set of isomorphism classes of indecomposable left $\Lambda$ -lattices. For an overorder $\Gamma$ of $\Lambda$ in $\tilde{\Lambda}$, we may naturally consider Ind $\Gamma$ as a subset of Ind $\Lambda$ . A subset ,9“ of Ind $\Lambda$ will be called a rejectable subset if there is an overorder $\Gamma$ such that $\mathscr{L}=Ind\Lambda$ –Ind $\Gamma$ . The map $\Gamma\vdasharrow$ (Ind $\Lambda$ –Ind $\Gamma$) defines a bijection from the set of all overorders of $\Lambda$ onto the set of all rejectable subsets of Ind $\Lambda$ . Indeed, the inverse map is given by $\mathscr{L}->\Lambda(\mathscr{L})$ . Here, for any subset $\mathscr{L}$ of Ind $\Lambda,$ $\Lambda(\mathscr{L})$ is defined as the intersection $\bigcap_{L\in Ind\Lambda-9},$ $O_{l}(L)$ of the left multiplier $O_{l}(L)$ $:=$
[1]
K. Nishida,et al.
Primary Orders of Finite Representation Type
,
1997
.
[2]
K. Nishida,et al.
Bass orders in non semisimple algebras
,
1994
.
[3]
S. Brenner,et al.
On the number of terms in the middle of an almost split sequence
,
1981
.
[4]
A. Wiedemann.
Orders with loops in their auslander-reiten graph
,
1981
.
[5]
C. Curtis,et al.
Methods of representation theory--with applications to finite groups and orders
,
1981
.
[6]
C. Ringel.
Report on the Brauer-Thrall conjectures: Rojter's theorem and the theorem of Nazarova and Rojter (on algorithms for solving vectorspace problems. I)
,
1980
.
[7]
J. Drozd,et al.
ON QUASI-BASS ORDERS
,
1972
.