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.

Derived Hall moduli types are locally finite and the input span is proper

Statement

For a locally finite dg-enhancement T, the moduli homotopy types X(0), X(1), and X(2) of Toën derived Hall algebra by homotopy-cofiber convolution are locally finite. The map s×t:X(1)→X(0)×X(0) is proper on components. Consequently the pull-push expression defining DH(T) is a well-defined product on finite-support functions.

Facts & Assumptions

Given: A locally finite dg-enhancement T and its perfect-module, arrow, and composable-pair homotopy types.

[F1]

For every pair of perfect modules a,b, the total graded space ⨁iExt⁡Ti(a,b) is finite-dimensional (Perfect dg modules have finite total Ext).

[F2]

The core of a perfect-module category has π1 the automorphism group and, for i>1, πi the group Ext⁡1−i(a,a). Mapping spaces between perfect modules are obtained from their derived Hom complexes, with πjMap⁡(a,b)=Ext⁡T−j(a,b) for j≥0 (Locally finite dg enhancements for derived Hall theory).

[F3]

X(1) and X(2) are the cores of the objectwise homotopy theories of arrows and composable pairs; s(u) is the source and t(u) its homotopy cofiber (Toën derived Hall algebra by homotopy-cofiber convolution).

[F4]

A locally finite homotopy type has finite homotopy groups and each based homotopy group sequence vanishes above some degree; finite-support functions use the homotopy-fiber weights (Locally finite homotopy types and rational cardinality).

Proof

1.1F1F2

Fix a perfect module a. The based loop space of X(0) at a is the equivalence component of Map⁡(a,a). Its components are Aut⁡(a), a subset of the finite vector space Ext⁡0(a,a), and for i>1, [F2] gives πi(X(0),a)=Ext⁡1−i(a,a). These groups are finite by [F1] and vanish in high degrees, so X(0) is locally finite.

1.2F1F3

Fix perfect modules a,b. A point of the homotopy fiber of s×t over (a,b) is an arrow with source identified with a and homotopy cofiber identified with b. Its connected components are distinguished triangles a→z→b→a[1] with both endpoints identified; the connecting map classifies the component in Hom⁡D(T)(b,a[1])=Ext⁡1(b,a). The latter is finite by [F1], so this fiber has finitely many components and s×t is proper on components.

2.1F1F2F3step 1.1

For arrows and composable pairs, the derived mapping complexes are finite homotopy limits of finite sums of the complexes RHom(a,b) between their finitely many entries. By [F1], each such complex has finite-dimensional cohomology in a finite degree range. A finite direct sum or homotopy fiber of these complexes again has finite-dimensional cohomology in a finite degree range. The same loop-space calculation as in step 1.1 therefore shows that X(1) and X(2) are locally finite.

3.1F3F4step 1.1step 2.1step 1.2∎

By [F4], pullback along s×t preserves finite support, and pushforward along c sends a finite-support function to a finite-support function. The homotopy groups of every fiber used in the pushforward are finite and eventually zero by steps 1.1–1.2, so each weight is a finite rational number. Thus the convolution in Toën derived Hall algebra by homotopy-cofiber convolution is a well-defined finite-support function.

Depends on

Used by

Cited to discharge well-definedness by Toën derived Hall algebra by homotopy-cofiber convolution.

Dependency tree · two levels

12 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