Movatterモバイル変換


[0]ホーム

URL:


Jump to content
WikipediaThe Free Encyclopedia
Search

Pointed set

From Wikipedia, the free encyclopedia
Basic concept in set theory

Inmathematics, apointed set[1][2] (alsobased set[1] orrooted set[3]) is anordered pair(X,x0){\displaystyle (X,x_{0})} whereX{\displaystyle X} is aset andx0{\displaystyle x_{0}} is an element ofX{\displaystyle X} called thebase point[2] (also spelledbasepoint).[4]: 10–11 

Amap between pointed a sets(X,x0){\displaystyle (X,x_{0})} and(Y,y0){\displaystyle (Y,y_{0})}—called abased map,[5]pointed map,[4] orpoint-preserving map[6]—is afunction fromX{\displaystyle X} toY{\displaystyle Y} that maps one basepoint to another, i.e. a mapf:XY{\displaystyle f:X\to Y} such thatf(x0)=y0{\displaystyle f(x_{0})=y_{0}}. A based map is usually denotedf:(X,x0)(Y,y0){\displaystyle f:(X,x_{0})\to (Y,y_{0})}.

Pointed sets are very simplealgebraic structures. In the sense ofuniversal algebra, a pointed set is a setX{\displaystyle X} together with a singlenullary operation:X0X{\displaystyle *:X^{0}\to X},[a] which picks out the basepoint.[7] Pointed maps are thehomomorphisms of these algebraic structures.

Theclass of all pointed sets together with the class of all based maps forms acategory. Every pointed set can be converted to an ordinary set by forgetting the basepoint (theforgetful functor isfaithful), but the reverse is not true.[8]: 44  In particular, theempty set cannot be pointed, because it has no element that can be chosen as the basepoint.[9]

Categorical properties

[edit]

The category of pointed sets and based maps is equivalent to the category of sets andpartial functions.[6] The base point serves as a "default value" for those arguments for which the partial function is not defined. One textbook notes that "This formal completion of sets and partial maps by adding 'improper', 'infinite' elements was reinvented many times, in particular, intopology (one-point compactification) and intheoretical computer science."[10] This category is also isomorphic to thecoslice category (1Set{\displaystyle \mathbf {1} \downarrow \mathbf {Set} }), where1{\displaystyle \mathbf {1} } is (a functor that selects) a singleton set, andSet{\displaystyle \scriptstyle {\mathbf {Set} }} (the identity functor of) thecategory of sets.[8]: 46 [11] This coincides with the algebraic characterization, since the unique map11{\displaystyle \mathbf {1} \to \mathbf {1} } extends thecommutative triangles defining arrows of the coslice category to form thecommutative squares defining homomorphisms of the algebras.

There is afaithful functor from pointed sets to usual sets, but it is not full and these categories are notequivalent.[8]

The category of pointed sets is apointed category. The pointedsingleton sets({a},a){\displaystyle (\{a\},a)} are bothinitial objects andterminal objects,[1] i.e. they arezero objects.[4]: 226  The category of pointed sets and pointed maps has bothproducts andcoproducts, but it is not adistributive category. It is also an example of a category where0×A{\displaystyle 0\times A} is not isomorphic to0{\displaystyle 0}.[9]

Applications

[edit]

Manyalgebraic structures rely on a distinguished point. For example,groups are pointed sets by choosing theidentity element as the basepoint, so thatgroup homomorphisms are point-preserving maps.[12]: 24  This observation can be restated in category theoretic terms as the existence of aforgetful functor from groups to pointed sets.[12]: 582 

A pointed set may be seen as apointed space under thediscrete topology or as avector space over thefield with one element.[13]

As "rooted set" the notion naturally appears in the study ofantimatroids[3] and transportation polytopes.[14]

See also

[edit]

Notes

[edit]
  1. ^The notationX0 refers to the zerothCartesian power of the setX, which is a one-element set that contains the empty tuple.

References

[edit]
  1. ^abcMac Lane 1998.
  2. ^abGrégory Berhuy (2010).An Introduction to Galois Cohomology and Its Applications. London Mathematical Society Lecture Note Series. Vol. 377. Cambridge University Press. p. 34.ISBN 978-0-521-73866-8.Zbl 1207.12003.
  3. ^abKorte, Bernhard;Lovász, László; Schrader, Rainer (1991),Greedoids, Algorithms and Combinatorics, vol. 4, New York, Berlin:Springer-Verlag, chapter 3,ISBN 3-540-18190-3,Zbl 0733.05023
  4. ^abcJoseph Rotman (2008).An Introduction to Homological Algebra (2nd ed.). Springer Science & Business Media.ISBN 978-0-387-68324-9.
  5. ^Maunder, C. R. F. (1996),Algebraic Topology, Dover, p. 31,ISBN 978-0-486-69131-2.
  6. ^abSchröder 2001.
  7. ^Saunders Mac Lane; Garrett Birkhoff (1999) [1988].Algebra (3rd ed.). American Mathematical Soc. p. 497.ISBN 978-0-8218-1646-2.
  8. ^abcJ. Adamek, H. Herrlich, G. Stecker, (18 January 2005)Abstract and Concrete Categories-The Joy of Cats
  9. ^abLawvere & Schanuel 2009.
  10. ^Neal Koblitz; B. Zilber; Yu. I. Manin (2009).A Course in Mathematical Logic for Mathematicians. Springer Science & Business Media. p. 290.ISBN 978-1-4419-0615-1.
  11. ^Francis Borceux; Dominique Bourn (2004).Mal'cev, Protomodular, Homological and Semi-Abelian Categories. Springer Science & Business Media. p. 131.ISBN 978-1-4020-1961-6.
  12. ^abPaolo Aluffi (2009).Algebra: Chapter 0. American Mathematical Soc.ISBN 978-0-8218-4781-7.
  13. ^Haran, M. J. Shai (2007),"Non-additive geometry"(PDF),Compositio Mathematica,143 (3):618–688,doi:10.1112/S0010437X06002624,MR 2330442. On p. 622, Haran writes "We considerF{\displaystyle \mathbb {F} }-vector spaces as finite setsX{\displaystyle X} with a distinguished 'zero' element ..."
  14. ^Klee, V.; Witzgall, C. (1970) [1968]. "Facets and vertices of transportation polytopes". In George Bernard Dantzig (ed.).Mathematics of the Decision Sciences. Part 1. American Mathematical Soc.ASIN B0020145L2.OCLC 859802521.

Further reading

[edit]

External links

[edit]
Retrieved from "https://en.wikipedia.org/w/index.php?title=Pointed_set&oldid=1333810062"
Categories:
Hidden categories:

[8]ページ先頭

©2009-2026 Movatter.jp