Fix an object . For , use as its identity arrow. For , its source is and target is . If , define the composite of followed by by
These expressions use addition and subtraction in the hom-set of the preadditive category. The reflexive pair identities give
so the composite has the required endpoints. Also and .
The unit identities follow directly: and . If and , either parenthesization of three arrows equals , so composition is associative. The inverse identities are
Therefore these operations define a groupoid on the specified object and arrow sets. Precomposing by respects each expression, by additivity of composition, so the groupoids are natural in .
Every reflexive pair therefore has the required groupoid structure on generalized points. This is the reflexive-pair groupoid formula in a preadditive category. If the composable-arrow pullback in a category exists, its projections give the actual internal composition map . The printed generalized-point definition does not assume that this pullback exists, and preadditivity alone would not ensure it.
A preadditive category has an abelian group structure on every hom-set, with composition additive in each variable. Neither a zero object nor biproducts are part of this definition.
Fix and use the reflexive pair , , with . Take objects and arrows , with source , target , and identity at equal to . For composable , so , define
The preadditive category axioms give
Thus the formula has the required endpoints. The identities satisfy and , using .
For and , both ways of composing three arrows equal
Indeed , while expanding and then composing with gives the same expression. Hence composition is associative.
Every arrow has inverse
Its source is and its target is . Substituting in the composition formula gives and . Therefore this is a groupoid.
For , precomposition by preserves sources, targets, identities, composition and inverses by bilinearity. Thus the construction is natural in , giving the requested internal groupoid structure in its hom-set formulation. If the composable-arrow pullback in a category exists, the same formula defines its internal composition morphism. The reflexive-pair groupoid formula in a preadditive category requires no extra additive-category hypotheses.
Reflexive pair in an additive category is an internal groupoid Created 2026-09-28 Updated 2026-11-05
Let be a reflexive pair in an additive category with finite limits, with common section . Regard as source and as target. For arrows satisfying , define
The identity at is , and the inverse of is . These operations define an internal groupoid. The finite limits hypothesis supplies the objects of composable arrows needed for the groupoid diagrams.
The source of the composite is , and its target is . The common-section identities prove both identity laws and both inverse laws. For a composable triple , either parenthesization gives , proving associativity. Bilinearity makes these formulas compatible with precomposition in .
The limit hypothesis cannot simply be discarded. Take the full subcategory of finite-dimensional vector spaces whose dimensions are , for nonnegative integers . A projection has a common section with itself, but its composable-pair pullback in a category in vector spaces has dimension , which is not of the allowed form. Testing the pullback in a category property on would force that same dimension, so the smaller category has no such pullback in a category. The reflexive-pair groupoid formula in a preadditive category still makes sense on generalized arrows without asserting existence of this object.