Alphabeta Math
RemarkRemark: Literature-sourcedProof: Not applicablePipeline-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.

Finite-quiver Hall counts and the limits of DT/BPS interpretation

Remarks

The coefficients of J(SZ(ϕ)) are finite-field, Euler-normalized semistable groupoid masses: the weight of [M] is tχQ(d(M),d(M))/∣Aut⁡(M)∣. The wall crossing proved on this page is an arithmetic finite-field Hall identity and its stated Euler/skew integrations. It does not identify these coefficients with Behrend-weighted numerical Donaldson–Thomas invariants of a Calabi–Yau-threefold, motivic vanishing-cycle invariants, cohomological BPS spaces, or dimensions of physical Hilbert spaces.

The four required preceding pages provide distinct reading contexts. The derived definition uses dg enhancements and higher homotopy weights; the motivic definition uses stack-function coefficients; the cohomological definition uses rational intrinsic quotient-stack Borel–Moore homology and the exact-sequence correspondence operations; a Hall-module definition is an algebra action on a separate module. These coefficient theories remain distinct from the arithmetic groupoid masses. Their operation and integration theorems are not used in this finite-field proof.

Any physical BPS identification is conditional on a specified supersymmetric quiver model, charge assignment, central charge, superpotential, relevant Calabi–Yau-threefold enhancement and orientation data, together with a proved state-counting comparison. The finite-field argument establishes none of those additional identifications.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

31 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