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 iff for some , and hence partition the acted-on set
Statement
For a left action of on , define when for some . This is an equivalence relation, its equivalence class at is , and the distinct orbits partition .
Facts & Assumptions
Given: A left action of a group on a set .
The action laws are and (Left group actions, transitive actions, and faithful actions).
The orbit at is (The orbit and stabilizer of a point in a group action).
Equivalence classes of an equivalence relation partition the underlying set (Equivalence relation, equivalence class, and the quotient set , The equivalence classes of an equivalence relation are nonempty, cover , and are pairwise equal or disjoint; conversely every such cover arises from exactly one equivalence relation).
Proof
The relation is reflexive: , so .
If , then , so implies .
If and , then , so and imply .
Steps 1.1–1.3 show that is an equivalence relation. Its class at is precisely the set of , namely .
Therefore the distinct orbits partition .
Depends on
- Left group actions, transitive actions, and faithful actions
- The orbit $G\cdot x$ and stabilizer $G_x$ of a point in a group action
- Equivalence relation, equivalence class, and the quotient set $A/{\sim}$
- The equivalence classes of an equivalence relation are nonempty, cover $A$, and are pairwise equal or disjoint; conversely every such cover arises from exactly one equivalence relation
Used by
- Orbit indicators form a basis of invariant functions Lemma
- (2n+1) Cₙ=C(2n+1, n), a second derivation of the Catalan count Theorem
- Cauchy-Frobenius orbit counting: |G| |X/G|=∑_g∈ G|Xᵍ| for a finite group action Theorem
- Every permutation of a finite set is a product of pairwise disjoint cycles, uniquely up to reordering and cyclic rotation Theorem
- If a finite p-group P acts on a finite set X, then |X|≡|X^P| (mod p) Theorem
- Sylow I: every finite group has a Sylow p-subgroup Theorem
- The Chung–Feller theorem: for each k with 0≤ k≤ n, exactly Cₙ of the diagonal paths from (0,0) to (2n,0) have exactly 2k steps lying above level 0 Theorem
- The class equation |G|=|Z(G)|+∑ᵢ [G:C_G(xᵢ)] for a finite group Theorem
Dependency tree · two levels
16 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Brosnan, Orbits and stabilizers (standard reference, not scraped)