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.
is a bijection, so whenever these cardinalities are finite
Statement
For a group and , the map
is a well-defined bijection. Consequently
whenever these cardinalities are finite, in particular when is finite.
Facts & Assumptions
Given: A group and an element .
Orbit-stabiliser gives a bijection from the cosets of a point stabilizer to its orbit (Orbit-stabiliser: , , is a well-defined bijection).
The finite cardinality of an orbit is the index of its stabilizer (Orbit-stabiliser cardinality: whenever either side is finite, and for finite ).
The conjugacy class is and the centralizer is (The conjugacy class and centralizer of an element).
The centralizer is a subgroup of ( and are subgroups of ).
The maps form the conjugation homomorphism (The map is a homomorphism with kernel and image ).
A homomorphism into a symmetric group defines a group action (Actions of on correspond exactly to homomorphisms ).
Proof
By [L5] and [L6], acts on itself by conjugation. By [L3], the orbit of is and its stabilizer is , which is a subgroup by [L4].
Applying [L1] to this action gives the displayed well-defined bijection .
Applying [L2] to the same orbit gives whenever finite.
Depends on
- Orbit-stabiliser: $G/G_x\to G\cdot x$, $gG_x\mapsto g\cdot x$, is a well-defined bijection
- Orbit-stabiliser cardinality: $|G\cdot x|=[G:G_x]$ whenever either side is finite, and $|G|=|G_x|\,|G\cdot x|$ for finite $G$
- The conjugacy class $\operatorname{Cl}_G(x)$ and centralizer $C_G(x)$ of an element
- $C_G(x)$ and $N_G(H)$ are subgroups of $G$
- The map $g\mapsto(x\mapsto gxg^{-1})$ is a homomorphism $G\to\operatorname{Aut}(G)$ with kernel $Z(G)$ and image $\operatorname{Inn}(G)$
- Actions of $G$ on $X$ correspond exactly to homomorphisms $G\to\operatorname{Sym}(X)$
Used by
- A noncentral element of an extraspecial p-group has centraliser of index p Corollary
- The class equation of Sₙ is n!=∑_∑ k cₖ=n n!/∏ₖ k^cₖcₖ! Corollary
- The class equation of S₃ is 6=1+2+3 Example
- The square-symmetry group has class equation 8=2+2+2+2 Example
- Every conjugacy class of an extraspecial p-group outside the centre has exactly p elements Proposition
- Burnside's pᵃqᵇ theorem Theorem
- The class equation |G|=|Z(G)|+∑ᵢ [G:C_G(xᵢ)] for a finite group Theorem
Dependency tree · two levels
27 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
- P. Brosnan, Undergraduate Algebra Notes, 3.14: G-Sets, Corollary 3.109 (standard reference, not scraped)
- T. W. Judson, Abstract Algebra: Theory and Applications, 14.2 (standard reference, not scraped)