Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6-luna)
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.

The full Hall algebra is simple-generated exactly in componentwise finite Dynkin type

Statement

Let Q be a finite loopless quiver over k=Fq, using finite-dimensional nilpotent representations when oriented cycles occur, and use the Euler-twisted Hall algebra over Q(q). Its vertex-simple-generated composition subalgebra equals the full Hall algebra if and only if every connected component of the underlying multigraph is a finite ADE Dynkin diagram. Thus adjoining the declared Cartan torus gives the full extended Hall algebra exactly under the same componentwise finite-type condition. The empty quiver is included.

No injectivity theorem for the Ringel map is a premise. The only quantum rank input is the independent surjection from the specialized divided-power integral half onto the composition algebra, which supplies an upper bound by classical PBW ranks.

Facts & Assumptions

Given: The quiver, finite field, nilpotence convention, Hall normalization and composition subalgebra in the statement, with inherited Choice.

[F1]

Hall products have positive nonzero Euler scalars times subobject counts, preserve dimension, and the composition algebra is generated by vertex simples (The Euler-twisted Hall algebra, The extended Hall algebra and composition subalgebra).

[F2]

Finite ADE forests have full Hall algebra generated by their simples (Finite-Dynkin Hall algebras are generated by vertex simples).

[F3]

For every orientation of an affine D or E tree, at least cqm/m indecomposables have dimension mδ, for all large m (Explicit affine D and E flag families give exponentially many indecomposables).

[F4]

The specialized integral divided-power half surjects onto the composition algebra, so each composition degree is at most its classical PBW rank; this surjection uses Green positivity and does not use specialized nondegeneracy or Ringel injectivity (Green positivity specializes the integral half into the composition algebra).

[F5]

For untwisted affine ADE the roots are α+nδ of multiplicity 1 and nonzero nδ of multiplicity the finite rank (Roots of an untwisted affine Lie algebra). PBW counts enveloping monomials in a homogeneous root-space basis (PBW for countably presented Kac Moody Lie algebras).

Proof

1.1F1givenalgebra

Restrict to a full induced subquiver on a vertex subset I. Objects of dimension supported on I have zero vector spaces elsewhere, so their representations, flags, nilpotence and Euler factors are exactly those of the induced subquiver. A word in simples with this degree cannot involve a vertex outside I, since all simple degrees are nonnegative. Thus its Hall and composition homogeneous components agree with those of the subquiver. A proper composition component for an induced subquiver therefore proves properness for Q.

1.2F4F5algebra

On an affine D or E subtree let Hδ be the positive total height of its null vector. There is a constant C bounding the sum of root-space multiplicities at every total height: by [F5] each finite root α contributes at most one integer mode n to a given height ht⁡(α)+nHδ, and imaginary modes contribute at most the finite rank. PBW therefore bounds the total-height generating series of the classical positive enveloping algebra coefficientwise by P(t)=∏h≥1(1−th)−C. For s>0, log⁡P(e−s)=C∑j≥11/[j(esj−1)]≤(C/s)∑j≥1j−2. The series and rearrangements converge absolutely because their terms are positive and e−s<1. A coefficient of height L is at most esLP(e−s); putting s=L−1/2 gives a bound exp⁡(C′L) for a fixed C′. In particular the classical PBW rank in root degree mδ is at most exp⁡(C′′m). By the surjective upper-bound input [F4], the same bound holds for the composition degree.

2.1F1step 1.1algebra

If two vertices have r arrows one way and s the other, with r+s≥2, use degree (1,1). Nilpotence forces at least one of the two scalar-arrow vectors to be zero: a nonzero scalar in each direction would give a nonzero arbitrarily repeatable two-cycle. Conversely either one-direction vector is nilpotent. Changes of vertex bases scale a nonzero vector by a common scalar, so the isomorphism classes are the zero representation and the two projective sets of nonzero vectors. Their number is 1+(qr−1)/(q−1)+(qs−1)/(q−1)>2. The composition degree is spanned by the two simple words. Hence it is proper, with no quantum rank input.

2.2F1step 1.1algebra

Suppose the simple underlying graph contains a chordless cycle of length n≥3. On that induced subquiver use dimension 1 at every vertex. Each proper subset of the n edges specifies a representation by setting those arrows to 1 and the rest to zero. Its support is a forest, so it is nilpotent in every original orientation. The 2n−1 distinct zero/nonzero supports give distinct isomorphism classes. For two nonadjacent vertices an extension of one vertex simple by the other is supported only at those vertices and has no arrow coordinates, so it splits. Their Hom space is zero by disjoint support, their cross Euler values vanish, and the split sum has a unique subobject of either prescribed vertex-simple type. Thus both Hall products are the same direct-sum class, and nonadjacent vertex simples commute. Permutations of the n letters modulo adjacent swaps of nonneighbors correspond to acyclic orientations of the cycle: orient an edge from its earlier letter to its later one. Every acyclic orientation has a topological ordering. Any two such orderings for it are linear extensions of the same partial order; move the first letter of one left in the other, crossing only incomparable letters, and induct to connect them by the allowed swaps. Exactly two of the 2n edge orientations are cyclic. Thus the composition degree has dimension at most 2n−2, less than the Hall degree. This proves properness for every orientation, including the nilpotent oriented-cycle case.

3.1step 1.1step 2.1step 2.2algebra

It remains to classify connected simple trees not of finite ADE type. A vertex of degree at least 4 contains the induced four-leaf star D~4. If there are two vertices of degree 3, choose a closest pair. Their joining path has no branch vertex inside; attach two outward neighbors at each end. The induced subgraph is an affine D tree with two branch vertices and four leaves. If there are no branch vertices, the tree is a path of type A. In the remaining case there is exactly one branch vertex of degree 3, with three arms of lengths p−1≤q−1≤r−1, where 2≤p≤q≤r. The cases (2,2,r) and (2,3,3),(2,3,4),(2,3,5) are precisely finite D and E; if p≥3, truncating arms gives (3,3,3); if p=2,q≥4, it gives (2,4,4); and if p=2,q=3,r≥6, it gives (2,3,6). These are respectively the affine E6,E7,E8 induced subtrees. Thus any remaining non-ADE tree contains an affine D or E induced subtree. An arbitrary graph either has the parallel-edge case, has an induced chordless cycle (take a shortest cycle), or is a forest to which this classification applies.

4.1F3step 1.1step 2.1step 2.2step 3.1step 1.2algebra

The Hall basis contains each of the pairwise nonisomorphic indecomposables from [F3], so its degree mδ has dimension at least cqm/m. For large m this exceeds exp⁡(C′′m), since mlog⁡q−log⁡m−C′′m→+∞. Hence composition is proper on the affine subtree. Steps 1.1 and 3.1, together with steps 2.1–2.2, prove properness whenever any component is not finite ADE. This argument used only the surjection in [F4], not an injection or an equality of quantum and Hall dimensions.

5.1F1F2step 4.1algebra∎

If every component is finite ADE, [F2] gives equality of composition and full Hall. Otherwise step 4.1 gives properness in a supported degree. The torus extension is a direct sum of its declared toral normal-form copies of the positive Hall algebra, so adjoining the torus neither removes nor creates the difference between these positive subspaces. This proves the entire componentwise criterion and its extended version.

Depends on

Used by

Dependency tree · two levels

38 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