Module categories without short cycles are of finite type

Dieter Happel, Shi Ping Liu

Proceedings of the American Mathematical Society · 1994 · 19 citations · 6 references

DOIFull text

Open access

Concepts

Abstract

Let <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper A"> <mml:semantics> <mml:mi>A</mml:mi> <mml:annotation encoding="application/x-tex">A</mml:annotation> </mml:semantics> </mml:math> </inline-formula> be an artin algebra. An indecomposable finitely generated <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper A"> <mml:semantics> <mml:mi>A</mml:mi> <mml:annotation encoding="application/x-tex">A</mml:annotation> </mml:semantics> </mml:math> </inline-formula> -module <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper X"> <mml:semantics> <mml:mi>X</mml:mi> <mml:annotation encoding="application/x-tex">X</mml:annotation> </mml:semantics> </mml:math> </inline-formula> is said to be on a short cycle if there exists an indecomposable finitely generated <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper A"> <mml:semantics> <mml:mi>A</mml:mi> <mml:annotation encoding="application/x-tex">A</mml:annotation> </mml:semantics> </mml:math> </inline-formula> -module <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper Y"> <mml:semantics> <mml:mi>Y</mml:mi> <mml:annotation encoding="application/x-tex">Y</mml:annotation> </mml:semantics> </mml:math> </inline-formula> and two nonzero noninvertible maps <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="f colon upper X right-arrow upper Y"> <mml:semantics> <mml:mrow> <mml:mi>f</mml:mi> <mml:mo>:</mml:mo> <mml:mi>X</mml:mi> <mml:mo stretchy="false"> → </mml:mo> <mml:mi>Y</mml:mi> </mml:mrow> <mml:annotation encoding="application/x-tex">f:X \to Y</mml:annotation> </mml:semantics> </mml:math> </inline-formula> and <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="g colon upper Y right-arrow upper X"> <mml:semantics> <mml:mrow> <mml:mi>g</mml:mi> <mml:mo>:</mml:mo> <mml:mi>Y</mml:mi> <mml:mo stretchy="false"> → </mml:mo> <mml:mi>X</mml:mi> </mml:mrow> <mml:annotation encoding="application/x-tex">g:Y \to X</mml:annotation> </mml:semantics> </mml:math> </inline-formula> . If there are no short cycles we show that there exist only finitely many indecomposable <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper A"> <mml:semantics> <mml:mi>A</mml:mi> <mml:annotation encoding="application/x-tex">A</mml:annotation> </mml:semantics> </mml:math> </inline-formula> -modules up to isomorphism.

References

6