A permutation is given as a list of cycles (or a reordered list) of the generators and it is checked that it induces a map from L to L. If it is true then the map is given as output, otherwise an error message is displayed.
i1 : L=holonomyLie{{a0,a1,a2},{a0,a3,a4},{a1,a3,a5},{a2,a4,a5}} o1 = L o1 : LieAlgebra |
i2 : symmetryLie{{a5,a0},{a1,a2,a4,a3}} o2 = MapLie{...8...} o2 : MapLie |
i3 : peekLie oo o3 = MapLie{a0 => a5 } a1 => a2 a2 => a4 a3 => a1 a4 => a3 a5 => a0 sourceLie => L targetLie => L |
i4 : symmetryLie{a5,a4,a3,a2,a1,a0} the map is not welldefined |