Permutation Composition Calculator

Compose permutations clearly. View cycles, inverses, parity, and order. Export results quickly for lessons, homework, exams, and verification.

Calculator Input

Choose the size n, then enter σ(i) and τ(i). Each row must contain a valid permutation of 1 through n.

Element 1

Element 2

Element 3

Element 4

Element 5

Example Data Table

i σ(i) τ(i) (σ ∘ τ)(i) (τ ∘ σ)(i)
12311
23125
31232
45454
54543

This example shows how composition order changes the outcome. In many cases, σ ∘ τ and τ ∘ σ are different.

Formula Used

Composition rule: For permutations σ and τ on the same set, the composition is

(σ ∘ τ)(i) = σ(τ(i))

This means apply τ first, then apply σ to the result.

Inverse rule:

σ⁻¹(σ(i)) = i

Order of a permutation: Convert the permutation into disjoint cycles. Then compute the least common multiple of the cycle lengths.

order(σ) = lcm(length of each disjoint cycle)

Parity: A permutation is even or odd depending on whether it can be written as an even or odd number of transpositions.

How to Use This Calculator

  1. Select the set size n.
  2. Enter values for σ(i) in the first input of each element card.
  3. Enter values for τ(i) in the second input of each element card.
  4. Make sure both rows are valid permutations of 1 through n.
  5. Click Calculate Composition.
  6. Review the result block shown below the header and above the form.
  7. Inspect cycle notation, order, parity, fixed points, and identity status.
  8. Use the CSV and PDF buttons to export the results.

Frequently Asked Questions

1. What does permutation composition mean?

Permutation composition means applying one permutation after another. If you compute σ ∘ τ, you first apply τ to an element, then apply σ to that output.

2. Why does the order of composition matter?

Order matters because permutation composition is usually not commutative. In general, σ ∘ τ and τ ∘ σ send elements to different outputs, so both are worth checking.

3. What is cycle notation?

Cycle notation groups elements that map around in loops. It is compact, easier to interpret, and useful for finding order, inverse behavior, and structural properties.

4. What is the order of a permutation?

The order is the smallest positive integer k such that σ^k becomes the identity. It equals the least common multiple of the lengths of disjoint cycles.

5. What are fixed points?

A fixed point is an element i for which σ(i) = i. Fixed points stay unchanged under the permutation and help reveal identity-like behavior.

6. What does even or odd parity mean?

Parity tells whether a permutation can be built from an even or odd number of swaps. This property is important in algebra, determinants, and sign calculations.

7. Can I use repeated values in a permutation row?

No. A valid permutation must use every integer from 1 through n exactly once. Repeated or missing values make the row invalid.

8. What does the graph show?

The graph compares how each element maps under σ, τ, σ ∘ τ, and τ ∘ σ. It gives a quick visual check of how the outputs differ.

Related Calculators

stabilizer calculatorpower of elementimage of homomorphismgroup extension calculatorfinite group ordersymmetric group calculatordihedral group calculatorcayley table generatorinverse element calculatorpermutation order calculator

Important Note: All the Calculators listed in this site are for educational purpose only and we do not guarentee the accuracy of results. Please do consult with other sources as well.