Kunze Linear Algebra · Problem 5.3.9

Determinants

Mathematics — Methods · permutations-linear-operators

Problem

Let nn be a positive integer and FF a field. If σ\sigma is a permutation of degree nn, prove that the function T(x1,…,xn)=(xσ1,…,xσn)T(x_1, \ldots, x_n) = (x_{\sigma 1}, \ldots, x_{\sigma n}) is an invertible linear operator on FnF^n.
Intuitive explanation

The key insight is recognizing that permuting coordinates is fundamentally a rearrangement—it's reversible by construction. To prove TT is invertible, you need to show it's linear (respects addition and scalar multiplication) and bijective (one-to-one and onto). Linearity follows directly from how permutations distribute over coordinate operations. Bijectivity comes from the fact that σ\sigma itself is a permutation, so applying the inverse permutation σ−1\sigma^{-1} recovers the original vector—this inverse map is your explicit inverse operator.

Intuitive explanation

The key insight is recognizing that permuting coordinates is fundamentally a rearrangement—it's reversible by construction. To prove TT is invertible, you need to show it's linear (respects addition and scalar multiplication) and bijective (one-to-one and onto). Linearity follows directly from how permutations distribute over coordinate operations. Bijectivity comes from the fact that σ\sigma itself is a permutation, so applying the inverse permutation σ−1\sigma^{-1} recovers the original vector—this inverse map is your explicit inverse operator.

Related theory

Browse the problem library