TheoremBase

Every Permutation is a Product of Adjacent Transpositions

Statement

Let n∈Nn\in\mathbb{N}, and let σ∈Sn\sigma\in S_n be a permutation in the sense of Permutation of the Set {1,…,r}\{1,\dots,r\}. For each r∈{1,…,n−1}r\in\{1,\dots,n-1\}, define the adjacent transposition τr∈Sn\tau_r\in S_n by

τr(r)=r+1,τr(r+1)=r,\tau_r(r)=r+1,\qquad \tau_r(r+1)=r,

and τr(m)=m\tau_r(m)=m for every m∈{1,…,n}∖{r,r+1}m\in\{1,\dots,n\}\setminus\{r,r+1\}. Then there exist an integer N≥0N\ge 0 and indices r1,…,rN∈{1,…,n−1}r_1,\dots,r_N\in\{1,\dots,n-1\} such that

σ=τr1∘⋯∘τrN.\sigma=\tau_{r_1}\circ\cdots\circ\tau_{r_N}.

Proofs

Log in to submit a proof.

Loading...

Citations

Loading…

Dependencies

Loading…

Related

0 relations

Curated associations between results. These are editable and subjective — they do not replace the dependency graph, which is derived from the references in the text.

No relations recorded yet.

Comments

Log in to comment.

Loading…