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.
Free object actions give orbit coverings
Statement
Let a group act on a connected small groupoid by automorphisms, with a left action on objects and arrows: . Assume that the object action is free, meaning that implies . Arrow products are read left to right. An orbit is the set of translates of an object or arrow.
The object and arrow orbits form a connected groupoid : the source and target of an arrow orbit are the orbits of its source and target, and composition is defined by choosing consecutive representatives. For each object , every arrow orbit whose source is has exactly one representative with source . The orbit functor is a normal covering, and identifies with its group of deck transformations, whose multiplication is ordinary function composition.
For every object , there is an exact sequence of groups . Here and are the groups of arrows from the indicated object to itself, and when the unique representative with source has target . Exactness means that the first map is injective, the last is surjective, and the image of the first equals the kernel of the last.
Statement references
Set-sized groupoids, functors and composition conversion
Independent groupoid covering and universal-cover input
Left group actions, transitive actions, and faithful actions
A free group action has no nonidentity element fixing a point
Equivalence relation, equivalence class, and the quotient set A/∼
Facts & Assumptions
Given: The group action and the connected small groupoid in the Statement.
A groupoid has associative arrow composition, identities and two-sided inverses; its automorphisms preserve all of these and the source and target of arrows. Connectedness means nonemptiness and an arrow between any ordered pair of objects. Set-sized groupoids, functors and composition conversion
In a left group action, acts as the identity and acts as after . The orbit relation is an equivalence relation, and freeness means that an element fixing an object is the identity. Left group actions, transitive actions, and faithful actions A free group action has no nonidentity element fixing a point Equivalence relation, equivalence class, and the quotient set A/∼
A covering of connected groupoids is a functor bijective on arrows with each fixed source. A deck transformation is an automorphism over the base, and the covering is normal when its deck transformations act transitively on a fibre. Independent groupoid covering and universal-cover input
A group homomorphism satisfies . Its kernel is , and its image is . Monoid homomorphism and group homomorphism The kernel and image of a group homomorphism
Proof
Goal: Construct the orbit groupoid and establish the covering, deck group and exact sequence.
Representatives and composition. If an arrow orbit has source , translate any representative so its source is . Two representatives in that orbit with source differ by an element fixing , hence are equal by freeness. For composable arrow orbits, choose a representative of the first and the unique representative of the second with source ; define their product to be . Replacing by replaces by , so the product orbit is unchanged. Sources and targets are well defined because automorphisms preserve them.
Groupoid and covering. For three composable orbits, choose consecutive representatives . Both parenthesizations have orbit , by uniqueness in 1.1 and associativity in . Identity and inverse orbits satisfy the groupoid laws by the same construction. Thus the orbit maps define a functor . It is bijective on every source-star by 1.1. The quotient is nonempty and connected because an arrow between representatives of any two object orbits exists in . Consequently is a covering of connected groupoids.
Deck transformations. Each acts as an automorphism over , so gives a deck transformation; these act transitively on every object fibre, which is an -orbit. If a deck transformation fixes one object , then it fixes every arrow with source by source-star injectivity, and hence fixes their targets. Connectedness reaches every object this way; source-star injectivity then fixes every arrow. For any deck transformation , its value at is for a unique by freeness. The deck transformation fixes , so is the identity. Thus is exactly the deck group, with multiplication preserved by the left-action law, and the covering is normal.
Vertex sequence. For a loop orbit at , its unique representative from ends at a unique , defining . If represents a second loop orbit, the consecutive representative after is ; hence , so is a homomorphism. Connectedness supplies an arrow for each , proving surjectivity. Its kernel consists exactly of orbit classes represented by arrows , which are the image of . The restriction of to is injective by source-star uniqueness. This proves the exact sequence and all assertions.
Depends on
- Set-sized groupoids, functors and composition conversion
- Independent groupoid covering and universal-cover input
- Left group actions, transitive actions, and faithful actions
- A free group action has no nonidentity element fixing a point
- Equivalence relation, equivalence class, and the quotient set A/∼
- Monoid homomorphism and group homomorphism
- The kernel and image of a group homomorphism
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.