Nagel point: Difference between revisions

Revision as of 22:49, 21 December 2013

In category theory, a category with a terminal object $1$ is well-pointed if for every pair of arrows $f,g:A\to B$ such that $f\neq g$ , there is an arrow $p:1\to A$ such that $f\circ p\neq g\circ p$ . (The arrows $p$ 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.)

20 year-old Real Estate Agent Rusty from Saint-Paul, has hobbies and interests which includes monopoly, property developers in singapore and poker. Will soon undertake a contiki trip that may include going to the Lower Valley of the Omo.

My blog: http://www.primaboinca.com/view_profile.php?userid=5889534

@@ Line 1: / Line 1: @@
-Nice to satisfy you, my name is Refugia. Managing individuals is his occupation. Minnesota has usually been his house but his spouse wants them to transfer. To gather badges is what her family members and her enjoy.<br><br>my web site :: [http://checkmates.co.za/index.php?do=/profile-120229/info/ at home std test]
+In [[category theory]], a category with a [[terminal object]] <math>1</math> is '''well-pointed''' if for every pair of arrows <math>f,g:A\to B</math> such that <math>f\neq g</math>, there is an arrow <math>p:1\to A</math> such that <math>f\circ p\neq g\circ p</math>. (The arrows <math>p</math> are called the [[global element]]s or ''points'' of the category; a well-pointed category is thus one that has "enough points" to distinguish non-equal arrows.)
+==See also==
+* [[Pointed category]]
+==Reference==
+* {{cite book | title=Nominal Sets: Names and Symmetry in Computer Science | volume=57 | series=Cambridge Tracts in Theoretical Computer Science | first=Andrew M. | last=Pitts | publisher=[[Cambridge University Press]] | year=2013 | isbn=1107017785 | page=16 }}
+[[Category:Category theory]]
+{{Categorytheory-stub}}