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

Toën derived Hall multiplication is associative and unital

Statement

For every locally finite dg-enhancement T over a finite field, the convolution of Toën derived Hall algebra by homotopy-cofiber convolution is a well-defined associative Q-algebra. Its unit is χ0, the characteristic function of the zero module.

Facts & Assumptions

Given: The product of Toën derived Hall algebra by homotopy-cofiber convolution on Qc(X(0)).

[F1]

The product is α∗β=c!(s×t)∗(α⊗β), where s is source, c is target, and t is homotopy cofiber (Toën derived Hall algebra by homotopy-cofiber convolution).

[F2]

The moduli homotopy types are locally finite, s×t is proper on components, and the convolution has finite support (Derived Hall moduli types are locally finite and the input span is proper).

[F3]

Homotopy pushforward is functorial and satisfies base change for a homotopy-cartesian square with proper lower map (Homotopy-cardinality pushforward is functorial, Homotopy-cardinality pushforward satisfies base change).

[F4]

For a composable pair, both correspondence squares in The two derived Hall correspondence squares are homotopy cartesian are homotopy cartesian; the cone calculation there gives t(k)≃t(g), and the definition of k gives s(k)=t(f).

Proof

1.1F1F2F3F4construct

Fix α,β,γ∈Qc(X(0)) and write p=s×t:X(1)→X(0)×X(0). For any map a and finite-support functions μ,ν, one has (a!μ)⊗ν=(a×id)!(μ⊗ν): the fiber of a×id at (y,z) is Fy×{z}, with the same homotopy groups and weight as Fy, and its component sum is the defining one for a!. The first square in [F4], transposed so that its lower map is p, is homotopy cartesian and p is proper by [F2]. Base change therefore gives (α∗β)∗γ=c!p∗(c×id)!((p×id)∗(α⊗β⊗γ))=(c∘g)!((s∘f,t∘f,t∘k)∗(α⊗β⊗γ)). Here f,g,h,k are the maps on X(2) from Toën derived Hall algebra by homotopy-cofiber convolution, and the three entries are source of f, cofiber of f, and cofiber of k; [F4] identifies the last entry with the cofiber of g.

1.2F1F2construct

Let δ0=χ0. For δ0∗χx, arrows with source zero have target equivalent to their cofiber; the target map on this restricted homotopy type has contractible fibers over the component of x. Its pushforward is therefore χx, and is zero on other components.

2.1F1F2F3F4step 1.1

The second square in [F4], again transposed with lower map p, is homotopy cartesian and gives α∗(β∗γ)=c!p∗(id×c)!((id×p)∗(α⊗β⊗γ))=(c∘h)!((s∘f,s∘k,t∘k)∗(α⊗β⊗γ)). By definition of the induced cofiber map, s∘k=t∘f; also c∘h=c∘g because h is the composite of f and g. Thus the last expression is the same as in step 1.1. This proves associativity on finite-support functions.

2.2F1F2step 1.2

For χx∗δ0, the selected arrows have source in the component of x and zero cofiber, hence are quasi-isomorphisms. Their core is the path homotopy type of the component of x; the target map is an equivalence onto that component with contractible homotopy fibers. The pushforward is again χx and vanishes elsewhere. Thus δ0 is a two-sided unit.

3.1F2step 1.1step 2.1step 1.2step 2.2∎

Steps 1.1–1.2 prove associativity on arbitrary finite-support functions, and steps 1.2–2.2 prove both unit identities. Finiteness of each convolution is supplied by [F2].

Depends on

Used by

Dependency tree · two levels

10 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