Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Permutation
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
===Parity of a permutation=== {{main|Parity of a permutation}} Every permutation of a finite set can be expressed as the product of transpositions.<ref>{{harvnb|Hall|1959|p=60}}</ref> Although many such expressions for a given permutation may exist, either they all contain an even number of transpositions or they all contain an odd number of transpositions. Thus all permutations can be classified as [[Even and odd permutations|even or odd]] depending on this number. This result can be extended so as to assign a ''sign'', written <math>\operatorname{sgn}\sigma</math>, to each permutation. <math>\operatorname{sgn}\sigma = +1</math> if <math>\sigma</math> is even and <math>\operatorname{sgn}\sigma = -1</math> if <math>\sigma</math> is odd. Then for two permutations <math>\sigma</math> and <math>\pi</math> : <math>\operatorname{sgn}(\sigma\pi) = \operatorname{sgn}\sigma\cdot\operatorname{sgn}\pi.</math> It follows that <math>\operatorname{sgn}\left(\sigma\sigma^{-1}\right) = +1.</math> The sign of a permutation is equal to the determinant of its permutation matrix (below).
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)