Alphabeta Math
DefinitionDefinition: AI-adaptedProof: 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-field stability data for an acyclic quiver

Definition

Let Q=(Q0,Q1,s,t) be a finite quiver: Q0 and Q1 are finite sets, and s,t:Q1→Q0 give the source and target of each arrow. Assume Q has no directed cycles. For a field K, a finite-dimensional representation M assigns a finite-dimensional K-vector space Mi to each i∈Q0 and a linear map Ma:Ms(a)→Mt(a) to each a∈Q1. A morphism is a family of linear maps at the vertices commuting with all arrow maps. Write AQ(K) for this category and d(M)=(dim⁡KMi)i∈Q0∈NQ0 for its dimension vector. For the finite-field Hall branch, fix k=Fq and write AQ=AQ(k). The next lemma proves the abelian and Euler properties over any field; over k it constructs a small finitary abelian skeleton of AQ, so AQ is essentially small.

For d,e∈ZQ0 define the bilinear form χQ(d,e)=∑i∈Q0diei−∑a:i→jdiej, and its skew-symmetrization ⟨d,e⟩=χQ(d,e)−χQ(e,d). The next lemma proves that χQ(d(M),d(N)) is the Hom-minus-Yoneda-Ext1 dimension for this arrow convention.

Fix zi∈H:={z∈C:Im⁡z>0} for each vertex and extend Z(d)=∑idizi additively. If d∈NQ0 is nonzero, then Im⁡Z(d)=∑idiIm⁡zi>0; thus its principal argument lies in (0,π). For a nonzero representation M, put ϕZ(M)=arg⁡Z(d(M))/π∈(0,1). Call M Z-semistable if every nonzero subrepresentation U⊆M satisfies ϕZ(U)≤ϕZ(M), and Z-stable if the inequality is strict for every proper nonzero subrepresentation.

For the semistable groupoids and stacks below, include the zero representation as semistable without assigning it a phase. Stable objects and HN factors remain nonzero.

For a dimension vector d, let Rep⁡d(Q)=∏a:i→jHom⁡k(kdi,kdj),Gd=∏i∈Q0GL⁡di,k. The group Gd acts by change of bases. Define Rep⁡dss(Q,Z) geometrically: its points over an algebraic closure kˉ are representations for which every nonzero kˉ-subrepresentation satisfies the semistability inequality. The associated quotient stack is Mdss(Q,Z)=[Rep⁡dss(Q,Z)/Gd]. For d=0, set Rep⁡0ss=Rep⁡0=Spec⁡k. The group G0 is trivial, so its rational-point groupoid has one zero object, trivial automorphism group, and cardinality 1. Here [X/G] denotes the groupoid-valued quotient: over a scheme S its objects are G-torsors on S with equivariant maps to X, and its arrows are equivariant isomorphisms over S. The openness lemma below proves that Rep⁡dss is open.

For a finite groupoid G, define its groupoid cardinality by ∣G∣=∑[x]∈Iso⁡(G)1∣Aut⁡G(x)∣. The rational-point groupoid of Mdss is finite, and the finite-field descent lemma identifies it with the groupoid of finite-field semistable representations and their isomorphisms. No Calabi–Yau structure, potential, orientation data, vanishing cycles, or physical state-counting identification is part of this definition.

Depends on

Used by

Dependency tree · two levels

6 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