Jump to content

Well-pointed category

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by RileyBot (talk | contribs) at 07:21, 2 February 2016 (Bot: Correcting capitalization or standardizing section headings) (Task 16). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

In category theory, a category with a terminal object is well-pointed if for every pair of arrows such that , there is an arrow such that . (The arrows are called the global elements or points of the category; a well-pointed category is thus one that has "enough points" to distinguish non-equal arrows.)

See also

References

  • Pitts, Andrew M. (2013). Nominal Sets: Names and Symmetry in Computer Science. Cambridge Tracts in Theoretical Computer Science. Vol. 57. Cambridge University Press. p. 16. ISBN 1107017785.