Which states are reachable by face turns alone? Exactly these three constraints determine it:
Each constraint forbids one physically intuitive move. You cannot twist a single corner (violates 1), flip a single edge (violates 2), or swap two edges without disturbing corners (violates 3). Popping the cube apart and reassembling it sidesteps these — 12 parallel "alternate universes" of unreachable states.
Every legal cube state satisfies three constraints. Manually break any one and the state is unreachable — no sequence of face turns can produce it.
Claim: applying any generator preserves .
Verify on the 6 generators:
So every generator preserves , and so does any finite product.
Claim: is preserved.
U, D, R, L do not affect any edge's EO (their stickers stay on the same {U/D, L/R} pair). F and B each flip 4 edges, contributing . ✓
Every generator gives , so is a G-invariant.
Claim: is preserved.
Each face turn cycles 4 corners (a 4-cycle in ) and 4 edges (a 4-cycle in ). A 4-cycle factors into 3 transpositions, so .
Therefore every generator flips and simultaneously. Their ratiostays constant. ✓
Together these three proofs pin G's location inside the free assembly group . The converse — that every state satisfying these three constraints is reachable — is usually established constructively: any working solver is itself a proof of reachability.
From a more abstract angle: the three conservation laws are precisely the obstruction classes in the first group cohomology when viewing the "free assembly space" as an Abelian extension.
We verified things combinatorially, but the same conclusion drops out of the cohomology-vanishing statement "the six generators all sum to 0 in ℤ/3." This is why "cube invariants," "planar-graph colorings," "topological indices," and "Stiefel–Whitney classes" are siblings in the same abstract family.
Three tables — for each generator, all three invariant increments vanish modulo the relevant base.
| Gen | |||
|---|---|---|---|
| U | 0 | 0 | +1 |
| D | 0 | 0 | +1 |
| R | 1+2+1+2 = 6 ≡ 0 | 0 | (−1)(−1) = +1 |
| L | 6 ≡ 0 | 0 | +1 |
| F | 6 ≡ 0 | 4 ≡ 0 | +1 |
| B | 6 ≡ 0 | 4 ≡ 0 | +1 |
Each row directly verifies "this face turn preserves the invariant." Since G is generated by the six face turns, every element does — an automated form of the proofs in §5.1–5.3.