Group theory and generalizations Proof
Proof of Burnside's lemma
Proof
In the proof of Burnside's lemma, the first step is to re-express the sum over the group elements g ∈ G as an equivalent sum over the set of elements x ∈ X:
Here is the set of points of fixed by the element of , whereas is the stabilizer subgroup of , consisting of those symmetries that fix the point .
The orbit-stabilizer theorem says that for each there is a natural bijection between the orbit and the set of left cosets . Lagrange's theorem implies that
The sum may therefore be rewritten as
Writing as the disjoint union of its orbits in gives
Putting everything together gives the desired result:
This is similar to the proof of the conjugacy class equation, which considers the conjugation action of on itself, that is, it is the case and , so that the stabilizer of is the centralizer .
Where this leads
1 page builds on this one.
Further reading
- Wikipedia, page 251900, revision 1374573038, Burnside's lemma, section Proof. adopted
About this page
| Tag | 3G6P3T63XY |
|---|---|
| URI | m2://3G6P3T63XY |
| Kind | proof |
| Writing | W0 stub |
| MSC | 20B05, 05E18 |
| Proves | Burnside's lemma |
| Changed | 4 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- edge uses out: each node that the argument needs (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.