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

An untwisted monoid map fails for the one-arrow quiver

Statement refuted

The claim that stack integration always maps quiver motivic Hall products multiplicatively to the untwisted dimension-vector monoid algebra is false. Here “untwisted” means the target rule xdxe=xd+e, while the source map is IQ([X→Md])=[X]xd.

Let Q have vertices 1,2 and one arrow 1→2.

1 \arrow[r] & 2

For k=F2, let S1 and S2 be the representations supported at vertices 1 and 2. Use S1 as quotient and S2 as subrepresentation. There are two exact sequences with these fixed endpoints, distinguished by the arrow map of the middle representation. The stack groupoid count of δS1∗δS2 is 2, whereas the product of the two integrated classes in the untwisted target has coefficient 1.

Facts & Assumptions

Given: The one-arrow quiver over F2, its simple representations S1,S2, and the quotient-first Hall convention.

[F1]

The extension stack with quotient dimension d and subobject dimension e has relative class L−χQ(d,e) (The motive of a quiver extension stack).

[F2]

The stack integration on a homogeneous class is its absolute stack class times the corresponding monomial, and the Euler-twisted target uses L−χQ(d,e) (Quiver stack integration is multiplicative with the Euler twist).

[F3]

An arrow of a quiver representation is a linear map from the space at its source vertex to the space at its target vertex; for the short exact sequence the off-diagonal arrow map belongs to Hom⁡(A1,B2) (The motivic Hall algebra of a finite quiver).

[F4]

Finite-field groupoid cardinality is the sum of inverse automorphism orders and respects the stack relations (Finite-field groupoid cardinality for quiver stack specializations, Finite-field groupoid cardinality respects the motivic stack relations).

[A1]

The algebraic-stack convention inherits its represented-sheaf descent use of AC (Algebraic stacks and their inertia stacks, The Axiom of Choice). All vector-space and groupoid calculations in this finite example are explicit.

Counterexample

technique · direct
1.1A1F1F3F4givenalgebra

The quotient S1 has dimension vector d=(1,0) and the subobject S2 has dimension vector e=(0,1). At each vertex the middle space is the direct sum of the endpoint spaces. The only possibly nonzero off-diagonal arrow entry is a scalar ξ∈Hom⁡F2(F2,F2), so there are exactly two extensions, ξ=0 and ξ=1. Since GL⁡1(F2) is the trivial group, neither endpoint automorphisms nor their identifications identify these two sequences, and each sequence has trivial automorphism group fixing the endpoints. Thus the extension groupoid has cardinality 2. The quotient-stack convention is the one in [A1]; the remaining calculation is a finite groupoid count.

2.1F1F2F4step 1.1

The Hall integration of this product therefore has coefficient 2 at x(1,1) in its finite-field point-count realization. Each endpoint stack BGL⁡1(F2) has groupoid cardinality 1, so their integrated product in the untwisted target has coefficient 1. The two coefficients differ, refuting the claimed multiplicativity.

3.1F1F2F4step 1.1algebra∎

The Euler pairing is χQ(d,e)=0−(1)(1)=−1, so the correct target twist is L−(−1)=L. It specializes to 2 over F2 and matches the source extension count from step 1.1. This also verifies the direction and sign of the twist.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

18 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