Alphabeta Math
CounterexampleConstruction: Literature-sourcedVerification: AI-adaptedPipeline-generated
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.

Unweighted triangle-orbit counts miss the derived homotopy factor

Statement refuted

For every locally finite dg-enhancement and all perfect modules x,y,z, the unweighted triangle-orbit count

nx,yz:=∣[x,z]y∣∣Aut⁡(x)∣

equals the Toën derived Hall coefficient gx,yz.

Facts & Assumptions

Given: A finite field k=Fq, the bounded derived category of finite-dimensional k-vector spaces with its standard dg-enhancement, and the coefficient formula of Toën derived Hall numbers have the higher-Ext orbit formula.

[F1]

The Toën coefficient has the extra factor ∏i>0∣Ext⁡−i(x,z)∣(−1)i∣Ext⁡−i(x,x)∣(−1)i+1 (Toën derived Hall numbers have the higher-Ext orbit formula).

Counterexample

1.1givenchoose

Let S=k concentrated in degree 0, let x=S, y=S[1], and z=S⊕S[1]. Since Hom⁡(S,S[1])=0 and Hom⁡(S,S)=k, every map f:S→z is fa=(a,0) for a unique a∈k. Its cone is isomorphic to S[1] exactly when a≠0: for a≠0 the first component is an isomorphism and cancels in the cone, while for a=0 the cone has nonzero degree-zero cohomology. Hence ∣[x,z]y∣=q−1 and ∣Aut⁡(x)∣=q−1, so nx,yz=1.

2.1F1step 1.1algebra∎

In this category Ext⁡−1(x,z)=Hom⁡(S,z[−1])≅k, while Ext⁡−i(x,z)=0 for i≥2 and Ext⁡−i(x,x)=0 for all i>0. Thus the higher-Ext factor in [F1] is q−1 and the Toën coefficient is gx,yz=q−1≠1=nx,yz. The claimed equality is false.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

17 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