Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Groupoid
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
=== Vertex groups and orbits === Given a groupoid ''G'', the '''vertex groups''' or '''isotropy groups''' or '''object groups''' in ''G'' are the subsets of the form ''G''(''x'',''x''), where ''x'' is any object of ''G''. It follows easily from the axioms above that these are indeed groups, as every pair of elements is composable and inverses are in the same vertex group. The '''orbit''' of a groupoid ''G'' at a point <math>x \in X</math> is given by the set <math>s(t^{-1}(x)) \subseteq X</math> containing every point that can be joined to x by a morphism in G. If two points <math>x</math> and <math>y</math> are in the same orbits, their vertex groups <math>G(x)</math> and <math>G(y)</math> are [[group isomorphism|isomorphic]]: if <math>f</math> is any morphism from <math>x</math> to {{tmath|1= y }}, then the isomorphism is given by the mapping {{tmath|1= g\to fgf^{-1} }}. Orbits form a partition of the set X, and a groupoid is called '''transitive''' if it has only one orbit (equivalently, if it is [[connected (category theory)|connected]] as a category). In that case, all the vertex groups are isomorphic (on the other hand, this is not a sufficient condition for transitivity; see the section [[Groupoid#Examples|below]] for counterexamples).
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)