Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generated
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.

Finite-field descent and restriction of Schur quiver representations

Statement

Let Q be a finite quiver, k=Fq, and k‾ an algebraic closure. A finite-dimensional representation M over k‾ is called Schur here when End⁡k‾QM=k‾. Let S be a Frobenius-stable set of Schur geometric isomorphism classes of a fixed dimension vector δ, consisting of representations defined over some finite extensions. Every class fixed by the mth Frobenius power has a model over km=Fqm, unique up to km-isomorphism. If constants c,C>0 satisfy cqm≤∣Fix⁡(Fr⁡m;S)∣≤Cqm for all sufficiently large m, then for all sufficiently large m there are at least c′qm/m pairwise nonisomorphic indecomposable kQ-representations of dimension mδ, for a constant c′>0. This conclusion also holds within the nilpotent representation category when the classes in S are nilpotent.

Facts & Assumptions

Given: The finite fields, Frobenius action, Schur classes and counting bounds in the statement. Assume the inherited Axiom of Choice to choose an algebraic closure and the standard finite-dimensional bases.

[F2]

Distinct field automorphisms are linearly independent as functions (Dedekind's linear independence theorem for distinct characters).

[F3]

Finite-dimensional quiver modules have unique finite indecomposable decompositions by Graded Krull–Schmidt for finite-dimensional graded modules, with path algebra and vector spaces concentrated in degree zero.

Proof

1.1F1F2givenalgebra

Let L/K be a finite cyclic extension with generator σ of order r, and let T be a σ-semilinear automorphism of a finite L-space with Tr=1. Fixed vectors span it over L. Otherwise quotient by their L-span and choose vˉ≠0 there. Every average ∑j=0r−1Tj(av) is fixed, so in the quotient ∑jσj(a)Tjvˉ=0 for all a∈L. A coordinate functional nonzero on vˉ contradicts [F2]. Choose an L-basis among the fixed vectors. A linear combination is fixed exactly when all its coefficients are fixed by σ, so these same vectors are a K-basis of the fixed space. This proves semilinear vector-space descent, and invariant arrow maps descend in these bases.

2.1F1F2step 1.1algebra

Suppose a geometric Schur class is fixed by Fr⁡m. Choose a model and an intertwiner to its transform, all over a finite extension L of K=km; enlarge L if necessary so it is cyclic over K. The intertwiner defines a semilinear operator T on the sum of the vertex spaces, preserving the vertex decomposition and commuting with all arrows. Its rth power is an endomorphism of the Schur representation, so is a common scalar λ. Commuting T with Tr gives σ(λ)=λ, hence λ∈K×. The norm L×→K× is onto: by [F1] it sends a cyclic generator to an element of order ∣K×∣. Choose a with norm λ−1; then (aT)r=1. Step 1.1 supplies fixed bases and a model over K. If two models over K are geometrically isomorphic, their intertwiner space is the kernel of a matrix of linear equations over K, whose dimension stays 1 after scalar extension. A nonzero rational intertwiner is therefore a scalar multiple over k‾ of an isomorphism and is invertible. This proves uniqueness of the rational model.

3.1F1givenstep 2.1algebra

A class fixed by Fr⁡m with orbit length less than m is fixed by Fr⁡d for some proper divisor d of m. For each d, step 2.1 places these fixed classes in bijection with a subset of the isomorphism classes of dimension-δ representations over kd. There are finitely many such representations up to isomorphism: after fixing the finite bases, there are finitely many arrow-matrix tuples over the finite field kd. Thus each fixed set for a small d is finite, and we may increase C to cover the finitely many small extension degrees. The number of classes with orbit length less than m is at most ∑d∣m,d<mCqd≤Cmqm/2. Thus at least cqm−Cmqm/2≥(c/2)qm classes have exact orbit length m for large m, yielding at least (c/2)qm/m distinct Frobenius orbits.

4.1F1F3step 2.1step 3.1algebra∎

For a Schur representative over km with exact orbit length m, restrict every vertex space and arrow to k. Such a representative exists by step 2.1. After scalar extension to k‾, the resulting representation is the direct sum of its m Frobenius conjugates: the algebra km⊗kk‾ is the product of m copies of k‾ under its distinct embeddings, since the finite extension is separable. Each conjugate is indecomposable, because its endomorphism ring is a field, and they are pairwise nonisomorphic by exact orbit length. If the restricted representation split over k, its two nonzero summands would, by [F3], partition this multiset into two nonempty Frobenius-stable subsets. Frobenius acts transitively, so no such partition exists. Hence restriction is indecomposable. Two restrictions from distinct orbits cannot be isomorphic, again by their scalar-extended decompositions and [F3]. Nilpotence of all sufficiently long paths is preserved by restriction. Combining with step 3.1 gives the stated bound.

Depends on

Used by

Dependency tree · two levels

23 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