I think the simplest way to describe parity is by doing a J-Perm on a 2x2x2. You should now have 2 corners swapped.
On 3x3x3 this would be an impossible position
On 2x2x2 you can just do a U or U' and now you have a 3-cycle of corners left.
Try to think about this example for a while.
Sorry, but I really don't get the message you're trying to convey

Can you make it a little clearer?
Hint: Parity has to do with even cycles. What does a U or U' turn do?
I'm really confused now :confused: I always thought what I thought was true was true... Now I'm starting to get confused.
I really have no idea what you meant by "to describe parity". I know what you're talking about in the whole example, I've thought about it for a while, but no, I still don't see where the "description of parity" is, I can't seem to pinpoint that description in your example

In fact, I don't even know what parity is. I always thought I knew. Now I realize all I know is odd parity and even parity, but I don't know what parity itself means.
Here's how I understand odd and even permutation parities:
When a quarter turn is done on any face of the cube, the corners can be solved by a 4-cycle, same goes for the edges. A 4-cycle can be seen as 3 2-cycles, hence permutation parity for corners is odd since they can be solved by an odd number of 2-cycles (3), permutation parity for edges is also odd (3). The sum of parities, however, is even (6).
When a half turn is done on any face of the cube, the corners can be solved by either (a) 2 3-cycles, or (b) 2 2-cycles, same goes for the edges. (a) 2 3-cycles can be seen as 4 2-cycles, (b) 2 2-cycles
are 2 2-cycles, so either way, permutation parity for corners is even since they can be solved by an even number of 2-cycles (4 or 2), permutation parity for edges is also even (4 or 2). The sum of parities is even too.
(On a solved cube, the corners can be solved with a 0-cycle, same goes for the edges. A 0-cycle can be seen as 0 2-cycles, hence permutation parity for corners can is even (0), permutation parity for edges is also even (0). The sum of parities is even (0).)
So we can see that the sum of the permutation parities of corners and edges must be even on a legal cube. However, the respective permutation parities of corners and edges are not necessarily even. The odd-/even-ness of the permutation parity of each piece type (corners/edges) is "toggled" with every quarter turn applied to the cube, hence a cube scrambled with an even number of quarter turns can only be solved with an even number of quarter turns, same goes for odd.
Since there are no edges on a 2x2x2, the permutation parity of the corners can be odd or even depending on the odd-/even-ness of the "invisible edges", i.e. the sum of the permutation parities of the corners and the "invisible edges" must still be even.
I hope this is right because this is what I thought was right all along. But I don't see the connection between this and the example you provided
