Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-03
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.

The orbits of a group action are the equivalence classes of x∼y iff y=g⋅x for some g, and hence partition the acted-on set

Statement

For a left action of G on X, define x∼y when y=g⋅x for some g∈G. This is an equivalence relation, its equivalence class at x is G⋅x, and the distinct orbits partition X.

Facts & Assumptions

Given: A left action of a group G on a set X.

[L1]

The action laws are e⋅x=x and (gh)⋅x=g⋅(h⋅x) (Left group actions, transitive actions, and faithful actions).

[L2]

The orbit at x is G⋅x={g⋅x:g∈G} (The orbit G⋅x and stabilizer Gx of a point in a group action).

Proof

technique · direct
1.1L1given

The relation is reflexive: x=e⋅x, so x∼x.

1.2L1givenalgebra

If y=g⋅x, then x=g−1⋅y, so x∼y implies y∼x.

1.3L1givenalgebra

If y=g⋅x and z=h⋅y, then z=(hg)⋅x, so x∼y and y∼z imply x∼z.

2.1step 1.1step 1.2step 1.3L2L3

Steps 1.1–1.3 show that ∼ is an equivalence relation. Its class at x is precisely the set of y=g⋅x, namely G⋅x.

3.1step 2.1L3∎

Therefore the distinct orbits partition X.

Depends on

Dependency tree · 2 levels

Sources