✦ScienexySCIENCE KNOWLEDGE LIBRARY
concept · INFO-MAT-AALG-105

Burnside's Lemma

Burnside's Lemma counts the number of distinct orbits by averaging the number of fixed points over all group elements.

Number of orbits = (1/|G|) Σ_{g ∈ G} |Fix(g)|

Explanation

Burnside's Lemma is a counting theorem for finite group actions. It states that the number of distinct orbits equals the average number of fixed points across all elements of the acting group. Instead of listing every possible configuration and manually identifying equivalent ones, the lemma counts how many configurations remain unchanged under each group element. Adding these fixed-point counts and dividing by the order of the group gives the number of distinct equivalence classes. It is widely used in combinatorics, coloring problems, symmetry classification and counting arrangements up to rotation or reflection.

Variables

SymbolMeaning

G

The finite acting group.

|G|

The number of elements in G.

g

An element of G.

Fix(g)

The set of configurations fixed by g.

Σ

Summation over all group elements.

Example or application

Description: Consider the rotations of a square acting on its four vertices.
Fixed Points: Identity rotation: 4 fixed vertices.; 90° rotation: 0 fixed vertices.; 180° rotation: 0 fixed vertices.; 270° rotation: 0 fixed vertices.
Calculation: Number of orbits = (4 + 0 + 0 + 0)/4 = 1.
Conclusion: All four vertices belong to one orbit under the rotation group.

Key Properties

  • The acting group must be finite.

  • The set being acted upon is usually finite in standard counting applications.

  • The number of orbits is the average fixed-point count.

  • Every group element, including the identity, contributes to the sum.

  • The result is always a nonnegative integer.

Applications

  • Counting colorings up to rotation or reflection.

  • Counting arrangements that are equivalent under symmetry.

  • Combinatorial enumeration.

  • Classifying geometric configurations.

Common Mistakes

  • Forgetting to include the identity element in the sum.

  • Adding orbit sizes instead of fixed-point counts.

  • Dividing by the number of elements of the acted-upon set rather than the group order.

Related Concepts

  • Group Actions on Sets

  • Orbits and Stabilizers

  • Fixed Points of Group Actions

  • Orbit-Stabilizer Theorem

Learning Guide

Core Idea

Burnside's Lemma counts the number of distinct orbits by averaging the number of fixed points over all group elements.

Worked Example

Description: Consider the rotations of a square acting on its four vertices.
Fixed Points: Identity rotation: 4 fixed vertices.; 90° rotation: 0 fixed vertices.; 180° rotation: 0 fixed vertices.; 270° rotation: 0 fixed vertices.
Calculation: Number of orbits = (4 + 0 + 0 + 0)/4 = 1.
Conclusion: All four vertices belong to one orbit under the rotation group.

How To Study

  • Write the formal definition and identify every object, operation, and hypothesis.

  • Work through the supplied example one step at a time; explain why each step is valid.

  • Check the listed properties and compare the example with at least one common mistake.

  • Try the self-check questions without looking at the answers, then explain the reasoning aloud or in writing.

Self Check

QuestionAnswer

In your own words, what is burnside's lemma?

Burnside's Lemma counts the number of distinct orbits by averaging the number of fixed points over all group elements.

What definition, condition, or property should you check first when solving a problem about burnside's lemma?

Start by checking the relevant defining properties: The acting group must be finite; The set being acted upon is usually finite in standard counting applications; The number of orbits is the average fixed-point count; Every group element, including the identity, contributes to the sum. Verify every required hypothesis before applying a theorem.

How is burnside's lemma connected to the wider study of abstract algebra?

It belongs to Group actions and advanced group theory. It connects naturally with Group Actions on Sets, Orbits and Stabilizers, Fixed Points of Group Actions, Orbit-Stabilizer Theorem.

Mastery Checklist

  • I can state the definition of burnside's lemma accurately.

  • I can identify the assumptions and notation used in a problem.

  • I can explain at least one example and justify each important step.

  • I can recognize a common mistake and explain why it is incorrect.

Examples

NameDescription

Worked example

Description: Consider the rotations of a square acting on its four vertices.
Fixed Points: Identity rotation: 4 fixed vertices.; 90° rotation: 0 fixed vertices.; 180° rotation: 0 fixed vertices.; 270° rotation: 0 fixed vertices.
Calculation: Number of orbits = (4 + 0 + 0 + 0)/4 = 1.
Conclusion: All four vertices belong to one orbit under the rotation group.

Sources and verification

Sources are shown as provided in the project data. Not every source has yet been independently verified. Please report errors or missing citations.

  • Standard abstract-algebra definitions and examples; no specific external reference has been independently verified.

Suggest a correction or source · More in Abstract Algebra