Alphabeta Math
DefinitionDefinition: AI-generatedProof: Not applicable
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 a:x→y and b:y→z, write ab=b∘a; 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 x of a small groupoid G, its vertex group Gx is the set of arrows x→x with the left-to-right product and identity 1x. Given an arrow a:x→y, the associated conjugation map ca:Gx→Gy is ca(u)=a−1ua.

Justification

The category axioms give associative composition and identities; in a groupoid every arrow has an inverse. Thus the endomorphisms at x are closed under the indicated composition and form a group, with identity 1x 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 a:x→y, the composite a−1ua is an endomorphism of y. Associativity and aa−1=1x show ca(uv)=ca(u)ca(v); the map v↦ava−1 is its two-sided inverse. Hence ca is a group isomorphism (Group isomorphisms, automorphisms and the set Aut(G)). It depends on the specified arrow a; no global choice of connecting arrows is required.

Depends on

Used by · 23

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.