Alphabeta Math
ExampleConstruction: AI-generatedVerification: AI-generatedPipeline-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 in finite abelian p-groups

Example

Fix a prime p, and let Pp be the category of finite abelian p-groups. For a small model, take all abelian group laws on standard sets of cardinality pn, for n≥0, and all group homomorphisms. Write Cpa=Z/paZ and Cp=Cp1. In the untwisted Hall product, [Cp]∗[Cp]=(p+1)[Cp⊕Cp]+[Cp2]. This example uses the ordinary counting product and needs no Fq-linear structure.

Facts & Assumptions

Given: A prime p, the category Pp, and the untwisted Hall product.

[F1]

The category is abelian precisely when it is additive and has kernels and cokernels with the canonical coimage-to-image maps isomorphisms (Abelian category); the ambient category of abelian groups is abelian (Abelian groups form an abelian category).

[F2]

Hall coefficients count subobjects with the prescribed subobject and quotient isomorphism types (The untwisted Hall algebra of a finitary abelian category).

[F3]

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

Verification

technique · direct
1.1F1F3algebra

Kernels and cokernels of homomorphisms between finite abelian p-groups are finite abelian p-groups, and finite direct sums remain finite abelian p-groups. Transporting each kernel or cokernel along a bijection of its underlying finite set with a standard set gives the required object in the chosen model, with the same universal property. Thus the model is abelian using [F1]. For fixed finite groups M,N, Hom is a finite set. Any short exact sequence with endpoints M,N has a middle group of cardinality ∣M∣∣N∣; there are finitely many group laws on a finite set of that size and finitely many endpoint maps. Therefore its Yoneda extension set is finite. The stated group-table model is a set of objects, so [F3] applies.

1.2givenalgebra

If 0→Cp→L→Cp→0 is exact, then ∣L∣=p2. If L contains an element of order p2, then L≅Cp2. Otherwise every nonzero element has order p, so scalar multiplication by Fp makes L a two-dimensional vector space and L≅Cp⊕Cp. Thus these are the only possible middle groups.

2.1F2step 1.2

In Cp2, the unique subgroup of order p is pZ/p2Z, and its quotient is Cp, giving coefficient one by [F2]. In Cp⊕Cp, every one-dimensional subspace is a subgroup isomorphic to Cp, and its quotient is Cp. The number of such subspaces is (p2−1)/(p−1)=p+1, by partitioning nonzero vectors into lines.

3.1step 1.1step 1.2step 2.1algebra∎

The extension classification and counts of step 2.1 give the formula. Moreover End⁡(Cp2)≅Z/p2Z additively, which has an element of order p2; it is not an Fp-vector space. Thus the category is not Fp-linear.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

25 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.