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

Permutations and Bijective Transformations

A permutation is a bijective mapping from a set onto itself, rearranging its elements without repetition or omission.

Explanation

A permutation of a set is a bijective transformation from the set to itself. A function is bijective when it is both injective and surjective. Injectivity ensures that distinct elements have distinct images, while surjectivity ensures that every element in the target set is reached. For a finite set, a permutation rearranges its elements. Every permutation has an inverse permutation, and permutations can be composed to produce other permutations. These properties make permutations suitable for forming groups under composition.

Example or application

A worked example has not yet been added.

Definition

A permutation of a set X is a bijection σ: X → X.

Key Properties

  • Every element has exactly one image.

  • Different elements have different images.

  • Every element of the set appears as an image.

  • Every permutation has an inverse.

  • The composition of two permutations is another permutation.

  • The identity mapping is a permutation.

Examples

SetMappingResult

{1, 2, 3}

σ(1) = 2, σ(2) = 3, σ(3) = 1

This is a permutation because every element appears exactly once as an image.

{1, 2, 3}

f(1) = 1, f(2) = 1, f(3) = 2

This is not a permutation because it is not injective and does not reach 3.

Applications

  • Rearranging objects and positions.

  • Solving problems involving symmetry.

  • Representing transformations in combinatorics.

  • Modeling rearrangements in computer science.

Common Mistakes

  • Assuming every function from a set to itself is a permutation.

  • Checking injectivity but not surjectivity.

  • Confusing a permutation with a subset or selection.

Related Concepts

  • Bijective Function

  • Symmetric Group

  • Cycle Notation

  • Composition of Permutations

  • Inverse of a Permutation

Learning Outcomes

  • Define a permutation as a bijection.

  • Determine whether a mapping is a permutation.

  • Explain why permutations have inverses.

  • Recognize composition as an operation on permutations.

Learning Guide

Core Idea

A permutation is a bijective mapping from a set onto itself, rearranging its elements without repetition or omission.

Worked Example

Set: {1, 2, 3}
Mapping: σ(1) = 2, σ(2) = 3, σ(3) = 1
Result: This is a permutation because every element appears exactly once as an image.

Set: {1, 2, 3}
Mapping: f(1) = 1, f(2) = 1, f(3) = 2
Result: This is not a permutation because it is not injective and does not reach 3.

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 permutations and bijective transformations?

A permutation is a bijective mapping from a set onto itself, rearranging its elements without repetition or omission.

What definition, condition, or property should you check first when solving a problem about permutations and bijective transformations?

Start by checking the relevant defining properties: Every element has exactly one image; Different elements have different images; Every element of the set appears as an image; Every permutation has an inverse. Verify every required hypothesis before applying a theorem.

How is permutations and bijective transformations connected to the wider study of abstract algebra?

It belongs to Permutation groups. It connects naturally with Bijective Function, Symmetric Group, Cycle Notation, Composition of Permutations.

Mastery Checklist

  • I can state the definition of permutations and bijective transformations 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.

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