Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge 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 untwisted Hall product is associative and unital

Statement

For every small finitary abelian category A and commutative coefficient ring R, the operation of The untwisted Hall algebra of a finitary abelian category is a well-defined associative R-bilinear multiplication on HA,R, with unit [0], the basis symbol of the zero object.

Facts & Assumptions

Given: A small finitary abelian category A, a commutative ring R with unit, and the product convention [M]∗[N]=∑[L]gM,NL[L].

[F1]

The product coefficient counts subobjects N with quotient M, and the natural-number counts are mapped to R (The untwisted Hall algebra of a finitary abelian category).

[F2]

Each coefficient is finite and, for fixed M,N, only finitely many middle-object classes occur (Untwisted Hall structure constants and products are finite).

[F3]

For a fixed quotient L/W, subobjects of it correspond bijectively to flags W≤U≤L, with (L/W)/(U/W)≅L/U (Flags lift uniquely through a quotient in an abelian category).

[F4]

Every monomorphism in an abelian category is the kernel of its cokernel (Every monomorphism is the kernel of its cokernel, and dually every epimorphism is the cokernel of its kernel).

Proof

technique · direct
1.1F1F2

Fix basis objects M,N,P,L. The coefficient of [L] in ([M]∗[N])∗[P] is the sum over isomorphism classes [X] of gM,NXgX,PL. By [F1], this counts a subobject W≤L with W≅P and L/W≅X, together with a subobject U‾≤L/W with U‾≅N and (L/W)/U‾≅M. The quotient class [X]=[L/W] is uniquely determined by W, so this sum counts exactly these pairs.

1.2F1F2F3

By [F3], each such pair (W,U‾) corresponds to exactly one flag W≤U≤L with W≅P, U/W≅N, and L/U≅M. The coefficient of [L] in [M]∗([N]∗[P]) counts the same flags: first choose U≤L with U≅Y, L/U≅M, then choose W≤U with W≅P, U/W≅N, summing over the uniquely determined class [Y]=[U].

1.3F1F4

The only subobject isomorphic to zero is the zero subobject, and the only subobject with zero quotient is the whole object: in the latter case the inclusion has zero cokernel and hence is an isomorphism by [F4]. Thus gM,0L=1 exactly when L≅M, while g0,ML=1 exactly when L≅M. The zero-object symbol is a two-sided unit.

2.1F2step 1.1step 1.2

The two parenthesizations therefore have the same coefficient at every basis vector [L], so ([M]∗[N])∗[P]=[M]∗([N]∗[P]) for basis elements.

3.1F2step 2.1step 1.3∎

Basis products have finite support by [F2]. Every element of HA,R is a finite linear combination of basis vectors, so bilinearity extends the basis calculation in step 2.1 to all triples and preserves finite support. Step 1.3 supplies the unit, proving the statement.

Depends on

Used by

Dependency tree · two levels

26 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