 i.e.If M is a matrix representing a particular Ghost Leg, then M"n"=I for some finite "n".For any Ghost Leg with matrix representation M, there exists a Ghost Leg with representation M−1,
such that M M−1=I

As each leg exchanges the two neighboring elements at its ends, the number of legs indicates the odd/even permutation property of the Ghost Leg.