[Paper Review] Continuous quivers of type A (I) The generalized barcode theorem

Kiyoshi Igusa, Job Daisie Rock+1 more|arXiv (Cornell University)|Sep 23, 2019

Algebraic structures and combinatorial models5 citations

TL;DR

This paper generalizes type A quivers to continuous quivers of type A and establishes a continuous analogue of Crawley-Boevey's BarCode theorem: every pointwise finite-dimensional representation decomposes as a direct sum of indecomposable representations supported on intervals. It further classifies indecomposable projective representations, extending foundational results in representation theory to a continuous setting.

ABSTRACT

We generalize type $A$ quivers to continuous type $A$ quivers and prove basic results about pointwise finite-dimensional representations. In particular, we generalize Crawley-Boevey's BarCode theorem to continuous quivers with alternating orientations: every pointwise finite-dimensional representation of a continuous type $A$ quiver is the direct sum of pointwise one-dimensional indecomposable whose supports are intervals. This recovers a result of [5]. We also classify the indecomposable projective representations. This is part of a longer work in which we study a generalization of the continuous cluster category (introduced by the first and last author in 2015) and a continuous generalization of mutation.

Motivation & Objective

• To extend the theory of type A quivers to a continuous setting, generalizing discrete quiver representations to continuous parameter spaces.
• To establish a continuous version of the BarCode theorem for pointwise finite-dimensional representations.
• To classify indecomposable projective representations in the continuous quiver setting.
• To lay foundational groundwork for a continuous cluster category and mutation theory.

Proposed method

• Generalize discrete type A quivers to continuous quivers with alternating orientations by replacing discrete vertices with continuous intervals.
• Define pointwise finite-dimensional representations over continuous quivers using sheaf-theoretic and category-theoretic constructions.
• Apply techniques from representation theory and homological algebra to analyze indecomposable representations.
• Use interval decomposability as a key structural principle, generalizing the discrete BarCode decomposition.
• Characterize indecomposable projectives via duality and support conditions on intervals.
• Leverage the continuous setting to recover and extend results from [5] and the 2015 continuous cluster category framework.

Experimental results

Research questions

• RQ1 How can the BarCode theorem be generalized to continuous quivers of type A with alternating orientations?
• RQ2 What is the structure of pointwise finite-dimensional representations in the continuous quiver setting?
• RQ3 Which representations are indecomposable, and how can they be classified in this continuous framework?
• RQ4 How do projective representations behave in continuous type A quivers, and what characterizes them?
• RQ5 What is the role of interval supports in the decomposition of continuous representations?

Key findings

• Every pointwise finite-dimensional representation of a continuous type A quiver decomposes as a direct sum of indecomposable representations, each supported on an interval.
• The indecomposable summands are one-dimensional and their supports are intervals, generalizing the discrete BarCode theorem.
• The classification of indecomposable projective representations is achieved via their interval supports and duality properties.
• The continuous BarCode theorem recovers a result previously established in [5], now in a broader categorical framework.
• The results provide a structural foundation for extending cluster category theory and mutation to continuous settings.