contents
§5

Three invariants (reachability conditions)

Which states are reachable by face turns alone? Exactly these three constraints determine it:

Theorem 5.1 — first law of cubology
A state is reachable (i.e. lies in G) if and only if all three hold:
(1)
total corner twist conserved
(2)
total edge flip conserved
(3)
corner-edge parity coupling

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.

Interactive § Three invariants

Every legal cube state satisfies three constraints. Manually break any one and the state is unreachable — no sequence of face turns can produce it.

twist corner 0flip edge 0swap two edges
Σ co (mod 3)
0
Σ eo (mod 2)
0
sgn(cp)
+1
sgn(ep)
+1
✓ Reachable — this state is in G

5.1 Proof: corner orientation sum is conserved

Proof

Claim: applying any generator preserves .

Verify on the 6 generators:

  • U, D: these cycle the four U-layer (or D-layer) corners while keeping the U-coloured sticker on the U/D face. So all four . ✓
  • R, L: R cycles four corners. URF → UBR: U sticker rotates "up" → "front-up", . UBR → DRB: "up" → "right", . By symmetry DRB → DFR = , DFR → URF = . Total: . ✓
  • F, B: similarly each contributes . ✓

So every generator preserves , and so does any finite product.

5.2 Proof: edge orientation sum is conserved

Proof

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.

5.3 Proof: corner-edge parity coupling

Proof

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.

Corollary 5.4
The "free assembly space" / G is a 12-element quotient group:Each cell of the quotient is one "disassembly-only" anomaly: extra CO twist (ℤ/3), extra EO flip (ℤ/2), wrong parity (ℤ/2). That is precisely why a popped-and-rebuilt cube falls into one of 12 "parallel universes", most of which cannot be solved by face turns.

5.4 Conservation laws as cohomology constraints

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.

5.5 Per-generator verification table

Three tables — for each generator, all three invariant increments vanish modulo the relevant base.

Gen
U00+1
D00+1
R1+2+1+2 = 6 ≡ 00(−1)(−1) = +1
L6 ≡ 00+1
F6 ≡ 04 ≡ 0+1
B6 ≡ 04 ≡ 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.

cuberoot.me · Rubik's Cube as a Group · 2026