Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck pass
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-quiver Hall multiplication counts extensions by automorphism orbits

Statement

Let U,V be finite-dimensional representations over Fq. For κM=∣Aut⁡(M)∣δM and the subobject-first product from Subobject-first Hall completion and quantum tori for finite quivers, κU⋆κV=∑[M]∣YExt⁡1(V,U)M∣∣Hom⁡(V,U)∣ κM, where YExt⁡1(V,U)M is the set of endpoint-fixed Yoneda classes of 0→U→E→V→0 whose middle term is isomorphic to M.

Facts & Assumptions

Given: Finite-dimensional U,V, an isomorphism class [M], and the subobject-first Hall product.

[F1]

In the generic untwisted Hall convention, [A]∗qf[B] counts short exact sequences 0→B→L→A→0 (The untwisted Hall algebra of a finitary abelian category).

[F2]

The local convention is f⋆g=g∗qff, and κU=∣Aut⁡(U)∣δU (Subobject-first Hall completion and quantum tori for finite quivers).

[F3]

The sets Hom⁡(V,U) and YExt⁡1(V,U) are finite; the latter is the endpoint-fixed Yoneda class set (Finite acyclic quiver representations: heredity, Euler form, and finite-field finitarity).

[F4]

For fixed endpoints, the untwisted Hall product has finite support (Untwisted Hall structure constants and products are finite).

Proof

Given: The objects and hypotheses in the statement.

1.1F1F2construct

Fix the middle object to be M. The coefficient of δM in δU⋆δV counts subobjects S⊆M with S≅U and M/S≅V, by [F1] and [F2]. For each such S, the monomorphisms U→M with image S form a set of size ∣Aut⁡(U)∣; the epimorphisms M→V with kernel S form a set of size ∣Aut⁡(V)∣. These choices are independent. Hence the number of endpoint-fixed short exact sequences with middle object literally M is gV,UM∣Aut⁡(U)∣∣Aut⁡(V)∣, where gV,UM is the Hall coefficient of [F1].

1.2F3constructalgebra

The finite group Aut⁡(M) acts on those sequences by (i,p)↦(gi,pg−1). Its orbits are exactly the endpoint-fixed Yoneda classes with middle term isomorphic to M: an isomorphism from any middle object E≅M transports its sequence to one on M, and changing that isomorphism changes the result by this action. The stabilizer of a sequence (i,p) consists of g with gi=i and pg=p. Put h=g−1. Since hi=0 and p is an epimorphism, h factors uniquely as h=ifp for a unique f:V→U. Conversely, 1+ifp is invertible because (ifp)2=0, with inverse 1−ifp. Thus every stabilizer has exactly ∣Hom⁡(V,U)∣ elements.

2.1F1F2F3F4step 1.1step 1.2algebra∎

For a fixed sequence, the map from Aut⁡(M) to its orbit has fibers exactly the cosets of its stabilizer, so that orbit has size ∣Aut⁡(M)∣/∣Hom⁡(V,U)∣. Summing over the ∣YExt⁡1(V,U)M∣ orbits gives gV,UM∣Aut⁡(U)∣∣Aut⁡(V)∣=∣Aut⁡(M)∣ ∣YExt⁡1(V,U)M∣∣Hom⁡(V,U)∣. Multiplying the coefficient of δM in κU⋆κV by the definition of κM yields precisely the claimed coefficient. Summing over the finitely many possible middle terms is valid by [F3] and [F4].

Depends on

Used by

Dependency tree · two levels

18 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