Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedjudge 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.

Small finitary abelian categories for Hall multiplication

Definition

A small finitary abelian category for Hall multiplication is a small abelian category A (its object and morphism collections are sets, by Small, locally small, and large categories), with abelian structure as in Abelian category, in which the following sets are finite for every pair of objects M,N:

  1. Hom⁡A(M,N);
  2. YExt⁡A1(M,N), the set of Yoneda classes of short exact sequences 0→N→E→M→0. Equivalence is the one-fold instance of the generated endpoint-fixed chain-map relation in Equivalence of n-fold extensions: chain maps are the identity on N and M, and the relation is closed under reflexivity, symmetry and transitivity. A short exact sequence and its endpoint order use Exact sequence and short exact sequence in an abelian category, An extension of an object by an object in an abelian category and An n-fold Yoneda extension.

One may instead supply a small skeleton A0 of an essentially small abelian category and perform the construction on A0. Here “essentially small” means that such a small equivalent category is part of the given data; the construction does not select representatives by an unstated choice principle. The isomorphism classes Iso⁡(A0) then form a set.

No Fq-linear structure, enough projectives or injectives, finite number of subobjects of every object, or identification with derived Ext⁡1 is included in this definition. Subobjects are the monomorphism classes of Subobject and quotient object as mutual-factorisation classes of monomorphisms and epimorphisms, and quotients are the cokernels specified in The quotient of an object by a subobject.

Depends on

Used by

Dependency tree · two levels

16 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