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 , and let be the category of finite abelian -groups. For a small model, take all abelian group laws on standard sets of cardinality , for , and all group homomorphisms. Write and . In the untwisted Hall product, This example uses the ordinary counting product and needs no -linear structure.
Facts & Assumptions
Given: A prime , the category , and the untwisted Hall product.
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).
Hall coefficients count subobjects with the prescribed subobject and quotient isomorphism types (The untwisted Hall algebra of a finitary abelian category).
A small finitary category has finite Hom and Yoneda extension sets (Small finitary abelian categories for Hall multiplication).
Verification
Kernels and cokernels of homomorphisms between finite abelian -groups are finite abelian -groups, and finite direct sums remain finite abelian -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 , Hom is a finite set. Any short exact sequence with endpoints has a middle group of cardinality ; 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.
If is exact, then . If contains an element of order , then . Otherwise every nonzero element has order , so scalar multiplication by makes a two-dimensional vector space and . Thus these are the only possible middle groups.
In , the unique subgroup of order is , and its quotient is , giving coefficient one by [F2]. In , every one-dimensional subspace is a subgroup isomorphic to , and its quotient is . The number of such subspaces is , by partitioning nonzero vectors into lines.
The extension classification and counts of step 2.1 give the formula. Moreover additively, which has an element of order ; it is not an -vector space. Thus the category is not -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.