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

Disjoint Cycles

Disjoint cycles are cycles that have no elements in common, and they commute under composition.

Explanation

Two cycles are disjoint when they move completely separate sets of elements. Disjoint cycles commute, meaning their composition is independent of the order in which they are applied. Every permutation of a finite set can be expressed as a product of disjoint cycles, and this decomposition is unique up to the order of the cycles and cyclic rotation within each cycle.

Example or application

A worked example has not yet been added.

Key Properties

  • Disjoint cycles have no common elements.

  • Disjoint cycles commute under composition.

  • Every finite permutation has a disjoint-cycle decomposition.

  • The decomposition is unique up to reordering the cycles and rotating their entries.

  • Fixed elements may be represented by omitted 1-cycles.

Examples

PermutationCyclesExplanationComposition

(1 2 3)(4 5)

  • (1 2 3)

  • (4 5)

The cycles are disjoint because they contain no common symbols.

(1 2)(3 4)

The two transpositions are disjoint, so they commute.

(1 2)(3 4) = (3 4)(1 2)

Common Mistakes

  • Calling cycles disjoint when they share even one element.

  • Assuming all cycles commute.

  • Assuming the order of overlapping cycles can be changed freely.

Related Concepts

  • Cycle Notation

  • Composition of Permutations

  • Transpositions

  • Order of a Permutation

Learning Outcomes

  • Identify disjoint cycles.

  • Decompose permutations into disjoint cycles.

  • Explain why disjoint cycles commute.

Learning Guide

Core Idea

Disjoint cycles are cycles that have no elements in common, and they commute under composition.

Worked Example

Permutation: (1 2 3)(4 5)
Cycles: (1 2 3), (4 5)
Explanation: The cycles are disjoint because they contain no common symbols.

Permutation: (1 2)(3 4)
Composition: (1 2)(3 4) = (3 4)(1 2)
Explanation: The two transpositions are disjoint, so they commute.

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 disjoint cycles?

Disjoint cycles are cycles that have no elements in common, and they commute under composition.

What definition, condition, or property should you check first when solving a problem about disjoint cycles?

Start by checking the relevant defining properties: Disjoint cycles have no common elements; Disjoint cycles commute under composition; Every finite permutation has a disjoint-cycle decomposition; The decomposition is unique up to reordering the cycles and rotating their entries. Verify every required hypothesis before applying a theorem.

How is disjoint cycles connected to the wider study of abstract algebra?

It belongs to Permutation groups. It connects naturally with Cycle Notation, Composition of Permutations, Transpositions, Order of a Permutation.

Mastery Checklist

  • I can state the definition of disjoint cycles 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.

Applications

  • Provides a foundational tool for later topics in permutation groups.

  • Supports precise mathematical reasoning, proof construction and the comparison of algebraic structures.

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 results on permutation decomposition; no specific external reference has been independently verified.

Suggest a correction or source · More in Abstract Algebra