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-Dynkin Hall algebras are generated by vertex simples

Statement

Let Q be any orientation of a finite ADE forest over k=Fq, with ν=q>1 and coefficient field Q(ν). Its Euler-twisted Hall algebra is generated by the vertex-simple classes. Consequently its composition algebra equals the full positive Hall algebra, and adjoining the declared Cartan torus gives the full extended Hall algebra. No fixed-parameter quantum-group injectivity theorem or Hall polynomial existence theorem is a premise.

Facts & Assumptions

Given: The finite ADE forest, its finite-field representation category, and the subobject-count Hall normalization.

[F1]

Indecomposables M1,…,Mm are indexed by positive roots, with End⁡Mi=k, self-Ext zero and Ext⁡1(Mi,Mj)=0 for i<j (Reflection classifies finite-Dynkin quiver indecomposables over a finite field).

[F2]

Objects decompose uniquely into indecomposables by Graded Krull–Schmidt for finite-dimensional graded modules, applied to the path algebra and modules in degree zero.

[F3]

The Hall coefficient counts subobjects in 0→N→R→M→0, multiplied by νχ0(M,N). By The hereditary Euler form is additive on the Grothendieck group, χ0(M,N)=⟨[M],[N]⟩ is bilinear on K0; for quiver representations the vertex-simple basis identifies these classes with dimension vectors. The composition algebra is the simple-generated subalgebra (The Euler-twisted Hall algebra, The extended Hall algebra and composition subalgebra).

Proof

1.1F1F2F3algebra

By [F1], every extension of Mi⊕a by Mj⊕b for i≤j splits. Hence an ordered Hall product of such blocks is a nonzero scalar multiple of their direct sum: the only possible middle object is the direct sum, and at least its canonical summand inclusion contributes to the positive integer Hall count. Its Euler factor is a nonzero power of ν. This proves that whenever the individual indecomposable classes in a sum have been generated, the class of that sum is generated. In particular [Si⊕a] is a nonzero scalar multiple of [Si]a, since there are no self-extensions at a loopless vertex.

2.1F3step 1.1algebra

Number the vertices topologically, with arrows from earlier to later vertices. For a dimension vector d, the product [d1S1]⋆⋯⋆[drSr] has the same nonzero coefficient on every object of dimension d. Indeed it counts the unique descending filtration whose successive quotients are supported at these vertices: the subobject after each step is the entire representation on the remaining terminal vertex set and zero on the preceding vertices. This is a subrepresentation because arrows never go from a terminal vertex to an earlier one. There are no choices of subspaces within a vertex block. All Euler factors depend only on d, so their product is a common nonzero scalar. There are finitely many objects in the degree, since there are finitely many arrow matrices over k.

3.1F1F2F3step 1.1step 2.1algebra∎

Induct on the total dimension of an indecomposable M. The one-dimensional case is a vertex simple. For larger dimension d, [F1] gives exactly one indecomposable of dimension d. Every other object of that degree is a direct sum of smaller-dimensional indecomposables by [F2]; its class is generated by induction and step 1.1. The simple word in step 2.1 is generated by step 1.1. Subtract all its other degree-d classes and divide by its nonzero coefficient to isolate [M]. This proves generation of every indecomposable, and step 1.1 then proves generation of every object. The composition and extended conclusions are exactly their definitions in [F3]. Across distinct components the cross Euler form, Hom and Ext are zero, so the same argument covers every finite ADE forest, including the empty one.

Depends on

Used by

Dependency tree · two levels

25 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