Faces, flags, and the symmetry of a shape [frap-0008]
✍️source

    A local turn needs a shape-level answer to two questions: which faces are incident, and which symmetries preserve those incidences? An abstract polytope retains the incidence of vertices, edges and faces without prescribing distances or angles. Schulte's flag formulation [schulte2017regular, Section 2] leads from these incidences to symmetries and to the extension of a facet symmetry used in local puzzle moves.

    Definition 1. Abstract polytopes and flags [schulte2017regular, Section 2] [frap-000D]

      An abstract \(n\)-polytope, for \(n\geq 0\), is a partially ordered set \(P\) of faces with a least face \(F_{-1}\) and greatest face \(F_n\). Every chain extends to a maximal chain, called a flag, with exactly \(n+2\) faces. Faces in each flag have ranks \(-1,0,\ldots ,n\), consistently across flags. Faces other than the least and greatest are proper; vertices, edges and facets have ranks \(0,1,n-1\).

      The diamond condition requires exactly two faces of rank \(i\) between faces \(F<G\) of ranks \(i-1\) and \(i+1\), for \(0\leq i<n\). Two flags are adjacent if they differ in exactly one proper face. Strong flag connectivity requires any two flags to be joined by adjacent flags, each containing their intersection.

      Thus, for each \(0\leq i<n\), each flag has a unique adjacent flag differing in rank \(i\). Strong flag connectivity restricts paths to these adjacent flags, each containing the endpoint flags' intersection; arbitrary paths through the least face would connect every pair without imposing an axiom. These conditions prescribe incidence without choosing lengths or angles.

      A rank-zero polytope is a two-element chain. A rank-one polytope has two vertices between its least and greatest faces. These low-rank cases occur as sections of higher-rank polytopes.

      Definition 2. Sections and vertex figures [schulte2017regular, Section 2] [frap-000E]

        Let \(P\) be a abstract polytope. For faces \(F\leq G\) of ranks \(i,j\), its section \(G/F\) is the interval \(\{H:F\leq H\leq G\}\), with ranks shifted so that \(F\) has rank \(-1\). For \(F<G\), it is an abstract polytope of rank \(j-i-1\geq 0\). For \(F=G\), the singleton section is called the rank-\(-1\) polytope. These low ranks allow all intervals, including vertex figures of polygons and intervals between consecutive faces.

        The section \(F_n/v\) at a vertex \(v\) is its vertex figure. Its vertices are the edges through \(v\); its faces record the incidences above \(v\). A facet \(H\) is viewed as the section \(H/F_{-1}\).

        Example 3. Flags of a triangle and a tetrahedron [frap-000F]

          The face-poset construction of [schulte2017regular, Section 2] gives the following elementary examples of flags. A triangle has the empty face, three vertices, three edges and the whole triangle, of ranks \(-1,0,1,2\). The flag \(\varnothing <1<12<123\) has rank-zero neighbor \(\varnothing <2<12<123\) and rank-one neighbor \(\varnothing <1<13<123\). There are \(3\cdot 2=6\) flags.

          Each vertex in this flag graph records the vertex and edge of one flag; the common empty and greatest faces are suppressed. Edge labels give the rank changed by adjacency.

          A tetrahedron has all subsets of \(\{1,2,3,4\}\) as faces, ordered by inclusion; a nonempty face with \(k\) vertices has rank \(k-1\). Its flag \(\varnothing <1<12<123<1234\) exhibits all five ranks. The vertex figure at \(1\) is a triangle: its vertices correspond to the three incident edges. A cube also has a triangular vertex figure, although its facets are squares. Local and global shapes carry different information.

          The triangle and tetrahedron calculation now supplies a concrete check: the flag graph records which flags are adjacent; a vertex figure records the local neighborhood seen from one vertex. With those objects in hand, the next steps ask which incidence-preserving maps act on all flags and how a symmetry of one facet can be extended.

          Definition 4. Automorphisms and regularity [schulte2017regular, Section 2] [frap-000G]

            An automorphism of a abstract polytope \(P\) is a bijection \(a:P\to P\) satisfying \(F\leq G\iff a(F)\leq a(G)\). Automorphisms form a group \(\Gamma (P)\) under composition; in \(ab\), the map \(b\) acts first. They preserve ranks and act on flags face by face.

            The polytope is regular if this action is transitive on flags. The tetrahedron is regular: a permutation of its four vertices sends any flag to any other.

            The underlying order automorphism is represented by OrderIso with equal source and target. This declaration does not impose the polytope axioms or assert regularity.

            Lemma 5. A flag determines an automorphism [schulte2017regular, Section 2, p. 4] [frap-000H]

              An automorphism of an abstract polytope fixing every face of one flag is the identity. Consequently the automorphism group of a regular polytope acts freely and transitively on its flags.

              The cited paragraph preceding Lemma 2.1 states simple transitivity for regular polytopes. The elementary argument below also proves freeness without assuming regularity.

              Proof. 

                For a flag adjacent to a pointwise fixed flag, only one rank has changed. The unchanged neighboring ranks bound a diamond condition with two possible faces. One is fixed, so the other is fixed too. The adjacent flag is therefore fixed pointwise. Propagating along the connected flag graph fixes every flag. Every face belongs to a flag, so every face is fixed. Transitivity is the definition of being regular.

                Remark 6. Distinguished generators and the intersection property [frap-000I]

                  Choose a base flag \(\Phi \) in a regular abstract polytope \(P\) of rank \(n\). By flag freeness, there is a unique automorphism \(\rho _i\) taking \(\Phi \) to its rank-\(i\) neighbor, for \(0\leq i<n\). The diamond condition and uniqueness give \(\rho _i^2=1\). For \(|i-j|>1\), the two rank changes are independent; \(\rho _i\rho _j\) and \(\rho _j\rho _i\) agree on \(\Phi \), hence are equal. Connectivity shows that the \(\rho _i\) reach every flag, so they generate \(\Gamma (P)\). These are the distinguished generators of [schulte2017regular, Section 5, pp. 13--14].

                  For \(I\subseteq \{0,\ldots ,n-1\}\), put \(G_I=\langle \rho _i:i\in I\rangle \). They also satisfy

                  \[G_I\cap G_J=G_{I\cap J}.\]

                  This intersection property is part of the string C-group description [schulte2017regular, Section 5, equation (18)]. Involution and nonadjacent commutation relations alone do not reconstruct a polytope; the group-theoretic characterization includes this additional condition [schulte2017regular, Section 5, p. 14].

                  Lemma 7. Extending a symmetry of one facet [frap-000J]

                    Let \(H\) be a facet of a regular abstract polytope \(P\) of rank \(n\geq 2\). Restriction gives an isomorphism

                    \[\operatorname {Stab}_{\Gamma (P)}(H)\cong \Gamma (H/F_{-1}).\]

                    In particular the facet is regular, and each of its automorphisms has a unique extension fixing \(H\). This is a consequence of the flag action in [schulte2017regular, Section 2 and Lemma 2.1]; the argument follows.

                    Proof. 

                      Extend a flag of the facet section by the greatest face of \(P\). A stabilizer element restricting to the identity fixes this whole flag and is the identity by flag freeness. Restriction is therefore injective.

                      Given a facet automorphism \(\alpha \), the regular action supplies an automorphism of \(P\) taking the extended flag to the extension of its image under \(\alpha \). It fixes \(H\). Its restriction agrees with \(\alpha \) on the chosen facet flag, so flag freeness in the facet makes these restrictions equal. This proves surjectivity. The same use of same regular action with any two facet flags shows that the facet is regular.

                      References

                        Reference. Regular Incidence Complexes, Polytopes, and C-Groups [schulte2017regular]

                        @misc{schulte2017regular,
 title = {Regular Incidence Complexes, Polytopes, and C-Groups},
 author = {Schulte, Egon},
 year = {2017},
 archiveprefix = {arXiv},
 eprint = {1711.02297},
 primaryclass = {math.CO},
 url = {https://arxiv.org/abs/1711.02297v1}
}

                        Context

                          From incidence to moves [frap-0002]

                            To describe a puzzle move without committing to coordinates, we need an incidence record that says which pieces and labels belong together. Faces and incidence define an abstract polytope without choosing lengths or an embedding [schulte2017regular, Section 2]. Regularity supplies shape symmetries; the Rubik construction applies facet rotations locally to incidence positions [marchetti2025rubik, Definitions 5--6]. The sections below first make the shape visible in triangle and tetrahedron examples, then build this action and calculate its tetrahedron and cube consequences.

                            Faces, flags, and the symmetry of a shape [frap-0008]
                            ✍️source

                              A local turn needs a shape-level answer to two questions: which faces are incident, and which symmetries preserve those incidences? An abstract polytope retains the incidence of vertices, edges and faces without prescribing distances or angles. Schulte's flag formulation [schulte2017regular, Section 2] leads from these incidences to symmetries and to the extension of a facet symmetry used in local puzzle moves.

                              Definition. Abstract polytopes and flags [schulte2017regular, Section 2] [frap-000D]

                                An abstract \(n\)-polytope, for \(n\geq 0\), is a partially ordered set \(P\) of faces with a least face \(F_{-1}\) and greatest face \(F_n\). Every chain extends to a maximal chain, called a flag, with exactly \(n+2\) faces. Faces in each flag have ranks \(-1,0,\ldots ,n\), consistently across flags. Faces other than the least and greatest are proper; vertices, edges and facets have ranks \(0,1,n-1\).

                                The diamond condition requires exactly two faces of rank \(i\) between faces \(F<G\) of ranks \(i-1\) and \(i+1\), for \(0\leq i<n\). Two flags are adjacent if they differ in exactly one proper face. Strong flag connectivity requires any two flags to be joined by adjacent flags, each containing their intersection.

                                Thus, for each \(0\leq i<n\), each flag has a unique adjacent flag differing in rank \(i\). Strong flag connectivity restricts paths to these adjacent flags, each containing the endpoint flags' intersection; arbitrary paths through the least face would connect every pair without imposing an axiom. These conditions prescribe incidence without choosing lengths or angles.

                                A rank-zero polytope is a two-element chain. A rank-one polytope has two vertices between its least and greatest faces. These low-rank cases occur as sections of higher-rank polytopes.

                                Definition. Sections and vertex figures [schulte2017regular, Section 2] [frap-000E]

                                  Let \(P\) be a abstract polytope. For faces \(F\leq G\) of ranks \(i,j\), its section \(G/F\) is the interval \(\{H:F\leq H\leq G\}\), with ranks shifted so that \(F\) has rank \(-1\). For \(F<G\), it is an abstract polytope of rank \(j-i-1\geq 0\). For \(F=G\), the singleton section is called the rank-\(-1\) polytope. These low ranks allow all intervals, including vertex figures of polygons and intervals between consecutive faces.

                                  The section \(F_n/v\) at a vertex \(v\) is its vertex figure. Its vertices are the edges through \(v\); its faces record the incidences above \(v\). A facet \(H\) is viewed as the section \(H/F_{-1}\).

                                  Example. Flags of a triangle and a tetrahedron [frap-000F]

                                    The face-poset construction of [schulte2017regular, Section 2] gives the following elementary examples of flags. A triangle has the empty face, three vertices, three edges and the whole triangle, of ranks \(-1,0,1,2\). The flag \(\varnothing <1<12<123\) has rank-zero neighbor \(\varnothing <2<12<123\) and rank-one neighbor \(\varnothing <1<13<123\). There are \(3\cdot 2=6\) flags.

                                    Each vertex in this flag graph records the vertex and edge of one flag; the common empty and greatest faces are suppressed. Edge labels give the rank changed by adjacency.

                                    A tetrahedron has all subsets of \(\{1,2,3,4\}\) as faces, ordered by inclusion; a nonempty face with \(k\) vertices has rank \(k-1\). Its flag \(\varnothing <1<12<123<1234\) exhibits all five ranks. The vertex figure at \(1\) is a triangle: its vertices correspond to the three incident edges. A cube also has a triangular vertex figure, although its facets are squares. Local and global shapes carry different information.

                                    The triangle and tetrahedron calculation now supplies a concrete check: the flag graph records which flags are adjacent; a vertex figure records the local neighborhood seen from one vertex. With those objects in hand, the next steps ask which incidence-preserving maps act on all flags and how a symmetry of one facet can be extended.

                                    Definition. Automorphisms and regularity [schulte2017regular, Section 2] [frap-000G]

                                      An automorphism of a abstract polytope \(P\) is a bijection \(a:P\to P\) satisfying \(F\leq G\iff a(F)\leq a(G)\). Automorphisms form a group \(\Gamma (P)\) under composition; in \(ab\), the map \(b\) acts first. They preserve ranks and act on flags face by face.

                                      The polytope is regular if this action is transitive on flags. The tetrahedron is regular: a permutation of its four vertices sends any flag to any other.

                                      The underlying order automorphism is represented by OrderIso with equal source and target. This declaration does not impose the polytope axioms or assert regularity.

                                      Lemma. A flag determines an automorphism [schulte2017regular, Section 2, p. 4] [frap-000H]

                                        An automorphism of an abstract polytope fixing every face of one flag is the identity. Consequently the automorphism group of a regular polytope acts freely and transitively on its flags.

                                        The cited paragraph preceding Lemma 2.1 states simple transitivity for regular polytopes. The elementary argument below also proves freeness without assuming regularity.

                                        Proof. 

                                          For a flag adjacent to a pointwise fixed flag, only one rank has changed. The unchanged neighboring ranks bound a diamond condition with two possible faces. One is fixed, so the other is fixed too. The adjacent flag is therefore fixed pointwise. Propagating along the connected flag graph fixes every flag. Every face belongs to a flag, so every face is fixed. Transitivity is the definition of being regular.

                                          Remark. Distinguished generators and the intersection property [frap-000I]

                                            Choose a base flag \(\Phi \) in a regular abstract polytope \(P\) of rank \(n\). By flag freeness, there is a unique automorphism \(\rho _i\) taking \(\Phi \) to its rank-\(i\) neighbor, for \(0\leq i<n\). The diamond condition and uniqueness give \(\rho _i^2=1\). For \(|i-j|>1\), the two rank changes are independent; \(\rho _i\rho _j\) and \(\rho _j\rho _i\) agree on \(\Phi \), hence are equal. Connectivity shows that the \(\rho _i\) reach every flag, so they generate \(\Gamma (P)\). These are the distinguished generators of [schulte2017regular, Section 5, pp. 13--14].

                                            For \(I\subseteq \{0,\ldots ,n-1\}\), put \(G_I=\langle \rho _i:i\in I\rangle \). They also satisfy

                                            \[G_I\cap G_J=G_{I\cap J}.\]

                                            This intersection property is part of the string C-group description [schulte2017regular, Section 5, equation (18)]. Involution and nonadjacent commutation relations alone do not reconstruct a polytope; the group-theoretic characterization includes this additional condition [schulte2017regular, Section 5, p. 14].

                                            Lemma. Extending a symmetry of one facet [frap-000J]

                                              Let \(H\) be a facet of a regular abstract polytope \(P\) of rank \(n\geq 2\). Restriction gives an isomorphism

                                              \[\operatorname {Stab}_{\Gamma (P)}(H)\cong \Gamma (H/F_{-1}).\]

                                              In particular the facet is regular, and each of its automorphisms has a unique extension fixing \(H\). This is a consequence of the flag action in [schulte2017regular, Section 2 and Lemma 2.1]; the argument follows.

                                              Proof. 

                                                Extend a flag of the facet section by the greatest face of \(P\). A stabilizer element restricting to the identity fixes this whole flag and is the identity by flag freeness. Restriction is therefore injective.

                                                Given a facet automorphism \(\alpha \), the regular action supplies an automorphism of \(P\) taking the extended flag to the extension of its image under \(\alpha \). It fixes \(H\). Its restriction agrees with \(\alpha \) on the chosen facet flag, so flag freeness in the facet makes these restrictions equal. This proves surjectivity. The same use of same regular action with any two facet flags shows that the facet is regular.

                                                Turning a facet into a puzzle move [frap-0009]

                                                  Once the shape symmetries are known, the next question is local: how can a turn change only the positions incident to one chosen facet while carrying their labels along? A facet rotation extends to a symmetry of the whole shape, but a puzzle move applies it only at positions incident to the chosen facet. Marchetti's construction retains both entries of each incidence pair [marchetti2025rubik, Definitions 5--6]. We use finite regular abstract polytopes of rank at least three; the extension lemma itself does not require finiteness.

                                                  Definition. The rotation subgroup [marchetti2025rubik, Definition 4] [frap-000K]

                                                    Let \(Q\) be a regular abstract polytope of rank \(m\geq 2\). Choose a base flag and its distinguished generators (involutions) \(\rho _0,\ldots ,\rho _{m-1}\). Its rotation subgroup is

                                                    \[\Gamma ^+(Q)=\langle \rho _{j-1}\rho _j:1\leq j<m\rangle .\]

                                                    The index starts at \(1\): for a polygon, the single adjacent pair \(\rho _0\rho _1\) generates its rotations. For triangles and squares these are the usual cyclic rotation groups.

                                                    Equivalently, \(\Gamma ^+(Q)\) consists of the elements represented by even-length words in the distinguished involutions. Indeed every pair \(\rho _i\rho _j\) is a product of adjacent pairs or their inverses, by cancellation along the index interval. Conjugating an even word by a distinguished involution again gives an even word, so this subgroup is normal. A change of base flag conjugates the distinguished generators and therefore leaves the subgroup unchanged. We do not require it to have index two for every abstract polytope.

                                                    Definition. Incidence positions and facet moves [marchetti2025rubik, Definitions 5--6] [frap-000L]

                                                      Let \(P\) be a finite regular abstract polytope of rank \(n\geq 3\), with least and greatest faces \(F_{-1},F_n\). Write \(P^\circ =P\setminus \{F_{-1},F_n\}\). The incidence positions are

                                                      \[\mathcal R(P)=\{(F,G)\in P^\circ \times P^\circ :F\leq G\}.\]

                                                      Choose a facet \(H\) and an element \(\alpha \) of the rotation subgroup \(\Gamma ^+(H/F_{-1})\). The facet extension lemma gives its unique extension \(\widehat \alpha \in \Gamma (P)\) fixing \(H\). The corresponding facet move is

                                                      \[\mu _{H,\alpha }(F,G)= \begin {cases} (\widehat \alpha (F),\widehat \alpha (G)),&F\leq H,\\ (F,G),&F\not \leq H. \end {cases}\]

                                                      The first entry decides where the shape automorphism is applied; the second entry is transported with it. The facet is part of the move's name: one shape automorphism may stabilize several facets and give different local moves. Each move is a permutation of \(\mathcal R(P)\).

                                                      Lemma. The inverse of a facet move [frap-000M]

                                                        Let \(P\) be a finite regular abstract polytope of rank \(n\geq 3\), \(H\) a facet and \(\alpha \in \Gamma ^+(H/F_{-1})\) a facet rotation. The facet move \(\mu _{H,\alpha }\) is a permutation of \(\mathcal R(P)\), with

                                                        \[\mu _{H,\alpha }^{-1}=\mu _{H,\alpha ^{-1}}.\]

                                                        This follows directly from the construction in [marchetti2025rubik, Definitions 5--6].

                                                        Proof. 

                                                          An automorphism preserves proper faces and the order relation, so the moving branch remains in \(\mathcal R(P)\). Since \(\widehat \alpha (H)=H\), the condition \(F\leq H\) holds exactly when \(\widehat \alpha (F)\leq H\). Thus the moving and fixed subsets are preserved separately. On the moving subset the extension of \(\alpha ^{-1}\) is \(\widehat \alpha ^{-1}\) by uniqueness, and cancels the first map. On the fixed subset both maps are the identity.

                                                          The general construction combining permutations of complementary subsets is Equiv.Perm.subtypeCongr; its inverse formula is Equiv.Perm.subtypeCongr.symm. Here the predicate is \(F\leq H\), the moving permutation is the restricted shape automorphism and the other permutation is the identity. These declarations supply that general combination; the polytope-specific preservation argument is the proof above.

                                                          The inverse lemma makes the local action reversible. The tetrahedron calculation that follows is a small witness for why the facet is part of a move's identity: two locally valid turns can act differently on the same incidence record and need not commute.

                                                          Example. Two turns of a tetrahedron [frap-000O]

                                                            Represent the faces of a tetrahedron by subsets of \(\{1,2,3,4\}\). We calculate facet moves from [marchetti2025rubik, Definitions 5--6]. For the facet \(H=123\), take an element of the rotation subgroup with global extension \(\widehat \alpha =(123)\), fixing \(4\). The vertex-edge records follow the cycle

                                                            \[(1,12)\longmapsto (2,23)\longmapsto (3,13)\longmapsto (1,12).\]

                                                            Every arrow is the local move \(\mu _{H,\alpha }\). The record \((4,14)\) stays fixed because \(4\not \leq H\), although the global shape symmetry sends it to \((4,24)\). The diagram records this permutation of incidence positions, rather than the tetrahedron's face graph.

                                                            For records whose second entry is a facet, the same move gives

                                                            \[(1,124)\longmapsto (2,234),\qquad (12,124)\longmapsto (23,234),\qquad (4,124)\longmapsto (4,124).\]

                                                            The last record is fixed even though the global symmetry changes its second entry. Now let \(K=124\) and take an element of the rotation subgroup with global extension \(\widehat \beta =(124)\). Applying the \(H\)-move and then the \(K\)-move sends

                                                            \[(1,124)\xrightarrow {\mu _{H,\alpha }}(2,234) \xrightarrow {\mu _{K,\beta }}(4,134).\]

                                                            Reversing their order gives \((1,124)\mapsto (2,124)\mapsto (3,234)\), so the two moves do not commute. Each has order three: its cube is the identity on both branches, and its displayed action is nontrivial.

                                                            The tetrahedron witness motivates the generated move group: reachable labelled configurations are products of these reversible local turns. The ordinary cube calculation then shows how the same definition compares with visible stickers and which data it leaves out.

                                                            Definition. The Rubik group and labelled configurations [frap-000N]

                                                              For a finite regular abstract polytope \(P\) of rank \(n\geq 3\), the Rubik group is the subgroup generated by all facet moves:

                                                              \[\operatorname {Rub}(P)= \langle \mu _{H,\alpha }:H\text { a facet},\quad \alpha \in \Gamma ^+(H/F_{-1})\rangle \leq \operatorname {Sym}(\mathcal R(P)).\]

                                                              This is Marchetti's generated group of permutations [marchetti2025rubik, Section 3, p. 6, following Definition 6]. The inverse lemma ensures that the generators are permutations.

                                                              Give each incidence position its own initial label. A labelled configuration can be represented by the permutation carrying each initial label to its current position. The identity is the solved configuration; the reachable labelled configurations are the elements of \(\operatorname {Rub}(P)\). A new move acts on the left: applying \(\mu \) to configuration \(g\) gives \(\mu g\), with \(g\) acting first. A visible coloring may identify several labelled configurations, so a solved visible coloring need not determine the labelled permutation.

                                                              Example. One ordinary cube face turn [frap-000P]

                                                                Realize the cube as \([-1,1]^3\) and let \(H\) be the facet \(z=1\). The facet move construction of [marchetti2025rubik, Definitions 5--6] gives the following explicit outer-face action. The shape rotation

                                                                \[q(x,y,z)=(y,-x,z)\]

                                                                is a clockwise quarter-turn when viewed from positive \(z\), with \(x\) rightward and \(y\) upward. Its restriction to \(H\) supplies our move. The corner \((1,1,1)\) goes to \((1,-1,1)\), and its color on \(y=1\) goes to the color position on \(x=1\). The corresponding corner at \(z=-1\) is fixed by the puzzle move, although the global map \(q\) moves it.

                                                                The signs give the \(x,y\) coordinates of the four corners on \(z=1\). The arrows show their clockwise motion; the central incidence record \((H,H)\) stays fixed. No orientation of a marked center is recorded.

                                                                Restricting the second entry to facets gives \(8\cdot 3+12\cdot 2+6=54\) incidence positions: three per corner, two per edge and one per face center. The turn moves twelve corner stickers and eight edge stickers, fixing the other thirty-four positions, including the unmarked center of the turned face. This is the usual outer-face action on visible stickers of a \(3\times 3\times 3\) cube in a fixed frame.

                                                                The full incidence set has \(8\cdot 7+12\cdot 3+6=98\) elements: above each vertex are that vertex, three edges and three facets; above each edge are itself and two facets. The facet-colored subset is invariant under every move. Its restricted action supplies the comparison with ordinary stickers; a faithful restriction for all abstract polytopes is not needed. Marked center orientations and inner-layer turns are additional data, absent from this comparison.

                                                                The local action determines which positions participate and how their incident labels travel. Frames and orientation separate this transport into a destination and a local orientation.

                                                                Backlinks

                                                                  How the notes are organized [frap-000C]

                                                                    The developed mathematics follows one practical question: what data must a move carry so that we can later compose moves and test reachability? Incidence, symmetry and moves answers it in order. First, polytopes, flags and facet symmetry describe the shape and show their role in triangle and tetrahedron examples. Next, facet moves turn a local facet rotation into an action on incidence positions, with tetrahedron and cube calculations that make the construction concrete. Only then do positions, orientations and global constraints separate a piece's destination from transport in its local frame, while transfer and the effect of dimension connect that transport with a group homomorphism and compute the relevant local abelianizations.

                                                                    The cube examples above connect the general mathematics with solving and play. The later accounts use those concrete states and moves as their starting point:

                                                                    The transition between the abstract facet action and the fixed-frame cube coordinates is recorded in how the cube models connect. Read it before the all-\(N\) law if the distinction between incidence positions, cubie fibres and observations is new.

                                                                    1. General Rubik puzzles: the incidence actions, framed orientations and transfer developed below.
                                                                    2. The layered-cube family: piece types, layer turns and conventions as \(N\) varies.
                                                                    3. The layered-cube law: all-\(N\) state coordinates and a constructive characterization of reachability.
                                                                    4. The complete three-layer cube: explicit outer generators, impossible states, the standard count and a worked cleanup.
                                                                    5. Human methods and computer search: recognizable cases, algebraic effects, usability, move costs and optimality. The complete layer-first method supplies one full human construction, and computer solving and efficiency supplies exact small search, admissible bounds and subgroup reduction.
                                                                    6. From move sequences to play: notation, scrambling, recognition, replay and complete solves, including the worked replay and projected lower bound.

                                                                    Further connections relate the developed orientation and transfer calculations to label transport and topology and scrambling and search functions. The quotient-compatible move account gives the criterion for an identification of observations to inherit a puzzle action. Together these results compare transport, randomization and information loss around the same concrete move.

                                                                    Five encounters with a cube [frap-001C]

                                                                      Put a solved three-layer cube on a table and turn its right face once. The move is familiar, but it raises concrete puzzles: which labelled pieces moved, why can a visually plausible arrangement be impossible, and how can another person undo the turn without watching the first hand? Begin with these experiences, then introduce only the distinctions needed to explain them.

                                                                      One turn is larger than the visible face

                                                                        The shaded strip is only the visible part of the layer: the same stickers cross the front, right, back, top, and bottom faces; viewed from above, the top-face part is the corresponding rightmost strip. A whole-cube rotation would change the viewing frame, whereas this face move keeps the six centres fixed and changes one layer. The layered-cube family makes this distinction for every \(N\); the complete three-layer cube spells it out for the six outer generators.

                                                                        A sticker needs a home and a frame

                                                                          A player sees colours; a proof must also track each sticker's cubie and transported local frame. How the cube models connect follows one sticker through incidence position, cubie fibre, and fixed-frame coordinate. A colour quotient forgets labels, while a larger cube adds positions, so the state space changes with the question.

                                                                          A plausible state can still be impossible

                                                                            Take a solved cube and twist one corner in place. Every sticker still has a cubie-sized home, and the three colours at that corner look locally consistent. But the corner orientations now have sum \(1\) modulo \(3\), whereas every face turn preserves sum \(0\). No sequence of legal turns can produce this state.

                                                                            The complete three-layer cube derives the matching edge and permutation restrictions from the six generators. The calculation is useful at the table: it tells a solver when a scrambled-looking object was assembled illegally, and it tells a proof which state space is worth searching.

                                                                            A human algorithm has to preserve these legal states while it borrows pieces from completed areas.

                                                                            A formula often disturbs pieces that were already placed. The disturbance is acceptable only when the setup is undone and the completed pieces return. A working slot, a trigger, and an inverse setup make that promise visible. The complete layer-first method repeats this pattern through the cross, the first layer, the middle layer, and the last layer. Its completeness depends on the preservation and termination checks, not on the formula's familiarity.

                                                                            Undoing a scramble checks the notation

                                                                              The worked replay and projected lower bound fixes the viewing convention, records the ten tokens, and applies their inverse. Sticker replay returns to solved. A corner-only projected search finds no solution of depth at most two, so the evidence is the bounded statement

                                                                              \[3\le d_{\rm HTM}\le 10.\]

                                                                              The inverse word is an upper-bound witness; the projected search is a lower-bound witness. The computer account explains why these checks do not prove that ten is shortest. A state, a word, and a replay log are enough to test the notation before asking for a general solver.

                                                                              Changing one ingredient changes the problem

                                                                                Once the move, its frame, its local repair, and its replay are explicit, three variations separate the effects of enlarging the cube, changing the shape, and forgetting labels.

                                                                                The layered-cube family develops the first variation; the incidence and facet construction in incidence, symmetry and moves develops the second; and which moves survive a quotient? gives the descent condition for the third. Framed orientations, label transport and topology, and scrambling, spectra and search then study the extra information each variation introduces or forgets. Their hypotheses stay attached to the concrete move that prompted the question.

                                                                                A face turn can therefore be drawn, named, replayed, and checked before it is generalized. The resulting state maps and invariants support later formal certification or measured comparisons, while the examples here make clear which claim each later programme would have to establish.

                                                                                Related

                                                                                  Turning a facet into a puzzle move [frap-0009]

                                                                                    Once the shape symmetries are known, the next question is local: how can a turn change only the positions incident to one chosen facet while carrying their labels along? A facet rotation extends to a symmetry of the whole shape, but a puzzle move applies it only at positions incident to the chosen facet. Marchetti's construction retains both entries of each incidence pair [marchetti2025rubik, Definitions 5--6]. We use finite regular abstract polytopes of rank at least three; the extension lemma itself does not require finiteness.

                                                                                    Definition. The rotation subgroup [marchetti2025rubik, Definition 4] [frap-000K]

                                                                                      Let \(Q\) be a regular abstract polytope of rank \(m\geq 2\). Choose a base flag and its distinguished generators (involutions) \(\rho _0,\ldots ,\rho _{m-1}\). Its rotation subgroup is

                                                                                      \[\Gamma ^+(Q)=\langle \rho _{j-1}\rho _j:1\leq j<m\rangle .\]

                                                                                      The index starts at \(1\): for a polygon, the single adjacent pair \(\rho _0\rho _1\) generates its rotations. For triangles and squares these are the usual cyclic rotation groups.

                                                                                      Equivalently, \(\Gamma ^+(Q)\) consists of the elements represented by even-length words in the distinguished involutions. Indeed every pair \(\rho _i\rho _j\) is a product of adjacent pairs or their inverses, by cancellation along the index interval. Conjugating an even word by a distinguished involution again gives an even word, so this subgroup is normal. A change of base flag conjugates the distinguished generators and therefore leaves the subgroup unchanged. We do not require it to have index two for every abstract polytope.

                                                                                      Definition. Incidence positions and facet moves [marchetti2025rubik, Definitions 5--6] [frap-000L]

                                                                                        Let \(P\) be a finite regular abstract polytope of rank \(n\geq 3\), with least and greatest faces \(F_{-1},F_n\). Write \(P^\circ =P\setminus \{F_{-1},F_n\}\). The incidence positions are

                                                                                        \[\mathcal R(P)=\{(F,G)\in P^\circ \times P^\circ :F\leq G\}.\]

                                                                                        Choose a facet \(H\) and an element \(\alpha \) of the rotation subgroup \(\Gamma ^+(H/F_{-1})\). The facet extension lemma gives its unique extension \(\widehat \alpha \in \Gamma (P)\) fixing \(H\). The corresponding facet move is

                                                                                        \[\mu _{H,\alpha }(F,G)= \begin {cases} (\widehat \alpha (F),\widehat \alpha (G)),&F\leq H,\\ (F,G),&F\not \leq H. \end {cases}\]

                                                                                        The first entry decides where the shape automorphism is applied; the second entry is transported with it. The facet is part of the move's name: one shape automorphism may stabilize several facets and give different local moves. Each move is a permutation of \(\mathcal R(P)\).

                                                                                        Lemma. The inverse of a facet move [frap-000M]

                                                                                          Let \(P\) be a finite regular abstract polytope of rank \(n\geq 3\), \(H\) a facet and \(\alpha \in \Gamma ^+(H/F_{-1})\) a facet rotation. The facet move \(\mu _{H,\alpha }\) is a permutation of \(\mathcal R(P)\), with

                                                                                          \[\mu _{H,\alpha }^{-1}=\mu _{H,\alpha ^{-1}}.\]

                                                                                          This follows directly from the construction in [marchetti2025rubik, Definitions 5--6].

                                                                                          Proof. 

                                                                                            An automorphism preserves proper faces and the order relation, so the moving branch remains in \(\mathcal R(P)\). Since \(\widehat \alpha (H)=H\), the condition \(F\leq H\) holds exactly when \(\widehat \alpha (F)\leq H\). Thus the moving and fixed subsets are preserved separately. On the moving subset the extension of \(\alpha ^{-1}\) is \(\widehat \alpha ^{-1}\) by uniqueness, and cancels the first map. On the fixed subset both maps are the identity.

                                                                                            The general construction combining permutations of complementary subsets is Equiv.Perm.subtypeCongr; its inverse formula is Equiv.Perm.subtypeCongr.symm. Here the predicate is \(F\leq H\), the moving permutation is the restricted shape automorphism and the other permutation is the identity. These declarations supply that general combination; the polytope-specific preservation argument is the proof above.

                                                                                            The inverse lemma makes the local action reversible. The tetrahedron calculation that follows is a small witness for why the facet is part of a move's identity: two locally valid turns can act differently on the same incidence record and need not commute.

                                                                                            Example. Two turns of a tetrahedron [frap-000O]

                                                                                              Represent the faces of a tetrahedron by subsets of \(\{1,2,3,4\}\). We calculate facet moves from [marchetti2025rubik, Definitions 5--6]. For the facet \(H=123\), take an element of the rotation subgroup with global extension \(\widehat \alpha =(123)\), fixing \(4\). The vertex-edge records follow the cycle

                                                                                              \[(1,12)\longmapsto (2,23)\longmapsto (3,13)\longmapsto (1,12).\]

                                                                                              Every arrow is the local move \(\mu _{H,\alpha }\). The record \((4,14)\) stays fixed because \(4\not \leq H\), although the global shape symmetry sends it to \((4,24)\). The diagram records this permutation of incidence positions, rather than the tetrahedron's face graph.

                                                                                              For records whose second entry is a facet, the same move gives

                                                                                              \[(1,124)\longmapsto (2,234),\qquad (12,124)\longmapsto (23,234),\qquad (4,124)\longmapsto (4,124).\]

                                                                                              The last record is fixed even though the global symmetry changes its second entry. Now let \(K=124\) and take an element of the rotation subgroup with global extension \(\widehat \beta =(124)\). Applying the \(H\)-move and then the \(K\)-move sends

                                                                                              \[(1,124)\xrightarrow {\mu _{H,\alpha }}(2,234) \xrightarrow {\mu _{K,\beta }}(4,134).\]

                                                                                              Reversing their order gives \((1,124)\mapsto (2,124)\mapsto (3,234)\), so the two moves do not commute. Each has order three: its cube is the identity on both branches, and its displayed action is nontrivial.

                                                                                              The tetrahedron witness motivates the generated move group: reachable labelled configurations are products of these reversible local turns. The ordinary cube calculation then shows how the same definition compares with visible stickers and which data it leaves out.

                                                                                              Definition. The Rubik group and labelled configurations [frap-000N]

                                                                                                For a finite regular abstract polytope \(P\) of rank \(n\geq 3\), the Rubik group is the subgroup generated by all facet moves:

                                                                                                \[\operatorname {Rub}(P)= \langle \mu _{H,\alpha }:H\text { a facet},\quad \alpha \in \Gamma ^+(H/F_{-1})\rangle \leq \operatorname {Sym}(\mathcal R(P)).\]

                                                                                                This is Marchetti's generated group of permutations [marchetti2025rubik, Section 3, p. 6, following Definition 6]. The inverse lemma ensures that the generators are permutations.

                                                                                                Give each incidence position its own initial label. A labelled configuration can be represented by the permutation carrying each initial label to its current position. The identity is the solved configuration; the reachable labelled configurations are the elements of \(\operatorname {Rub}(P)\). A new move acts on the left: applying \(\mu \) to configuration \(g\) gives \(\mu g\), with \(g\) acting first. A visible coloring may identify several labelled configurations, so a solved visible coloring need not determine the labelled permutation.

                                                                                                Example. One ordinary cube face turn [frap-000P]

                                                                                                  Realize the cube as \([-1,1]^3\) and let \(H\) be the facet \(z=1\). The facet move construction of [marchetti2025rubik, Definitions 5--6] gives the following explicit outer-face action. The shape rotation

                                                                                                  \[q(x,y,z)=(y,-x,z)\]

                                                                                                  is a clockwise quarter-turn when viewed from positive \(z\), with \(x\) rightward and \(y\) upward. Its restriction to \(H\) supplies our move. The corner \((1,1,1)\) goes to \((1,-1,1)\), and its color on \(y=1\) goes to the color position on \(x=1\). The corresponding corner at \(z=-1\) is fixed by the puzzle move, although the global map \(q\) moves it.

                                                                                                  The signs give the \(x,y\) coordinates of the four corners on \(z=1\). The arrows show their clockwise motion; the central incidence record \((H,H)\) stays fixed. No orientation of a marked center is recorded.

                                                                                                  Restricting the second entry to facets gives \(8\cdot 3+12\cdot 2+6=54\) incidence positions: three per corner, two per edge and one per face center. The turn moves twelve corner stickers and eight edge stickers, fixing the other thirty-four positions, including the unmarked center of the turned face. This is the usual outer-face action on visible stickers of a \(3\times 3\times 3\) cube in a fixed frame.

                                                                                                  The full incidence set has \(8\cdot 7+12\cdot 3+6=98\) elements: above each vertex are that vertex, three edges and three facets; above each edge are itself and two facets. The facet-colored subset is invariant under every move. Its restricted action supplies the comparison with ordinary stickers; a faithful restriction for all abstract polytopes is not needed. Marked center orientations and inner-layer turns are additional data, absent from this comparison.

                                                                                                  The local action determines which positions participate and how their incident labels travel. Frames and orientation separate this transport into a destination and a local orientation.