How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Explicit affine D and E flag families give exponentially many indecomposables
Statement
Let have underlying graph an affine tree of type (), , or , with any orientation, over . Let be its primitive positive null vector. There are constants such that for every the category has at least pairwise nonisomorphic indecomposable representations of dimension . All its representations are nilpotent, since the underlying graph is a tree. The construction uses only partial flags, finite-field descent and source/sink reflection, not a classification of arbitrary quiver indecomposables.
For , has value along the central chain and on its four outer leaves. For , use the star with arm types , respectively. The central value is , and the arm values, from the outside inward, are for an arm of type .
Facts & Assumptions
Given: A finite field and an oriented affine D or E tree, with the stated dimension vectors. Assume the inherited Axiom of Choice.
A Frobenius-stable family of geometric Schur classes of dimension whose th fixed set has cardinality comparable to yields at least indecomposables of dimension (Finite-field descent and restriction of Schur quiver representations).
The kernel/cokernel reflection construction and inverse exact subcategories clause of Reflection classifies finite-Dynkin quiver indecomposables over a finite field applies to every finite acyclic quiver, not only finite Dynkin type. They preserve endomorphism rings and commute with field extension whenever the object is not the reflected simple.
Every two orientations of a finite tree are connected by source/sink firings; clause (1) of Coxeter elements of tree type are conjugate by source and sink firings has this scope without a finite-type hypothesis.
Grassmannians have standard affine graph charts and dimension ; iterating these gives partial-flag charts (Standard affine charts on the Grassmannian, The Grassmannian is smooth, irreducible, and has dimension r(n-r)). The finite general linear group has order over : choose its ordered basis columns successively outside the span of the preceding columns.
Proof
For affine D, choose all arrows at the outer leaves pointing toward the central chain and choose any orientation of its edges. Take the chain spaces to have dimension and their maps to be isomorphisms; identify them along the chain. The four nonzero leaf maps then specify four lines in a common -space. Isomorphisms of such representations are exactly common transports of the four lines, and their endomorphisms are exactly linear maps preserving all four lines. Three distinct lines force that endomorphism to be scalar: preserving two lines diagonalizes it and preserving a third with both coordinates nonzero equates the diagonal entries. Such configurations exist over an algebraic closure in every characteristic. Their variety is irreducible of dimension . The stated vector is a null vector: each leaf equation is , each interior chain equation is , and each end branch has ; the one-vertex chain has four leaves and the same equality. It is primitive because it has entries .
For affine E, orient all arms toward the center and take every arm map injective. Such representations modulo changes of bases on the arms are triples of flags in the central -space, with steps . Endomorphisms are exactly central endomorphisms preserving these flags, since an arm endomorphism is their unique restriction. The product flag variety is irreducible. The dimension of the flag for equal blocks of size is by its successive graph charts. Thus , because . Each internal null-vector equation is a second difference of this arithmetic progression; at the center it is . The vectors have entries with greatest common divisor , proving that they are the primitive positive null vectors.
For E6 choose two opposite full flags in dimension . Their common endomorphisms are diagonal. Choose the first line of the third full flag to be spanned by and extend it to any full flag. A diagonal endomorphism preserving this line has equal entries, so the common endomorphism algebra is scalar. For E7 choose two opposite full flags in dimension . Choose the third, two-dimensional subspace to be spanned by and with four distinct over the algebraic closure. If a diagonal matrix preserves this plane, its diagonal entries are , while preservation of says for all four distinct . A quadratic polynomial cannot have four distinct roots unless zero, so and . The matrix is scalar. These arguments hold in every characteristic.
For E8, choose a full flag in a -space grouped into three consecutive pairs, and the opposite partial flag consisting of the last pair and last two pairs. An endomorphism preserving both is block diagonal with three upper triangular -by- blocks: the full flag makes it upper triangular and the opposite partial flag eliminates the off-block entries. Choose three full flags in a -space whose common endomorphisms are scalar, as in step 2.1. Map this space into by its three quotient maps; it is injective because the three lines have zero intersection. Identify the first coordinate line in each two-dimensional quotient with . Use the image as the remaining three-dimensional subspace in the -space. If the three upper triangular blocks preserve this image, they induce a common endomorphism of ; the quotient identities force to preserve every and . Hence is scalar by step 2.1, and surjectivity of the quotient maps forces each block to be that same scalar. Thus E8 also has a configuration with scalar endomorphism algebra in every characteristic.
For each of these product flag varieties , let be the locus of scalar endomorphism algebra. It is nonempty by steps 1.1, 2.1 and 3.1 and open: preservation of the flags is a finite linear system in the matrix entries; its kernel always contains the scalars, and has dimension exactly when some -minor is nonzero. Every product flag variety has an affine big cell of dimension over . Its intersection with is nonempty by irreducibility, so on that cell one such minor is a nonzero polynomial over of fixed degree. A nonzero degree- polynomial in variables has at most zeros over , by induction on variables and the one-variable root bound. Therefore for large . The full flag counts, or a finite cover by the standard cells [F4], give . Every orbit in has cardinality , because its endomorphisms are exactly the scalars. By [F4] that orbit cardinality is bounded above and below by fixed positive constants times . Hence its number of rational orbits is bounded above and below by fixed positive constants times .
Let be the geometric Schur classes of the representations just constructed, with the injection/isomorphism conditions on the arrows. These conditions are invariant under Frobenius and base extension. The finite-field descent lemma [F1] shows that Frobenius-fixed classes have rational models; all these rank conditions hold on that model because they hold after scalar extension. Two rational models in one geometric Schur class are rationally isomorphic by the same lemma. After normalizing the chain isomorphisms and forgetting the arm bases, their classes are precisely the rational flag orbits counted in step 4.1. Thus the fixed-class numbers are comparable to , and [F1] gives the claimed exponential lower bound for the chosen orientations.
For an arbitrary orientation of the same tree, use a finite sequence of source/sink firings from [F3]. The null-vector equations checked in steps 1.1–1.2 imply at every vertex. A -dimensional indecomposable is never a vertex simple. The reflection equivalences [F2] therefore give bijections of Schur classes of dimension through the whole firing sequence. They commute with extension and Frobenius and hence preserve all fixed-class counts and exact Frobenius orbit lengths. Apply [F1] again to get the bound in the target orientation. Every path of length at least the number of vertices in a tree orientation is zero, so all constructed representations are nilpotent. This completes the full orientation and category assertions.
Depends on
- The Axiom of Choice
- Finite-field descent and restriction of Schur quiver representations
- Reflection classifies finite-Dynkin quiver indecomposables over a finite field
- Coxeter elements of tree type are conjugate by source and sink firings
- Standard affine charts on the Grassmannian
- The Grassmannian is smooth, irreducible, and has dimension r(n-r)
Used by
Dependency tree · two levels
26 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Olivier Schiffmann, Lectures on Hall Algebras (standard reference, not scraped)
- Claus Michael Ringel, The Hall Algebra Approach to Quantum Groups, E.L.A.M. Lectures (standard reference, not scraped)