Alphabeta Math
TheoremStatement: 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.

Quiver stack integration is multiplicative with the Euler twist

Statement

For a finite quiver Q over k, equip TQ with the multiplication in The Euler-twisted dimension-vector algebra of a quiver. The product is associative and has unit x0. Define IQ:HQ→TQ,IQ([X→Md(Q)])=[X] xd. Then IQ is a well-defined R-algebra homomorphism. The exact twist is L−χQ(d,e) for the product of a quotient of dimension d and a subrepresentation of dimension e. This result uses the stack of ordinary representations of Q with no potential and no vanishing-cycle weight. It makes no claim about an orientation-dependent 3-Calabi–Yau or Donaldson–Thomas integration map.

Facts & Assumptions

Given: The motivic Hall algebra and the twisted dimension-vector multiplication with the conventions stated in their Definitions.

[F1]

The Hall product is pullback to the exact-sequence stack and pushforward to the middle representation, with quotient first and subrepresentation second (The motivic Hall algebra of a finite quiver).

[F2]

For an extension family of quotient dimension d by subrepresentation dimension e, its relative class is L−χQ(d,e) (The motive of a quiver extension stack).

[F3]

The target multiplication is xdxe=L−χQ(d,e)xd+e (The Euler-twisted dimension-vector algebra of a quiver).

[F4]

Pullback, pushforward and exterior product in the coefficient system are defined by fiber product, composition and product over k (Relative motivic stack-function groups for quiver representation stacks).

[F5]

The source Hall convolution is an associative unital R-bilinear product on HQ, with the zero-representation stack as its unit (Quiver motivic Hall convolution is associative and unital).

[A1]

The Artin-stack convention inherits its represented-sheaf descent dependence on AC from Algebraic stacks and their inertia stacks and The Axiom of Choice. All class computations below use explicit finite-dimensional presentations.

Proof

technique · direct
1.1F3F5givenalgebra

By [F5], HQ with its Hall convolution is an associative unital R-algebra. Bilinearity of χQ gives χQ(d,e)+χQ(d+e,f)=χQ(e,f)+χQ(d,e+f). Hence the two products of xd,xe,xf have the same coefficient and degree; the zero vector gives the unit. Thus TQ is also an associative unital R-algebra.

1.2F1F2F3F4F5A1construct

Let α=[X→Md] and β=[Y→Me] be generators. Their Hall product is the class of the exact-sequence stack over X×Y, pushed to the middle-object stack by [F1]. By [F2], its absolute motive is L−χQ(d,e)[X×Y]. Therefore IQ(α∗β)=L−χQ(d,e)[X][Y] xd+e=IQ(α)IQ(β) by [F3]. The unit from [F5] is the class of M0(Q)=Spec⁡k, whose image is [Spec⁡k]x0=x0, the target unit.

2.1F4step 1.1step 1.2algebra∎

Isomorphisms, scissor decompositions, and vector-bundle-stack relations in each relative group map to the same relations in R=K(Spec⁡k) under [X→Md]↦[X]xd. Thus IQ is well-defined and additive. For r∈R, the coefficient-system product gives IQ(rα)=rIQ(α), so it is R-linear. Every element of HQ is a finite sum of homogeneous generators, so bilinearity and step 1.2 extend the multiplication identity to all elements. Together with the unit preservation in step 1.2 and the algebra structures in step 1.1, IQ is the claimed algebra homomorphism.

Depends on

Used by

Dependency tree · two levels

13 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