Home
Algebra
Math Formulas
Everyday Math
Calculus
FREE e-Books
Geometry
Basic Statistics
Contact
Exclusive Topics
Basic Mathematics
Basic Algebra
Algebra
Everyday Math
Geometry
Trigonometry
Calculus
Business Math
Basic Statistics
Linear Programming
 
Other Math Links
Math Results And Formulas
Free Math E Books
History Of Mathematics
 
Higher Mathematics
Real Analysis
Group Theory
General Topology
 
» Home » Group Theory »

Inverse of Permutations

            Iff be a permutation of degreen, defined on a finite setS consisting of n distinct elements, by definitionf is a one-one mapping ofS onto itself. Sincef is one-one onto, it is invertible. Letf^-1 be the inverse of mapf then f^-1 will also be one-one map ofS onto itself. Thus,f^-1 is also a permutation of degreen onS. Thisf^-1 is known as the inverse of the permutationf.



            Thus if
            Then
Note: Evidentlyf^-1 is obtained by interchanging the rows off because etc.  




Join Us on Facebook Follow Us on Twitter


© emathzone 2008-2012