Alphabeta Math
PropositionStatement: AI-generatedProof: AI-generated
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 N act on a connected small groupoid G by automorphisms, with a left action on objects and arrows: (nm)a=n(ma). Assume that the object action is free, meaning that nx=x implies n=1. 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 G/N: 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 x, every arrow orbit whose source is [x] has exactly one representative with source x. The orbit functor p:G→G/N is a normal covering, and n↦(a↦na) identifies N with its group of deck transformations, whose multiplication is ordinary function composition.

For every object x, there is an exact sequence of groups 1→Gx→p(G/N)[x]→δN→1. Here Gx and (G/N)[x] are the groups of arrows from the indicated object to itself, and δ([a])=n when the unique representative a with source x has target nx. Exactness means that the first map is injective, the last is surjective, and the image of the first equals the kernel of the last.

Facts & Assumptions

Given: The group action and the connected small groupoid in the Statement.

[F1]

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

[F2]

In a left group action, 1 acts as the identity and (nm) acts as n after m. 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/∼

[F3]

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

[F4]

A group homomorphism f:H→K satisfies f(uv)=f(u)f(v). Its kernel is {u∈H:f(u)=1K}, and its image is {f(u):u∈H}. Monoid homomorphism and group homomorphism The kernel and image of a group homomorphism

Proof

technique · direct

Goal: Construct the orbit groupoid and establish the covering, deck group and exact sequence.

1.1F1F2given

Representatives and composition. If an arrow orbit has source [x], translate any representative so its source is x. Two representatives in that orbit with source x differ by an element fixing x, hence are equal by freeness. For composable arrow orbits, choose a representative a:x→y of the first and the unique representative b:y→z of the second with source y; define their product to be [ab]. Replacing a by na replaces b by nb, so the product orbit is unchanged. Sources and targets are well defined because automorphisms preserve them.

2.1F1F3step 1.1

Groupoid and covering. For three composable orbits, choose consecutive representatives a,b,c. Both parenthesizations have orbit [abc], by uniqueness in 1.1 and associativity in G. Identity and inverse orbits satisfy the groupoid laws by the same construction. Thus the orbit maps define a functor p. 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 G. Consequently p is a covering of connected groupoids.

3.1F1F2F3F4step 2.1

Deck transformations. Each n∈N acts as an automorphism over G/N, so gives a deck transformation; these act transitively on every object fibre, which is an N-orbit. If a deck transformation fixes one object x, then it fixes every arrow with source x 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 d, its value at x is nx for a unique n by freeness. The deck transformation n−1d fixes x, so is the identity. Thus N is exactly the deck group, with multiplication preserved by the left-action law, and the covering is normal.

4.1F1F2F4step 1.1step 2.1step 3.1∎

Vertex sequence. For a loop orbit at [x], its unique representative a from x ends at a unique nx, defining δ([a])=n. If b:x→mx represents a second loop orbit, the consecutive representative after a is nb:nx→nmx; hence δ([a][b])=nm, so δ is a homomorphism. Connectedness supplies an arrow x→nx for each n, proving surjectivity. Its kernel consists exactly of orbit classes represented by arrows x→x, which are the image of Gx. The restriction of p to Gx is injective by source-star uniqueness. This proves the exact sequence and all assertions.

Depends on

Used by · 4

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.