Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6-luna)
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.

The Hall square of the simple finite-field vector space

Example

Let k=Fq, let Vk be the category of finite-dimensional k-vector spaces, and let S=k. Use a small skeleton with objects kn. The untwisted Hall product satisfies [S]∗[S]=(q+1)[k2].

Facts & Assumptions

Given: A finite field k=Fq, the vector-space category Vk, and the untwisted Hall product.

[F1]

An abelian category is additive, has kernels and cokernels, and its canonical coimage-to-image maps are isomorphisms (Abelian category).

[F2]

A small finitary category for Hall multiplication has finite Hom sets and finite Yoneda extension sets (Small finitary abelian categories for Hall multiplication).

[F3]

[M]∗[N] counts subobjects isomorphic to N whose quotient is isomorphic to M (The untwisted Hall algebra of a finitary abelian category).

Verification

technique · direct
1.1givenF1F2chooseconstructalgebra

Use the small model with objects kn and all matrices between them; every finite-dimensional vector space is isomorphic to one of these. The zero object and finite direct sums exist, and each Hom set is an abelian group under pointwise addition with bilinear composition. For a linear map f:V→W, its kernel and cokernel W/im⁡f are finite-dimensional. Choose bases of these two spaces for this single map and transport them to standard kd objects; the transported inclusion and projection retain the universal properties, so the model has kernels and cokernels. The canonical map V/ker⁡f→im⁡f is injective because f(v)=0 implies v∈ker⁡f, and surjective by the definition of image, hence is an isomorphism. Thus [F1] makes the model abelian. Hom sets are finite sets of matrices over k. Any short exact sequence 0→U→iE→pQ→0 splits: lift a finite basis of Q to E and extend linearly to a section s:Q→E. The map U⊕Q→E, (u,q)↦i(u)+s(q), is injective by applying p and then using monicity of i; it is surjective because e−s(p(e)) lies in ker⁡p=im⁡i. It is an isomorphism fixing the endpoints, so every Yoneda extension is equivalent to the split one and its Yoneda extension set has one class. Therefore the model satisfies [F2].

1.2F3algebra

If gS,SL≠0, an exact sequence 0→S→L→S→0 gives dim⁡kL=2, so the only possible isomorphism class is k2. Every one-dimensional subspace of k2 is counted by [F3], and its quotient is one-dimensional. The nonzero vectors of k2 are partitioned by their spans, each span contains q−1 nonzero vectors, and k2 has q2−1 nonzero vectors. Hence the number of lines is (q2−1)/(q−1)=q+1.

2.1F3step 1.1step 1.2∎

There are no other middle-object classes by step 1.2, and the coefficient of [k2] is the line count from step 1.2. This proves the displayed untwisted product.

Remarks

Schiffmann's square-root Euler-twisted product multiplies the same subobject-counting coefficient by ⟨M,N⟩m=(∏i≥0∣Ext⁡i(M,N)∣(−1)i)1/2, where Ext⁡0=Hom⁡ and higher Ext terms are derived Ext; see Lectures on Hall Algebras, §§1.2–1.3, equations (1.2)–(1.3). Every finite- dimensional vector space is projective, since a map out of it lifts across a surjection by lifting the images of a finite basis; thus this category has global dimension zero. Hence the higher Ext groups vanish here, while ∣Hom⁡(S,S)∣=q, so the factor is ⟨S,S⟩m=q1/2. The twisted square is therefore q1/2(q+1)[k2]; this factor is absent from the product ∗ on the A page.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

19 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