There is a problem on Invariance in Arthur Engel's Problem Solving Strategies.
Problem: The following operation is performed with a nonconvex non-self-intersecting polygon P. Let A,B be two nonneighboring vertices. Suppose P lies on the same side of AB. Reflect one part of the polygon connecting A with B at the midpoint O of AB. Prove that the polygon becomes convex after finitely many such reflections.
My Attempt: I could easily see that perimeter, the length of the sides are both invariant while the area of the polygon always increased. But then I thought that the order of the sides changes in each step. So I could not convince myself that I had solved it. I saw Engel's solution.
Solution from Engel's book: The permissible transformations leave the sides of the polygon and their directions invariant. Hence, there are only a finite number of polygons. In addition, the area strictly increases after each reflection. So the process is finite.
Remark. The corresponding problem for line reflections in AB is considerably harder. The theorem is still valid, but the proof is no more elementary. The sides still remain the same, but their direction changes. So the finiteness of the process cannot be easily deduced. (In the case of line reflections, there is a conjecture that 2n reflections suffice to reach a convex polygon.)
My Doubt: It should be that the line reflection preserves the order while the reflection about the midpoint of AB changes the order.
Is'nt that true? Please help me understand.
Edit: I found this website where they define reflection about midpoint O of AB as a "flipturn". It is clearly stated in proof of "Joss and Shannon's 2nd Theorem" that in a flipturn, "sides differ only by their cyclic order". Doesn't this confirm that order is indeed different when reflected about O?