🔢 mathematics

Infinitely Many Components in Auslander--Reiten Quivers of Representation-Infinite Algebras over Perfect Fields

This paper proves that the Auslander–Reiten quiver of any representation-infinite finite-dimensional algebra over a perfect field contains infinitely many connected components, thereby confirming a conjecture by Auslander, Reiten, and Smalø for this class of algebras.

Original authors: Wen Chang, Quanyu Tang

Published 2026-07-28

📖 5 min read🧠 Deep dive

CC BY 4.0

Original authors: Wen Chang, Quanyu Tang

Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). ✨ This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer

Imagine the universe of mathematics as a vast, bustling city where every building represents a unique mathematical object, and the roads connecting them represent the ways these objects can transform into one another. In a specific neighborhood of this city called "Representation Theory," mathematicians study how complex algebraic structures (think of them as intricate machines made of gears and levers) can be broken down into their simplest, indivisible parts. To map out this neighborhood, they use a special kind of city planner's tool called an "Auslander–Reiten quiver." You can picture this quiver as a giant, glowing subway map. The stations on the map are the simplest building blocks, and the lines connecting them show how they can be morphed or twisted into each other.

The big question mathematicians have been asking for decades is about the layout of this subway system. If the city is "infinite" in size—meaning there are endlessly many unique building blocks—does the subway map consist of just one giant, tangled web where you can travel from any station to any other? Or does it break apart into infinitely many separate, isolated islands, where you can never hop from one island to another? This isn't just a game of connect-the-dots; understanding whether these islands are finite or infinite helps scientists grasp the fundamental complexity and "shape" of the mathematical structures they are studying. It's like asking if a massive forest is one single, connected ecosystem or a collection of thousands of tiny, isolated groves.

This paper, written by Wen Chang and Quanyu Tang, tackles this exact puzzle for a specific type of mathematical city built over "perfect fields" (a technical term for a very well-behaved type of number system, like the real numbers or finite fields). The authors prove a long-standing guess: if the city is infinite, the subway map must have infinitely many separate, disconnected islands. They didn't just guess; they built a rigorous mathematical proof to show this is undeniably true.

Here is how they cracked the code, using a mix of clever tricks and logical leaps:

The "Magic Mirror" Trick (The Algebraically Closed Case)
First, the authors tackled the problem in a "perfectly smooth" version of the city where the number system is algebraically closed (imagine a world where every equation has a solution, like a mirror that reflects every possible image). In this world, they used a powerful tool called a "representation embedding." Think of this as a magical machine that takes a simple, one-dimensional line of numbers and turns it into a complex, multi-dimensional building block.

By tweaking the settings on this machine, they could generate a never-ending parade of unique building blocks. But here's the catch: just because you have a parade of unique blocks doesn't mean they are on different islands. They could all be connected by a single, long road. To prove they are on separate islands, the authors used a concept called "field automorphisms." Imagine these as magical shufflers that rearrange the numbers in the city without changing the rules of the game.

They discovered a secret pattern: if you take a building block and apply a specific shuffler, it moves to a new block. If you keep shuffling, it eventually loops back to the start. The length of this loop is called the "orbit length." The authors proved that if two blocks are on the same island (connected by a road), their loop lengths must be mathematically compatible. By choosing shufflers with loop lengths that are huge, prime numbers (numbers only divisible by 1 and themselves), they forced the blocks to have loop lengths that simply couldn't match up. It's like trying to fit a square peg into a round hole; the math just doesn't work. Therefore, these blocks must be on different islands. Since they could create an infinite parade of blocks with these incompatible loop lengths, they proved there are infinitely many islands.

The "Bridge" Trick (The Perfect Field Case)
The first part of the proof worked for the "smooth" city, but the authors needed to prove it for the "perfect" city, which might be a bit rougher or smaller. They used a technique called "separable base change." Imagine the "perfect" city as a small village, and the "smooth" city as a massive metropolis built right on top of it. You can expand the village into the metropolis by adding new materials (scalar extension).

The tricky part is that when you expand the village, a single building block might split into several smaller pieces. The authors had to prove that if the village had only a few islands, the metropolis would also have only a few islands. They did this by showing that you can always "lift" a path from the village up to the metropolis. If you can walk from Island A to Island B in the village, you can walk from a piece of Island A to a piece of Island B in the metropolis.

This led to a logical trap: If the village (the original algebra) had only a finite number of islands, then the metropolis (the expanded algebra) would also have to have a finite number. But the authors had already proven in the first part that the metropolis must have infinitely many islands. This contradiction means the village couldn't have had a finite number of islands to begin with.

The Verdict
The paper concludes with a definitive "Yes." For any finite-dimensional algebra over a perfect field that is infinite in complexity, the Auslander–Reiten quiver is not a single connected web. It is a fractured landscape of infinitely many disconnected components. The authors didn't just suggest this; they proved it with airtight logic, combining the power of prime numbers, magical shufflers, and bridge-building to settle a conjecture that had stood for decades. They showed that in the infinite world of these algebras, isolation is the rule, not the exception.

Technical Summary: Infinitely Many Components in Auslander–Reiten Quivers of Representation-Infinite Algebras over Perfect Fields

Problem Statement
The paper addresses a fundamental structural question in the representation theory of Artin algebras: determining the number of connected components in the Auslander–Reiten (AR) quiver $\Gamma_A$ of a representation-infinite algebra. Specifically, it seeks to resolve Conjecture 1.1, proposed by Auslander, Reiten, and Smalø in their monograph [ARS95], which posits that if an Artin algebra $A$ is of infinite representation type, then its AR-quiver $\Gamma_A$ must possess infinitely many connected components. While this conjecture has been verified for specific classes of algebras (e.g., hereditary algebras, tame algebras over algebraically closed fields, and certain self-injective algebras), a general proof for finite-dimensional algebras over perfect fields remained open.

Methodology
The authors establish the result for any finite-dimensional algebra $A$ over a perfect field $k$ through a two-part strategy that bridges representation theory and field theory:

The Algebraically Closed Case:
- Representation Embedding: The proof utilizes a representation embedding $H = M \otimes_R -$ derived from a localized polynomial ring $R = k[T, h(T)^{-1}]$ (based on work by Bongartz [B16] and Bautista–Pérez–Salmerón [BPS25]). This embedding generates a one-parameter family of pairwise non-isomorphic indecomposable $A$ -modules of a fixed dimension.
- Semilinear Twists and Orbit Analysis: The authors construct field automorphisms $\sigma$ acting on the parameters of these modules. By applying semilinear twists to the representation embedding, they induce additive autoequivalences $\Phi_\sigma$ on the module category.
- Orbit Length Invariants: A key technical innovation is the use of large prime numbers $\ell$ to analyze the orbit lengths of modules under these autoequivalences. Using a uniform local dimension estimate (Lemma 3.1) and properties of the categorical radical, the authors prove that for a sufficiently large prime $\ell$ , the $\ell$ -adic valuation of the orbit length of a module is constant across any connected component of $\Gamma_A$ .
- Construction of Distinct Components: By recursively selecting parameters $\lambda_i$ and automorphisms $\sigma_i$ with distinct prime orbit lengths, the authors construct modules that must reside in pairwise distinct connected components, thereby proving the infinitude of components when $k$ is algebraically closed.
The Perfect Field Case (Base Change):
- Separable Extension: The authors extend the result from a perfect field $k$ to its algebraic closure $K = \bar{k}$ via scalar extension $A_K = K \otimes_k A$ . Since $k$ is perfect, the extension $K/k$ is Galois and separable.
- Descent of Components: The core difficulty addressed is that scalar extension can split indecomposable modules. The authors prove that if $\Gamma_A$ $Γ_{A}$ has finitely many components, then $\Gamma_{A_K}$ $Γ_{A_{K}}$ must also have finitely many. This is achieved by:
  - Establishing that the Jacobson radical and the square of the radical behave well under separable base change (Lemmas 5.2, 5.3).
  - Showing that the Galois group $G = \text{Gal}(K/k)$ acts transitively on the isomorphism classes of indecomposable direct summands of an extended module (Lemma 5.5).
  - Developing a "path-lifting" argument (Lemma 5.6) to show that any path in $\Gamma_{A_K}$ can be connected back to a finite set of components derived from $\Gamma_A$ .

Key Contributions and Results

Main Theorem (Theorem 1.2): The paper proves that for any finite-dimensional algebra $A$ over a perfect field $k$ , if $A$ is of infinite representation type, then its Auslander–Reiten quiver $\Gamma_A$ has infinitely many connected components.
Resolution of Conjecture 1.1: This result settles the Auslander–Reiten–Smalø conjecture for the class of finite-dimensional algebras over perfect fields.
Technical Tools:
- A refined application of representation embeddings from localized polynomial rings to generate families of modules.
- A novel invariant for AR-quiver components based on the $\ell$ -adic valuation of orbit lengths under semilinear twists.
- A rigorous descent argument for the number of connected components under separable base change, clarifying the behavior of the categorical radical and irreducible morphisms in this context.

Significance
The paper provides a definitive answer to a long-standing open problem in the structural theory of Artin algebras. By establishing the infinitude of components for representation-infinite algebras over perfect fields, it confirms that the complexity of the module category (in terms of global combinatorial structure) is intrinsically linked to the representation type. The methodology demonstrates how combining representation embeddings with field-theoretic automorphisms and Galois descent can resolve structural questions that are difficult to tackle using purely module-theoretic methods. The authors explicitly note that the perfectness of the field is crucial for ensuring the separability of the extension to the algebraic closure, which preserves the semisimplicity of quotients and allows the radical formulas to hold.

Author's Note on AI Usage
The authors disclose that while the main theorem and proof strategy are human-derived, ChatGPT assisted in the technical construction of the semilinear twist argument (Lemma 4.2) and the extension of results from algebraically closed fields to arbitrary perfect fields (Lemmas 5.3, 5.5, 5.6, and Proposition 5.7). The authors retain full responsibility for the verification and revision of all arguments.

More like this