Group theory and generalizations Group actions and permutation groups Theorem
Burnside's lemma
Builds on Fixed points of an actionOrbitSize of an orbit times the size of the stabiliser
Remarks
The proof counts the pairs with in two ways, and uses . For example, the rotation group of a square acts on the colourings of the corners with two colours. The fixed colourings number , , and , so there are colourings up to rotation.
History
William Burnside stated and proved the lemma in his 1897 book on finite groups, and he attributed it to Frobenius, 1887. Cauchy already knew the formula in 1845. For this reason, the lemma is sometimes called "the lemma that is not Burnside's".
Reading path
To understand this page from the ground up, read these 55 pages in order. The foundations come first. The path takes the proof Proof of Lagrange's theorem.
- Element definition
- Group concept
- Left coset concept
- Proposition concept
- Set definition
- Conjugate elements definition
- Group homomorphism definition
- Order of a group definition
- Subgroup definition
- Symmetric group definition
- Conjunction definition
- Disjunction definition
- Implication definition
- Predicate definition
- Empty set object
- Family of sets definition
- Ordered pair definition
- Intersection definition
- Union definition
- Conjugate subgroup definition
- Group action definition
- Left coset definition
- Right coset definition
- Subgroup criterion statement
- Set-builder notation concept
- Existential quantifier definition
- Universal quantifier definition
- Disjoint sets definition
- Cartesian product definition
- Normal subgroup definition
- Stabiliser definition
- Subset definition
- Union of a family of sets definition
- Orbit definition
- Intersection of subgroups is a subgroup statement
- Index of a subgroup definition
- Cosets have the same cardinality as the subgroup statement
- Binary relation definition
- Partition of a set definition
- Normal core definition
- Fixed points of an action definition
- Transitive action definition
- Order of a group is the index times the order of the subgroup statement
- Reflexive relation definition
- Symmetric relation definition
- Transitive relation definition
- Action on left cosets example
- Equivalence relation definition
- Orbit-stabiliser theorem statement
- Equivalence class definition
- Equivalence classes form a partition statement
- Proof of Lagrange's theorem proof
- Lagrange's theorem statement
- Size of an orbit times the size of the stabiliser statement
- Burnside's lemma statement
Further reading
- Web https://en.wikipedia.org/wiki/Burnside's_lemma, Statement
- Web https://en.wikipedia.org/wiki/Burnside's_lemma, History: the lemma that is not Burnside's
About this page
| Tag | 0Z47M1B2VS |
|---|---|
| URI | m2://0Z47M1B2VS |
| Aliases | orbit-counting-theorem, cauchy-frobenius-lemma |
| Kind | statement, theorem |
| Writing | W1 stated |
| MSC | 20B05, 05E18 |
| Status | This copy of the site has no build data. Run m2 status 0Z47M1B2VS. |
| Uses | Fixed points of an action, Orbit, Size of an orbit times the size of the stabiliser |
| Same as |
Markdown · JSON · Edit on GitHub
What this page needs for W2
- edge about out: the concepts that the statement is about (0 of 1)
- edge proves in: at least one proof node (0 of 1)
- edge instance_of or illustrates in: one example that shows the statement at work (0 of 1)
- explanation L2 (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.