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.

The two derived Hall correspondence squares are homotopy cartesian

Statement

Let X(0),X(1),X(2) and s,c,t,f,g,h,k be as in Toën derived Hall algebra by homotopy-cofiber convolution. The arrow-composition square (first diagram below) and the composite-cofiber square (second diagram below) are homotopy cartesian.

Facts & Assumptions

Given: A locally finite dg-enhancement, its homotopy types of perfect modules and arrows, and the two displayed squares.

[F1]

The homotopy theory of dg modules is stable: a square is a homotopy pushout exactly when it is a homotopy pullback, and homotopy cofibers are functorial (Locally finite dg enhancements for derived Hall theory).

[F2]

For a composable pair x→y→z, f is the first arrow, g the second, h the composite, and k:Cone⁡(f)→Cone⁡(h) the induced map (Toën derived Hall algebra by homotopy-cofiber convolution).

[F3]

X(2) classifies composable pairs, while X(1) classifies arrows; the maps s,c,t record source, target, and cofiber (Toën derived Hall algebra by homotopy-cofiber convolution).

[F4]

Homotopy cofibers are represented functorially by mapping cones in the supplied dg enhancement (Locally finite dg enhancements for derived Hall theory).

Proof

1.1F1F2F3F4construct

For chain maps x→fy→gz, put h=gf. With the mapping-cone convention Cone⁡(f)n=yn⊕xn+1 and d(y,x)=(dyy+fx,−dxx), the induced map is k(y,x)=(gy,x). A point of the first homotopy pullback consists of arrows f and g with the target of f identified with the source of g, together with an object identified with the cofiber of g. To compare this cofiber coordinate with the image of a composable pair, write a degree-n element of Cone⁡(k) as (z,u,y′,x′)∈zn⊕xn+1⊕yn+1⊕xn+2. Its differential is (dzz+gfu+gy′,−dxu+x′,−dyy′−fx′,dxx′). Under the invertible coordinate change y~=y′+fu, x~=x′−dxu, this becomes (dzz+gy~,x~,−dyy~,0), the direct sum of Cone⁡(g) and a contractible identity pair. Thus Cone⁡(k)≃Cone⁡(g). The homotopy pullback of the source and target maps on arrow cores is the core of composable pairs: its data are two arrows and an equivalence between their middle objects; transporting one arrow along that equivalence gives a composable pair, and the same transport identifies equivalences of such data with objectwise equivalences of pairs. The additional cofiber coordinate is an object equipped with an equivalence to Cone⁡(g), whose space of choices is contractible over each g. The coordinate change supplies the equivalence from Cone⁡(k), so this coordinate adds no further homotopy data. Hence the first square is homotopy cartesian.

1.2F1F2F3construct

A point of the homotopy pullback in the second square consists of an object x, an arrow h:x→z, an arrow k:a→b, and an equivalence b≃Cone⁡(h). Form y:=z×Cone⁡(h)ha, the homotopy pullback of the cofiber map z→Cone⁡(h) along k. Pulling the fiber sequence x→z→Cone⁡(h) back along k gives a fiber sequence x→y→a, so Cone⁡(x→y)≃a. The pullback square also identifies Cone⁡(y→z) with Cone⁡(k). The composite x→y→z is h, and the induced cofiber map is k by the defining pullback square. The object y is perfect because the perfect modules form a stable subcategory closed under finite homotopy limits. These constructions are inverse, functorially on equivalences, to the map from composable pairs to (h,k); hence the second square is homotopy cartesian.

2.1F1F3F4step 1.1step 1.2∎

The constructions in steps 1.1 and 1.2 are functorial in maps and equivalences of the input diagrams, and their displayed inverse maps recover every object, arrow, and comparison path. They therefore give equivalences of the full homotopy pullbacks with X(2), proving both squares homotopy cartesian. The argument uses the enhancement's functorial cones; an unenhanced triangulated category alone would not supply these maps.

Diagrams

X(2)X(1)X(1)£X(0)X(0)£X(0)gf£(t±k)s£tc£id
X(2)X(1)X(0)£X(1)X(0)£X(0)h(s±f)£ks£tid£c

In the first diagram, the lower-left pair is the first arrow and the cofiber of the second arrow. In the second, it is the source of the first arrow and the induced map between the two cofibers. Step 1.2 proves the second square by reconstructing the middle object as a homotopy pullback; the proof does not infer cartesianness from either picture.

Depends on

Used by

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