Alphabeta Math
ExampleConstruction: AI-generatedVerification: AI-adaptedPipeline-generatedprecheck pass
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.

One vertex with no arrows gives the quantum dilogarithm

Example

Let Q consist of one vertex and no arrows:

\begin{tikzpicture}
  \node[circle,draw,inner sep=2pt,label=below:{1}] at (0,0) {};
\end{tikzpicture}

The single vertex is labelled 1 and there are no edges. Thus AQ is the category of finite-dimensional Fq-vector spaces. For any z1∈H, all nonzero objects are semistable of the same phase. With t=q>0, the skew integration of their all-object series is J(Aall)=Et2(x):=∑n≥0tnxn∏r=1n(t2r−1), where the empty product for n=0 is 1. This is a finite-field Euler-normalized groupoid series, not by itself a physical BPS number.

Facts & Assumptions

Given: A finite field Fq, its positive square root t=q, and the one-vertex quiver displayed above.

[F1]

Representations, dimension vectors and Z-semistability are as in Finite-field stability data for an acyclic quiver.

[F2]

J(δM)=tχQ(d(M),d(M))/∣Aut⁡(M)∣ xd(M) (Euler and skew integration are multiplicative for finite acyclic quivers).

[F3]

The groupoid mass of the semistable quotient stack is the sum of inverse automorphism orders over semistable isomorphism classes (Finite-field points of the semistable quiver stack give the Hall groupoid).

Verification

Given: The objects and hypotheses in the statement.

1.1F1constructalgebra

A representation is determined up to isomorphism by its dimension n; its automorphism group is GL⁡n(Fq). For n>0, Z(n)=nz1 and every nonzero subspace has the same phase, so every object is semistable. The zero object supplies the degree-zero term.

1.2givenconstructalgebra

An ordered basis of Fqn can be chosen in ∣GL⁡n(Fq)∣=∏j=0n−1(qn−qj) ways: after j independent vectors have been chosen, their span contains qj vectors to exclude. Factoring qj from the jth term and reversing the remaining index gives ∣GL⁡n(Fq)∣=qn(n−1)/2∏r=1n(qr−1). For n=0 both sides equal 1.

2.1F1F2step 1.2algebra

The Euler form is χQ(n,n)=n2. By [F2], the degree-n term of J(Aall) is tn2∣GL⁡n(Fq)∣xn=tn∏r=1n(t2r−1)xn, using [F1], step 1.2 and q=t2. The formula also holds at n=0 by the empty-product convention.

3.1F2F3step 2.1∎

Summing the degreewise coefficients in step 2.1 gives the stated formal power series. By [F3] its unweighted coefficient is the finite groupoid cardinality of the semistable stack, and the factor tn2 is precisely the Euler normalization in [F2]. No physical state-counting identification is asserted.

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