How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Set-sized groupoids, functors and composition conversion
Definition
A small category is a category whose objects and morphisms each form a set; each morphism carries its source and target. A groupoid is a category in which every morphism has a two-sided inverse. A groupoid is connected when it is nonempty and there is an arrow between every ordered pair of objects.
For arrows and , write ; hence composition is read from left to right. A covariant functor sends objects to objects and arrows to arrows with the corresponding sources and targets, preserving identities and composition. An automorphism is a functor from a category to itself with a two-sided inverse functor.
For an object of a small groupoid , its vertex group is the set of arrows with the left-to-right product and identity . Given an arrow , the associated conjugation map is .
Definition references
Justification
The category axioms give associative composition and identities; in a groupoid every arrow has an inverse. Thus the endomorphisms at are closed under the indicated composition and form a group, with identity and inverses inherited from the groupoid. The left-to-right notation is a relabelling of the existing composite, so associativity and identities remain valid. The connectedness condition agrees with the zigzag definition because arrows in a groupoid can be reversed and composed.
For , the composite is an endomorphism of . Associativity and show ; the map is its two-sided inverse. Hence is a group isomorphism (Group isomorphisms, automorphisms and the set Aut(G)). It depends on the specified arrow ; no global choice of connecting arrows is required.
Depends on
Used by · 23
- Path presentations, congruences and formal inverses
- Independent groupoid covering and universal-cover input
- Free object actions give orbit coverings
- Covering-space actions and fundamental-groupoid quotients
- A criterion for lifting a presented groupoid
- Independent spherical ribbon splitting input
- Reduced-ribbon lcm presentation including the empty subset
- Connected small groupoids and vertex groups
- Groupoid completion and its universal property
- Brink–Howlett groupoid
- Opposite-category convention for Brink–Howlett
- Universal wall groupoid on relative chambers
- Natural functors to the universal wall groupoid
- Two ribbon-lcm expressions and presentation
- Universal wall graph as a groupoid Cayley graph
- Unique lifts, endpoint fibres and characteristic subgroups
- Explicit connected cover associated with a vertex subgroup
- Pointed classification of connected groupoid coverings
- Normal coverings and the convention-correct deck quotient
- Universal groupoid covering from the trivial subgroup
- The empty-object ribbon component and its braid relations
- The reduced ribbon subgroupoid uses exactly the exterior atoms
- Unique conjugator factorization restricts to a normalizer splitting
Dependency tree · 2 levels
Each result is drawn at its shortest distance from this item. Arrows run from prerequisites to the items that use them; this item has a heavier outline. External source nodes link directly to the cited text. The view shows up to two dependency steps; open a prerequisite to continue.