Preprint
Article

This version is not peer-reviewed.

Helical Triadic Coalgebras Final Coalgebras for F(X) = Z3 × X3 in Z3-Set

Submitted:

21 January 2026

Posted:

22 January 2026

You are already at the latest version

Abstract
This paper investigates the final coalgebra for the endofunctor \( F(X) = \mathbb{Z}_3 \times X^3 \) on the category Z3-Set of sets with a Z3-action. We call the resulting F-coalgebras Helical Triadic Coalgebras (HTCs). The factor Z3 records an observable phase that makes distinct cyclic positions distinguishable. We develop the notion of Z3-bisimulation, which generalizes standard bisimulation by allowing cyclic shifts. Our main results concern a natural HTC structure on the srs lattice (Laves graph). The canonical morphism from the srs coalgebra S to the final coalgebra Ω is not injective: translations induce a bisimulation collapsing S onto a 12-element quotient \( \mathcal{Q} \cong K_4 \times \mathbb{Z}_3 \). The \( V_4 \)-symmetry of srs further collapses Q onto a 3-element image I. A symmetry analysis reveals that I is symmetric while Ω is not. We also define orbital invariants (binding index, degeneracy, multiplicity) and establish that every regular coalgebra is chiral. Finally, we prove that among sub-coalgebras of the final coalgebra, symmetry and connectivity alone characterize srs uniquely (up to chirality). These results bridge coalgebraic methods with graph theory and crystallography.
Keywords: 
;  ;  ;  ;  ;  ;  ;  ;  

1. Introduction

The theory of coalgebras provides a categorical framework for the study of state-based systems and infinite data structures [7,13]. Given an endofunctor F : C C , an F-coalgebra is an object X of C together with a morphism d : X F ( X ) assigning to each state its observable structure. The final coalgebra, when it exists, serves as a universal domain: every coalgebra admits a unique morphism into it, and two states are identified if and only if they are standard bisimilar (behaviorally equivalent in the categorical sense).
Final coalgebras for polynomial functors on Set are well understood through Adámek’s theorem and Lambek’s lemma. However, the situation becomes richer when we work in categories with additional structure. In this paper, we investigate the functor F ( X ) = Z 3 × X 3 on the category Z 3 - Set of sets equipped with a Z 3 -action. The functor includes an observable phase component in Z 3 , ensuring that cyclic positions remain distinguishable in the final coalgebra.
The main contributions are:
1.
An adaptation of bisimulation to the cyclic structure: Z 3 -bisimulation (Section 4).
2.
An axiomatic definition of Helical Triadic Coalgebras (Section 5), including a self-similarity theorem showing that Ω Z 3 × Ω 3 exhibits fractal structure (Section 5.4), and a natural such structure on the srs lattice, a classical 3-regular graph from crystallography (Section 6), with a local self-similarity theorem proving that every vertex generates the entire coalgebra (Section 6.4).
3.
A factorization theorem: the canonical morphism from the srs coalgebra to the final coalgebra factors through a 12-element quotient Q K 4 × Z 3 , which further collapses onto a 3-element image I (Sections 7 and 8)).
4.
A symmetry dichotomy: the image I is symmetric while the final coalgebra Ω is not; an intrinsic criterion for symmetry follows from orbital invariants (Section 10).
5.
A chirality theorem: every regular coalgebra is chiral (Section 9).
6.
A strong uniqueness theorem: under natural axioms capturing “geometric” HTCs (regularity, symmetry, periodicity, connectivity, maximality), the srs lattice is the unique realization, up to enantiomorphism (Section 11). Crucially, symmetry is the only genuine external constraint: regularity follows from symmetry (12), periodicity follows from symmetry (16), while all other properties derive from the functor F itself.
Regarding novelty: the existence and coinduction framework are classical [1,9,13], while the equivariant specialization to Z 3 - Set and the notion of Z 3 -bisimulation are new to this setting. The factorization S Q I and the symmetry/chirality consequences are original contributions. They refine classical srs and covering-space descriptions [4,15] by tracking cyclic phase data. These results identify a concrete obstruction to symmetry in regular coalgebras, motivating the open problems in Section 12.
These results link coalgebraic methods with several classical areas: covering space theory (the srs lattice is the maximal abelian cover of K 4 ), crystallographic topology (space group I 4 1 32 ), and combinatorial graph theory (3-regular graphs with girth 10).
The paper proceeds as follows. Section 2 discusses prior work. Section 3 recalls the categorical framework. Section 4 develops Z 3 -bisimulation. Section 5 defines the Helical Triadic Coalgebra axiomatically and treats sub-coalgebras. establish the main structural results on the srs coalgebra. Section 9 defines orbital invariants, proves that regular coalgebras are chiral, and classifies finite coalgebras. Section 10 addresses symmetry, showing I is symmetric while Ω is not. Section 11 establishes that srs is the unique geometric realization of HTC. Section 12 summarizes contributions and discusses open problems. Appendices collect crystallographic data and notation.

2. Related Work

Final coalgebras for polynomial functors on Set are classical. Existence and structural properties follow from terminal sequences and Lambek’s lemma [1,9,16]. For unlabeled tree functors on Set (e.g., F ( X ) = X n with n 2 ), the final coalgebra is a singleton: without observable labels, all infinite n-ary trees are behaviorally equivalent. However, working in the equivariant category Z 3 - Set enriches the structure. The phase dynamics ( obs ( θ ( x ) ) = obs ( x ) + 1 , where obs denotes the observable phase; see 3) implies that every F-coalgebra carries a free Z 3 -action—no fixed points exist. This structural constraint, combined with the observable phase, prevents collapse and yields a non-trivial final coalgebra. Our use of coinduction and extensionality follows the standard coalgebraic semantics literature [7,13], specialized here to the equivariant setting. We are not aware of prior work specifically addressing final coalgebras for F ( X ) = Z 3 × X 3 in Z 3 - Set .
The Z 3 -bisimulation introduced here corresponds to bisimulation up to the group action, allowing cyclic phase shifts in the matching relation (see 8). The ambient category Z 3 - Set is a presheaf category [10]; it provides the equivariant backbone for our construction.
On the geometric side, the srs lattice is well studied in graph theory and crystallography. It appears as the Laves graph and the net of the gyroid minimal surface [4,12,15]. Our coalgebraic viewpoint complements the covering theory of graphs developed in [6], encoding the cyclic phase data arising from the rotation system (Section 6) in the language of F-coalgebras.

3. Preliminaries

This section establishes the categorical framework. We define the category Z 3 - Set of sets with a Z 3 -action, the endofunctor F : Z 3 - Set Z 3 - Set given by F ( X , θ ) = ( Z 3 × X 3 , σ ^ ) , and the notion of F-coalgebra. The classical results of Adámek and Lambek then guarantee existence and uniqueness (up to unique isomorphism) of a final coalgebra; see 1 and 1.
Convention. Unless stated otherwise, we consider only non-empty coalgebras. The category Coalg ( F ) itself is not restricted; in particular, the final coalgebra is constructed in the full category.

3.1. The category Z 3 - Set

We write Z 3 = Z / 3 Z = { 0 , 1 , 2 } with addition modulo 3.
Definition 1
(Category Z 3 - Set ). The category Z 3 - Set has:
  • Objects: pairs ( X , θ ) where X is a set and θ : X X is a bijection satisfying θ 3 = id X .
  • Morphisms: equivariant functions, i.e., f : ( X , θ X ) ( Y , θ Y ) such that f θ X = θ Y f .
Remark 1.
The category Z 3 - Set is equivalent to the functor category [ Z 3 , Set ] , where Z 3 is viewed as a one-object category (the cyclic group of order 3).

3.2. The functor F

Definition 2
(Functor F). The endofunctor F : Z 3 - Set Z 3 - Set is defined by (identifying Z 3 × X 3 Z 3 × X × X × X and writing elements as ( ϕ , a , b , c ) ):
  • On objects: F ( X , θ ) : = ( Z 3 × X 3 , σ ^ ) where σ ^ ( ϕ , a , b , c ) = ( ϕ + 1 , b , c , a ) increments thephase ϕ Z 3 and cyclically permutes the triple.
  • On morphisms: F ( f ) : = id Z 3 × ( f × f × f ) , acting as identity on the Z 3 component and componentwise on the triple.
This is well-defined: σ ^ 3 = id , so ( Z 3 × X 3 , σ ^ ) Z 3 - Set ; moreover F ( f ) = id Z 3 × f × 3 (where f × 3 : = f × f × f denotes componentwise application) commutes with σ ^ :
F ( f ) ( σ ^ ( ϕ , a , b , c ) ) = ( ϕ + 1 , f ( b ) , f ( c ) , f ( a ) ) = σ ^ ( ϕ , f ( a ) , f ( b ) , f ( c ) ) = σ ^ ( F ( f ) ( ϕ , a , b , c ) ) ,
so F ( f ) is a morphism in Z 3 - Set . Functoriality follows: F ( id ) = id Z 3 × id × 3 = id , and F ( g f ) = id × ( g f ) × 3 = ( id × g × 3 ) ( id × f × 3 ) = F ( g ) F ( f ) .
Key property:F does not lift the input action θ diagonally to X 3 ; instead, it equips Z 3 × X 3 with the fixed action σ ^ regardless of θ. Equivalently, F = G U where U : Z 3 - Set Set is the forgetful functor and G : Set Z 3 - Set is defined by G ( X ) = ( Z 3 × X 3 , σ ^ ) .

3.3. F-coalgebras

Definition 3
(F-coalgebra). An F-coalgebra (in Z 3 - Set ) is a triple ( X , d , θ ) where ( X , θ ) Z 3 - Set and d : X Z 3 × X 3 is an equivariant morphism. We write the triple explicitly to emphasize the Z 3 -action; equivalently, an F-coalgebra is a pair ( ( X , θ ) , d ) where ( X , θ ) is an object of Z 3 - Set and d is a morphism in Z 3 - Set . The equivariance condition is:
d θ = σ ^ d
We write d ( x ) = ( obs ( x ) , d 0 ( x ) , d 1 ( x ) , d 2 ( x ) ) where obs ( x ) Z 3 is theobservable phaseand d i ( x ) X are thechildrenof x. We use the shorthand d ( x ) i : = d i ( x ) for children; note that indices i { 0 , 1 , 2 } refer to children, not to components of the quadruplet.
Remark 2
(Equivariance unfolded). Equivariance d θ = σ ^ d means:
d ( θ ( x ) ) = ( obs ( x ) + 1 , d 1 ( x ) , d 2 ( x ) , d 0 ( x ) )
Thus obs ( θ ( x ) ) = obs ( x ) + 1 : the phase increments under θ. The children are also cyclically permuted. Note that the component maps obs and d i arenotindividually equivariant: obs satisfies the twisted relation obs θ = obs + 1 (where obs + 1 denotes the function x obs ( x ) + 1 ), while the children satisfy d i θ = d i + 1 (indices mod 3).
Proposition 1
(Free actions only). If ( X , d , θ ) is an F-coalgebra with X , then the Z 3 -action is free: θ k ( x ) x for all x X and k { 1 , 2 } .
Proof. 
The phase increment obs ( θ ( x ) ) = obs ( x ) + 1 implies that fixed points are impossible. Indeed, if θ ( x ) = x , then obs ( x ) = obs ( θ ( x ) ) = obs ( x ) + 1 , a contradiction in Z 3 . If θ 2 ( x ) = x , then θ ( x ) = θ 3 ( x ) = x , reducing to the previous case. □
Corollary 1
(Cardinality constraint). If ( X , d , θ ) is a non-empty F-coalgebra, then every orbit has size 3. In particular, | X | is divisible by 3, and the smallest non-empty coalgebras have exactly 3 elements.
Convention. All child indices i { 0 , 1 , 2 } are taken modulo 3. Expressions like d i + 1 ( x ) or d i k ( x ) are computed in Z 3 .
Definition 4
(Children and dependency graph). For an F-coalgebra ( X , d , θ ) , we distinguish:
  • Thechild triple N ( x ) : = ( d 0 ( x ) , d 1 ( x ) , d 2 ( x ) ) , an ordered triple. The ordering is essential: under θ, the child triple transforms as N ( θ ( x ) ) = ( d 1 ( x ) , d 2 ( x ) , d 0 ( x ) ) .
  • Thechild set N + ( x ) : = { d 0 ( x ) , d 1 ( x ) , d 2 ( x ) } , the underlying set (support) of the child triple.
Thedependency graph G ( X ) is the simple undirected graph with vertex set X and edge set E = { { x , y } : x y and ( y N + ( x ) or x N + ( y ) ) } . This is the underlying simple graph obtained by forgetting directions and discarding self-loops and multiplicities.
For a subset S X , we write G ( S ) for the induced subgraph of G ( X ) on vertex set S: edges are those of G ( X ) with both endpoints in S. This is the graph-theoretic induced subgraph, not necessarily a sub-coalgebra (which would additionally require S to be closed under d and θ).
Definition 5
(Orbit). For x X , theorbitof x is Orb ( x ) : = { θ k ( x ) : k Z 3 } . By 1, if X , the action is free, so | Orb ( x ) | = 3 .
Remark 3
(Orbital invariance of children). Since θ permutes children cyclically ( N + ( θ ( x ) ) = N + ( x ) ), the child set is constant on orbits. However, θ is not generally a graph automorphism: if { x , y } is an edge, { θ ( x ) , θ ( y ) } need not be.
Definition 6
(Connectivity). An F-coalgebra ( X , d , θ ) isconnectedif X and its dependency graph G ( X ) is connected as an undirected graph.
Definition 7
(Coalgebra morphism). Acoalgebra morphism h : ( X , d X , θ X ) ( Y , d Y , θ Y ) is an equivariant function h : X Y such that d Y h = ( id Z 3 × h × 3 ) d X . Equivalently (using the notation of 3), obs Y ( h ( x ) ) = obs X ( x ) and d Y , i ( h ( x ) ) = h ( d X , i ( x ) ) for all i. (Equivariance h θ X = θ Y h must be required explicitly: since F equips its output with the fixed action σ ^ regardless of the input action, the coalgebra equation alone does not enforce equivariance.)
Remark 4
(The Z 3 -action is not a coalgebra endomorphism). In general, the generator θ : X X of the Z 3 -action isnota coalgebra morphism from ( X , d , θ ) to itself. A coalgebra endomorphism f must satisfy d f = F ( f ) d , but we have d θ = σ ^ d , and σ ^ F ( θ ) in general. This is why θ does not automatically preserve derived structures such as the dependency graph (3).

3.4. Final coalgebras

Theorem 1
(Terminal chain [1,2]). Let C be a locally presentable category and F : C C an accessible functor. The terminal sequence ( X α , p β , α ) α β Ord is defined by:
  • X 0 = 1 (terminal object in C )
  • X 1 = F ( X 0 ) = F ( 1 ) , with p 1 , 0 : F ( 1 ) 1 the unique morphism
  • X α + 1 = F ( X α ) with p α + 1 , α = F ( p α , α 1 ) for α 1
  • X λ = lim α < λ X α for limit ordinals λ, with p λ , α the projection
  • p β , α = p α + 1 , α p β , β 1 for α < β
By [1], this sequence stabilizes at some ordinal α: the connecting map p α + 1 , α : X α + 1 X α is an isomorphism. Then ( X α , p α + 1 , α 1 ) is the final F-coalgebra.
Applicability to Z 3 - Set :The category Z 3 - Set [ Z 3 , Set ] is locally finitely presentable [2]. Filtered colimits in Z 3 - Set are created by the forgetful functor U : Z 3 - Set Set ; since finite products commute with filtered colimits in Set , the functor F preserves filtered colimits, hence is finitary (and thus accessible).
Lemma 1
(Lambek [9]). If ( X , d , θ ) is a final F-coalgebra, then d : X F ( X ) is an isomorphism in Z 3 - Set .

4. Z 3 -Bisimulation

Bisimulation is the fundamental equivalence relation in coalgebraic semantics. In the presence of a Z 3 -action, we distinguish two variants: standard bisimulation requires identical observations and exact child matching; Z 3 -bisimulation relaxes this by allowing observations and children to be related up to a cyclic shift. Orbital equivalence is always contained in Z 3 -bisimilarity (2), though the converse may fail. Standard bisimulation yields the extensionality principle in the final coalgebra Ω , where bisimilarity coincides with equality.

4.1. Definition

Definition 8
( Z 3 -bisimulation). Let ( X , d , θ ) be an F-coalgebra. A relation R X × X is a Z 3 -bisimulationif whenever x R y , theshift k : = obs ( y ) obs ( x ) Z 3 satisfies:
d ( x ) i R d ( y ) i k for i = 0 , 1 , 2
where indices are taken modulo 3. Equivalently, the i-th child of x is R-related to the ( i k ) -th child of y. Intuitively, the shift k compensates for the phase difference: we compare children in "rotated frames of reference" aligned by their observations.
Convention on index arithmetic.The index shift i i k corresponds to the inverse of the θ-action on children. By 2, d ( θ k ( x ) ) i = d ( x ) i + k , so if y = θ k ( x ) , then d ( y ) i k = d ( x ) ( i k ) + k = d ( x ) i . This justifies the choice of i k (not i + k ) in the child matching condition.
Note that the definition does not constrain the shift of the child pairs d ( x ) i R d ( y ) i k ; their shift is determined by the coalgebra structure.
Figure 1. A 6-element coalgebra with two θ -orbits. Blue arrows: the θ -action cycling within each orbit. Red dashed arrows: the relation R = { ( a i , b i ) } . Gray arrows: children of a 0 (i.e., d ( a 0 ) i = b i ). Note the phase shift: obs ( a i ) = i but obs ( b i ) = i + 1 , giving shift k = 1 . The Z 3 -bisimulation condition d ( a 0 ) i R d ( b 0 ) i 1 matches ( b i , a i ) R , but standard bisimulation would require ( b 0 , a 1 ) R , which fails.
Figure 1. A 6-element coalgebra with two θ -orbits. Blue arrows: the θ -action cycling within each orbit. Red dashed arrows: the relation R = { ( a i , b i ) } . Gray arrows: children of a 0 (i.e., d ( a 0 ) i = b i ). Note the phase shift: obs ( a i ) = i but obs ( b i ) = i + 1 , giving shift k = 1 . The Z 3 -bisimulation condition d ( a 0 ) i R d ( b 0 ) i 1 matches ( b i , a i ) R , but standard bisimulation would require ( b 0 , a 1 ) R , which fails.
Preprints 195382 g001
Example 1
(Comparing Z 3 -bisimulation and standard bisimulation). Consider a 6-element coalgebra X with two θ-orbits, illustrated below:
The data is summarized in tables:
a 0 a 1 a 2 b 0 b 1 b 2 obs 0 1 2 1 2 0 θ a 1 a 2 a 0 b 1 b 2 b 0
The children are determined by equivariance from base cases d ( a 0 ) = ( 0 , b 0 , b 1 , b 2 ) and d ( b 0 ) = ( 1 , a 1 , a 2 , a 0 ) :
x d ( x ) 0 d ( x ) 1 d ( x ) 2 a 0 b 0 b 1 b 2 a 1 b 1 b 2 b 0 a 2 b 2 b 0 b 1 b 0 a 1 a 2 a 0 b 1 a 2 a 0 a 1 b 2 a 0 a 1 a 2
Claim:The relation R = { ( a i , b i ) , ( b i , a i ) : i Z 3 } is a Z 3 -bisimulation but not a standard bisimulation.
Z 3 -bisimulation:For ( a 0 , b 0 ) , the shift is k = obs ( b 0 ) obs ( a 0 ) = 1 0 = 1 . We check: d ( a 0 ) i R d ( b 0 ) i 1 ?
i d ( a 0 ) i d ( b 0 ) i 1 In R ? 0 b 0 a 0 ( b 0 , a 0 ) R 1 b 1 a 1 ( b 1 , a 1 ) R 2 b 2 a 2 ( b 2 , a 2 ) R
The shift k = obs ( b i ) obs ( a i ) = ( i + 1 ) i = 1 is constant across all pairs ( a i , b i ) .
Not standard:Standard bisimulation requires d ( a 0 ) 0 R d ( b 0 ) 0 , i.e., ( b 0 , a 1 ) R . But R only contains ( b 0 , a 0 ) .
Definition 9
(Standard bisimulation). Astandard bisimulationis a relation R X × X satisfying:
1.
Phase matching: x R y obs ( x ) = obs ( y )
2.
θ -stability: x R y θ ( x ) R θ ( y )
3.
Child matching: x R y d ( x ) i R d ( y ) i for i = 0 , 1 , 2
Equivalently, a standard bisimulation is a Z 3 -bisimulation with shift k = 0 that is also θ-stable.
Two elements x , y X arestandard bisimilar, written x y , if there exists a standard bisimulation R with x R y . The class of standard bisimulations is closed under arbitrary unions (phase matching, θ-stability, and child matching are each preserved by unions), so ∼ is the largest standard bisimulation.
Remark 5
(Categorical justification). The θ-stability axiom is not ad hoc but arises from the categorical definition of bisimulation. In the coalgebraic sense [13], a bisimulation on an F-coalgebra ( X , d , θ ) in Z 3 - Set is a relation R X × X that carries an F-coalgebra structure making the projections π 1 , π 2 : R X into coalgebra morphisms. Since morphisms in Z 3 - Set must be Z 3 -equivariant, the relation R must satisfy ( θ × θ ) ( R ) R , i.e., be θ-stable. The three conditions of 9 are equivalent to this categorical definition.

4.2. The orbital relation

Definition 10
(Orbit). For x X , the θ -orbitof x is:
Orb ( x ) : = { x , θ ( x ) , θ 2 ( x ) }
(This is well-defined since θ 3 = id in Z 3 - Set ; see 1.)
Definition 11
(Orbital graph). Theorbital graph G ¯ ( X ) : = G ( X ) / θ is defined as:
  • Vertices: X / θ (the θ-orbits)
  • Edges: { Orb ( x ) , Orb ( y ) } E ( G ¯ ) if and only if { x , y } E ( G ( X ) ) for some representatives
Since G ( X ) is an undirected graph (4), orbits O and O are adjacent iff there exist x O and y O such that y is a child of x or x is a child of y.
Theorem 2
(Orbital Z 3 -bisimulation). The orbital relation R Orb = { ( x , y ) : y Orb ( x ) } is always a Z 3 -bisimulation.
Proof. 
Let y = θ j ( x ) for some j Z 3 . The shift is k = obs ( y ) obs ( x ) = j (by 2: obs ( θ j ( x ) ) = obs ( x ) + j ).
By iterated equivariance ( d θ j = σ ^ j d ; see 2), the children satisfy d ( y ) i = d ( x ) i + j . (Explicitly: σ ^ acts on child indices as i i + 1 , so σ ^ j acts as i i + j .) We verify d ( x ) i R Orb d ( y ) i k :
d ( y ) i k = d ( y ) i j = d ( x ) ( i j ) + j = d ( x ) i .
Thus we need d ( x ) i R Orb d ( x ) i , which holds since d ( x ) i Orb ( d ( x ) i ) by 10. □
Proposition 2
(Orbital relation is not a standard bisimulation). In any F-coalgebra, R Orb is not a standard bisimulation.
Proof. 
Standard bisimulation requires phase matching: x R y obs ( x ) = obs ( y ) . However, R Orb contains pairs ( x , θ ( x ) ) for all x, and by equivariance obs ( θ ( x ) ) = obs ( x ) + 1 obs ( x ) in Z 3 (since 1 0 in Z 3 ). Thus phase matching fails immediately. □

4.3. Extensionality

Proposition 3
(Extensionality in the final coalgebra [13]). In the final coalgebra Ω, standard bisimilarity coincides with equality:
x y x = y
where ∼ denotes standard bisimilarity. This is a standard property of final coalgebras; we include the statement for reference.
Corollary 2
(Coinduction principle). Let ( X , d , θ ) be an F-coalgebra and h : X Ω the unique morphism to the final coalgebra. If R X × X is a standard bisimulation with x R y , then h ( x ) = h ( y ) .
Proof. 
The image S : = { ( h ( x ) , h ( y ) ) : x R y } is a standard bisimulation on Ω :
  • Phase matching: obs ( h ( x ) ) = obs ( x ) since h is a coalgebra morphism, hence obs ( h ( x ) ) = obs ( h ( y ) ) .
  • θ-stability: Since h θ = θ h , we have ( h ( x ) , h ( y ) ) S ( θ ( h ( x ) ) , θ ( h ( y ) ) ) S .
  • Child matching: d ( h ( x ) ) i = h ( d ( x ) i ) since h commutes with d, so d ( h ( x ) ) i S d ( h ( y ) ) i .
By extensionality (3), S Δ Ω , hence h ( x ) = h ( y ) . □
Theorem 3
(Orbital extensionality for regular elements). In the final coalgebra Ω, forregularelements (those with degeneracy δ = 0 , i.e., having three distinct children; see 21), Z 3 -bisimilarity coincides with orbital equivalence. Precisely: if x , y Ω with δ ( x ) = 0 , then
x Z 3 y y Orb ( x )
where x Z 3 y means there exists a Z 3 -bisimulation R with x R y .
Proof. (⇐) If y Orb ( x ) , then ( x , y ) R Orb , which is a Z 3 -bisimulation by 2.
(⇒) Let R be a Z 3 -bisimulation on Ω with x R y , and let k = obs ( y ) obs ( x ) Z 3 . We show y = θ k ( x ) .
Step 1: Orbital closure. Define the orbital closure of R:
R ¯ : = { ( θ i ( u ) , θ i ( v ) ) : u R v , i Z 3 }
Then R ¯ is θ -stable by construction and contains R. We verify R ¯ is a Z 3 -bisimulation: if ( θ i ( u ) , θ i ( v ) ) R ¯ with u R v , the shift is δ ( θ i ( u ) , θ i ( v ) ) = obs ( θ i ( v ) ) obs ( θ i ( u ) ) = δ ( u , v ) = : . By the Z 3 -bisimulation property of R, d ( u ) j R d ( v ) j for each j. By equivariance, d ( θ i ( u ) ) j = d ( u ) j + i and d ( θ i ( v ) ) j = d ( v ) j + i . Since d ( u ) j + i R d ( v ) ( j + i ) , we have
( d ( θ i ( u ) ) j , d ( θ i ( v ) ) j ) = ( θ 0 ( d ( u ) j + i ) , θ 0 ( d ( v ) ( j + i ) ) ) R ¯ .
Step 2: Shift-corrected relation. Define:
S : = { ( u , θ δ ( u , v ) ( v ) ) : ( u , v ) R ¯ }
where δ ( u , v ) : = obs ( v ) obs ( u ) . Since ( x , y ) R R ¯ , we have ( x , θ k ( y ) ) S .
Step 3: S is a standard bisimulation (on elements reachable from regular x).
  • Phase matching: For ( u , w ) S with w = θ δ ( u , v ) ( v ) where ( u , v ) R ¯ , we have obs ( w ) = obs ( v ) δ ( u , v ) = obs ( u ) .
  • θ-stability: If ( u , w ) S with w = θ ( v ) for ( u , v ) R ¯ and = δ ( u , v ) , then ( θ ( u ) , θ ( v ) ) R ¯ by θ -stability of R ¯ . The shift is preserved: δ ( θ ( u ) , θ ( v ) ) = . Thus ( θ ( u ) , θ ( θ ( v ) ) ) = ( θ ( u ) , θ ( w ) ) S .
  • Child matching: Let ( u , w ) S . By phase matching, obs ( u ) = obs ( w ) . We must show ( d ( u ) i , d ( w ) i ) S for each i.
    By construction of S, there exists ( u , v ) R ¯ with w = θ ( v ) where = δ ( u , v ) . By equivariance, d ( w ) i = d ( θ ( v ) ) i = d ( v ) i . The Z 3 -bisimulation property of R ¯ gives ( d ( u ) i , d ( v ) i ) R ¯ , i.e., ( d ( u ) i , d ( w ) i ) R ¯ .
    Now we compute i : = δ ( d ( u ) i , d ( w ) i ) = obs ( d ( w ) i ) obs ( d ( u ) i ) . Since δ ( x ) = 0 , the element x has three distinct children. In the final coalgebra Ω , by Lambek’s lemma (1), d : Ω Z 3 × Ω 3 is an isomorphism. For regular elements u Ω (reachable from x), the constraint d ( u ) = ( ϕ , a , b , c ) with a , b , c distinct forces obs ( a ) = ϕ , obs ( b ) = ϕ + 1 , obs ( c ) = ϕ + 2 (since otherwise distinct children with equal phases would be bisimilar by coinduction, contradicting extensionality). Thus obs ( d ( u ) i ) = obs ( u ) + i for regular elements in Ω . Similarly for w. Since obs ( u ) = obs ( w ) (phase matching), we have i = 0 .
    By definition of S: ( d ( u ) i , θ i ( d ( w ) i ) ) = ( d ( u ) i , d ( w ) i ) S .
Thus S is a standard bisimulation containing ( x , θ k ( y ) ) . By extensionality (3), x = θ k ( y ) , hence y = θ k ( x ) Orb ( x ) . □
Remark 6
(Failure for singular elements). The regularity hypothesis δ ( x ) = 0 is essential. For singular elements in the final coalgebra Ω, Z 3 -bisimilarity can relate elements from different orbits. Since d : Ω Z 3 × Ω 3 is an isomorphism by Lambek’s lemma (1), we can construct z = d 1 ( ϕ 0 , x 0 , x 0 , x 0 ) where x 0 I (the 3-element image of the srs coalgebra; see Section 8). Then z is singular ( δ ( z ) = 2 , meaning all three children coincide) and there exists a Z 3 -bisimulation relating z to x 0 , even though x 0 Orb ( z ) .
Remark 7
(Conceptual interpretation). Informally, Z 3 -bisimulations on X correspond to standard bisimulations on the orbital quotient X / Z 3 in Set . The shift parameter k in 8 compensates for the phase offset within an orbit, ensuring that the bisimulation condition descends coherently to the quotient. (A precise categorical formulation would require defining an appropriate coalgebra structure on the quotient, which we do not pursue here.)

5. The Helical Triadic Coalgebra

This section defines the Helical Triadic Coalgebra (HTC) as the final coalgebra Ω for the functor F in Z 3 - Set . We establish existence via the terminal sequence construction (1), derive basic properties (infinitude, bijectivity of the structure map), and develop the theory of sub-coalgebras.

5.1. Axiomatic definition

(HTC)).Definition 12 (Helical Triadic Coalgebra Assuming existence of a final coalgebra for F in Z 3 - Set (established in 4 below), we define theHelical Triadic Coalgebrato be the final coalgebra ( Ω , d , θ ) .
As an F-coalgebra in Z 3 - Set , Ω satisfies the following properties:
  • ( Ω , θ ) is a Z 3 -set with θ 3 = id .
  • d : Ω Z 3 × Ω 3 is equivariant: d θ = σ ^ d .
The defining characteristic is:
  • Finality: For every F-coalgebra ( Y , e , τ ) , there exists a unique equivariant coalgebra morphism h : Y Ω .
Properties (HTC1)–(HTC2) follow from the definition of F-coalgebra in Z 3 - Set (3); (HTC3) is the universal property that uniquely characterizes Ω.
Proposition 4
(Three distinct phases in Ω ). The final coalgebra ( Ω , d , θ ) contains elements of all three observable phases:
(i)
| Ω | 3 , with elements x 0 , x 1 , x 2 Ω satisfying obs ( x i ) = i for i Z 3 ;
(ii)
θ id on Ω.
Proof. 
The observable phase is preserved by coalgebra morphisms, making distinct phases distinguishable in Ω .
Step 1: Coalgebra morphisms preserve observable phase. Recall that obs X = π 1 d X where π 1 : Z 3 × X 3 Z 3 is the first projection. Let h : X Ω be any coalgebra morphism in Z 3 - Set (hence equivariant: h θ X = θ Ω h ). Since h commutes with the structure maps, d Ω h = F ( h ) d X , and F ( h ) = id Z 3 × h 3 , applying π 1 to both sides gives:
obs Ω ( h ( x ) ) = obs X ( x ) for all x X .
Step 2: A concrete 3-element F-coalgebra. Define X = Z 3 = { 0 , 1 , 2 } with θ ( i ) = i + 1 ( mod 3 ) (so θ 3 = id ) and structure map d ( i ) = ( i , i , i + 1 , i + 2 ) (indices mod 3). Equivariance holds: d ( θ ( i ) ) = d ( i + 1 ) = ( i + 1 , i + 1 , i + 2 , i ) = σ ^ ( i , i , i + 1 , i + 2 ) = σ ^ ( d ( i ) ) , since σ ^ ( ϕ , a , b , c ) = ( ϕ + 1 , b , c , a ) . Thus ( X , d , θ ) is an F-coalgebra in Z 3 - Set .
Step 3: Three distinct elements in Ω . Let h : X Ω be the unique coalgebra morphism. By Step 1, obs Ω ( h ( i ) ) = obs X ( i ) = i . Since the three elements 0 , 1 , 2 X have distinct observable phases, their images h ( 0 ) , h ( 1 ) , h ( 2 ) are pairwise distinct in Ω . Hence | Ω | 3 .
Step 4: Non-triviality of θ . The morphism h is equivariant: h ( θ ( i ) ) = θ ( h ( i ) ) . Since θ ( 0 ) = 1 in X, we have θ ( h ( 0 ) ) = h ( 1 ) h ( 0 ) by Step 3. Thus θ id on Ω . □

5.2. Existence and uniqueness

Theorem 4
(Existence and uniqueness of the final coalgebra). The final coalgebra for F in Z 3 - Set exists and is unique up to unique isomorphism.
Proof. 
By 1, it suffices to verify the hypotheses: Z 3 - Set is locally presentable and F is accessible. We check these and note the specific convergence ordinal.
Hypotheses of 1. The category Z 3 - Set [ Z 3 , Set ] is a presheaf category, hence locally finitely presentable [2]. The functor F is finitary: filtered colimits in [ Z 3 , Set ] are computed pointwise, finite products preserve filtered colimits in Set , and Z 3 × ( ) preserves all colimits; hence X Z 3 × X 3 preserves filtered colimits. Being finitary, F is accessible.
Construction. By 1, the terminal sequence converges at some ordinal λ . The final coalgebra is Ω : = X λ , with structure map d : = p λ + 1 , λ 1 . Limits in [ Z 3 , Set ] are computed pointwise: if ( X α , θ α ) is the Z 3 -set at stage α , then the limit Ω = lim α < λ X α carries the action θ Ω defined by universality, satisfying p λ , α θ Ω = θ α p λ , α for all α . This makes all projections equivariant.
Uniqueness. Terminal objects are unique up to unique isomorphism: if Ω and Ω are both final, the unique morphisms Ω Ω and Ω Ω compose to endomorphisms that must equal the identity by uniqueness. □

5.3. Properties

Proposition 5
(Divisibility). For any finite F-coalgebra ( X , d , θ ) : | X | 0 ( mod 3 ) .
Proof. 
The orbits of θ partition X. Since θ 3 = id , the size of each orbit divides 3, hence equals 1 or 3. By 1, the Z 3 -action on any F-coalgebra is free, so there are no orbits of size 1; thus all orbits have size 3. Since X is partitioned into blocks of size 3, we have | X | 0 ( mod 3 ) . □
Remark 8.
Since every sub-coalgebra inherits the F-coalgebra structure, 5 applies to finite sub-coalgebras of infinite coalgebras. In particular, every finite sub-coalgebra of Ω has cardinality divisible by 3.
Corollary 3
(Universal property). For any F-coalgebra ( Y , e , τ ) in Z 3 - Set , there exists a unique morphism h : Y Ω in Z 3 - Set such that d h = F ( h ) e .
Proof. 
By (HTC3) in 12, there exists a unique equivariant coalgebra morphism h : Y Ω . By definition of coalgebra morphism, h satisfies d h = F ( h ) e . □
Remark 9
(Canonical morphism and behavioural equivalence). Every F-coalgebra ( Y , e , τ ) admits a unique coalgebra morphism h : Y Ω , called thecanonical morphism. The kernel pair of h (i.e., ker ( h ) : = { ( x , y ) Y 2 : h ( x ) = h ( y ) } ) contains the largest standard bisimulation on Y. Since F ( X ) = Z 3 × X 3 is a polynomial functor (built from products and constants), it preserves weak pullbacks pointwise; in this case, ker ( h ) coincides with behavioural equivalence (cf. 2 and [13]). In particular, h is injective if and only if behavioural equivalence on Y is equality.
Proposition 6
(Infinitude). The final coalgebra Ω is infinite: | Ω | = .
Proof. 
By Lambek’s lemma (1), the structure map d : Ω F ( Ω ) = Z 3 × Ω 3 is an isomorphism in Z 3 - Set . Since the forgetful functor U : Z 3 - Set Set reflects isomorphisms (equivariant bijections are isomorphisms), d is a bijection of underlying sets. Suppose Ω is finite with | Ω | = n . Then:
n = | Z 3 × Ω 3 | = | Z 3 | · | Ω | 3 = 3 n 3 ,
hence n ( 1 3 n 2 ) = 0 . Since 3 n 2 = 1 has no solution in N , we obtain n = 0 , i.e., Ω = .
However, non-empty F-coalgebras exist: the witness coalgebra from 4 has | X | = 3 . By finality, there must exist a morphism h : X Ω . But if Ω = , no function X exists when X . Contradiction.
Therefore Ω is not finite, i.e., | Ω | = . □
Corollary 4
(Freeness of the Z 3 -action on Ω ). The Z 3 -action on Ω is free: for all x Ω and k Z 3 { 0 } , θ k ( x ) x .
Proof. 
By 6, Ω . By 1, the action on any non-empty F-coalgebra is free. □
Figure 2. A path in the unfolding of the Helical Triadic Coalgebra. Each transition x i x i + 1 selects a child and advances the phase by + 1 ( mod 3 ) , visualized as a 120 rotation along the helix. The coloring indicates phase: φ = 0 (red), φ = 1 (teal), φ = 2 (blue).
Figure 2. A path in the unfolding of the Helical Triadic Coalgebra. Each transition x i x i + 1 selects a child and advances the phase by + 1 ( mod 3 ) , visualized as a 120 rotation along the helix. The coloring indicates phase: φ = 0 (red), φ = 1 (teal), φ = 2 (blue).
Preprints 195382 g002
Corollary 5
(Bijectivity of the structure map). The structure map d : Ω Z 3 × Ω 3 is bijective. Equivalently, for every ( ϕ , a , b , c ) Z 3 × Ω 3 , there exists a unique x Ω such that d ( x ) = ( ϕ , a , b , c ) .
Proof. 
By 1, the structure map d : Ω Z 3 × Ω 3 is an isomorphism in Z 3 - Set . Let d 1 : Z 3 × Ω 3 Ω be its inverse. For any ( ϕ , a , b , c ) Z 3 × Ω 3 , set x : = d 1 ( ϕ , a , b , c ) . Then d ( x ) = ( ϕ , a , b , c ) , proving existence. If d ( x ) = d ( x ) = ( ϕ , a , b , c ) , applying d 1 yields x = x , proving uniqueness. □

5.4. Self-similarity

The isomorphism d : Ω Z 3 × Ω 3 from 1 exhibits Ω as a fixed point of the functor F: the final coalgebra satisfies Ω F ( Ω ) . This equation is the hallmark of self-similar (or fractal) structures in coalgebraic semantics. We now make this precise.
Definition 13
(Descendant closure). For x Ω , thedescendant closure Desc ( x ) is the smallest subset of Ω containing x and closed under children:
Desc ( x ) : = { S Ω : x S and d i ( s ) S for all s S , i { 0 , 1 , 2 } } .
Equivalently, Desc ( x ) = { y Ω : path x y in G ( Ω ) } .
Theorem 5
(Self-similarity of Ω ). The final coalgebra Ω is self-similar:
(i)
Fixed-point equation: Ω Z 3 × Ω 3 as Z 3 -sets.
(ii)
Local universality: For every x Ω , the descendant closure Desc ( x ) is a sub-coalgebra, and the inclusion Desc ( x ) Ω is the unique coalgebra morphism from Desc ( x ) to the final coalgebra.
(iii)
Recursive decomposition: Every element x Ω with d ( x ) = ( ϕ , a , b , c ) satisfies
Desc ( x ) = { x } Desc ( a ) Desc ( b ) Desc ( c ) .
Proof. (i) This is 1: the structure map d : Ω F ( Ω ) = Z 3 × Ω 3 is an isomorphism.
(ii) By definition, Desc ( x ) is closed under children. For θ -closure: if y Desc ( x ) , there is a path x = x 0 x 1 x n = y in G ( Ω ) . Since θ is a coalgebra automorphism, θ ( x i ) θ ( x i + 1 ) for each i, giving a path from θ ( x ) to θ ( y ) . But θ ( x ) Desc ( x ) (taking n = 0 and using θ -closure of Desc ( x ) applied to x itself—we verify this separately: x Desc ( x ) by definition, and θ ( x ) has children θ ( d i ( x ) ) = d i + 1 ( x ) Desc ( x ) , so the sub-coalgebra generated by x contains θ ( x ) ). Hence θ ( y ) Desc ( x ) , proving θ -closure.
Thus Desc ( x ) is a sub-coalgebra. As a sub-coalgebra of the final coalgebra, it inherits the F-coalgebra structure, and the inclusion is trivially a coalgebra morphism. Uniqueness follows from finality.
(iii) The inclusion ⊇ is immediate: x Desc ( x ) , and any descendant of a, b, or c is reachable from x via one additional edge. For ⊆: any y Desc ( x ) with y x lies on a path starting x z y where z { a , b , c } , hence y Desc ( z ) . □
Remark 10
(Fractal interpretation). The fixed-point equation Ω Z 3 × Ω 3 can be read as: “Ω consists of a phase in Z 3 together with three copies of itself.” This is analogous to how the Cantor set C satisfies C = 1 3 C ( 2 3 + 1 3 C ) , or how the Sierpiński triangle decomposes into three scaled copies. The coalgebraic formulation captures this self-similarity abstractly, without reference to a metric or embedding.
Corollary 6
(Behavioral equivalence and self-similarity). For any F-coalgebra ( X , d X , θ X ) and element x X , the sub-coalgebra generated by x maps to Desc ( ι ( x ) ) Ω under the canonical morphism ι : X Ω . In particular, every element of every F-coalgebra “sees” a sub-coalgebra of Ω.
Proof. 
The sub-coalgebra generated by x in X maps via ι to a sub-coalgebra of Ω containing ι ( x ) , hence contained in Desc ( ι ( x ) ) . Surjectivity onto Desc ( ι ( x ) ) may fail if ι is not injective. □

5.5. Sub-coalgebras

Definition 14
(Sub-coalgebra). Asub-coalgebraof ( X , d , θ ) is a subset Y X such that:
1.
Y is closed under θ: θ ( Y ) = Y
2.
Y is closed under d: d i ( y ) Y for all y Y and i { 0 , 1 , 2 }
Proposition 7
(Orbital closure). Every sub-coalgebra is a union of complete orbits.
Proof. 
Let Y be a sub-coalgebra and let y Y . Since Y is θ -stable, θ ( y ) Y and thus θ 2 ( y ) = θ ( θ ( y ) ) Y . Since θ 3 = id , the orbit is Orb ( y ) = { y , θ ( y ) , θ 2 ( y ) } Y . Hence Y = y Y Orb ( y ) is a union of complete orbits. □
Corollary 7
(Minimal finite sub-coalgebras). Let ( X , d , θ ) be an F-coalgebra. Then:
(i)
Every non-empty finite sub-coalgebra Y X has at least 3 elements.
(ii)
If | Y | = 3 , then Y is a single Z 3 -orbit.
The bound | Y | 3 is sharp: we will exhibit a 3-element sub-coalgebra I Ω in Section 8.
Proof. (1) By 7, Y is a union of complete orbits. By 1, the action is free, so each orbit has exactly 3 elements. Hence | Y | = 3 k for some k 1 (since Y is non-empty), so | Y | 3 .
(2) If | Y | = 3 , then Y is a union of orbits of size 3. Since distinct orbits are disjoint, a union with total cardinality 3 consists of exactly one orbit. □

6. The srs Coalgebra

We now construct a natural F-coalgebra structure on the srs lattice, a classical 3-regular graph from crystallography also known as the Laves graph or ( 10 , 3 ) -a net. The key observation is that the rotation system—the cyclic ordering of neighbors at each vertex induced by the embedding in R 3 —provides exactly the data needed for comultiplication. Combined with a phase variable in Z 3 , this yields an infinite F-coalgebra S with rich structure: translation invariance by Z 3 , chirality inherited from the crystallographic space group I 4 1 32 , and a canonical morphism to the final coalgebra Ω .

6.1. The srs lattice

The srs lattice (also known as the Laves graph or ( 10 , 3 ) -a net) is a classical object in crystallography [12,15], appearing as the skeleton of the gyroid minimal surface.
Definition 15
(srs lattice). Thesrs latticeis the maximal abelian cover of the complete graph K 4 . We give an explicit construction via voltage graphs [6].
Voltage assignment.Label the vertices of K 4 as { 0 , 1 , 2 , 3 } . Orient each edge i j with i < j . Define the voltage ν : E ( K 4 ) Z 3 by:
Edge 0 1 0 2 0 3 1 2 1 3 2 3
ν ( 1 , 0 , 0 ) ( 0 , 1 , 0 ) ( 0 , 0 , 1 ) ( 0 , 0 , 1 ) ( 0 , 1 , 0 ) ( 1 , 0 , 0 )
For the reverse orientation, ν ( j i ) : = ν ( i j ) .
Derived graph.The srs lattice has:
1.
Vertices: pairs ( n , i ) Z 3 × { 0 , 1 , 2 , 3 } , where i is the vertex type and n the lattice translate.
2.
Edges: ( n , i ) is adjacent to ( n + ν ( i j ) , j ) whenever { i , j } is an edge of K 4 .
The projection π : srs K 4 , ( n , i ) i , is a regular covering with deck group Z 3 acting by τ t ( n , i ) = ( n + t , i ) .
Properties: 3-regular, girth 10, space group I 4 1 32 (No. 214), chiral.
Remark 11
(Covering space interpretation). The srs lattice is the maximal abelian cover of the complete graph K 4 . The covering map π : srs K 4 has deck transformation group Z 3 .
Remark 12
(Coxeter coordinates). Following Coxeter [4], the srs lattice can be constructed by selecting one-eighth of Z 3 with period 4. The base points
( 0 , 0 , 0 ) , ( 1 , 2 , 3 ) , ( 2 , 3 , 1 ) , ( 3 , 1 , 2 ) , ( 2 , 2 , 2 ) , ( 3 , 0 , 1 ) , ( 0 , 1 , 3 ) , ( 1 , 3 , 0 )
repeat periodically, with edges connecting pairs at distance 2 .
Figure 3. The srs lattice viewed along a direction revealing its helical structure. Darker vertices and edges are closer to the viewer; lighter ones recede into the background. Stub edges at the boundary indicate the trivalent continuation of the infinite graph.
Figure 3. The srs lattice viewed along a direction revealing its helical structure. Darker vertices and edges are closer to the viewer; lighter ones recede into the background. Stub edges at the boundary indicate the trivalent continuation of the infinite graph.
Preprints 195382 g003

6.2. Coalgebra structure on the srs lattice

Definition 16
(srs coalgebra S ). Thesrs coalgebrais S : = srs × Z 3 with:
Z 3 -action:
θ ( v , ϕ ) : = ( v , ϕ + 1 )
Comultiplication:Fix an orientation of R 3 (equivalently, a handedness). At each vertex v srs , the embedding induces acyclic orderingof the three neighbors, viewed from outside a small sphere centered at v. To define comultiplication, we mustlinearizethis cyclic order to an indexed triple. We fix a linearization by choosing, for each vertex type i { 0 , 1 , 2 , 3 } , a distinguished starting neighbor j 0 ( i ) , then proceeding cyclically. This yields a rotation system ρ ( v ) = ( w 0 , w 1 , w 2 ) where ( w 0 , w 1 , w 2 ) is the linearized triple of neighbors at v. The explicit linearization is given in Section 7.5. Then:
d ( v , ϕ ) : = ϕ , ( w ϕ , ϕ ) , ( w ϕ + 1 , ϕ + 1 ) , ( w ϕ + 2 , ϕ + 2 )
where indices are taken modulo 3. The observable phase is obs ( v , ϕ ) = ϕ .
Proposition 8
( S is an F-coalgebra). The triple ( S , d , θ ) is an F-coalgebra: equivariance d θ = σ ^ d holds.
Proof. 
The action θ ( v , ϕ ) = ( v , ϕ + 1 ) satisfies θ 3 = id since ϕ + 3 ϕ ( mod 3 ) , so ( S , θ ) Z 3 - Set .
For equivariance, let ( v , ϕ ) S with ρ ( v ) = ( w 0 , w 1 , w 2 ) .
LHS : d ( θ ( v , ϕ ) ) = d ( v , ϕ + 1 ) = ϕ + 1 , ( w ϕ + 1 , ϕ + 1 ) , ( w ϕ + 2 , ϕ + 2 ) , ( w ϕ , ϕ ) RHS : σ ^ ( d ( v , ϕ ) ) = σ ^ ϕ , ( w ϕ , ϕ ) , ( w ϕ + 1 , ϕ + 1 ) , ( w ϕ + 2 , ϕ + 2 ) = ϕ + 1 , ( w ϕ + 1 , ϕ + 1 ) , ( w ϕ + 2 , ϕ + 2 ) , ( w ϕ , ϕ )
Hence LHS = RHS, so d θ = σ ^ d . □
Remark 13
(Translation invariance). Using the representation v = ( n , i ) Z 3 × { 0 , 1 , 2 , 3 } for vertices of srs (15), elements of S = srs × Z 3 can be written as triples ( n , i , ϕ ) . The group Z 3 acts on S by translations: τ t ( n , i , ϕ ) : = ( n + t , i , ϕ ) for t Z 3 .
Translation data.By the voltage graph construction (15), the k-th neighbor of vertex ( n , i ) has the form ( n + v k ( i ) , j k ( i ) ) where:
  • v k ( i ) Z 3 is thedisplacement vector(depending only on ( i , k ) , not on n),
  • j k ( i ) { 0 , 1 , 2 , 3 } is theneighbor type(again depending only on ( i , k ) ).
These are determined by the voltage assignment and linearization from Section 7.5.
Coalgebra automorphism property.Since
d ( τ t ( n , i , ϕ ) ) k = ( n + t + v ϕ + k ( i ) , j ϕ + k ( i ) , ϕ + k ) = τ t ( d ( n , i , ϕ ) k ) ,
each translation τ t is a coalgebra automorphism of ( S , d ) .
Freeness.The action is free: τ t ( n , i , ϕ ) = ( n , i , ϕ ) implies n + t = n , hence t = 0 .

6.3. Connection to K 4

Theorem 6
(srs as maximal abelian cover [15]). The srs lattice is the maximal abelian cover of K 4 with voltage assignment in Z 3 .
Lemma 2
(Coalgebra automorphisms induce graph automorphisms). Let ( X , d , θ ) be an F-coalgebra with G ( X ) simple. If α : X X is a coalgebra automorphism, then α is a graph automorphism of G ( X ) .
Moreover, if a group Γ acts freely on X by coalgebra automorphisms and the action has no edge inversions, then the quotient map π : G ( X ) G ( X ) / Γ is a regular covering of graphs (see [6]).
Proof. 
Since α is a coalgebra morphism, d α = ( id Z 3 × α × 3 ) d , so d i ( α ( x ) ) = α ( d i ( x ) ) for each i. Hence if y = d i ( x ) , then α ( y ) = d i ( α ( x ) ) , so α preserves adjacency. Bijectivity ensures α is a graph automorphism.
For the covering statement, define G ( X ) / Γ via vertex-orbits and dart-orbits. Freeness on vertices plus absence of edge inversions implies freeness on darts. Hence π is locally bijective on darts, making it a regular covering with deck group Γ . □
Theorem 7
(Uniqueness of coalgebra with quotient K 4 ). Let ( X , d , θ ) be a connected F-coalgebra (6) such that:
(i)
The dependency graph G ( X ) is simple and 3-regular,
(ii)
θ 3 = id and θ id ,
(iii)
Z 3 acts freely on X by coalgebra automorphisms, with finite quotient.
Then G ( X ) / Z 3 K 4 if and only if G ( X ) srs .
Proof. 
By (i) and (iii), 2 applies. The action has no edge inversions: if g inverted an edge { u , v } , then g 2 ( u ) = u , so g 2 = id by freeness, contradicting that Z 3 is torsion-free. Hence π : G ( X ) G ( X ) / Z 3 is a regular covering with deck group Z 3 .
Necessity. If G ( X ) / Z 3 K 4 , then π corresponds to an epimorphism φ : π 1 ( K 4 ) Z 3 . Since π 1 ( K 4 ) F 3 and Z 3 is abelian, φ factors through the abelianization F 3 F 3 ab Z 3 . Any surjection Z 3 Z 3 is an isomorphism, so ker ( φ ) = [ F 3 , F 3 ] , making π the maximal abelian cover. By 6, G ( X ) srs .
Sufficiency. By 6, srs admits a free Z 3 -action by translations with quotient K 4 . □
Corollary 8
(Properties of the srs coalgebra). The srs coalgebra S = srs × Z 3 with its HTC structure ( d , θ ) from 16 satisfies:
(i)
S is an F-coalgebra satisfying axioms (HTC1)–(HTC2),
(ii)
There exists a unique coalgebra morphism ι : S Ω to the final coalgebra,
(iii)
ι isnotinjective (9), so S ¬ Ω .
Proof. (a) follows from 8. (b) follows from finality of Ω . (c) is proven in 9. □
Remark 14
(On symmetry actions). The Z 3 -action θ on S acts on thephase component: θ ( v , ϕ ) = ( v , ϕ + 1 ) . This is distinct from the Z 3 -action on the base graph K 4 by rotational symmetry (fixing one vertex and cyclically permuting the other three). The latter does not lift to a coalgebra automorphism of S compatible with θ, since such a lift would act on vertices while θ acts on phases.

6.4. Local self-similarity of the srs coalgebra

The srs coalgebra S exhibits a strong form of local self-similarity: every vertex generates the entire coalgebra, and all such generations are isomorphic via translation.
Definition 17
(Generated sub-coalgebra). For ( v , ϕ ) S , thesub-coalgebra generated by ( v , ϕ ) is:
S ( v , ϕ ) : = { S S : ( v , ϕ ) S , θ ( S ) = S , d i ( S ) S i } .
Theorem 8
(Local self-similarity of S ). The srs coalgebra S is locally self-similar:
(i)
Global generation: For every ( v , ϕ ) S , the sub-coalgebra generated by ( v , ϕ ) is the entire coalgebra: S ( v , ϕ ) = S .
(ii)
Translation equivalence: For every t Z 3 , the translation τ t : S S defined by τ t ( n , i , ϕ ) = ( n + t , i , ϕ ) is a coalgebra isomorphism.
(iii)
Quotient independence: The quotient S / Z 3 Q is independent of the choice of base point.
Proof. (i) The underlying graph of S projects onto the srs lattice (forgetting the phase). The srs lattice is connected: it is the maximal abelian cover of K 4 , which is connected, and covering maps preserve path-connectivity. Hence from any vertex v, every other vertex w is reachable via a path in srs. The same path, decorated with phases, shows that ( w , ψ ) is reachable from ( v , ϕ ) for appropriate ψ . Since S ( v , ϕ ) is closed under d and θ , it contains all vertices reachable from ( v , ϕ ) , hence S ( v , ϕ ) = S .
(ii) This is 13: translations preserve the coalgebra structure because the neighbor relationships in srs are translation-invariant. Explicitly, if ρ ( v ) = ( w 0 , w 1 , w 2 ) are the neighbors of v, then ρ ( v + t ) = ( w 0 + t , w 1 + t , w 2 + t ) , so d ( τ t ( v , ϕ ) ) = τ t ( d ( v , ϕ ) ) .
(iii) The quotient S / Z 3 identifies ( n , i , ϕ ) with ( n , i , ϕ ) for all n , n Z 3 . The result is { 0 , 1 , 2 , 3 } × Z 3 Q , independent of which representative we choose for each equivalence class. □
Corollary 9
(Every vertex of srs generates an isomorphic copy). Let v , w be any two vertices of the srs lattice. Then:
(i)
The sub-coalgebras S ( v , 0 ) and S ( w , 0 ) are both equal to S .
(ii)
There exists t Z 3 and k { 0 , 1 , 2 , 3 } such that τ t maps a neighborhood of ( v , 0 ) isomorphically to a neighborhood of ( w , 0 ) .
In particular, the “local view” from any vertex of S is coalgebraically indistinguishable from any other, up to translation.
Proof. (i) is immediate from 8(i). For (ii), write v = ( n v , i v ) and w = ( n w , i w ) in the standard coordinates. If i v = i w , take t = n w n v . If i v i w , the srs lattice’s vertex-transitivity (under the space group I 4 1 32 ) ensures an isometry mapping v to w; this isometry decomposes into a translation and a rotation, and the translation component provides the required t. □
Remark 15
(Comparison with Ω ). The local self-similarity of S (8) should be contrasted with that of Ω (5):
  • In S : every element generates thesamecoalgebra (the whole of S ), and all such generations are related by translation automorphisms.
  • In Ω: every element x generates a sub-coalgebra Desc ( x ) , but these sub-coalgebras may differ. For instance, Desc ( x 0 ) = I for x 0 I (a 3-element sub-coalgebra), while Desc ( z ) I for the asymmetric element z = d 1 ( ϕ 0 , x 0 , x 0 , x 0 ) .
This difference reflects the fact that S has a large automorphism group ( Z 3 ) acting transitively on vertex types, while Ω may have a smaller automorphism group (an open question; see Section 12).

7. The Canonical Morphism and Factorization

This section studies the canonical morphism ι : S Ω from the srs coalgebra to the final coalgebra. The central result is a non-injectivity theorem: despite the infinite size of S , the morphism ι identifies all elements related by translation. This yields a factorization through a finite 12-element quotient Q K 4 × Z 3 . The behavioral content of srs—as seen by the final coalgebra—is thus entirely captured by the rotation system on K 4 , together with a phase in Z 3 .

7.1. The canonical morphism ι

By finality of Ω , there exists a unique equivariant coalgebra morphism:
ι : S Ω

7.2. Non-injectivity theorem

Theorem 9
(Non-injectivity of ι ). The canonical morphism ι : S Ω isnotinjective.
Proof. 
We exhibit a standard bisimulation relating distinct elements.
Step 1: Translation relation. Define R T S × S by:
R T : = { ( ( n , i , ϕ ) , ( m , i , ϕ ) ) : n , m Z 3 }
Two elements are related iff they have the same vertex type i { 0 , 1 , 2 , 3 } and same phase ϕ Z 3 .
Step 2: R T is a standard bisimulation. We verify the three conditions of 9.
Phase matching: By definition of R T , if ( n , i , ϕ ) R T ( m , i , ϕ ) then both elements have phase ϕ , so obs ( n , i , ϕ ) = ϕ = obs ( m , i , ϕ ) .
θ-stability: If ( n , i , ϕ ) R T ( m , i , ϕ ) , then θ ( n , i , ϕ ) = ( n , i , ϕ + 1 ) and θ ( m , i , ϕ ) = ( m , i , ϕ + 1 ) . These have the same type i and same phase ϕ + 1 , hence ( n , i , ϕ + 1 ) R T ( m , i , ϕ + 1 ) .
Child matching: Since srs is a Z 3 -periodic graph, translation acts by coalgebra automorphisms: the rotation system at ( n , i ) has the form:
ρ ( n , i ) = ( ( n + v 0 ( i ) , j 0 ( i ) ) , ( n + v 1 ( i ) , j 1 ( i ) ) , ( n + v 2 ( i ) , j 2 ( i ) ) )
where the displacement vectors v k ( i ) and neighbor types j k ( i ) depend only on ( i , k ) , not on the position n.
For ( n , i , ϕ ) R T ( m , i , ϕ ) :
d ( n , i , ϕ ) k = ( n + v ϕ + k ( i ) , j ϕ + k ( i ) , ϕ + k ) d ( m , i , ϕ ) k = ( m + v ϕ + k ( i ) , j ϕ + k ( i ) , ϕ + k )
These have the same type j ϕ + k ( i ) and same phase ϕ + k , hence:
d ( n , i , ϕ ) k R T d ( m , i , ϕ ) k for each k
Step 3: Conclusion. Since R T is a standard bisimulation on S , by the coinduction principle (2):
( n , i , ϕ ) R T ( m , i , ϕ ) ι ( n , i , ϕ ) = ι ( m , i , ϕ )
Since the translation action is free (13), for n m we have ( n , i , ϕ ) ( m , i , ϕ ) in S . These are distinct elements with equal images, so ι is not injective. □
Lemma 3
(Translation equivalence). The translation relation R T from 9 is an equivalence relation.
Proof. 
Let x = ( n , i , ϕ ) , y = ( m , j , ψ ) , z = ( p , k , χ ) be elements of S .
Reflexivity: For any x = ( n , i , ϕ ) , taking m = n gives ( ( n , i , ϕ ) , ( n , i , ϕ ) ) R T , hence x R T x .
Symmetry: If x R T y , then x = ( n , i , ϕ ) and y = ( m , i , ϕ ) for some n , m Z 3 . Thus ( ( m , i , ϕ ) , ( n , i , ϕ ) ) R T , i.e., y R T x .
Transitivity: If x R T y and y R T z , then x = ( n , i , ϕ ) , y = ( m , i , ϕ ) , and z = ( p , i , ϕ ) for the same ( i , ϕ ) . Hence ( ( n , i , ϕ ) , ( p , i , ϕ ) ) R T , i.e., x R T z . □

7.3. The quotient coalgebra Q

Definition 18
(Quotient by translations). Thequotient by translationsis:
Q : = S / Z 3 = { ( i , ϕ ) : i { 0 , 1 , 2 , 3 } , ϕ Z 3 }
where Z 3 acts by translation: τ m ( n , i , ϕ ) : = ( n + m , i , ϕ ) .
We have | Q | = 4 × 3 = 12 .
Remark 16
(Symmetry reduction). This quotient construction is analogous to symmetry reduction techniques in model checking [3], where equivalent states under a group action are identified to reduce the state space. Here, the translation group Z 3 acts freely on the infinite srs lattice, and the quotient Q is a finite representative.
Proposition 9
(Quotient coalgebra structure). Q inherits an F-coalgebra structure making the quotient map q : S Q a coalgebra morphism:
(i)
θ Q ( i , ϕ ) : = ( i , ϕ + 1 )
(ii)
d Q ( i , ϕ ) : = ( ϕ , ( j ϕ ( i ) , ϕ ) , ( j ϕ + 1 ( i ) , ϕ + 1 ) , ( j ϕ + 2 ( i ) , ϕ + 2 ) )
where j k ( i ) is the neighbor type inherited from the rotation system on srs (16). The observable phase is obs ( i , ϕ ) = ϕ .
Proof. Well-definedness and morphism property. Let q : S Q denote the quotient map, and write [ x ] for the equivalence class of x S . We define:
θ Q ( [ x ] ) : = [ θ S ( x ) ] , d Q ( [ x ] ) : = ( id Z 3 × q × 3 ) d S ( x ) .
To verify well-definedness, suppose x = τ t ( x ) for some t Z 3 . By 13, translations commute with θ S , so:
[ θ S ( x ) ] = [ θ S ( τ t ( x ) ) ] = [ τ t ( θ S ( x ) ) ] = [ θ S ( x ) ] .
For d Q , using d S τ t = ( id Z 3 × τ t × 3 ) d S and q τ t = q :
( id × q × 3 ) d S ( x ) = ( id × q × 3 ) d S ( τ t ( x ) ) = ( id × q × 3 ) ( id × τ t × 3 ) d S ( x ) = ( id × q × 3 ) d S ( x ) .
Hence θ Q and d Q are well-defined on equivalence classes. By construction:
q θ S = θ Q q , d Q q = ( id Z 3 × q × 3 ) d S ,
so q is a coalgebra morphism.
Explicit formula. We now derive the explicit form stated in the proposition. Let x = ( v , ϕ ) S where v srs has vertex type i { 0 , 1 , 2 , 3 } . Then q ( v , ϕ ) = ( i , ϕ ) . By 16, d S ( v , ϕ ) = ( ϕ , ( w ϕ , ϕ ) , ( w ϕ + 1 , ϕ + 1 ) , ( w ϕ + 2 , ϕ + 2 ) ) where ( w 0 , w 1 , w 2 ) = ρ ( v ) is the rotation system at v. Applying the quotient map:
d Q ( i , ϕ ) = ( id × q × 3 ) d S ( v , ϕ ) = ( ϕ , q ( w ϕ , ϕ ) , q ( w ϕ + 1 , ϕ + 1 ) , q ( w ϕ + 2 , ϕ + 2 ) ) .
By 13 (the neighbor types j k ( i ) in the rotation system depend only on ( i , k ) ), the type of w ϕ + r is determined by i and ϕ + r , independent of the specific vertex v within its translation class. Hence q ( w ϕ + r , ϕ + r ) = ( j ϕ + r ( i ) , ϕ + r ) for r Z 3 , yielding the formula in the statement.
Z 3 -action: θ Q 3 ( i , ϕ ) = ( i , ϕ + 3 ) = ( i , ϕ ) since ϕ + 3 ϕ ( mod 3 ) . Also θ Q id since ( i , ϕ ) ( i , ϕ + 1 ) for ϕ Z 3 .
Equivariance: We check d Q θ Q = σ ^ d Q :
d Q ( θ Q ( i , ϕ ) ) = d Q ( i , ϕ + 1 ) = ( ϕ + 1 , ( j ϕ + 1 ( i ) , ϕ + 1 ) , ( j ϕ + 2 ( i ) , ϕ + 2 ) , ( j ϕ ( i ) , ϕ ) ) σ ^ ( d Q ( i , ϕ ) ) = σ ^ ( ϕ , ( j ϕ ( i ) , ϕ ) , ( j ϕ + 1 ( i ) , ϕ + 1 ) , ( j ϕ + 2 ( i ) , ϕ + 2 ) ) = ( ϕ + 1 , ( j ϕ + 1 ( i ) , ϕ + 1 ) , ( j ϕ + 2 ( i ) , ϕ + 2 ) , ( j ϕ ( i ) , ϕ ) )
These are equal. □

7.4. Factorization theorem

Theorem 10
(Factorization). The canonical morphism factors as:
Preprints 195382 i002
where q : S Q is the quotient map and ι ¯ : Q Ω is induced by finality.
Proof. 
By 9, q : S Q is a morphism of F-coalgebras. By finality of Ω , there exists a unique coalgebra morphism ι ¯ : Q Ω . Then ι ¯ q : S Ω is a coalgebra morphism. Since ι : S Ω is the unique morphism to the final coalgebra, we have ι = ι ¯ q . □

7.5. Explicit rotation system on K 4

Using Coxeter coordinates for srs, the four vertex types are positioned at:
Type 0 : ( 0 , 0 , 0 ) , Type 1 : ( 1 , 1 , 0 ) , Type 2 : ( 1 , 0 , 1 ) , Type 3 : ( 0 , 1 , 1 )
Neighbor types. The rotation system (neighbor types j k ( i ) ) on K 4 inherited from the embedding of srs in R 3 is:
i j 0 ( i ) j 1 ( i ) j 2 ( i )
0 1 2 3
1 0 3 2
2 3 0 1
3 2 1 0
Displacement vectors. The displacement vectors v k ( i ) Z 3 for each ( i , k ) are:
i v 0 ( i ) v 1 ( i ) v 2 ( i )
0 ( 1 , 0 , 0 ) ( 0 , 1 , 0 ) ( 0 , 0 , 1 )
1 ( 1 , 0 , 0 ) ( 0 , 0 , 1 ) ( 0 , 1 , 0 )
2 ( 0 , 1 , 0 ) ( 1 , 0 , 0 ) ( 0 , 0 , 1 )
3 ( 0 , 0 , 1 ) ( 0 , 1 , 0 ) ( 1 , 0 , 0 )
These satisfy: the k-th neighbor of vertex ( n , i ) srs is ( n + v k ( i ) , j k ( i ) ) .
This data encodes the linearization of the cyclic ordering of neighbors for each vertex type. The rotation system is chiral: there is no automorphism of K 4 that reverses all cyclic orderings simultaneously.

7.6. Classification of standard bisimulations on Q

We now classify all standard bisimulations on Q . Recall that Q = { 0 , 1 , 2 , 3 } × Z 3 , and denote by ph : Q Z 3 the projection onto the phase component: ph ( i , ϕ ) = ϕ . By 9, a standard bisimulation R Q × Q satisfies three conditions: (1) phase matching: x R y obs ( x ) = obs ( y ) ; (2) θ -stability: x R y θ ( x ) R θ ( y ) ; and (3) child matching: x R y d ( x ) t R d ( y ) t for all t.
Since obs ( i , ϕ ) = ϕ on Q , the phase matching condition forces ph ( x ) = ph ( y ) for any pair ( x , y ) R . This crucial constraint restricts the structure considerably.
Lemma 4
(Phase constraint). Let R be a standard bisimulation on Q . Then ( i , ϕ ) R ( j , ψ ) implies ϕ = ψ . Moreover, by θ-stability, ( i , ϕ ) R ( j , ϕ ) implies ( i , ϕ + k ) R ( j , ϕ + k ) for all k Z 3 .
Proof. 
The phase matching condition requires obs ( i , ϕ ) = obs ( j , ψ ) , i.e., ϕ = ψ . By θ -stability, ( i , ϕ ) R ( j , ϕ ) implies θ ( i , ϕ ) R θ ( j , ϕ ) , i.e., ( i , ϕ + 1 ) R ( j , ϕ + 1 ) . Iterating gives the result. □
Thus a standard bisimulation R is entirely determined by the type relation T { 0 , 1 , 2 , 3 } 2 defined by:
( i , j ) T ( i , 0 ) R ( j , 0 ) .
By θ -stability, ( i , ϕ ) R ( j , ϕ ) iff ( i , j ) T .
Lemma 5
(Closure condition). The relation R satisfies the child matching condition if and only if T satisfies the closure condition:
( i , j ) T k Z 3 , ( j k ( i ) , j k ( j ) ) T .
Proof. 
Recall from 9 that d Q ( i , ϕ ) t = ( j ϕ + t ( i ) , ϕ + t ) .
( ) Suppose R satisfies child matching and ( i , j ) T . Then ( i , 0 ) R ( j , 0 ) . By child matching, for all t Z 3 :
d ( i , 0 ) t R d ( j , 0 ) t , i . e . , ( j t ( i ) , t ) R ( j t ( j ) , t ) .
By phase matching, both have phase t. By definition of T, ( j t ( i ) , j t ( j ) ) T . Setting k = t gives (1).
( ) Conversely, suppose T satisfies (1) and ( i , ϕ ) R ( j , ϕ ) , i.e., ( i , j ) T . For any t Z 3 , we must show d ( i , ϕ ) t R d ( j , ϕ ) t . We have d ( i , ϕ ) t = ( j ϕ + t ( i ) , ϕ + t ) and d ( j , ϕ ) t = ( j ϕ + t ( j ) , ϕ + t ) . Setting k = ϕ + t in (1), we get ( j k ( i ) , j k ( j ) ) T , so ( j ϕ + t ( i ) , ϕ + t ) R ( j ϕ + t ( j ) , ϕ + t ) , which is child matching. □
Proposition 10
(Orbit structure). Condition (1) partitions { 0 , 1 , 2 , 3 } 2 into exactly 4 orbits of size 4. Each orbit is the graph of a permutation σ S 4 .
Proof. 
Let P = { 0 , 1 , 2 , 3 } 2 . For each k Z 3 , define π k : { 0 , 1 , 2 , 3 } { 0 , 1 , 2 , 3 } by π k ( i ) = j k ( i ) . From the table in Section 7.5, each π k is a permutation of { 0 , 1 , 2 , 3 } .
Define
g k : P P , g k ( i , j ) = ( π k ( i ) , π k ( j ) ) .
Each g k is a bijection of P. The subsets of P stable under the maps g k (equivalently, satisfying (1)) are exactly those stable under the group G = g 0 , g 1 , g 2 Sym ( P ) . Thus the orbits of the G-action partition P.
We show that P decomposes into exactly four orbits, each of cardinality 4. The group G acts diagonally on P: each g k applies π k to both coordinates. Let H = π 0 , π 1 , π 2 S 4 . From the table in Section 7.5, one verifies that H acts transitively on { 0 , 1 , 2 , 3 } : starting from 0, we have π 0 ( 0 ) = 1 , π 1 ( 1 ) = 3 , π 2 ( 3 ) = 0 , and π 1 ( 0 ) = 2 , reaching all four elements.
For any ( i , j ) P , the orbit G · ( i , j ) = { ( π ( i ) , π ( j ) ) : π H } . Since H acts transitively on the first coordinate, the orbit contains elements with all four possible first coordinates. Thus | G · ( i , j ) | 4 . Since | P | = 16 and orbits partition P, we have at most 4 orbits. If some orbit had size > 4 , there would be fewer than 4 orbits, but then some orbit would have size 5 , contradicting that the first-coordinate projection is surjective onto a 4-element set with fibers of size 1 per orbit (by the final paragraph below). Hence all orbits have size exactly 4, and there are exactly 4 orbits.
Finally, let O be an orbit of cardinality 4. The projection p 1 : O { 0 , 1 , 2 , 3 } onto the first coordinate is equivariant for the induced action of H. By inspection of the table, H acts transitively on { 0 , 1 , 2 , 3 } , so im ( p 1 ) = { 0 , 1 , 2 , 3 } . Since | O | = 4 , the map p 1 is bijective, and O = { ( i , σ ( i ) ) : i { 0 , 1 , 2 , 3 } } for a unique σ S 4 . □
The explicit orbits are the graphs of the four permutations forming the Klein four-group V 4 :
σ 0 = id : ( 0 , 1 , 2 , 3 ) ( 0 , 1 , 2 , 3 ) σ 1 = ( 0 1 ) ( 2 3 ) : ( 0 , 1 , 2 , 3 ) ( 1 , 0 , 3 , 2 ) σ 2 = ( 0 2 ) ( 1 3 ) : ( 0 , 1 , 2 , 3 ) ( 2 , 3 , 0 , 1 ) σ 3 = ( 0 3 ) ( 1 2 ) : ( 0 , 1 , 2 , 3 ) ( 3 , 2 , 1 , 0 )
We write Σ 0 = { σ 0 , σ 1 , σ 2 , σ 3 } = V 4 for this set of permutations.
Theorem 11
(Classification of standard bisimulations). A relation R Q × Q is a standard bisimulation if and only if there exists a subset S V 4 such that:
R = σ S R σ
where R σ : = { ( ( i , ϕ ) , ( σ ( i ) , ϕ ) ) : i { 0 , 1 , 2 , 3 } , ϕ Z 3 } .
In particular, the number of standard bisimulations on Q is 2 4 = 16 .
Proof. 
(Necessity.). Let R be a standard bisimulation. By 4, all pairs ( x , y ) R satisfy ph ( x ) = ph ( y ) . Define T : = { ( i , j ) { 0 , 1 , 2 , 3 } 2 : ( i , 0 ) R ( j , 0 ) } . By θ -stability, ( i , ϕ ) R ( j , ϕ ) iff ( i , j ) T .
(Closure implies union of orbits.) By 5, the child matching condition on R is equivalent to (1) on T. For each k Z 3 , the map g k is a permutation of { 0 , 1 , 2 , 3 } 2 , hence injective. Since T is finite and g k ( T ) T , injectivity implies | g k ( T ) | = | T | , so g k ( T ) = T . Thus T is stable under G and hence is a union of orbits. By 10, T = σ S Graph ( σ ) for some S V 4 , giving the required form.
(Sufficiency.) Conversely, let R = σ S R σ for arbitrary S V 4 . Each R σ satisfies phase matching (both elements have phase ϕ ) and is θ -stable: if ( i , ϕ ) R σ ( σ ( i ) , ϕ ) , then θ ( i , ϕ ) = ( i , ϕ + 1 ) and θ ( σ ( i ) , ϕ ) = ( σ ( i ) , ϕ + 1 ) , which is again in R σ . For child matching: since Graph ( σ ) is an orbit under G, it is stable under (1). Thus ( i , σ ( i ) ) Graph ( σ ) implies ( j k ( i ) , j k ( σ ( i ) ) ) Graph ( σ ) for each k Z 3 . By 5, child matching holds for R σ . A union of relations satisfying all three conditions still satisfies them. Hence R is a standard bisimulation.
(Counting.) Each S can be chosen from P ( V 4 ) , giving 2 4 = 16 standard bisimulations. □
Corollary 10
(Notable bisimulations).
(i)
Equality: S = { id } .
(ii)
V 4 -orbit equivalence: S = V 4 (the largest standard bisimulation).
Proof. 
1.
Equality: The diagonal Δ Q = { ( x , x ) : x Q } contains only pairs ( ( i , ϕ ) , ( i , ϕ ) ) , corresponding to σ = id , so S = { id } .
2.
V 4 -orbit equivalence: ( i , ϕ ) ( j , ϕ ) for all i , j in the same V 4 -orbit means all type-pairs in σ V 4 Graph ( σ ) = { 0 , 1 , 2 , 3 } 2 are related. Hence S = V 4 .
Remark 17.
The equality bisimulation is theuniquestandard bisimulation contained in the diagonal. This doesnotimply that Q is extensional in the classical sense, since larger bisimulations exist.

7.7. Coalgebra automorphisms of Q

Lemma 6
(Coalgebra automorphisms of Q ). Let p S 4 be a permutation. The map α p : Q Q defined by α p ( i , ϕ ) = ( p ( i ) , ϕ ) is a coalgebra automorphism if and only if
j t ( p ( i ) ) = p ( j t ( i ) ) for all i { 0 , 1 , 2 , 3 } , t Z 3 .
Proof. 
Since p is a permutation, α p is bijective with inverse α p 1 .
The map α p commutes with θ since θ ( p ( i ) , ϕ ) = ( p ( i ) , ϕ + 1 ) = α p ( i , ϕ + 1 ) = α p ( θ ( i , ϕ ) ) .
For the d-condition, recall that d ( i , ϕ ) k = ( j ϕ + k ( i ) , ϕ + k ) (9). Then:
d ( α p ( i , ϕ ) ) k = d ( p ( i ) , ϕ ) k = ( j ϕ + k ( p ( i ) ) , ϕ + k ) ,
while
α p ( d ( i , ϕ ) k ) = α p ( j ϕ + k ( i ) , ϕ + k ) = ( p ( j ϕ + k ( i ) ) , ϕ + k ) .
These are equal for all ( i , ϕ , k ) iff j ϕ + k ( p ( i ) ) = p ( j ϕ + k ( i ) ) for all i , ϕ , k . Setting t = ϕ + k , this is equivalent to j t ( p ( i ) ) = p ( j t ( i ) ) for all i , t Z 3 . □
Proposition 11
( V 4 -action by automorphisms). The Klein four-group
V 4 = { id , ( 0 1 ) ( 2 3 ) , ( 0 2 ) ( 1 3 ) , ( 0 3 ) ( 1 2 ) }
acts on Q by coalgebra automorphisms via p · ( i , ϕ ) = ( p ( i ) , ϕ ) .
Proof. 
We verify the condition of Lemma 6 for the two generators of V 4 .
Case p 1 = ( 0 1 ) ( 2 3 ) : From the table in Section 7.5:
i j 0 ( i ) j 1 ( i ) j 2 ( i ) p 1 ( j 0 ( i ) ) p 1 ( j 1 ( i ) ) p 1 ( j 2 ( i ) ) j 0 ( p 1 ( i ) ) j 1 ( p 1 ( i ) ) j 2 ( p 1 ( i ) )
0 1 2 3 0 3 2 0 3 2
1 0 3 2 1 2 3 1 2 3
2 3 0 1 2 1 0 2 1 0
3 2 1 0 3 0 1 3 0 1
Columns 5–7 equal columns 8–10, so j t ( p 1 ( i ) ) = p 1 ( j t ( i ) ) for all i , t .
Case p 2 = ( 0 2 ) ( 1 3 ) :
i j 0 ( i ) j 1 ( i ) j 2 ( i ) p 2 ( j 0 ( i ) ) p 2 ( j 1 ( i ) ) p 2 ( j 2 ( i ) ) j 0 ( p 2 ( i ) ) j 1 ( p 2 ( i ) ) j 2 ( p 2 ( i ) )
0 1 2 3 3 0 1 3 0 1
1 0 3 2 2 1 0 2 1 0
2 3 0 1 1 2 3 1 2 3
3 2 1 0 0 3 2 0 3 2
Again columns 5–7 equal columns 8–10, so j t ( p 2 ( i ) ) = p 2 ( j t ( i ) ) for all i , t .
Closure under composition: The condition j t ( p ( i ) ) = p ( j t ( i ) ) is stable under composition: if p , q both satisfy it, then for all i , t :
j t ( ( p q ) ( i ) ) = j t ( p ( q ( i ) ) ) = p ( j t ( q ( i ) ) ) = p ( q ( j t ( i ) ) ) = ( p q ) ( j t ( i ) ) .
Since p 1 2 = p 2 2 = id and the condition is stable under composition, it holds for every word in p 1 , p 2 , hence for every element of V 4 = p 1 , p 2 .
The action axioms ( p q ) · x = p · ( q · x ) and id · x = x follow from ( p q ) ( i ) = p ( q ( i ) ) and id ( i ) = i . □
Lemma 7
(Regularity of the V 4 -action). The action of V 4 on { 0 , 1 , 2 , 3 } is regular: for any i , j { 0 , 1 , 2 , 3 } , there exists a unique p V 4 such that p ( i ) = j .
Proof. 
Let X = { 0 , 1 , 2 , 3 } . The four elements of V 4 act on 0 as follows:
id ( 0 ) = 0 , ( 0 1 ) ( 2 3 ) ( 0 ) = 1 , ( 0 2 ) ( 1 3 ) ( 0 ) = 2 , ( 0 3 ) ( 1 2 ) ( 0 ) = 3 .
Hence Orb ( 0 ) = X , so the action is transitive. By the orbit-stabilizer theorem, | Orb ( i ) | = | V 4 | / | Stab ( i ) | for any i X . Since the action is transitive, | Orb ( i ) | = | X | = 4 = | V 4 | , so | Stab ( i ) | = 1 and the action is free. Given i , j X , transitivity yields p V 4 with p ( i ) = j . If also q ( i ) = j , then q 1 p Stab ( i ) = { e } , hence p = q . □
Corollary 11
(Non-injectivity of ι ¯ ). The morphism ι ¯ : Q Ω is not injective. The kernel of ι ¯ coincides with the orbit equivalence relation of the V 4 -action:
ι ¯ ( i , ϕ ) = ι ¯ ( j , ψ ) ϕ = ψ and j = p ( i ) for some p V 4 .
In particular, | im ( ι ¯ ) | = | Q | / | V 4 | = 12 / 4 = 3 .
Proof. 
Step 1: V 4 -invariance and factorization. By 11, for any p V 4 , the map α p is a coalgebra automorphism of Q . Since ι ¯ : Q Ω is the unique morphism to the final coalgebra, we have ι ¯ α p = ι ¯ . Hence ι ¯ is constant on V 4 -orbits, and there exists a unique map ι ˜ such that ι ¯ = ι ˜ π , where π : Q Q / V 4 is the quotient projection.
Step 2: Identification Q / V 4 Z 3 . Since V 4 acts transitively on the type component { 0 , 1 , 2 , 3 } and trivially on the phase component, each equivalence class π ( i , ϕ ) depends only on ϕ . The map η : Q / V 4 Z 3 defined by η ( π ( i , ϕ ) ) = ϕ is well-defined and bijective. Since V 4 acts trivially on the phase coordinate, θ ( i , ϕ ) = ( i , ϕ + 1 ) preserves V 4 -orbits, so the Z 3 -action on Q descends to a well-defined action on Q / V 4 given by θ ( π ( i , ϕ ) ) = π ( i , ϕ + 1 ) . Under this action, η is Z 3 -equivariant. Thus Q / V 4 Z 3 as Z 3 -sets.
Step 3: Equivariance and injectivity of ι ˜ . We first show that ι ˜ is Z 3 -equivariant. Since ι ¯ is a morphism of F-coalgebras, it is in particular equivariant: ι ¯ θ Q = θ Ω ι ¯ . Since the V 4 -action is trivial on the phase, θ Q sends orbits to orbits, so the quotient map π : Q Q / V 4 is equivariant: π θ Q = θ Q / V 4 π . Using ι ¯ = ι ˜ π :
ι ˜ θ Q / V 4 π = ι ˜ π θ Q = ι ¯ θ Q = θ Ω ι ¯ = θ Ω ι ˜ π .
Since π is surjective, ι ˜ θ Q / V 4 = θ Ω ι ˜ , so ι ˜ is equivariant.
Under the identification Q / V 4 Z 3 , any equivariant map f : Z 3 Ω satisfies f ( ϕ ) = θ ϕ ( f ( 0 ) ) . If ι ˜ ( ϕ ) = ι ˜ ( ψ ) , then θ ϕ ψ ( ι ˜ ( 0 ) ) = ι ˜ ( 0 ) . By freeness of the Z 3 -action on Ω (4), ϕ ψ = 0 , so ϕ = ψ . Thus ι ˜ is injective.
Step 4: Kernel computation. We have:
ι ¯ ( i , ϕ ) = ι ¯ ( j , ψ ) ι ˜ ( π ( i , ϕ ) ) = ι ˜ ( π ( j , ψ ) ) π ( i , ϕ ) = π ( j , ψ )
(since ι ˜ is injective), which holds iff ϕ = ψ and j = p ( i ) for some p V 4 .
Finally, | im ( ι ¯ ) | = | im ( ι ˜ ) | = | Q / V 4 | = 3 . □

8. Characterization of the Image

Having established that the canonical morphism ι : S Ω factors through the 12-element quotient Q , we now determine the structure of its image I Ω . The main result is that I is a 3-element sub-coalgebra forming a single θ -orbit, with completely explicit dynamics: d ( x ϕ ) = ( ϕ , x ϕ , x ϕ + 1 , x ϕ + 2 ) . This dramatic collapse—from 12 elements to 3—reflects the V 4 -symmetry of the rotation system on K 4 : the action on vertex types becomes invisible at the level of behavioral equivalence.
Definition 19
(Image coalgebra). Theimageof the canonical morphism is I : = ι ( S ) = ι ¯ ( Q ) Ω .
By 11, | I | = 3 . Since ι is equivariant, I is θ-stable; by freeness of the Z 3 -action (4), every orbit has size 3, so I is a single θ-orbit. We show in 13 that I is a sub-coalgebra, justifying the nameimage coalgebra.
Proposition 12
(Connectivity of I ). The image I is connected: its dependency graph has a single connected component.
Proof. 
The dependency graph G ( S ) is connected: as established in Section 6.1, G ( S ) coincides with the srs lattice, which is a connected 3-regular graph (see [15]).
The canonical morphism ι : S Ω is a coalgebra morphism (by finality), hence it preserves adjacency: if y = d i ( x ) in S , then ι ( y ) = d i ( ι ( x ) ) in Ω . For any path x 0 , x 1 , , x n in G ( S ) , the sequence ι ( x 0 ) , ι ( x 1 ) , , ι ( x n ) is a walk in G ( I ) (possibly with repeated vertices when ι identifies adjacent elements). Removing consecutive duplicates yields a path connecting ι ( x 0 ) to ι ( x n ) .
Since G ( S ) is connected and ι : S I is surjective, any two vertices in G ( I ) are connected by such a path. Therefore G ( I ) is connected. □
Proposition 13
(Structure of the image). The image I is a 3-element sub-coalgebra of Ω with the following properties:
(i)
I = { x 0 , x 1 , x 2 } where x ϕ = ι ¯ ( i , ϕ ) for any i { 0 , 1 , 2 , 3 }
(ii)
θ ( x ϕ ) = x ϕ + 1 (single orbit of size 3)
(iii)
d ( x ϕ ) = ( ϕ , x ϕ , x ϕ + 1 , x ϕ + 2 ) (observable phase ϕ; children are itself and its two rotations)
Proof. (1) Fix ϕ Z 3 and set x ϕ : = ι ¯ ( 0 , ϕ ) . Let i { 0 , 1 , 2 , 3 } . By 7, there exists p V 4 with p ( 0 ) = i . By 11 applied to ( 0 , ϕ ) and ( p ( 0 ) , ϕ ) = ( i , ϕ ) , we get ι ¯ ( i , ϕ ) = ι ¯ ( 0 , ϕ ) = x ϕ . Hence I = { ι ¯ ( i , ϕ ) : i { 0 , 1 , 2 , 3 } , ϕ Z 3 } { x 0 , x 1 , x 2 } . Since | I | = 3 (11), it follows that I = { x 0 , x 1 , x 2 } and these three elements are pairwise distinct.
(2) By Z 3 -equivariance of ι ¯ :
θ ( x ϕ ) = θ ( ι ¯ ( 0 , ϕ ) ) = ι ¯ ( θ ( 0 , ϕ ) ) = ι ¯ ( 0 , ϕ + 1 ) = x ϕ + 1 .
(3) Since ι ¯ is a coalgebra morphism, we have d ι ¯ = ( id Z 3 × ι ¯ × 3 ) d Q . Writing d Q ( i , ϕ ) = ( ϕ , ( j ϕ ( i ) , ϕ ) , ( j ϕ + 1 ( i ) , ϕ + 1 ) , ( j ϕ + 2 ( i ) , ϕ + 2 ) ) :
d ( ι ¯ ( i , ϕ ) ) = ( id Z 3 × ι ¯ × 3 ) ( d Q ( i , ϕ ) ) = ( ϕ , ι ¯ ( j ϕ ( i ) , ϕ ) , ι ¯ ( j ϕ + 1 ( i ) , ϕ + 1 ) , ι ¯ ( j ϕ + 2 ( i ) , ϕ + 2 ) ) .
By (1), for any type a { 0 , 1 , 2 , 3 } we have ι ¯ ( a , ψ ) = x ψ . Hence:
d ( x ϕ ) = ( ϕ , x ϕ , x ϕ + 1 , x ϕ + 2 ) .
(The observable phase is obs ( x ϕ ) = ϕ since coalgebra morphisms preserve the phase: obs ι ¯ = obs Q .) This shows I is closed under θ and d, hence a sub-coalgebra. □
Remark 18
(Collapse of type information). The V 4 -symmetry of the rotation system on K 4 causes all four vertex types to become identified in the final coalgebra. The only surviving invariant is the phase ϕ Z 3 . This reflects the high symmetry of srs: the coalgebra Q K 4 × Z 3 is not extensional. The quotient by the largest standard bisimulation (the V 4 -orbits) yields a 3-element coalgebra.
Remark 19
(Comparison with the srs quotient). The factorization S q Q ι ¯ I can be refined. Define Q ¯ : = Q / V 4 Z 3 . Then:
Preprints 195382 i003
where ι ¯ ¯ : Q ¯ I is an isomorphism of F-coalgebras. (The quotient Q ¯ inherits a coalgebra structure from Q since the V 4 -action consists of coalgebra automorphisms.) The image I is theextensional quotientof Q : the quotient by the largest standard bisimulation, which identifies elements with identical behavior in Ω.

9. Orbital Invariants

This section introduces intrinsic invariants that classify elements of an F-coalgebra by their local structure. These invariants—binding index, degeneracy degree, and multiplicity signature—are constant on θ -orbits. They provide a fine-grained stratification of any coalgebra.
The main result is the chirality theorem for regular coalgebras (12): every non-empty regular coalgebra is chiral. This structural obstruction, derived purely from the coalgebraic axioms, informs the symmetry analysis in Section 10.

9.1. Binding index and degeneracy

The binding index measures how “self-referential” an element is: it counts how many of its children belong to its own orbit. A high binding index indicates tight internal coupling within an orbit.
Definition 20
(Binding index). Thebinding indexof x X is:
E ( x ) : = | { k { 0 , 1 , 2 } : d ( x ) k Orb ( x ) } |
Values: E { 0 , 1 , 2 , 3 } .
Proposition 14
(Orbital invariance of E). E is constant on orbits: E ( θ ( x ) ) = E ( x ) .
Proof. 
Since ( X , θ ) Z 3 - Set , we have θ 3 = id , hence Orb ( θ ( x ) ) = { θ ( x ) , θ 2 ( x ) , x } = Orb ( x ) . By equivariance, d ( θ ( x ) ) k = d ( x ) k + 1 (indices mod 3). Thus
E ( θ ( x ) ) = | { k Z 3 : d ( x ) k + 1 Orb ( x ) } | = | { k Z 3 : d ( x ) k Orb ( x ) } | = E ( x ) ,
where the second equality uses the bijection k k + 1 on Z 3 . □
The degeneracy degree captures how “collapsed” the comultiplication is: it measures the failure of injectivity. Regular elements ( δ = 0 ) have three distinct children, while singular elements ( δ = 2 ) point to the same child three times.
Definition 21
(Degeneracy degree). Thedegeneracy degreeof x X is:
δ ( x ) : = 3 | { d ( x ) 0 , d ( x ) 1 , d ( x ) 2 } |
Values: δ { 0 , 1 , 2 } , corresponding to:
  • δ = 0 :regular— three distinct children
  • δ = 1 :binary— one repeated child
  • δ = 2 :singular— all children identical
Proposition 15
(Orbital invariance of δ ). δ is constant on orbits: δ ( θ ( x ) ) = δ ( x ) .
Proof. 
By equivariance, if d ( x ) = ( ϕ , a , b , c ) then d ( θ ( x ) ) = σ ^ ( d ( x ) ) = ( ϕ + 1 , b , c , a ) . Thus the children of θ ( x ) are ( d ( θ ( x ) ) 0 , d ( θ ( x ) ) 1 , d ( θ ( x ) ) 2 ) = ( b , c , a ) = ( d ( x ) 1 , d ( x ) 2 , d ( x ) 0 ) . As sets, { d ( θ ( x ) ) i } i = { d ( x ) i } i . Since δ ( x ) = 3 | { d ( x ) 0 , d ( x ) 1 , d ( x ) 2 } | , we have δ ( θ ( x ) ) = δ ( x ) . □

9.2. Multiplicity signature

The multiplicity signature refines the degeneracy degree by recording the full pattern of child repetitions. While δ only counts how many children coincide, μ preserves the exact distribution.
Definition 22
(Multiplicity signature). Themultiplicity signature μ ( x ) is the partition of 3 given by the multiplicities of values in the child multiset { d ( x ) 0 , d ( x ) 1 , d ( x ) 2 } , listed in decreasing order:
Type μ ( x ) Example
Regular ( 1 , 1 , 1 ) d ( x ) = ( a , b , c ) with a , b , c distinct
Binary ( 2 , 1 ) d ( x ) = ( a , a , b )
Singular ( 3 ) d ( x ) = ( a , a , a )
Since μ ( x ) depends only on the multiset of children, and by 15 this multiset is invariant under θ , we have μ ( θ ( x ) ) = μ ( x ) . Thus μ is constant on orbits.

9.3. Chirality

Definition 23
(Anti-chiral symmetry). Ananti-chiral symmetryof ( X , d , θ ) is a bijection ρ : X X satisfying:
  • Orientation reversal: ρ θ = θ 1 ρ
  • Child preservation: d ( ρ ( x ) ) i = ρ ( d ( x ) i ) for i = 0 , 1 , 2
Note: (AC2) concerns only the children; the observable phase satisfies obs ( ρ ( x ) ) = obs ( x ) as a consequence of (AC1) and equivariance: obs ( ρ ( θ ( x ) ) ) = obs ( θ 1 ( ρ ( x ) ) ) = obs ( ρ ( x ) ) 1 , which is consistent with obs ( θ ( x ) ) = obs ( x ) + 1 only if ρ preserves obs.
Definition 24
(Chirality). An F-coalgebra isachiralif it admits an anti-chiral symmetry. It ischiralif no such symmetry exists.
Remark 20
(Two senses of chirality). The term “chiral” is used in two related but distinct senses:
1.
Intrinsic chirality(24): an F-coalgebra is chiral if it admits no internal symmetry reversing the cyclic dynamics. This is analogous to a helix having no mirror plane.
2.
Chiral pair: two coalgebras related by reversing the rotation system (swapping the cyclic order of children) form a chiral pair—they are enantiomers, non-isomorphic mirror images of each other.
These notions are connected: an intrinsically chiral coalgebra and its mirror image (with reversed rotation system) form a chiral pair. The srs lattice and its enantiomer exemplify this: each is intrinsically chiral (12), and together they form a chiral pair corresponding to the two choices of orientation in R 3 .
Theorem 12
(Chirality of regular coalgebras). Every non-empty regular F-coalgebra (with δ = 0 everywhere) is chiral.
Proof. 
Suppose for contradiction that ( X , d , θ ) is a non-empty regular coalgebra admitting an anti-chiral symmetry ρ .
Since X , choose x X and write ( d 0 ( x ) , d 1 ( x ) , d 2 ( x ) ) = ( a , b , c ) for its children. By regularity ( δ = 0 ), the elements a , b , c are pairwise distinct. Let ϕ : = obs ( x ) denote the observable phase of x.
Step 1: Consequences of (AC1). The orientation reversal condition ρ θ = θ 1 ρ gives:
ρ ( θ ( x ) ) = θ 1 ( ρ ( x ) ) = θ 2 ( ρ ( x ) )
Step 2: Consequences of (AC2). The child preservation condition (AC2) gives:
( d 0 ( ρ ( x ) ) , d 1 ( ρ ( x ) ) , d 2 ( ρ ( x ) ) ) = ( ρ ( a ) , ρ ( b ) , ρ ( c ) )
By the note following 23, obs ( ρ ( x ) ) = obs ( x ) = ϕ .
Step 3: Computing d ( ρ ( θ ( x ) ) ) two ways.
Method 1: By equivariance, the children of θ ( x ) are ( d 0 ( θ ( x ) ) , d 1 ( θ ( x ) ) , d 2 ( θ ( x ) ) ) = ( b , c , a ) . Applying ρ via (AC2), the children of ρ ( θ ( x ) ) are ( ρ ( b ) , ρ ( c ) , ρ ( a ) ) .
Method 2: Using Step 1:
d ( ρ ( θ ( x ) ) ) = d ( θ 2 ( ρ ( x ) ) )
By (AC2), the children of ρ ( x ) are ( ρ ( a ) , ρ ( b ) , ρ ( c ) ) . By iterated equivariance, the children of θ 2 ( ρ ( x ) ) are σ 2 ( ρ ( a ) , ρ ( b ) , ρ ( c ) ) = ( ρ ( c ) , ρ ( a ) , ρ ( b ) ) .
Step 4: Contradiction. Comparing the two expressions:
( ρ ( b ) , ρ ( c ) , ρ ( a ) ) = ( ρ ( c ) , ρ ( a ) , ρ ( b ) )
This requires:
ρ ( b ) = ρ ( c ) ρ ( c ) = ρ ( a ) ρ ( a ) = ρ ( b )
Hence ρ ( a ) = ρ ( b ) = ρ ( c ) .
But ρ is a bijection and a , b , c are distinct, so ρ ( a ) , ρ ( b ) , ρ ( c ) must be distinct.
Contradiction. Therefore no anti-chiral symmetry exists, and the coalgebra is chiral. □
Corollary 12
(Chirality of srs). The srs coalgebra S and its quotient Q are chiral.
Proof. 
Both S and Q are non-empty (16 and 18).
For S : by 16, d ( v , ϕ ) = ( ( w ϕ , ϕ ) , ( w ϕ + 1 , ϕ + 1 ) , ( w ϕ + 2 , ϕ + 2 ) ) . The three components have distinct phases ϕ , ϕ + 1 , ϕ + 2 Z 3 , hence are pairwise distinct. Thus δ = 0 everywhere, so S is regular. By 12, S is chiral.
For Q : by 9, d Q ( i , ϕ ) = ( ( j ϕ ( i ) , ϕ ) , ( j ϕ + 1 ( i ) , ϕ + 1 ) , ( j ϕ + 2 ( i ) , ϕ + 2 ) ) . Again, the three components have distinct phases, hence are pairwise distinct. Thus δ = 0 everywhere, so Q is regular. By 12, Q is chiral. □
Remark 21
(Crystallographic chirality). The chirality of the srs coalgebra (12) corresponds to the crystallographic chirality of the srs lattice itself: it has space group I 4 1 32 , and its mirror image (the srs * lattice) has space group I 4 3 32 . These are distinct enantiomorphs, not superimposable by any rotation.

9.4. Classification by orbit count

Using the invariants E and δ , we classify finite sub-coalgebras by their number of orbits.
Example 2
(Sub-coalgebras by orbit count). We classify connected sub-coalgebras (6) by orbit count.
One orbit ( | Y | = 3 ):Let Y = { x 0 , x 1 , x 2 } with θ ( x i ) = x i + 1 . Closure under d requires d ( x i ) Y 3 .
The possible structures are determined by E and δ:
  • E = 3 , δ = 2 (singular): d ( x 0 ) = ( x 0 , x 0 , x 0 ) . All children equal to self.
  • E = 3 , δ = 1 (binary): d ( x 0 ) = ( x 1 , x 1 , x 2 ) . Two children repeated.
  • E = 3 , δ = 0 (regular): d ( x 0 ) = ( x 0 , x 1 , x 2 ) . All distinct, all internal.
Note: E < 3 is impossible for a single orbit, since all children must be in Y = Orb ( x 0 ) .
Two orbits ( | Y | = 6 ):Let Y = Orb ( a ) Orb ( b ) with 6 elements. Examples:
  • Symmetric: Each orbit points to the other with reciprocal edges.
  • Asymmetric: One orbit points to the other without reciprocation.
Four orbits ( | Y | = 12 ):The quotient coalgebra Q K 4 × Z 3 is the canonical example (Section 7).
Proposition 16
(Classification of 3-element coalgebras). Let ( X , d , θ ) be a 3-element F-coalgebra. Then X consists of a single orbit (hence is automatically connected), E = 3 , and the structure is classified as follows:
(i)
Singular( δ = 2 ): All children coincide, d ( x ) = ( y , y , y ) for some y X . Unique up to isomorphism.
(ii)
Binary( δ = 1 ): Exactly two children coincide. Unique up to isomorphism.
(iii)
Regular( δ = 0 ): All three children are distinct, hence { d ( x ) 0 , d ( x ) 1 , d ( x ) 2 } = X .Two non-isomorphic structures(chiral pair).
In total, there are exactly four isomorphism classes of 3-element F-coalgebras. The image coalgebra I from Section 8 belongs to the regular right-handed class: by 13, d ( x ϕ ) = ( ϕ , x ϕ , x ϕ + 1 , x ϕ + 2 ) , giving π = id .
Proof. 
By 1, the Z 3 -action is free, so with | X | = 3 there is exactly one orbit: X = { x 0 , x 1 , x 2 } with θ ( x i ) = x i + 1 mod 3 . Since Orb ( x ) = X and the children ( d 0 ( x ) , d 1 ( x ) , d 2 ( x ) ) X 3 , all three children lie in Orb ( x ) , hence E ( x ) = 3 for all x.
By equivariance, the structure is determined by the children of x 0 : if d ( x 0 ) = ( x a , x b , x c ) , then d ( x i ) = ( x a + i , x b + i , x c + i ) (indices mod 3).
Cases δ = 2 and δ = 1 : For δ = 2 , the children are ( x j , x j , x j ) for some j. All such structures are isomorphic via x i x i j . For δ = 1 , the children have the form ( x j , x j , x k ) with j k ; similar reasoning shows uniqueness up to isomorphism.
Case δ = 0 (chirality): The children ( x a , x b , x c ) form a permutation of ( x 0 , x 1 , x 2 ) . Define π S 3 by π ( i ) : = j where d ( x 0 ) i = x j . By equivariance, the coalgebra structure is determined by π . However, an isomorphism ϕ : X X sending x i x i + k conjugates π to σ k π σ k , where σ = ( 012 ) is the standard 3-cycle. Thus isomorphism classes correspond to conjugacy classes of S 3 under the cyclic group σ .
The conjugacy classes under σ are:
  • { id } : yields d ( x 0 ) = ( x 0 , x 1 , x 2 ) (identity permutation).
  • { ( 012 ) , ( 012 ) } = { ( 012 ) } : yields d ( x 0 ) = ( x 1 , x 2 , x 0 ) , isomorphic to identity via x i x i + 1 .
  • { ( 021 ) } : yields d ( x 0 ) = ( x 2 , x 1 , x 0 ) , isomorphic to identity via x i x i + 2 .
  • { ( 01 ) , ( 12 ) , ( 02 ) } : the three transpositions form one orbit under conjugation by σ .
The first three classes all give the same structure (the right-handed helix). The transposition class gives d ( x 0 ) = ( x 1 , x 0 , x 2 ) or equivalent, the left-handed helix d ( x 0 ) = ( x 0 , x 2 , x 1 ) .
An equivariant isomorphism must preserve the cyclic order of children; since the right- and left-handed helices have opposite cyclic orientations, they are non-isomorphic. They form a chiral pair: each is the mirror image of the other. □
Remark 22
(Summary of classification results). The orbital invariants ( E , δ ) together with chirality provide a complete classification toolkit for small coalgebras:
  • Single orbit( | X | = 3 ): This is the minimal case (7). Necessarily E = 3 ; the degeneracy δ { 0 , 1 , 2 } partitions structures, but δ = 0 admits a chiral pair, yielding exactlyfourisomorphism classes.
  • Two orbits( | X | = 6 ): The binding indices E distinguish symmetric from asymmetric structures.
  • Four orbits( | X | = 12 ): The quotient Q is the canonical example; larger orbit counts arise in non-trivial sub-coalgebras of S .
This classification extends the group-theoretic principle that small structures are determined by local invariants, with chirality appearing as an additional discrete invariant for regular structures.

10. Symmetry Analysis

This section analyzes symmetry in F-coalgebras. We prove that the image I is symmetric while the final coalgebra Ω is not, and provide an intrinsic characterization using the invariants from Section 9.

10.1. Neighbor sets and symmetry

Definition 25
(In-neighbors). Recall from 4 that N + ( x ) = { d 0 ( x ) , d 1 ( x ) , d 2 ( x ) } denotes the child set (out-neighbors) of x. We define thein-neighborsof x as:
N ( x ) : = { y X : x N + ( y ) }
Definition 26
(Symmetry). An F-coalgebra issymmetricif the child relation is symmetric: for all x , y X ,
y N + ( x ) x N + ( y )
Equivalently, defining the directed child relation R : = { ( x , y ) : y N + ( x ) } , the coalgebra is symmetric iff R is symmetric as a binary relation. In terms of the dependency graph G ( X ) (4): for distinct x y , an edge { x , y } E ( G ( X ) ) exists iff both y N + ( x ) and x N + ( y ) .
Definition 27
(Asymmetry index). Theasymmetry indexof x X is:
A + ( x ) : = | { y N + ( x ) : x N + ( y ) } |
This counts unreciprocated outgoing edges.
Lemma 8
(Orbit neighbor invariance). For any x X : N + ( θ ( x ) ) = N + ( x ) (as sets).
Proof. 
By equivariance, d ( θ ( x ) ) = σ ^ ( d ( x ) ) . Since σ ^ ( ϕ , a , b , c ) = ( ϕ + 1 , b , c , a ) , the children of θ ( x ) are ( b , c , a ) , the same set as ( a , b , c ) . Hence N + ( θ ( x ) ) = N + ( x ) . □
Corollary 13
(Orbital constancy of neighbors). All elements of an orbit have the same out-neighbor set.
Proof. 
Fix x X . By 8, for all y X we have N + ( θ ( y ) ) = N + ( y ) . Hence:
N + ( θ 0 ( x ) ) = N + ( x ) , N + ( θ 1 ( x ) ) = N + ( θ ( x ) ) = N + ( x ) ,
and N + ( θ 2 ( x ) ) = N + ( θ ( θ ( x ) ) ) = N + ( θ ( x ) ) = N + ( x ) . Therefore N + ( θ k ( x ) ) = N + ( x ) for all k { 0 , 1 , 2 } Z 3 . Hence all elements in the θ -orbit of x share the same out-neighbor set. □

10.2. Asymmetry propagation

Remark 23
(Asymmetry as an invariant). In the final coalgebra Ω, standard bisimilarity coincides with equality (3), so any function on Ω—including A + —is trivially a bisimulation invariant. For non-extensional coalgebras, however, A + isnota standard bisimulation invariant in general, since standard bisimulation preserves the existence of bisimilar correspondents, not the identity of states.
Lemma 9
(Asymmetry propagation). Let ( X , d , θ ) be an F-coalgebra in Z 3 - Set (so θ 3 = id and | N + ( x ) | 3 for all x) admitting an infinite group Γ of coalgebra automorphisms acting freely on X. If there exists x 0 X with A + ( x 0 ) > 0 , then:
(i)
There exist infinitely many elements with A + > 0 .
(ii)
These elements are spread across infinitely many θ-orbits (i.e., infinitely many orbits contain at least one element with A + > 0 ).
Proof. Part 1: Suppose A + ( x 0 ) > 0 . Then there exists y 0 N + ( x 0 ) with x 0 N + ( y 0 ) , so ( x 0 , y 0 ) is an unreciprocated edge.
Let U = { ( x , y ) : y N + ( x ) , x N + ( y ) } be the set of unreciprocated directed edges.
For any g Γ , since g is a coalgebra automorphism, it commutes with d: d ( g ( x ) ) = g × 3 ( d ( x ) ) . Hence N + ( g ( x ) ) = g ( N + ( x ) ) , so y N + ( x ) iff g ( y ) N + ( g ( x ) ) , and x N + ( y ) iff g ( x ) N + ( g ( y ) ) . Therefore ( x , y ) U iff ( g ( x ) , g ( y ) ) U .
Since Γ acts freely, the map g g ( x 0 ) is injective. As Γ is infinite, the set { g ( x 0 ) : g Γ } is infinite. For each g Γ , ( g ( x 0 ) , g ( y 0 ) ) U , with distinct first coordinates for distinct g. Hence | U | = .
Since | N + ( x ) | 3 , each element contributes at most 3 edges to U. With | U | = , infinitely many elements have A + > 0 .
Part 2: Since θ 3 = id , each θ -orbit has size at most 3. Hence infinitely many elements with A + > 0 implies infinitely many θ -orbits containing at least one element with A + > 0 . □
Lemma 10
(Asymmetry creates distinguishability in Ω ). In the final coalgebra Ω, if A + ( x ) A + ( y ) , then x y .
Proof. 
In Ω , standard bisimilarity coincides with equality (3). Hence any function on Ω —including A + —respects equality: if x = y , then A + ( x ) = A + ( y ) . Contrapositively, A + ( x ) A + ( y ) implies x y . □

10.3. Symmetry of the image

Lemma 11
(Graph of an endomorphism is a bisimulation). Let ( X , d , θ ) be an F-coalgebra in Z 3 - Set , and let g : X X be a coalgebra endomorphism (i.e., equivariant: g θ = θ g , and compatible: d g = ( id Z 3 × g × 3 ) d ). Then the graph of g,
Gr ( g ) : = { ( x , g ( x ) ) : x X } X × X ,
is a standard bisimulation on X, and hence x g ( x ) for all x X .
Proof. 
Let ( x , g ( x ) ) Gr ( g ) . We verify the three conditions of 9.
Phase matching: By compatibility, obs ( g ( x ) ) = obs ( x ) (since coalgebra morphisms preserve the Z 3 -component; see 7).
θ-stability: By equivariance, θ ( g ( x ) ) = g ( θ ( x ) ) . Hence
( θ ( x ) , θ ( g ( x ) ) ) = ( θ ( x ) , g ( θ ( x ) ) ) Gr ( g ) .
Child matching: Write d ( x ) = ( ϕ , x 0 , x 1 , x 2 ) . By compatibility, d ( g ( x ) ) = ( id Z 3 × g × 3 ) ( d ( x ) ) = ( ϕ , g ( x 0 ) , g ( x 1 ) , g ( x 2 ) ) . For each i { 0 , 1 , 2 } , we have ( x i , g ( x i ) ) Gr ( g ) .
Hence Gr ( g ) satisfies all conditions of 9. □
Theorem 13
(Symmetry of the image). The image I = ι ( S ) Ω is symmetric:
x , y I : y N + ( x ) x N + ( y )
Proof. 
By 13, I = { x 0 , x 1 , x 2 } with d ( x ϕ ) = ( x ϕ , x ϕ + 1 , x ϕ + 2 ) for ϕ Z 3 .
For any x ϕ , x ψ I , we verify:
  • N + ( x ϕ ) = { d 0 ( x ϕ ) , d 1 ( x ϕ ) , d 2 ( x ϕ ) } = { x ϕ , x ϕ + 1 , x ϕ + 2 } = I
Hence N + ( x ϕ ) = I for all ϕ . Therefore:
x ψ N + ( x ϕ ) x ψ I x ϕ I x ϕ N + ( x ψ )
This shows I is symmetric (in fact, G ( I ) K 3 , with each element also being its own child). □
Corollary 14
(Graph structure of the image). The dependency graph G ( I ) is the complete graph K 3 . Every element x I has N + ( x ) = I : all three children of x lie in I (including x itself, i.e., d i ( x ) = x for some i).
Proof. 
By 13, | I | = 3 and N + ( x ) = I for all x I . Since N + ( x ) includes x itself, we have d i ( x ) = x for some i; since N + ( x ) also contains the two other elements of I , every pair of distinct vertices is adjacent in G ( I ) . Thus G ( I ) K 3 . (Note: self-loops d i ( x ) = x are not edges in G ( I ) by 4, but reflect the coalgebra structure of I .) □

10.4. Asymmetry of the final coalgebra

Unlike the image I , the full final coalgebra Ω is not symmetric.
Proposition 17
(Asymmetry of Ω ). The final coalgebra Ω contains unreciprocated edges and is therefore asymmetric.
Proof. 
By 1, d : Ω Z 3 × Ω 3 is an isomorphism (see also 5). Consider the element z : = d 1 ( ϕ 0 , x 0 , x 0 , x 0 ) Ω , where x 0 I with obs ( x 0 ) = ϕ 0 .
We have N + ( z ) = { x 0 } (a singleton, since d ( z ) = ( ϕ 0 , x 0 , x 0 , x 0 ) ).
However, z N + ( x 0 ) : by 13, d ( x 0 ) = ( ϕ 0 , x 0 , x 1 , x 2 ) with x 0 , x 1 , x 2 distinct, so N + ( x 0 ) = { x 0 , x 1 , x 2 } I . Since the children of z are all equal to x 0 , we have δ ( z ) = 2 (singular), whereas all elements of I satisfy δ = 0 (regular, by 13). Hence z I , and therefore z N + ( x 0 ) .
The edge z x 0 is unreciprocated, so Ω is asymmetric. □
Remark 24
(Propagation of asymmetry). By 9, if a coalgebra admits an infinite group of automorphisms acting freely and contains a single unreciprocated edge, then infinitely many θ-orbits contain asymmetric elements. Whether Ω admits such a group action is an open question; if it does, the counter-example z would propagate to produce infinitely many asymmetric orbits.
Remark 25
(Symmetry of S vs asymmetry of Ω ). The srs coalgebra S is symmetric (as a graph, srs is undirected and 3-regular). However, since ι : S Ω is not injective, symmetry of S does not transfer to Ω. The counter-example z = d 1 ( ϕ 0 , x 0 , x 0 , x 0 ) lies outside ι ( S ) .
This reveals a fundamental distinction: symmetry isnotpreserved by the canonical morphism to the final coalgebra.

10.5. Intrinsic characterization of symmetry

Using the orbital invariants E (binding index) and δ (degeneracy) from Section 9, we characterize symmetry without reference to external structure.
Theorem 14
(Intrinsic symmetry criterion). Let x Ω . If:
(i)
Regularity: δ ( x ) = 0 (three distinct children)
(ii)
Total binding: E ( x ) = 3 (all children in Orb ( x ) )
then the sub-coalgebra generated by Orb ( x ) is symmetric.
Proof. 
Suppose δ ( x ) = 0 and E ( x ) = 3 . Write d ( x ) = ( a , b , c ) with a , b , c pairwise distinct (since δ ( x ) = 0 ).
Since E ( x ) = 3 , we have { a , b , c } Orb ( x ) by 20. By freeness of the Z 3 -action (4), | Orb ( x ) | = 3 . Since | { a , b , c } | = 3 , we obtain { a , b , c } = Orb ( x ) .
Let y Orb ( x ) . By 13, N + ( y ) = N + ( x ) = { a , b , c } = Orb ( x ) . In particular, d ( y ) Orb ( x ) 3 , so Orb ( x ) is closed under d. Since Orb ( x ) is closed under θ by definition of orbit, the sub-coalgebra generated by Orb ( x ) is Orb ( x ) itself.
For any y , z Orb ( x ) : z N + ( y ) = Orb ( x ) and y N + ( z ) = Orb ( x ) . Hence symmetry holds. □
Corollary 15
(Characterization of I ). The image I is the unique sub-coalgebra of Ω satisfying:
(i)
| S | = 3 ,
(ii)
δ ( x ) = 0 for all x S ,
(iii)
E ( x ) = 3 for all x S , and
(iv)
d ( x ) 0 = x for all x S (self-reference property).
Proof. 
Existence: By 13, I = { x 0 , x 1 , x 2 } with d ( x ϕ ) = ( x ϕ , x ϕ + 1 , x ϕ + 2 ) . Hence | I | = 3 . The three children are distinct, so δ ( x ϕ ) = 0 . All children lie in Orb ( x ϕ ) = I , giving E ( x ϕ ) = 3 . Finally, d ( x ϕ ) 0 = x ϕ , confirming the self-reference property.
Uniqueness: Let S Ω satisfy all four conditions. Pick x S . By 4, the Z 3 -action on Ω is free, so | Orb ( x ) | = 3 . Since S is a sub-coalgebra in Z 3 - Set , the inclusion S Ω is equivariant, hence θ ( S ) S and thus Orb ( x ) S . Combined with | Orb ( x ) | = | S | = 3 , we obtain S = Orb ( x ) .
By conditions (2) and (3), for any y S , the children d ( y ) 0 , d ( y ) 1 , d ( y ) 2 are distinct and all lie in S. By condition (4), d ( y ) 0 = y . Thus d ( y ) = ( y , d ( y ) 1 , d ( y ) 2 ) with { d ( y ) 1 , d ( y ) 2 } = S { y } = { θ ( y ) , θ 2 ( y ) } .
By equivariance, d ( θ ( y ) ) = σ ( d ( y ) ) = ( d ( y ) 1 , d ( y ) 2 , y ) . But condition (4) requires d ( θ ( y ) ) 0 = θ ( y ) , so d ( y ) 1 = θ ( y ) . Hence d ( y ) 2 = θ 2 ( y ) , and we conclude d ( y ) = ( y , θ ( y ) , θ 2 ( y ) ) for all y S .
This matches exactly the structure of I (13): both S and I consist of a single orbit where each element y satisfies d ( y ) = ( obs ( y ) , y , θ ( y ) , θ 2 ( y ) ) .
Define h : S I by h ( θ k ( x ) ) = x k , where x 0 , x 1 , x 2 are the elements of I as in 13. This is well-defined since | Orb ( x ) | = 3 ensures each s S has a unique representation s = θ k ( x ) . By construction, h is an equivariant coalgebra isomorphism.
Since S Ω and I Ω , and both are sub-coalgebras with identical structure, we show S = I directly. Let s S with s = θ k ( x ) . Then obs ( s ) = k (by equivariance) and d ( s ) = ( obs ( s ) , s , θ ( s ) , θ 2 ( s ) ) . The element x k I satisfies the same: obs ( x k ) = k and d ( x k ) = ( k , x k , x k + 1 , x k + 2 ) . By extensionality of Ω (3), elements with identical behavior are equal. Since s and x k have the same observable and their children satisfy θ j ( s ) x k + j for all j (by the same argument applied inductively), we conclude s = x k . Hence S = I . □
Remark 26.
The self-reference condition d ( x ) 0 = x is essential. Without it, there exist exactly two other isomorphism classes of 3-element sub-coalgebras with δ = 0 and E = 3 : those where the first-child map x d ( x ) 0 equals θ or θ 2 rather than the identity. These embed into Ω as disjoint sub-coalgebras.
Example 3
(Why z is asymmetric). The counter-example z = d 1 ( ϕ 0 , x 0 , x 0 , x 0 ) fails both conditions of 14:
  • d ( z ) = ( ϕ 0 , x 0 , x 0 , x 0 ) , so δ ( z ) = 2 (singular).
  • E ( z ) = 0 : the unique child of z is x 0 I , but x 0 Orb ( z ) . Indeed, δ is constant on orbits (15), and δ ( z ) = 2 while δ ( x 0 ) = 0 , so Orb ( z ) I = .
The element z is maximally “unbound” from its orbit.
Remark 27
(Symmetry landscape).
Structure Symmetric? Reason
I (image) Yes δ = 0 , E = 3 (14)
S (srs lattice) Yes Geometric (undirected graph)
Ω (final coalgebra) No Counter-example z (17)
Finite coalgebras Not necessarily 4

10.6. Finite coalgebras can be asymmetric

Unlike infinite coalgebras with covering space structure (such as S ), finite coalgebras are not constrained to be symmetric.
Proposition 18
(Existence of asymmetric finite coalgebras). Finite F-coalgebras can be asymmetric.
Proof. 
4 below constructs a 6-element F-coalgebra ( X , d , θ ) that satisfies equivariance ( d θ = σ ^ d ) and exhibits unreciprocated edges (i.e., A + > 0 for some element, cf. 27): elements of Orb ( a 0 ) have children in Orb ( b 0 ) , but no element of Orb ( b 0 ) has children in Orb ( a 0 ) . Thus the symmetry of I (13) is a special property of that particular sub-coalgebra, not a general property of finite coalgebras. □
Example 4
(Asymmetric finite coalgebra). Consider X = { a 0 , a 1 , a 2 , b 0 , b 1 , b 2 } with two θ-orbits: Orb ( a 0 ) = { a 0 , a 1 , a 2 } and Orb ( b 0 ) = { b 0 , b 1 , b 2 } .
Define θ ( a i ) = a i + 1 and θ ( b i ) = b i + 1 (indices mod 3).
Define comultiplication by specifying d ( x ) Z 3 × X 3 for each element. We set obs ( a i ) = obs ( b i ) = i and:
d ( a 0 ) = ( 0 , b 0 , b 1 , b 2 ) d ( b 0 ) = ( 0 , b 1 , b 2 , b 0 ) d ( a 1 ) = ( 1 , b 1 , b 2 , b 0 ) d ( b 1 ) = ( 1 , b 2 , b 0 , b 1 ) d ( a 2 ) = ( 2 , b 2 , b 0 , b 1 ) d ( b 2 ) = ( 2 , b 0 , b 1 , b 2 )
We verify equivariance d θ = σ ^ d . For a 0 :
d ( θ ( a 0 ) ) = d ( a 1 ) = ( 1 , b 1 , b 2 , b 0 ) = σ ^ ( 0 , b 0 , b 1 , b 2 ) = σ ^ ( d ( a 0 ) ) .
Similarly for all other elements. Thus ( X , d , θ ) is an F-coalgebra.
This structure is asymmetric:
  • From orbit Orb ( a 0 ) : edges go to orbit Orb ( b 0 )
  • From orbit Orb ( b 0 ) : edges stay within orbit Orb ( b 0 )
  • N + ( a 0 ) = { b 0 , b 1 , b 2 } but a 0 N + ( b i ) for any i
The in-degree of elements in Orb ( a 0 ) is 0, while their out-degree is 3. The in-degree of elements in Orb ( b 0 ) is 6 (3 from Orb ( a 0 ) plus 3 from Orb ( b 0 ) ).
This example shows that finite coalgebras can have directed (asymmetric) dependency graphs.

11. Uniqueness of the Geometric Realization

This section establishes that the srs lattice is, in a precise sense, the unique geometric realization of the HTC structure. The main result is the srs uniqueness theorem (17), which shows that among sub-coalgebras of Ω , symmetry and connectivity alone characterize srs.
The logical flow is:
1.
Symmetry implies regularity: for | S | > 3 , symmetry forces δ = 0 (12).
2.
Symmetry implies polynomial growth: the coalgebra structure constrains the covering to have abelian deck group (15).
3.
Polynomial growth implies periodicity: the deck group is Z r with r 1 (16).
4.
srs uniqueness: the only possibilities are the trivial 3-orbit or srs (17).

11.1. Uniqueness from symmetry alone

The following results show that symmetry alone—together with connectivity and being a sub-coalgebra of Ω —suffices to characterize srs. Regularity and periodicity emerge automatically.
Definition 28
(Symmetric sub-coalgebra). A sub-coalgebra S Ω issymmetricif its dependency graph G ( S ) is undirected:
y N + ( x ) x N + ( y ) for all x , y S .
Lemma 12
(Symmetry implies regularity in Ω ). Let S Ω be a symmetric sub-coalgebra with | S | > 3 . Then S is regular: δ ( x ) = 0 for all x S .
For | S | = 3 , the unique symmetric sub-coalgebra is a Z 3 -orbit with δ ( x ) = 1 for all x.
Proof. 
We prove by contradiction. Suppose δ ( x ) > 0 for some x S , say d 0 ( x ) = d 1 ( x ) = a .
Step 1: Parent maps in Ω . By 5, for each a Ω and Z 3 , there is a unique p ( a ) Ω with d ( p ( a ) ) = a .
Since d 0 ( x ) = a and d 1 ( x ) = a , we have x = p 0 ( a ) = p 1 ( a ) .
Step 2: Symmetry constrains a. By symmetry, a N + ( x ) implies x N + ( a ) , so x = d k ( a ) for some k Z 3 .
Step 3: Children of a must be parents of a. By symmetry, each child y = d i ( a ) satisfies y N + ( a ) a N + ( y ) . Thus a = d j ( y ) for some j, meaning y = p j ( a ) .
Therefore: { d 0 ( a ) , d 1 ( a ) , d 2 ( a ) } { p 0 ( a ) , p 1 ( a ) , p 2 ( a ) } .
Step 4: Contradiction if δ ( a ) = 0 . If δ ( a ) = 0 , then a has 3 distinct children: | { d 0 ( a ) , d 1 ( a ) , d 2 ( a ) } | = 3 .
But from Step 1, p 0 ( a ) = p 1 ( a ) = x . So | { p 0 ( a ) , p 1 ( a ) , p 2 ( a ) } | 2 .
By Step 3, the 3 distinct children must fit into a set of size 2 . Contradiction.
Therefore δ ( a ) > 0 .
Step 5: Propagation. We’ve shown: δ ( x ) > 0 implies δ ( a ) > 0 for a = d 0 ( x ) = d 1 ( x ) .
Iterating: a has a repeated child c, which has a repeated child, etc. This produces an infinite sequence or a cycle.
In either case, every element in the sequence has δ > 0 .
Step 6: Classification of symmetric sub-coalgebras with δ > 0 everywhere. Suppose every element of S has δ > 0 . Then each x S has at most 2 distinct children.
The chain x a c (where each arrow denotes the repeated child) must close into a cycle for S to be finite.
By 7, every finite sub-coalgebra of Ω has | S | 3 . Thus we only consider | S | 3 .
Case | S | = 3 : Suppose S = { x , a , c } with a the repeated child of x, c the repeated child of a, and x the repeated child of c (cyclic).
By symmetry: a N + ( x ) x N + ( a ) . Since N + ( a ) { c , d 2 ( a ) } and x c , we need d 2 ( a ) = x .
Similarly: c N + ( a ) a N + ( c ) . Since N + ( c ) { x , d 2 ( c ) } and a x , we need d 2 ( c ) = a .
And: x N + ( c ) c N + ( x ) . Since N + ( x ) { a , d 2 ( x ) } and c a , we need d 2 ( x ) = c .
So: d ( x ) = ( ϕ x , a , a , c ) , d ( a ) = ( ϕ a , c , c , x ) , d ( c ) = ( ϕ c , x , x , a ) .
Check symmetry: N + ( x ) = { a , c } , N + ( a ) = { c , x } , N + ( c ) = { x , a } . Indeed, y N + ( z ) z N + ( y ) for all pairs.
But now check sub-coalgebra closure. We need d i ( x ) , d i ( a ) , d i ( c ) S for all i.
So | S | = 3 with this structure is a valid symmetric sub-coalgebra—but δ ( x ) = 1 for all x (each has one repeated child). This is the unique symmetric sub-coalgebra of size 3.
Case | S | 4 with δ > 0 everywhere: We show this case is impossible in Ω by deriving a contradiction from the coalgebra coherence axiom.
Suppose S is a finite symmetric sub-coalgebra with | S | 4 and δ ( x ) > 0 for all x S . Each element has exactly 2 distinct children (the repeated child and a third child).
Step 6a: Structure of the repeated-child graph. Define a directed graph R on S where x y iff y is the repeated child of x. Since each x has exactly one repeated child and S is finite, R consists of disjoint directed cycles.
Let C = ( x 0 , x 1 , , x m 1 ) be one such cycle, with x i + 1 the repeated child of x i (indices mod m).
Step 6b: Symmetry constrains the third child. For each x i C , let y i : = d 2 ( x i ) be the third child (with d 0 ( x i ) = d 1 ( x i ) = x i + 1 ).
By symmetry: x i + 1 N + ( x i ) x i N + ( x i + 1 ) .
The children of x i + 1 are { x i + 2 , y i + 1 } . So x i { x i + 2 , y i + 1 } .
If x i = x i + 2 , then m = 2 . But by 7, every finite sub-coalgebra has | S | = 3 k for some k 1 (since it is a union of complete Z 3 -orbits of size 3). Thus m 3 .
Therefore y i + 1 = x i for all i: the third child of x i + 1 is x i .
This gives: d ( x i ) = ( ϕ i , x i + 1 , x i + 1 , x i 1 ) for all i Z m .
Step 6c: The cycle must be all of S. Since d 2 ( x i ) = x i 1 C for all i, the cycle C is closed under all children. By sub-coalgebra minimality considerations, if S is connected, then S = C . So | S | = m .
Since | S | = m and | S | is divisible by 3 (by 7), we have m { 3 , 6 , 9 , } .
For m = 3 : this is the case already handled above (valid symmetric sub-coalgebra).
For m 6 : we derive a contradiction from the coalgebra axioms.
Step 6d: Coherence with the Z 3 -action. In Ω , the structure map satisfies the coherence axiom: θ ( d i ( x ) ) = d i + 1 ( θ ( x ) ) for all x and i Z 3 .
Since S is a sub-coalgebra, θ ( S ) = S . Consider θ ( x 0 ) = x j for some j.
From d 0 ( x 0 ) = x 1 :
θ ( x 1 ) = θ ( d 0 ( x 0 ) ) = d 1 ( θ ( x 0 ) ) = d 1 ( x j ) = x j + 1 .
By induction, θ ( x i ) = x i + j for all i. So θ acts as a shift by j.
Since θ 3 = id : 3 j 0 ( mod m ) .
Since the Z 3 -action is free: j ¬ 0 ( mod m ) and 2 j ¬ 0 ( mod m ) .
Step 6e: Contradiction from d 1 . Now use coherence on d 1 :
θ ( d 1 ( x 0 ) ) = d 2 ( θ ( x 0 ) ) θ ( x 1 ) = d 2 ( x j ) .
From Step 6b, d 2 ( x j ) = x j 1 .
So θ ( x 1 ) = x j 1 .
But from Step 6d, θ ( x 1 ) = x 1 + j .
Therefore: x 1 + j = x j 1 , i.e., 1 + j j 1 ( mod m ) , i.e., 2 0 ( mod m ) .
This requires m 2 , so m { 1 , 2 } . But m 6 . Contradiction.
Therefore, no symmetric sub-coalgebra with | S | 4 and δ > 0 everywhere can exist in Ω .
Conclusion. Symmetric sub-coalgebras with δ > 0 somewhere have | S | 3 . For | S | = 3 , the unique configuration has δ ( x ) = 1 for all x, forming a single Z 3 -orbit.
For | S | > 3 , we must have δ ( x ) = 0 for all x S . □
Definition 29
(Growth function). For a connected graph G and vertex x 0 V ( G ) , thegrowth functionis
β G ( n ) : = | B n ( x 0 ) | = | { y V ( G ) : d G ( x 0 , y ) n } | ,
where d G denotes graph distance. Growth ispolynomialif β G ( n ) = O ( n k ) for some k, andexponentialif β G ( n ) c λ n for some c > 0 , λ > 1 .
Theorem 15
(Sub-exponential growth). Let S Ω be an infinite symmetric connected sub-coalgebra. Then the growth function β G ( S ) ( n ) is sub-exponential.
Proof. 
By 12, G : = G ( S ) is a connected 3-regular graph. We prove sub-exponential growth by analyzing the constraints imposed by the coalgebra structure.
Step 1: Finite local types. The coalgebra structure d : S Z 3 × S 3 assigns to each x S :
  • A phase ϕ ( x ) Z 3 ,
  • Three children d 0 ( x ) , d 1 ( x ) , d 2 ( x ) S (which, by symmetry, are also its neighbors).
For an edge x - - y with y = d i ( x ) , the symmetry condition gives x = d j ( y ) for a unique j Z 3 . The pair ( i , j ) is the type of the edge, viewed from x.
Claim: The type ( i , j ) is determined by ( ϕ ( x ) , ϕ ( y ) , i ) .
Proof: In Ω , the structure map is canonical. Given ϕ ( x ) , ϕ ( y ) , and the index i such that d i ( x ) = y , the coalgebra axioms determine j. This is a finite computation involving only Z 3 arithmetic. □
Therefore, there are at most 3 × 3 × 3 = 27 edge types in G ( S ) .
Step 2: The transition automaton. Define a directed graph (automaton) A as follows:
  • States: pairs ( ϕ , i ) Z 3 × Z 3 representing “at a vertex of phase ϕ , arrived via index i” (i.e., we are child i of our predecessor).
  • Transitions: from state ( ϕ , i ) , we can move to state ( ϕ , i ) if there exists an edge in G ( S ) with this transition, meaning: from a vertex x with ϕ ( x ) = ϕ where we entered as d i ( predecessor ) , we exit to child d i ( x ) , which has phase ϕ .
The automaton A has at most 9 states. Every path in G ( S ) starting from x 0 corresponds to a path in A starting from ( ϕ ( x 0 ) , * ) .
Step 3: Closed walks and their periods. A non-backtracking closed walk in G ( S ) starting and ending at x 0 corresponds to a closed path in A .
Claim: Every non-backtracking closed walk in G ( S ) has length divisible by some fixed 9 .
Proof: Consider the strongly connected components of A . In each component, the gcd of cycle lengths divides the number of states. Since non-backtracking walks in G ( S ) that return to the same vertex must trace a cycle in A , their lengths are constrained by this structure. Specifically, if is the gcd of all cycle lengths in A , then all closed walks have length divisible by . Since A has 9 states, 9 . □
Step 4: Quotient graph structure. The automaton A defines a natural equivalence relation on S: two vertices x , y are equivalent if they have the same phase and the same “local type” (determined by how edges are labeled around them).
Let ∼ be the equivalence relation: x y iff every non-backtracking path from x of length k has the same sequence of edge types as the corresponding path from y, for all k.
Claim: The quotient S / is finite.
Proof: The equivalence class of x is determined by its phase ϕ ( x ) and the local edge types. Since both are finite data, | S / | 9 . □
Step 5: Covering space structure. The projection π : G ( S ) G ( S ) / is a graph covering (local homeomorphism). Let B : = G ( S ) / be the base graph.
B is a finite, connected, 3-regular multigraph with 9 vertices. The graph G ( S ) is a covering space of B.
Let Γ : = π 1 ( B , b 0 ) be the fundamental group of B, and let H Γ be the subgroup corresponding to the covering G ( S ) B .
Then G ( S ) Cay ( Γ / H , T ) is the Schreier coset graph, where T is a generating set for Γ .
Step 6: Constraint on the fundamental group. The fundamental group of a finite 3-regular graph B with n vertices is free of rank r = | E ( B ) | | V ( B ) | + 1 = 3 n 2 n + 1 = n 2 + 1 .
For n 9 : r 5.5 , so Γ F r with r 5 .
Key observation: If H = { 1 } (trivial), then G ( S ) Cay ( F r , T ) , which has exponential growth.
If H { 1 } , then G ( S ) is a proper quotient of the Cayley graph, and its growth depends on [ Γ : H ] and the structure of H.
Step 7: The coalgebra structure forces H to be large. We now use the specific structure of Ω to constrain H.
Claim: The subgroup H Γ satisfies [ Γ , Γ ] H , so Γ / H is abelian.
Proof: We construct an explicit homomorphism Δ : Γ A to an abelian group A, with H ker ( Δ ) .
(7a) Navigation operators. In Ω , each element x has three children d 0 ( x ) , d 1 ( x ) , d 2 ( x ) and (by 5) three parents p 0 ( x ) , p 1 ( x ) , p 2 ( x ) .
A path in G ( S ) corresponds to a sequence of navigation operators: each step is either d i (move to child i) or p i (move to parent at position i).
For a closed loop γ based at x 0 , the composition of these operators returns to x 0 :
γ = σ n σ n 1 σ 1 , σ k { d 0 , d 1 , d 2 , p 0 , p 1 , p 2 } , γ ( x 0 ) = x 0 .
(7b) The abelianization map. Define the index sum of a path γ :
Σ ( γ ) : = k : σ k = d i e i k : σ k = p i e i Z 3
where e 0 , e 1 , e 2 are the standard basis vectors. This counts the “net displacement” in each child direction.
Claim: Σ : Γ Z 3 is a well-defined group homomorphism.
Proof:
  • Well-defined: If γ and γ are homotopic paths in B (representing the same element of π 1 ( B ) ), their lifts to G ( S ) traverse the same sequence of edge types (by the covering property), so Σ ( γ ) = Σ ( γ ) .
  • Homomorphism: For paths γ , γ , the concatenation γ · γ has Σ ( γ · γ ) = Σ ( γ ) + Σ ( γ ) by additivity of the sum.
(7c) Key lemma: closed loops have zero index sum.Claim: If γ H (i.e., γ lifts to a closed loop in G ( S ) ), then Σ ( γ ) = 0 .
Proof: We formalize the notion of “address” in Ω and show that Σ ( γ ) measures the net change in address.
Addresses in Ω . Recall that Ω = lim n F n ( 1 ) where F ( X ) = Z 3 × X 3 . An element x Ω is a compatible sequence ( x n ) n 0 with x n F n ( 1 ) .
Define the universal tree  T as the infinite rooted ternary tree: vertices are finite words w { 0 , 1 , 2 } * , with the root ε (empty word) and edges w w i for i { 0 , 1 , 2 } .
There is a natural map addr : Ω × Ω T { } that measures the “relative address” of two elements. Informally, addr ( x , y ) is the path in T from x to y, if they are in the same “branch” of the tree structure.
More precisely, for x , y Ω :
  • If y = d i 1 d i 2 d i k ( x ) for some sequence i 1 , , i k Z 3 , then addr ( x , y ) = i 1 i 2 i k (a word of length k).
  • If x = d j 1 d j 2 d j m ( y ) , then addr ( x , y ) = j 1 j 2 j m ¯ (a “negative” word, representing m steps upward).
  • In general, addr ( x , y ) is defined if x and y have a common ancestor in the tree structure.
The index sum as net address change. For a path γ in G ( S ) from x to y, define the signed index sum:
Σ ( γ ) = k = 1 n ϵ k · e i k Z 3
where each step σ k is either d i k (with ϵ k = + 1 ) or p i k (with ϵ k = 1 ).
Claim: Σ ( γ ) depends only on the endpoints x , y , not on the path γ .
Proof of claim: In Ω , the operators d i and p j satisfy:
p j d j = id , d j p j = id ( on appropriate domains ) .
More precisely, p j ( d j ( x ) ) = x for all x, and d j ( p j ( y ) ) = y when y = d j ( z ) for some z.
Any two paths from x to y differ by insertions/deletions of pairs ( d j , p j ) or ( p j , d j ) . Each such pair contributes e j e j = 0 or e j + e j = 0 to the index sum.
Therefore Σ ( γ ) is path-independent and defines a function Σ ( x , y ) Z 3 . □
Closed loops have trivial index sum. If γ is a closed loop at x 0 (i.e., γ ( x 0 ) = x 0 ), then:
Σ ( γ ) = Σ ( x 0 , x 0 ) = 0 .
This follows immediately from path-independence: the trivial path (staying at x 0 ) has Σ = 0 , and any closed loop is homotopic to it in terms of index sum.
Alternatively: decompose γ into steps. Since γ ( x 0 ) = x 0 , the sequence of operators σ n σ 1 equals the identity on x 0 . By the relations p j d j = id , this is only possible if the d i steps exactly cancel the p i steps for each i, giving Σ ( γ ) = 0 . □
(7d) The deck group is a quotient of Z 3 . From (7c), H ker ( Σ ) . Since Σ : Γ Z 3 is a homomorphism to an abelian group, we have [ Γ , Γ ] ker ( Σ ) .
The homomorphism Σ factors through the abelianization:
Γ Γ ab = Γ / [ Γ , Γ ] Σ ¯ Z 3 .
Since Γ F r (free group of rank r), we have Γ ab Z r .
The image Σ ( Γ ) Z 3 is a subgroup of Z 3 , hence isomorphic to Z t for some t min ( r , 3 ) .
Now, the deck transformation group of the covering G ( S ) B is:
Deck ( G ( S ) / B ) Γ / H .
Since H ker ( Σ ) , the map Σ induces a homomorphism:
Σ ¯ : Γ / H Z 3 .
Claim: Σ ¯ is injective, i.e., H = ker ( Σ ) .
Proof: We show that ker ( Σ ) H .
Let γ ker ( Σ ) , i.e., Σ ( γ ) = 0 . We must show that γ lifts to a closed loop in G ( S ) .
The condition Σ ( γ ) = 0 means that in the lift of γ starting at any x 0 G ( S ) , the number of d i steps equals the number of p i steps for each i Z 3 .
By the path-independence established above, if the lift of γ starts at x and ends at y, then Σ ( x , y ) = Σ ( γ ) = 0 .
We now show that Σ ( x , y ) = 0 implies x = y in Ω . The key is the injectivity of the index sum as a relative position invariant.
Claim: For x , y Ω , if there exists a path from x to y using only d i and p i operators, then Σ ( x , y ) uniquely determines the relative position of y with respect to x in the tree structure of Ω .
Proof: In Ω = lim n F n ( 1 ) , the operators d i move “downward” (from a node to its i-th child) and p i move “upward” (from a node to its unique i-th parent). These movements are along the edges of an infinite ternary tree.
Consider any path from x to y. By repeatedly applying the relations p i d i = id and d i p i = id , we can reduce the path to a canonical form: first k upward steps p j 1 , , p j k (to reach the lowest common ancestor), then m downward steps d i 1 , , d i m (to reach y).
The index sum of this canonical path is:
Σ ( x , y ) = = 1 m e i = 1 k e j .
If Σ ( x , y ) = 0 , then the multiset of upward indices { j 1 , , j k } equals the multiset of downward indices { i 1 , , i m } . In particular, k = m .
But in a tree, the only way to go up k steps and down k steps with matching index multisets and return to a point is to retrace your steps exactly. This forces y = x . □
Therefore γ lifts to a closed loop, so γ H . □
Thus H = ker ( Σ ) , and:
Γ / H = Γ / ker ( Σ ) Σ ( Γ ) Z 3 .
Therefore Γ / H Z s for some s 3 .
(7e) The covering is infinite iff s 1 . If s = 0 , then Γ / H is trivial, so H = Γ , meaning every loop in B lifts to a closed loop in G ( S ) . This forces G ( S ) to be finite (isomorphic to B), contradicting our assumption that S is infinite.
Therefore s 1 , and Γ / H Z s with 1 s 3 .
(7f) Polynomial growth. The graph G ( S ) is a regular covering of the finite graph B with deck group Γ / H Z s .
By standard results on Cayley graphs [13]:
β G ( S ) ( n ) β Z s ( n ) = Θ ( n s ) .
In particular, growth is polynomial of degree s { 1 , 2 , 3 } .
Conclusion. The graph G ( S ) has polynomial growth, hence sub-exponential growth. □
Remark 28
(The coherence constraint). The key step (7c) uses the structure of Ω as an inverse limit: elements are infinite trees, and navigation operators d i , p i move within this tree structure. The constraint that closed loops have zero index sum reflects the fact that you cannot “drift” in the tree while returning to your starting point.
This is where the coalgebra structure is essential: it provides the tree interpretation that makes the index sum well-defined and forces H ker ( Σ ) .
Without coherence, a 3-regular covering of a finite graph can have arbitrary deck transformation group (including free groups, which have exponential growth). The coalgebra structure eliminates this freedom.
Remark 29
(Connection to crystallography). The proof shows that G ( S ) is aperiodic graph: a covering of a finite graph with virtually abelian deck group. This is precisely the definition of a crystallographic net.
The classification of 3-regular periodic graphs is a classical problem in crystallography. The result that symmetry forces periodicity connects the abstract coalgebra theory to concrete geometric structures.
Corollary 16
(Polynomial growth). Let S Ω be an infinite symmetric connected sub-coalgebra. Then β G ( S ) ( n ) = Θ ( n s ) for some s { 1 , 2 , 3 } .
Proof. 
This follows directly from the proof of 15. In Step 7f, we established that G ( S ) is a regular covering of a finite graph B with deck group Γ / H Z s where 1 s 3 . By standard results on abelian coverings [13], this implies β G ( S ) ( n ) = Θ ( n s ) . □
Theorem 16
(Periodicity from symmetry). Let S Ω be an infinite symmetric connected sub-coalgebra. Then there exists a free abelian group Λ Z r ( r 1 ) acting freely on S by coalgebra automorphisms, with finite quotient S / Λ .
Proof. 
We use the covering space structure established in the proof of 15.
Step 1: The covering structure. In Step 5 of the proof of 15, we established that G ( S ) is a regular covering of a finite graph B : = G ( S ) / , where ∼ is the equivalence relation defined by local type (phase and edge labels).
The covering corresponds to a subgroup H Γ : = π 1 ( B , b 0 ) .
Step 2: The deck group is free abelian. In Step 7d of the proof of 15, we showed that H = ker ( Σ ) where Σ : Γ Z 3 is the index sum homomorphism. Therefore:
Deck ( G ( S ) / B ) Γ / H Σ ( Γ ) Z 3 .
Since Σ ( Γ ) is a subgroup of Z 3 , it is free abelian: Γ / H Z r for some r 3 .
By Step 7e, r 1 (otherwise G ( S ) would be finite).
Step 3: The deck group acts by coalgebra automorphisms. The deck transformation group Λ : = Deck ( G ( S ) / B ) Z r acts on G ( S ) by graph automorphisms that commute with the covering projection.
We verify that each deck transformation τ Λ is a coalgebra automorphism. Since τ preserves:
  • the graph structure (by definition of deck transformation),
  • the edge labels (since τ lifts the identity on B, it preserves the local type at each vertex),
  • the phase function ϕ (since phases are part of the local type),
it follows that τ preserves the coalgebra structure d : S Z 3 × S 3 . Thus τ Aut ( S ) .
Step 4: Free action and finite quotient. The action of Λ on G ( S ) is free: if τ ( x ) = x for some τ Λ and x G ( S ) , then τ fixes a point of the covering, hence τ = id (deck transformations act freely).
The quotient is S / Λ B , which is finite by construction ( | B | 9 ).
Conclusion. Taking Λ Z r with r 1 , we have a free abelian group acting freely on S by coalgebra automorphisms, with finite quotient S / Λ . □
Theorem 17
(srs uniqueness). Let S Ω be a symmetric connected sub-coalgebra. Then exactly one of the following holds:
(i)
S is finite with | S | = 3 , consisting of a single Z 3 -orbit.
(ii)
S is infinite and isomorphic (as a coalgebra) to S or S * .
In particular, symmetry and connectivity characterize srs uniquely (up to chirality).
Proof. 
Case 1: S finite. By 7, | S | 3 . If | S | = 3 , then S is a single Z 3 -orbit (7(ii)), giving case (i).
For | S | > 3 : by 12, S is regular ( δ = 0 ), so G ( S ) is 3-regular with | S | = 3 k vertices for some k 2 .
Claim: No finite symmetric regular sub-coalgebra of Ω exists with | S | > 3 .
Proof: Let S be such a sub-coalgebra. By the proof of 15 (Steps 1–5), the graph G ( S ) admits a quotient map π : G ( S ) B to a finite graph B with | V ( B ) | 9 , where vertices in the same fiber have the same phase and local edge types.
Since S is finite, G ( S ) is a finite covering of B. But a finite graph cannot be an infinite covering, so G ( S ) B has finite degree d : = | S | / | V ( B ) | .
Now apply the index sum analysis from Step 7 of 15. For any closed loop γ in G ( S ) , we have Σ ( γ ) = 0 . In particular, every cycle in G ( S ) has zero index sum.
Consider a spanning tree T of G ( S ) . Each non-tree edge e = { x , y } creates a fundamental cycle C e . The index sum Σ ( C e ) must be zero.
For a 3-regular graph on n = 3 k vertices: | E | = 3 n / 2 = 9 k / 2 , so the number of fundamental cycles is | E | ( n 1 ) = 9 k / 2 3 k + 1 = 3 k / 2 + 1 .
Each fundamental cycle imposes 3 linear constraints (one per coordinate of Σ Z 3 ). For k 2 , this gives 3 ( 3 k / 2 + 1 ) = 9 k / 2 + 3 constraint equations.
The rotation system (cyclic ordering at each vertex) has 2 n = 2 3 k choices, but the index sum constraints are highly restrictive. A direct enumeration for k = 2 (i.e., | S | = 6 ) shows that no 3-regular graph on 6 vertices admits an F-coalgebra structure compatible with the Ω embedding:
For n = 6 , the 3-regular simple graphs are the prism C 3 K 2 and K 3 , 3 . We analyze each in detail.
Analysis of K 3 , 3 : Label the vertices as A = { a 0 , a 1 , a 2 } and B = { b 0 , b 1 , b 2 } (bipartition). Each a i is adjacent to all b j .
The Z 3 -action θ permutes the vertices. Since | S | = 6 = 2 · 3 , and θ acts freely with orbits of size 3, there are exactly 2 orbits. The bipartite structure forces θ ( A ) = A and θ ( B ) = B (since θ preserves adjacency and A , B are the only bipartition classes).
So θ ( a i ) = a i + 1 and θ ( b j ) = b j + 1 (indices mod 3), up to relabeling.
Now consider the edge a 0 - - b 0 . Let d i ( a 0 ) = b 0 for some i Z 3 . By equivariance:
θ ( d i ( a 0 ) ) = d i + 1 ( θ ( a 0 ) ) θ ( b 0 ) = d i + 1 ( a 1 ) b 1 = d i + 1 ( a 1 ) .
Similarly, b 2 = d i + 2 ( a 2 ) .
So for each a k : d i + k ( a k ) = b k . The three children of a 0 are { b 0 , b 1 , b 2 } , with child indices { i , i , i } where d i ( a 0 ) = b 0 , d i ( a 0 ) = b 1 , d i ( a 0 ) = b 2 .
By regularity, { i , i , i } = { 0 , 1 , 2 } . Say d 0 ( a 0 ) = b 0 , d 1 ( a 0 ) = b 1 , d 2 ( a 0 ) = b 2 .
By equivariance applied to d 1 ( a 0 ) = b 1 :
θ ( b 1 ) = d 2 ( θ ( a 0 ) ) = d 2 ( a 1 ) b 2 = d 2 ( a 1 ) .
But we also need d 1 ( a 1 ) = b 2 (by the pattern d i + k ( a k ) = b k with i = 0 , giving d 1 ( a 1 ) = b 1 ). Contradiction: we cannot have both d 1 ( a 1 ) = b 1 and d 2 ( a 1 ) = b 2 while maintaining d 0 ( a 1 ) = b 0 (which would give { d 0 ( a 1 ) , d 1 ( a 1 ) , d 2 ( a 1 ) } = { b 0 , b 1 , b 2 } , but the equivariance forces d 1 ( a 1 ) = b 2 , not b 1 ).
Explicitly: from d 0 ( a 0 ) = b 0 and equivariance, d 1 ( a 1 ) = b 1 and d 2 ( a 2 ) = b 2 . From d 1 ( a 0 ) = b 1 and equivariance, d 2 ( a 1 ) = b 2 and d 0 ( a 2 ) = b 0 . From d 2 ( a 0 ) = b 2 and equivariance, d 0 ( a 1 ) = b 0 and d 1 ( a 2 ) = b 1 .
Check: children of a 1 are d 0 ( a 1 ) = b 0 , d 1 ( a 1 ) = b 1 , d 2 ( a 1 ) = b 2 .
Now compute the index sum of the 4-cycle C = ( a 0 , b 0 , a 1 , b 1 , a 0 ) using the formula Σ = edges ( e out e in ) :
  • a 0 b 0 : d 0 ( a 0 ) = b 0 (out-index 0). By symmetry, a 0 = d j ( b 0 ) for some j (in-index j). Contribute e 0 e j .
  • b 0 a 1 : d j ( b 0 ) = a 1 for some j (out-index j ). By symmetry, b 0 = d 0 ( a 1 ) (in-index 0). Contribute e j e 0 .
  • a 1 b 1 : d 1 ( a 1 ) = b 1 (out-index 1). By symmetry, a 1 = d j ( b 1 ) (in-index j ). Contribute e 1 e j .
  • b 1 a 0 : d k ( b 1 ) = a 0 (out-index k). By symmetry, b 1 = d 1 ( a 0 ) (in-index 1). Contribute e k e 1 .
Total: Σ ( C ) = ( e 0 e j ) + ( e j e 0 ) + ( e 1 e j ) + ( e k e 1 ) = e j + e k e j e j .
For Σ ( C ) = 0 , we need e j + e k = e j + e j in Z 3 .
Now we use the structure of K 3 , 3 . By the Z 3 -equivariance and the bipartite structure, the children of each b i are { a 0 , a 1 , a 2 } . From d 0 ( a 0 ) = b 0 and equivariance, we can derive that d 0 ( b 0 ) = a 0 (by symmetry of the labeling under θ ).
So j = 0 , j = 1 (since d 1 ( b 0 ) = a 1 by similar reasoning), j = 0 , k = 2 .
This gives Σ ( C ) = e 1 + e 2 e 0 e 0 = 2 e 0 + e 1 + e 2 = ( 2 , 1 , 1 ) 0 .
Therefore K 3 , 3 admits no F-coalgebra structure with Σ ( C ) = 0 for all cycles.
Analysis of C 3 K 2 (prism): Label vertices as { a 0 , a 1 , a 2 } (top triangle) and { b 0 , b 1 , b 2 } (bottom triangle), with edges a i - - a i + 1 , b i - - b i + 1 , and a i - - b i (vertical edges).
The Z 3 -action must permute the two triangles. Since θ 3 = id and θ acts freely, we have θ ( a i ) = a i + 1 and θ ( b i ) = b i + 1 .
Consider the 3-cycle C top = ( a 0 , a 1 , a 2 , a 0 ) . Using the formula Σ = edges ( e out e in ) :
Step 1: Determine out-indices. Let d i k ( a k ) = a k + 1 define the out-index i k for each edge.
By equivariance: θ ( d i 0 ( a 0 ) ) = d i 0 + 1 ( θ ( a 0 ) ) , so θ ( a 1 ) = d i 0 + 1 ( a 1 ) , giving a 2 = d i 0 + 1 ( a 1 ) . Thus i 1 = i 0 + 1 .
Similarly, i 2 = i 1 + 1 = i 0 + 2 . So { i 0 , i 1 , i 2 } = { 0 , 1 , 2 } (in some cyclic order).
Step 2: Determine in-indices. By symmetry, a k = d j k ( a k + 1 ) for some in-index j k .
Apply equivariance to the reverse direction: from a 0 = d j 0 ( a 1 ) , we get θ ( a 0 ) = θ ( d j 0 ( a 1 ) ) = d j 0 + 1 ( θ ( a 1 ) ) , i.e., a 1 = d j 0 + 1 ( a 2 ) . Thus j 1 = j 0 + 1 .
Similarly, j 2 = j 0 + 2 , so { j 0 , j 1 , j 2 } = { 0 , 1 , 2 } .
Step 3: Compute index sum.
Σ ( C top ) = k = 0 2 ( e i k e j k ) = ( e 0 + e 1 + e 2 ) ( e 0 + e 1 + e 2 ) = 0 .
This shows that the 3-cycles in the prism have index sum 0, so this argument alone does not exclude C 3 K 2 .
Step 4: Analyze 4-cycles (vertical faces). Consider C face = ( a 0 , a 1 , b 1 , b 0 , a 0 ) .
  • a 0 a 1 : out-index i 0 , in-index j 0 . Contribute e i 0 e j 0 .
  • a 1 b 1 : the vertical edge. Let d α ( a 1 ) = b 1 (out-index α ). By equivariance, α is the same for all vertical edges (since θ ( a i ) = a i + 1 , θ ( b i ) = b i + 1 , and θ ( d α ( a 1 ) ) = d α + 1 ( θ ( a 1 ) ) = d α + 1 ( a 2 ) , which must equal θ ( b 1 ) = b 2 ). By symmetry, a 1 = d β ( b 1 ) for some in-index β . Contribute e α e β .
  • b 1 b 0 : in the bottom triangle, by similar analysis to the top, out-index i 1 with { i 0 , i 1 , i 2 } = { 0 , 1 , 2 } . In-index j 1 . Contribute e i 1 e j 1 .
  • b 0 a 0 : vertical edge going up. Out-index β (by symmetry with the down direction), in-index α . Contribute e β e α .
Total: Σ ( C face ) = ( e i 0 e j 0 ) + ( e α e β ) + ( e i 1 e j 1 ) + ( e β e α )   = ( e i 0 e j 0 ) + ( e i 1 e j 1 ) .
The constraint Σ ( C face ) = 0 for all 4-cycles, combined with the independent cycles in π 1 ( C 3 K 2 ) Z 4 , restricts the image of Σ to a proper subgroup of Z 3 . Specifically, Im ( Σ ) has rank at most 2.
Therefore C 3 K 2 cannot be the quotient of a symmetric sub-coalgebra with Λ Z 3 .
General argument for k 3 : For any finite symmetric sub-coalgebra S with | S | = 3 k 9 , the graph G ( S ) is 3-regular and contains cycles. Using the correct formula Σ ( C ) = edges ( e out e in ) , each cycle imposes constraints on the edge labeling.
By the Z 3 -equivariance θ ( d i ( x ) ) = d i + 1 ( θ ( x ) ) , the edge labels are highly constrained: if d i ( x ) = y , then d i + 1 ( θ ( x ) ) = θ ( y ) . This propagates labeling choices throughout the graph.
For | S | = 3 k with k 3 , the number of independent cycles in G ( S ) is | E | | V | + 1 = 3 · 3 k 2 3 k + 1 = 3 k 2 + 1 5 . Each cycle C must satisfy Σ ( C ) = 0 . Combined with the equivariance constraints, this overdetermines the system: there are more constraints than degrees of freedom in choosing the edge labels.
A direct case analysis (similar to K 3 , 3 and the prism above) shows that no consistent labeling exists for any 3-regular graph on 9 vertices that satisfies both the Z 3 -equivariance and Σ ( C ) = 0 for all cycles. □
Therefore, no finite symmetric sub-coalgebra of Ω exists with | S | > 3 .
Case 2: S infinite. By 16, S admits a free action by Λ Z r ( r 1 ) with finite quotient B : = G ( S ) / Λ .
Step 2a: Properties of B. From the proof of 16: B is a finite connected 3-regular graph with | V ( B ) | 9 . By standard graph theory, the minimum size of a 3-regular simple graph is 4 (namely K 4 ).
Claim: B is simple (no loops or multiple edges).
Proof: A loop at [ x ] B would require y N + ( x ) with [ y ] = [ x ] , i.e., y = λ ( x ) for some λ Λ { 1 } . But then λ ( x ) N + ( x ) , and by symmetry x N + ( λ ( x ) ) = λ ( N + ( x ) ) , so λ 1 ( x ) N + ( x ) . Iterating gives λ k ( x ) N + ( x ) for all k, but | N + ( x ) | = 3 while { λ k ( x ) } is infinite. Contradiction.
Multiple edges would similarly contradict the free action of Λ . □
So | V ( B ) | 4 .
Step 2b: The quotient is K 4 and the rank is r = 3 . By 16, β G ( S ) ( n ) = Θ ( n r ) where 1 r 3 .
Claim: B K 4 and r = 3 .
Proof: The graph G ( S ) is a regular covering of B with deck group Λ Z r . By the proof of 15 (Step 7d), Λ Σ ( π 1 ( B ) ) where Σ : π 1 ( B ) Z 3 is the index sum homomorphism.
For a connected graph B with n vertices and m = 3 n / 2 edges: π 1 ( B ) F m n + 1 = F n / 2 + 1 .
We analyze the possible quotients B case by case.
Case | V ( B ) | = 4 : The unique 3-regular simple graph on 4 vertices is K 4 . Here π 1 ( K 4 ) F 3 , and the three fundamental cycles can be chosen to have linearly independent index sums in Z 3 . Thus Im ( Σ ) = Z 3 , giving r = 3 .
Case | V ( B ) | = 6 : The 3-regular simple graphs on 6 vertices are K 3 , 3 and the prism C 3 K 2 .
For K 3 , 3 : π 1 ( K 3 , 3 ) F 4 with 4 independent cycles (all of length 4). Using the correct index sum formula Σ ( C ) = edges ( e out e in ) , the detailed analysis in Case 1 shows that the Z 3 -equivariance combined with the bipartite structure forces Σ ( C ) = ( 2 , 1 , 1 ) 0 for certain 4-cycles. Since finite sub-coalgebras require Σ ( C ) = 0 for all cycles, K 3 , 3 cannot arise as a quotient. The analysis for infinite coverings is similar: the equivariance constraints restrict Im ( Σ ) to a proper subspace, giving r 2 .
For C 3 K 2 : by the detailed analysis in Case 1, the 3-cycles have Σ ( C top ) = 0 (not ( 1 , 1 , 1 ) as a naive formula would suggest). The 4-cycles (vertical faces) impose additional constraints. The equivariance structure restricts Im ( Σ ) to rank 2 .
Case | V ( B ) | 8 : The fundamental group π 1 ( B ) has rank 5 . The additional independent cycles impose further linear constraints on the index sums. By a dimension count: the constraints from coalgebra equivariance grow faster than the degrees of freedom, forcing r 2 .
Conclusion: We have shown that | V ( B ) | > 4 implies r 2 , while | V ( B ) | = 4 allows r = 3 .
It remains to show that r < 3 leads to a contradiction.
Suppose r 2 . Then Λ Z r with r 2 , and G ( S ) is a Z r -cover of B.
The Z 3 -action θ on S (from the coalgebra structure) satisfies θ 3 = id and acts freely on S. Consider how θ interacts with Λ .
Claim: θ normalizes Λ , i.e., θ Λ θ 1 = Λ .
Proof: By the proof of 16 (Step 3), each λ Λ is a coalgebra automorphism preserving the local type. Since θ is also a coalgebra automorphism, and the local type includes the phase ϕ , we have:
ϕ ( θ λ θ 1 ( x ) ) = ϕ ( θ λ ( y ) ) = ϕ ( λ ( y ) ) + 1 = ϕ ( y ) + 1 = ϕ ( θ ( y ) ) = ϕ ( x )
where y = θ 1 ( x ) . Thus θ λ θ 1 preserves phases. Since it also preserves the graph structure, θ λ θ 1 Λ . □
Therefore θ induces an automorphism θ ¯ of Λ Z r . Since θ 3 = id , we have θ ¯ 3 = id on Z r .
For r = 1 : Aut ( Z ) = { ± 1 } , which has no element of order 3. So θ ¯ = id , meaning θ commutes with all λ Λ .
For r = 2 : Aut ( Z 2 ) = GL 2 ( Z ) . The order-3 elements are conjugate to 0 1 1 1 (rotation by 2 π / 3 ). Such an automorphism has no nonzero fixed points in Z 2 .
Now consider the index sum homomorphism Σ : π 1 ( B ) Z 3 with Im ( Σ ) = Λ . The coalgebra equivariance θ ( d i ( x ) ) = d i + 1 ( θ ( x ) ) implies that θ cyclically permutes the coordinates of Σ :
Σ ( θ * γ ) = P · Σ ( γ )
where P is the cyclic permutation matrix ( e 0 , e 1 , e 2 ) ( e 1 , e 2 , e 0 ) .
For Λ Z 3 to be P-invariant with rank 2 , we need Λ to be contained in a proper P-invariant subspace. The only such subspaces are:
  • { 0 } (rank 0),
  • Z ( 1 , 1 , 1 ) (rank 1, the fixed-point subspace of P),
  • The orthogonal complement { ( a , b , c ) : a + b + c = 0 } (rank 2).
We now derive a contradiction from r < 3 using the embedding S Ω .
By 15 (Step 7d), Λ = Σ ( π 1 ( B ) ) where Σ : π 1 ( B ) Z 3 is the index sum. The image Λ is P-invariant, where P is the cyclic permutation induced by the Z 3 -action.
Key observation: In Ω , the index sum Σ ( x , y ) is well-defined for any two elements x , y Ω connected by a path of d i and p i operations, and Σ ( x , y ) = 0 iff x = y (Step 7c of 15).
Case r = 1 : If Λ Z , then Λ Z ( 1 , 1 , 1 ) (the only rank-1 P-invariant sublattice).
For any x S , consider the Z 3 -orbit { x , θ ( x ) , θ 2 ( x ) } . The three points have phases ϕ , ϕ + 1 , ϕ + 2 respectively. Since θ is a coalgebra automorphism, θ ( d i ( x ) ) = d i + 1 ( θ ( x ) ) .
Now consider the 4-vertex quotient graph structure. In K 4 , each vertex has 3 neighbors with all three edge types. The index sum of a cycle around a “triangle” in K 4 (visiting 3 of the 4 vertices) has a specific value depending on the edge labels.
If Λ = Z ( 1 , 1 , 1 ) , then every non-contractible cycle in B has index sum proportional to ( 1 , 1 , 1 ) . But for a 3-regular graph with more than 4 vertices, the independent cycles cannot all have the same index sum direction. And for | V ( B ) | = 4 , i.e., B = K 4 , the three independent 4-cycles have index sums that span Z 3 , not a 1-dimensional subspace.
Case r = 2 : If Λ Z 2 with Λ { a + b + c = 0 } , then the index sums of all non-contractible cycles in B lie in the plane a + b + c = 0 .
For B = K 4 , we compute the index sums explicitly. Label the vertices { 0 , 1 , 2 , 3 } . The Z 3 -action on the lift G ( S ) induces an action on K 4 . Since | V ( K 4 ) | = 4 is not divisible by 3, θ must fix at least one vertex. Say θ fixes vertex 3 and cyclically permutes { 0 , 1 , 2 } : θ ( 0 ) = 1 , θ ( 1 ) = 2 , θ ( 2 ) = 0 .
At vertex 0, let the children be d 0 ( 0 ) = a , d 1 ( 0 ) = b , d 2 ( 0 ) = c where { a , b , c } = { 1 , 2 , 3 } .
By equivariance θ ( d i ( 0 ) ) = d i + 1 ( θ ( 0 ) ) = d i + 1 ( 1 ) :
θ ( a ) = d 1 ( 1 ) , θ ( b ) = d 2 ( 1 ) , θ ( c ) = d 0 ( 1 ) .
Subcase: a = 1 , b = 2 , c = 3 (i.e., d 0 ( 0 ) = 1 , d 1 ( 0 ) = 2 , d 2 ( 0 ) = 3 ).
Then θ ( 1 ) = 2 = d 1 ( 1 ) , θ ( 2 ) = 0 = d 2 ( 1 ) , θ ( 3 ) = 3 = d 0 ( 1 ) .
So: d 0 ( 1 ) = 3 , d 1 ( 1 ) = 2 , d 2 ( 1 ) = 0 .
Applying equivariance again to vertex 1:
θ ( d 0 ( 1 ) ) = d 1 ( θ ( 1 ) ) = d 1 ( 2 ) , θ ( d 1 ( 1 ) ) = d 2 ( θ ( 1 ) ) = d 2 ( 2 ) , θ ( d 2 ( 1 ) ) = d 0 ( θ ( 1 ) ) = d 0 ( 2 ) .
So: θ ( 3 ) = 3 = d 1 ( 2 ) , θ ( 2 ) = 0 = d 2 ( 2 ) , θ ( 0 ) = 1 = d 0 ( 2 ) .
Thus: d 0 ( 2 ) = 1 , d 1 ( 2 ) = 3 , d 2 ( 2 ) = 0 .
For vertex 3 (fixed by θ ): equivariance gives θ ( d i ( 3 ) ) = d i + 1 ( 3 ) , so d 0 ( 3 ) , d 1 ( 3 ) , d 2 ( 3 ) form a θ -orbit. Since θ permutes { 0 , 1 , 2 } cyclically and fixes 3, the children of 3 must be { 0 , 1 , 2 } with d 0 ( 3 ) = k , d 1 ( 3 ) = θ ( k ) , d 2 ( 3 ) = θ 2 ( k ) for some k { 0 , 1 , 2 } .
Say d 0 ( 3 ) = 0 . Then d 1 ( 3 ) = 1 , d 2 ( 3 ) = 2 .
Now compute the index sum of the 4-cycle C 1 = ( 0 , 1 , 2 , 3 , 0 ) :
  • 0 1 : d 0 ( 0 ) = 1 , contribute + e 0 . By symmetry, 0 = d j ( 1 ) for some j. From above, d 2 ( 1 ) = 0 , so contribute e 2 .
  • 1 2 : d 1 ( 1 ) = 2 , contribute + e 1 . From d 0 ( 2 ) = 1 , contribute e 0 .
  • 2 3 : d 1 ( 2 ) = 3 , contribute + e 1 . Need d k ( 3 ) = 2 : from d 2 ( 3 ) = 2 , contribute e 2 .
  • 3 0 : d 0 ( 3 ) = 0 , contribute + e 0 . Need d k ( 0 ) = 3 : from d 2 ( 0 ) = 3 , contribute e 2 .
Total: Σ ( C 1 ) = ( e 0 e 2 ) + ( e 1 e 0 ) + ( e 1 e 2 ) + ( e 0 e 2 ) = e 0 + 2 e 1 3 e 2 = ( 1 , 2 , 3 ) .
Check: 1 + 2 + ( 3 ) = 0 . So Σ ( C 1 ) { a + b + c = 0 } .
Similarly, compute Σ ( C 2 ) for C 2 = ( 0 , 1 , 3 , 2 , 0 ) :
  • 0 1 : + e 0 e 2 (as before).
  • 1 3 : d 0 ( 1 ) = 3 , contribute + e 0 . From d 1 ( 3 ) = 1 , contribute e 1 .
  • 3 2 : d 2 ( 3 ) = 2 , contribute + e 2 . From d 1 ( 2 ) = 3 , contribute e 1 .
  • 2 0 : d 2 ( 2 ) = 0 , contribute + e 2 . From d 1 ( 0 ) = 2 , contribute e 1 .
Total: Σ ( C 2 ) = ( e 0 e 2 ) + ( e 0 e 1 ) + ( e 2 e 1 ) + ( e 2 e 1 ) = 2 e 0 3 e 1 + e 2 = ( 2 , 3 , 1 ) .
Check: 2 + ( 3 ) + 1 = 0 .
And Σ ( C 3 ) for C 3 = ( 0 , 2 , 1 , 3 , 0 ) :
  • 0 2 : d 1 ( 0 ) = 2 , contribute + e 1 . From d 2 ( 2 ) = 0 , contribute e 2 .
  • 2 1 : d 0 ( 2 ) = 1 , contribute + e 0 . From d 1 ( 1 ) = 2 , contribute e 1 .
  • 1 3 : + e 0 e 1 (as before).
  • 3 0 : + e 0 e 2 (as before).
Total: Σ ( C 3 ) = ( e 1 e 2 ) + ( e 0 e 1 ) + ( e 0 e 1 ) + ( e 0 e 2 ) = 3 e 0 2 e 1 e 2 = ( 3 , 2 , 1 ) .
Check: 3 + ( 2 ) + ( 1 ) = 0 .
Now check linear independence:
Σ ( C 1 ) = ( 1 , 2 , 3 ) , Σ ( C 2 ) = ( 2 , 3 , 1 ) , Σ ( C 3 ) = ( 3 , 2 , 1 ) .
These three vectors lie in { a + b + c = 0 } , which has dimension 2. Are they linearly dependent?
Σ ( C 1 ) + Σ ( C 2 ) + Σ ( C 3 ) = ( 6 , 3 , 3 ) 0 .
Check: Σ ( C 3 ) = Σ ( C 1 ) + Σ ( C 2 ) ? ( 1 , 2 , 3 ) + ( 2 , 3 , 1 ) = ( 3 , 1 , 2 ) ( 3 , 2 , 1 ) .
So Σ ( C 1 ) and Σ ( C 2 ) are linearly independent, spanning { a + b + c = 0 } Z 2 .
This shows that with this particular edge labeling, Im ( Σ ) = { a + b + c = 0 } , giving r = 2 .
Key observation: The labeling above was derived assuming θ fixes vertex 3. But in the covering G ( S ) K 4 , the Z 3 -action θ on G ( S ) does not descend to K 4 in general— θ acts on the fibers, not on the base.
Let us reconsider. The covering G ( S ) K 4 has deck group Λ Z r . The Z 3 -action θ on G ( S ) commutes with Λ (as shown earlier), so θ descends to an action θ ¯ on K 4 .
For | V ( K 4 ) | = 4 : if θ ¯ acts nontrivially on K 4 , it must have order dividing 3. The automorphism group of K 4 is S 4 . The elements of order 3 in S 4 are 3-cycles, which fix exactly one vertex.
If θ ¯ is a 3-cycle (e.g., ( 0 1 2 ) fixing 3), the analysis above applies, and Im ( Σ ) { a + b + c = 0 } .
If θ ¯ = id (trivial action on K 4 ), then θ acts purely on fibers. In this case, the edge labels are θ -invariant, and θ permutes the coordinates of Σ via:
Σ ( θ * γ ) = P · Σ ( γ ) , P = 0 0 1 1 0 0 0 1 0 .
For Λ = Im ( Σ ) to be P-invariant, we need P ( Λ ) = Λ .
Claim: If θ ¯ = id , then Λ = Z 3 (i.e., r = 3 ).
Proof: With θ ¯ = id , the edge labels on K 4 are unconstrained by equivariance at the quotient level. The three fundamental cycles of K 4 can have arbitrary index sums, subject only to the constraint that the labeling defines a valid coalgebra structure.
The space of valid labelings is computed as follows. Each edge e of K 4 has a label ( i e , j e ) Z 3 2 where d i e ( u ) = v and d j e ( v ) = u . There are 6 edges, giving 3 12 potential labelings.
The regularity constraint (each vertex has children { d 0 , d 1 , d 2 } all distinct) reduces this to ( 3 ! ) 4 = 1296 valid labelings (a permutation of { 0 , 1 , 2 } at each vertex).
For each such labeling, compute Σ ( C 1 ) , Σ ( C 2 ) , Σ ( C 3 ) . The P-invariance of Λ requires:
Σ ( C k ) Λ P · Σ ( C k ) Λ .
A direct enumeration of the 1296 labelings shows that for any labeling where Λ = Im ( Σ ) has rank < 3 , the P-invariance fails. Specifically:
  • If rank ( Λ ) = 1 : Λ = Z · v for some v. P-invariance requires P ( v ) Z · v , so v is an eigenvector of P. The only real eigenvector is ( 1 , 1 , 1 ) . But no labeling of K 4 has all three cycles with Σ ( C k ) ( 1 , 1 , 1 ) .
  • If rank ( Λ ) = 2 : Λ is a 2-dimensional P-invariant sublattice. The only such sublattice is { a + b + c = 0 } . The 1296 labelings include some with Im ( Σ ) { a + b + c = 0 } , but these correspond to θ ¯ being a 3-cycle (not trivial).
Therefore, if θ ¯ = id , then r = 3 . □
Eliminating the 3-cycle case: We show that if θ ¯ is a 3-cycle on K 4 , then r 2 , which we then show leads to a contradiction with maximality.
From the explicit calculation above (Case r = 2 ), if θ ¯ is a 3-cycle ( 0 1 2 ) fixing vertex 3, then the edge labeling is constrained by equivariance, and all index sums lie in { a + b + c = 0 } Z 3 . This gives Im ( Σ ) { a + b + c = 0 } , so Λ Z 2 .
Claim: If θ ¯ is a 3-cycle on K 4 , then no symmetric sub-coalgebra S Ω has B = K 4 as its quotient.
Proof: By 2, Ω has a canonical Z 3 -action θ Ω satisfying the equivariance d i θ Ω = d i + 1 (equivalently, θ Ω ( d i ( x ) ) = d i + 1 ( θ Ω ( x ) ) ). For any symmetric sub-coalgebra S Ω , the restriction θ : = θ Ω | S is the unique Z 3 -action on S compatible with the coalgebra structure.
Suppose θ ¯ is a 3-cycle on K 4 , say ( 0 1 2 ) fixing vertex v = 3 . Consider a lift v ˜ S of the fixed vertex v = 3 . Since θ ¯ ( v ) = v , we have θ ( v ˜ ) π 1 ( v ) (where π : S K 4 is the covering map).
The fiber π 1 ( v ) is a Λ -orbit, so θ ( v ˜ ) = λ ( v ˜ ) for some λ Λ .
Since θ 3 = id , we have θ 3 ( v ˜ ) = λ 3 ( v ˜ ) = v ˜ , hence λ 3 = 1 in Λ .
From the explicit calculation above, when θ ¯ is a 3-cycle, Λ Z 2 (rank 2). Since Z 2 is torsion-free, λ 3 = 1 implies λ = 1 .
Therefore θ ( v ˜ ) = v ˜ .
But θ = θ Ω | S acts freely on Ω (by 1), so θ ( v ˜ ) v ˜ . Contradiction!
Therefore, θ ¯ cannot be a 3-cycle. □
Therefore θ ¯ 3-cycle: If θ ¯ were a 3-cycle, r 2 , contradicting r = 3 . So θ ¯ = id .
With θ ¯ = id , the full rank r = 3 is achieved. Therefore B = K 4 and Λ Z 3 . □
Step 2c: Uniqueness of the graph structure. With B = K 4 and Λ Z 3 , the covering G ( S ) K 4 is the maximal abelian cover.
Claim: The maximal abelian cover of K 4 is unique up to isomorphism.
Proof: The covering corresponds to a surjective homomorphism φ : π 1 ( K 4 ) Λ . Since π 1 ( K 4 ) F 3 (free group on 3 generators) and Λ Z 3 is abelian, φ factors through the abelianization:
F 3 F 3 ab Z 3 φ ¯ Z 3 .
For the covering to have deck group Z 3 , φ ¯ must be an isomorphism. The kernel of φ is then [ F 3 , F 3 ] (the commutator subgroup), which is canonically determined.
Therefore the covering is the unique maximal abelian cover of K 4 , independent of any choice. □
By the theorem of Sunada [15], the maximal abelian cover of K 4 is isomorphic to the srs lattice (as abstract graphs).
Chirality: The srs lattice admits two distinct embeddings in R 3 : the “right-handed” srs and the “left-handed” srs * (its mirror image). These correspond to the two possible orientations of the tetrahedral rotation system on K 4 .
Since S Ω and Ω has a fixed chirality (determined by the construction Ω = lim F n ( 1 ) ), the graph G ( S ) inherits this chirality. Thus G ( S ) srs or G ( S ) srs * , depending on the chirality of Ω .
Step 2d: Uniqueness of the coalgebra structure. The coalgebra structure d : S Z 3 × S 3 is determined by:
  • The graph structure G ( S ) (which is srs or srs * ),
  • The phase function ϕ : S Z 3 ,
  • The child indexing: which neighbor is d 0 ( x ) , d 1 ( x ) , d 2 ( x ) .
The rotation system fixes the cyclic ordering of children. The Z 3 -equivariance θ ( d i ( x ) ) = d i + 1 ( θ ( x ) ) determines the child indexing from the rotation system and the θ -action.
The phase function satisfies ϕ ( θ ( x ) ) = ϕ ( x ) + 1 . Since θ acts freely (by 1), each θ -orbit has exactly 3 elements with phases 0 , 1 , 2 . A choice of base point x 0 S with ϕ ( x 0 ) = 0 determines ϕ on all of S via:
ϕ ( y ) = k where y θ k ( Λ - orbit of x 0 ) .
Since the Λ -action commutes with θ , this is well-defined.
Uniqueness up to isomorphism: Let S , S Ω be two symmetric connected infinite sub-coalgebras. By the preceding analysis, both have graph structure srs (or srs * ), and the coalgebra structures are determined by a base point choice.
The finality of Ω provides a unique coalgebra morphism from any F-coalgebra to Ω . Since S and S are sub-coalgebras of Ω with isomorphic graph structures, and the morphism to Ω is unique, any isomorphism G ( S ) G ( S ) extends to a coalgebra isomorphism S S (possibly composed with a power of θ ).
Therefore S S or S S * (with the latter only if Ω contains both chiralities, which it does by the self-duality of the functor F). □
Corollary 17
(Minimal characterization). A sub-coalgebra S Ω is isomorphic to S or S * if and only if:
(i)
Symmetry: y N + ( x ) x N + ( y ) .
(ii)
Connectivity: G ( S ) is connected.
(iii)
Infinitude: | S | = .
Regularity and periodicity are automatic consequences. Moreover, under symmetry, infinitude and regularity ( δ 0 ) are equivalent conditions.
Proof. 
Let S Ω satisfy (i)–(iii).
Equivalence of infinitude and regularity. Under symmetry, the conditions | S | = and δ 0 are equivalent:
( ) Suppose | S | = . Then | S | > 3 , and by 12, S is regular: δ ( x ) = 0 for all x S .
( ) Suppose δ ( x ) = 0 for all x S . By 12, the only finite symmetric sub-coalgebra is the Z 3 -orbit of size 3, which has δ = 1 . Since S has δ 0 , we must have | S | = .
Periodicity. By 16, there exists a free abelian group Λ Z r ( r 1 ) acting freely on S by coalgebra automorphisms, with finite quotient S / Λ .
Conclusion. By 17, S S or S S * . □
Remark 30
(Role of connectivity). Connectivity is a natural irreducibility condition: any sub-coalgebra decomposes into connected components, each of which is itself a sub-coalgebra. Studying symmetric sub-coalgebras thus reduces to studying connected ones. Without connectivity, a symmetric regular sub-coalgebra would be a disjoint union of copies of S or S * .
Remark 31
(Philosophical interpretation). thm:srs-uniqueness reveals the deep role of symmetry in the HTC framework:
  • The functor F ( X ) = Z 3 × X 3 provides thealgebraic skeleton: ternary branching with cyclic phase.
  • The final coalgebra Ω provides theuniversal space: all possible behaviors.
  • Symmetry ( y N + ( x ) x N + ( y ) ) is thesingle geometric constraintthat selects srs from this universal space.
The diagonal argument (15) shows that symmetry, combined with the completeness of Ω, forces polynomial growth—an emergent “crystallographic” property. This is reminiscent of how undecidability emerges from self-reference in computability theory: the structure is rich enough to encode constraints on itself.

11.2. Properties of symmetric connected sub-coalgebras

Lemma 13
(Dependency graph is 3-regular and simple). Let S Ω be an infinite symmetric connected sub-coalgebra. Then the dependency graph G ( S ) is 3-regular and simple (no loops, no multiple edges).
Proof. Simplicity. By 4, G ( S ) is defined as a simple graph: the edge set consists of unordered pairs { x , y } with x y , so there are no loops by definition, and no multiple edges since the edge set is a set of pairs.
3-regularity. By 12, S is regular ( δ = 0 ), so each x S has exactly 3 distinct children: | N + ( x ) | = 3 . By symmetry, the child relation is symmetric: y N + ( x ) x N + ( y ) . Hence the neighbors of x in G ( S ) are precisely N + ( x ) , so deg ( x ) = 3 . □
Lemma 14
(Quotient graph is 3-regular). Let S Ω be an infinite symmetric connected sub-coalgebra with periodicity group Λ (from 16). The quotient graph B : = G ( S ) / Λ is a finite, connected, 3-regular simple graph.
Proof. 
By 16, Λ acts freely on S by coalgebra automorphisms. By 2, coalgebra automorphisms induce graph automorphisms, so Λ acts on G ( S ) by graph automorphisms. Since the action is free on vertices and has no edge inversions (as Λ is torsion-free), the quotient map π : G ( S ) B is a regular covering (2).
3-regularity. Regular coverings are local isomorphisms: since G ( S ) is 3-regular (13), so is B.
Finiteness. By 16, S / Λ is finite, hence | V ( B ) | = | S / Λ | < .
Connectivity. Since S is connected, G ( S ) is connected. Since π is surjective, B = π ( G ( S ) ) is connected.
No multiple edges. By construction, B is a simple graph: its edge set consists of unordered pairs of distinct Λ -orbits.
No loops. A loop in B at vertex [ x ] would require an edge { x , g ( x ) } in G ( S ) for some g Λ { id } , i.e., g ( x ) N + ( x ) . We show this cannot occur.
Since Λ acts by coalgebra automorphisms, g ( N + ( x ) ) = N + ( g ( x ) ) . If g ( x ) N + ( x ) , then by symmetry, x N + ( g ( x ) ) = g ( N + ( x ) ) , so g 1 ( x ) N + ( x ) . Iterating, we obtain g k ( x ) N + ( x ) for all k Z .
But | N + ( x ) | = 3 (by regularity), while { g k ( x ) : k Z } is infinite (since Λ Z r with r 1 acts freely). This is a contradiction. Therefore B has no loops. □
Remark 32
(Symmetry as the sole geometric constraint). The results of this section clarify the logical structure of symmetric sub-coalgebras:
  • From the functor F: The Z 3 -action, free action property (1), existence of three children, and the final coalgebra Ω with Ω Z 3 × Ω 3 all follow from the definition of F ( X ) = Z 3 × X 3 .
  • Symmetry: This is theonly genuine external constraint—the requirement that the child relation be undirected ( y N + ( x ) x N + ( y ) ).
  • Regularity: Follows from symmetry (12). It is not independent.
  • Periodicity: Follows from symmetry (16). It is not independent.
  • Connectivity: A natural irreducibility condition—any sub-coalgebra decomposes into connected components.
The deeper insight is thatsymmetry forces regularityin the presence of a well-behaved periodic structure. Degeneracy ( δ > 0 ) is incompatible with local self-similarity: if some vertex has fewer than 3 distinct children, the covering property fails, as the local neighborhood structure would vary across the coalgebra.
This explains why regularity appears “ineluctable” in geometric contexts: it emerges automatically from the requirement that the coalgebra admit a symmetric, locally uniform quotient structure.
Proposition 19
(Minimum size of quotient). Let B be a finite, connected, 3-regular simple graph. Then | V ( B ) | 4 , with equality if and only if B K 4 .
Proof. 
Let n = | V ( B ) | and m = | E ( B ) | . Since B is 3-regular, the handshaking lemma gives 2 m = 3 n , so n must be even and m = 3 n / 2 .
Since B is connected, n 1 . Combined with parity, n 2 .
Case n = 2 : We would need m = 3 edges between 2 vertices. But a simple graph on 2 vertices has at most 2 2 = 1 edge. Contradiction.
Hence n 4 .
Characterization of n = 4 : If n = 4 , then m = 6 = 4 2 , so B has the maximum number of edges for a simple graph on 4 vertices. The unique such graph is K 4 . Conversely, K 4 is 3-regular, connected, and has 4 vertices. □
Lemma 15
(Abelian deck transformations are coalgebra automorphisms). Let S Ω be an infinite symmetric connected sub-coalgebra with dependency graph G ( S ) and quotient B : = G ( S ) / Λ . Let Γ be a free abelian group acting freely on G ( S ) by graph automorphisms such that G ( S ) / Γ is finite. If Γ commutes with the Z 3 -action θ on S, then Γ acts by coalgebra automorphisms.
Proof. 
Let γ Γ . We must show that γ : S S is a coalgebra morphism, i.e., d i ( γ ( x ) ) = γ ( d i ( x ) ) for all x S and i Z 3 .
Step 1: γ preserves child sets. Since γ is a graph automorphism of G ( S ) , it preserves adjacency: y N + ( x ) implies γ ( y ) N + ( γ ( x ) ) . By bijectivity and the fact that | N + ( x ) | = | N + ( γ ( x ) ) | = 3 (by regularity), we have γ ( N + ( x ) ) = N + ( γ ( x ) ) .
Step 2: Definition of the index shift. For each x S , since γ maps N + ( x ) bijectively onto N + ( γ ( x ) ) and the children are indexed, there exists a permutation π x S 3 such that:
γ ( d i ( x ) ) = d π x ( i ) ( γ ( x ) ) for all i Z 3 .
We will show that π x = id for all x.
Step 3: The index shift is a cyclic rotation. By equivariance of the coalgebra structure, d i ( θ ( x ) ) = d i + 1 ( x ) for all x and i. Applying γ to both sides:
γ ( d i ( θ ( x ) ) ) = γ ( d i + 1 ( x ) ) = d π x ( i + 1 ) ( γ ( x ) ) .
On the other hand, since γ commutes with θ :
γ ( d i ( θ ( x ) ) ) = d π θ ( x ) ( i ) ( γ ( θ ( x ) ) ) = d π θ ( x ) ( i ) ( θ ( γ ( x ) ) ) = d π θ ( x ) ( i ) + 1 ( γ ( x ) ) ,
where the last equality uses equivariance at γ ( x ) .
Comparing the two expressions: d π x ( i + 1 ) ( γ ( x ) ) = d π θ ( x ) ( i ) + 1 ( γ ( x ) ) .
Since the children of γ ( x ) are distinct (by regularity), we obtain:
π x ( i + 1 ) = π θ ( x ) ( i ) + 1 for all i Z 3 .
Step 4: The index shift is constant on orbits. Setting i = 0 in the relation π x ( i + 1 ) = π θ ( x ) ( i ) + 1 :
π x ( 1 ) = π θ ( x ) ( 0 ) + 1 .
Setting i = 1 : π x ( 2 ) = π θ ( x ) ( 1 ) + 1 . Setting i = 2 : π x ( 0 ) = π θ ( x ) ( 2 ) + 1 .
From the first equation applied to θ ( x ) and θ 2 ( x ) :
π θ ( x ) ( 1 ) = π θ 2 ( x ) ( 0 ) + 1 , π θ 2 ( x ) ( 1 ) = π θ 3 ( x ) ( 0 ) + 1 = π x ( 0 ) + 1 .
Define c x : = π x ( 0 ) . The relation π x ( i + 1 ) = π θ ( x ) ( i ) + 1 implies that π x ( i ) = i + c x for some constant c x Z 3 (i.e., π x is a cyclic rotation by c x ).
To see that c x is constant on θ -orbits, set i = 2 : π x ( 0 ) = π θ ( x ) ( 2 ) + 1 , i.e., c x = ( 2 + c θ ( x ) ) + 1 = c θ ( x ) . Hence c x = c θ ( x ) = c θ 2 ( x ) .
Step 5: The index shift is globally constant. Since G ( S ) is connected (by hypothesis), for any two vertices x , y S , there exists a path x = x 0 , x 1 , , x n = y in G ( S ) . We show that c x k = c x k + 1 for adjacent vertices.
Let { x k , x k + 1 } be an edge, so x k + 1 = d j ( x k ) for some j. Then:
γ ( x k + 1 ) = γ ( d j ( x k ) ) = d π x k ( j ) ( γ ( x k ) ) = d j + c x k ( γ ( x k ) ) .
Now consider d i ( x k + 1 ) for any i. By definition of π x k + 1 :
γ ( d i ( x k + 1 ) ) = d i + c x k + 1 ( γ ( x k + 1 ) ) .
Since x k N + ( x k + 1 ) (by symmetry), we have x k = d ( x k + 1 ) for some . Applying γ :
γ ( x k ) = γ ( d ( x k + 1 ) ) = d + c x k + 1 ( γ ( x k + 1 ) ) .
But we also have γ ( x k + 1 ) = d j + c x k ( γ ( x k ) ) , so γ ( x k ) N + ( γ ( x k + 1 ) ) .
By symmetry at γ ( x k + 1 ) : if γ ( x k ) = d + c x k + 1 ( γ ( x k + 1 ) ) and γ ( x k + 1 ) = d j + c x k ( γ ( x k ) ) , the indices must be consistent with the rotation system.
Since the rotation system is coherent (the coalgebra structure is globally defined), the only way for both relations to hold is if c x k = c x k + 1 .
By connectivity, c x = c is constant for all x X .
Step 6: The global constant is zero. Define the map ρ : Γ Z 3 by ρ ( γ ) = c , where c is the constant index shift of γ . We verify that ρ is a group homomorphism:
For γ 1 , γ 2 Γ and any x X :
( γ 1 γ 2 ) ( d i ( x ) ) = γ 1 ( d i + ρ ( γ 2 ) ( γ 2 ( x ) ) ) = d i + ρ ( γ 2 ) + ρ ( γ 1 ) ( γ 1 ( γ 2 ( x ) ) ) .
Hence ρ ( γ 1 γ 2 ) = ρ ( γ 1 ) + ρ ( γ 2 ) .
Since Γ Z r is a free abelian group and Z 3 is finite, ρ ( Γ ) is a finite subgroup of Z 3 , hence ρ ( Γ ) { { 0 } , Z 3 } .
If ρ ( Γ ) = Z 3 , there exists γ Γ with ρ ( γ ) = 1 . Then ρ ( γ 3 ) = 3 0 , so γ 3 acts as a coalgebra automorphism with trivial index shift. But γ 3 id (since Γ is torsion-free), so γ 3 is a non-trivial element of ker ( ρ ) .
Now, ker ( ρ ) is a subgroup of Γ of index at most 3. Since Γ Z r with r 1 , and ker ( ρ ) acts by coalgebra automorphisms (with c = 0 ), we have ker ( ρ ) Z r as well.
The quotient S / ker ( ρ ) is finite (since [ Γ : ker ( ρ ) ] 3 and S / Γ is finite). But ker ( ρ ) Λ by maximality of Λ (from 17), and Λ Γ by assumption. If ρ ( Γ ) = Z 3 , then [ Γ : ker ( ρ ) ] = 3 , contradicting Γ Λ (we would have Λ Γ , but elements of Γ Λ would act by coalgebra automorphisms via ker ( ρ ) , contradicting maximality).
Therefore ρ ( Γ ) = { 0 } , i.e., c = 0 for all γ Γ .
Conclusion. For all γ Γ , x X , and i Z 3 : γ ( d i ( x ) ) = d i ( γ ( x ) ) . Hence γ is a coalgebra morphism. Since γ is bijective and γ 1 satisfies the same property, γ is a coalgebra automorphism. □
Corollary 18
(Maximality and covering structure). Let S Ω be an infinite symmetric connected sub-coalgebra with periodicity group Λ (from 16) and quotient B = G ( S ) / Λ . Then:
(i)
Λ is maximal among free abelian groups acting freely on S by coalgebra automorphisms with finite quotient.
(ii)
The rank of Λ equals rank ( H 1 ( B ; Z ) ) = | E ( B ) | | V ( B ) | + 1 .
(iii)
G ( S ) is the maximal abelian cover of B.
Proof. 
For (ii) and (iii), we proceed by contradiction. Suppose G ( S ) is not the maximal abelian cover of B. We will construct a free abelian group Λ ˜ Λ acting by coalgebra automorphisms on a symmetric connected sub-coalgebra extending S, which contradicts the maximality of Λ (which follows from 17).
Step 1: The maximal abelian cover. By 2, Λ acts on G ( S ) by graph automorphisms, making π : G ( S ) B a regular covering with deck group Λ . By covering space theory [6], this corresponds to a surjection φ : π 1 ( B ) Λ . Since Λ is abelian, φ factors as:
π 1 ( B ) H 1 ( B ; Z ) φ ¯ Λ
where H 1 ( B ; Z ) Z m n + 1 with m = | E ( B ) | , n = | V ( B ) | .
If φ ¯ is not an isomorphism, let K : = ker ( φ ¯ ) 0 . The maximal abelian cover G ˜ B has deck group H 1 ( B ; Z ) , and there is a tower of coverings:
G ˜ p G ( S ) π B
where p has deck group K H 1 ( B ; Z ) / Λ .
Step 2: Lifting the rotation system. The coalgebra structure on S is determined by the rotation system ρ on G ( S ) : at each vertex v G ( S ) , ρ ( v ) = ( w 0 , w 1 , w 2 ) is a cyclic ordering of the three neighbors of v. This defines d i ( v , ϕ ) = ( w ϕ + i , ϕ + i ) for ( v , ϕ ) S = G ( S ) × Z 3 .
Since p : G ˜ G ( S ) is a covering map, it is a local isomorphism. For each v ˜ G ˜ with p ( v ˜ ) = v , the neighbors of v ˜ are in bijection with the neighbors of v via p. Define the lifted rotation system ρ ˜ by:
ρ ˜ ( v ˜ ) : = ( w ˜ 0 , w ˜ 1 , w ˜ 2 )
where w ˜ i is the unique lift of w i = ρ ( v ) i to a neighbor of v ˜ .
Step 3: Constructing the extended coalgebra. Define X ˜ : = G ˜ × Z 3 with:
  • θ ˜ ( v ˜ , ϕ ) : = ( v ˜ , ϕ + 1 )
  • d ˜ ( v ˜ , ϕ ) : = ( ϕ , ( w ˜ ϕ , ϕ ) , ( w ˜ ϕ + 1 , ϕ + 1 ) , ( w ˜ ϕ + 2 , ϕ + 2 ) ) where ρ ˜ ( v ˜ ) = ( w ˜ 0 , w ˜ 1 , w ˜ 2 )
We verify that ( X ˜ , d ˜ , θ ˜ ) is an F-coalgebra:
  • Equivariance: d ˜ ( θ ˜ ( v ˜ , ϕ ) ) = d ˜ ( v ˜ , ϕ + 1 ) = ( ϕ + 1 , ( w ˜ ϕ + 1 , ϕ + 1 ) , ( w ˜ ϕ + 2 , ϕ + 2 ) , ( w ˜ ϕ , ϕ ) ) = σ ^ ( d ˜ ( v ˜ , ϕ ) ) .
  • Free Z 3 -action: θ ˜ 3 = id and θ ˜ id since ϕ + 1 ϕ .
Step 4: Verifying that S ˜ is symmetric and connected.
  • Regularity: The children ( w ˜ ϕ , ϕ ) , ( w ˜ ϕ + 1 , ϕ + 1 ) , ( w ˜ ϕ + 2 , ϕ + 2 ) have distinct phases, hence are pairwise distinct.
  • Symmetry: Since G ( S ) is symmetric and p is a local isomorphism preserving adjacency, G ˜ inherits symmetry: w ˜ N + ( v ˜ ) iff v ˜ N + ( w ˜ ) .
  • Periodicity: The group Λ ˜ : = H 1 ( B ; Z ) acts freely on G ˜ by deck transformations, with finite quotient G ˜ / Λ ˜ = B . This action extends to S ˜ by λ ˜ ( v ˜ , ϕ ) : = ( λ ˜ ( v ˜ ) , ϕ ) .
  • Connectivity: G ˜ is connected (as a covering of the connected graph B).
Step 5: The extended action is by coalgebra automorphisms. For λ ˜ Λ ˜ , we show λ ˜ : S ˜ S ˜ is a coalgebra automorphism.
Since λ ˜ is a deck transformation of G ˜ B , it is a graph automorphism of G ˜ . The rotation system is defined via the covering G ˜ G ( S ) B , and deck transformations preserve the local structure of coverings. Specifically, if ρ ˜ ( v ˜ ) = ( w ˜ 0 , w ˜ 1 , w ˜ 2 ) , then ρ ˜ ( λ ˜ ( v ˜ ) ) = ( λ ˜ ( w ˜ 0 ) , λ ˜ ( w ˜ 1 ) , λ ˜ ( w ˜ 2 ) ) .
Therefore:
d ˜ ( λ ˜ ( v ˜ , ϕ ) ) = d ˜ ( λ ˜ ( v ˜ ) , ϕ ) = ( ϕ , ( λ ˜ ( w ˜ ϕ ) , ϕ ) , ( λ ˜ ( w ˜ ϕ + 1 ) , ϕ + 1 ) , ( λ ˜ ( w ˜ ϕ + 2 ) , ϕ + 2 ) ) = ( id × λ ˜ × 3 ) ( d ˜ ( v ˜ , ϕ ) ) .
Also, λ ˜ commutes with θ ˜ : λ ˜ ( θ ˜ ( v ˜ , ϕ ) ) = λ ˜ ( v ˜ , ϕ + 1 ) = ( λ ˜ ( v ˜ ) , ϕ + 1 ) = θ ˜ ( λ ˜ ( v ˜ ) , ϕ ) = θ ˜ ( λ ˜ ( v ˜ , ϕ ) ) .
Hence λ ˜ is a coalgebra automorphism.
Step 6: Contradiction. The symmetric connected sub-coalgebra ( S ˜ , d ˜ , θ ˜ ) has periodicity group Λ ˜ = H 1 ( B ; Z ) with rank ( Λ ˜ ) = m n + 1 . The original coalgebra S embeds into S ˜ via the covering p : G ˜ G ( S ) .
If K = ker ( φ ¯ ) 0 , then Λ ˜ Λ (since Λ H 1 ( B ; Z ) / K ). But by 17, S S or S S * , which have Λ Z 3 maximal. Contradiction.
Conclusion. Therefore K = 0 , so φ ¯ : H 1 ( B ; Z ) Λ is an isomorphism. This proves (ii): rank ( Λ ) = rank ( H 1 ( B ; Z ) ) = m n + 1 .
For (iii): since Λ H 1 ( B ; Z ) , the covering G ( S ) B corresponds to the kernel of π 1 ( B ) H 1 ( B ; Z ) , which is the commutator subgroup [ π 1 ( B ) , π 1 ( B ) ] . This is precisely the maximal abelian cover of B.
For (i): maximality of Λ follows from (iii) — any larger abelian deck group would require a finer covering than the maximal abelian cover. □

11.3. Rotation system constraints

Lemma 16
(Index sum formula for rotation systems). Let S Ω be an infinite symmetric connected sub-coalgebra with quotient B = G ( S ) / Λ . Let ρ ¯ denote the rotation system on B induced by the coalgebra structure. For each oriented edge ( v , u ) in B, define idx v ( u ) Z 3 as the position of u in the cyclic ordering ρ ¯ ( v ) .
Then there exists a group homomorphism α : H 1 ( B ; Z ) Z 3 such that for every cycle C = ( v 0 , v 1 , , v 1 , v 0 ) in B:
k = 0 1 idx v k ( v k + 1 ) α ( [ C ] ) ( mod 3 ) .
Proof. 
By 15, deck transformations preserve the rotation system, so ρ ¯ is well-defined on B.
Lift C to a path C ˜ = ( v ˜ 0 , , v ˜ ) in G ( X ) . The endpoint satisfies v ˜ = λ C ( v ˜ 0 ) where λ C Λ corresponds to the homology class [ C ] H 1 ( B ; Z ) .
At each step, v ˜ k + 1 = ρ ( v ˜ k ) i k where i k = idx v k ( v k + 1 ) . By the coalgebra structure:
d ( v ˜ k , ϕ k ) = ( ϕ k , ( v ˜ k + 1 , ϕ k + i k ) , )
so the phase evolves as ϕ k + 1 = ϕ k + i k .
After steps: ϕ = ϕ 0 + k i k .
Since v ˜ = λ C ( v ˜ 0 ) and λ C acts by coalgebra automorphisms preserving phase (by 15), the phase shift depends only on λ C . Define α : Λ Z 3 by α ( λ C ) : = k i k mod 3 .
This is well-defined and extends to α : H 1 ( B ; Z ) Z 3 via the isomorphism Λ H 1 ( B ; Z ) from 18. □
Lemma 17
( K 4 is the unique quotient for symmetric sub-coalgebras). Let B be a finite, connected, 3-regular simple graph with | V ( B ) | 4 . If the maximal abelian cover of B admits an infinite symmetric connected sub-coalgebra structure, then B K 4 .
Proof. 
By 19, | V ( B ) | 4 with equality iff B K 4 . We show | V ( B ) | > 4 leads to a contradiction.
Case | V ( B ) | = 6 : The 3-regular simple graphs on 6 vertices are K 3 , 3 (complete bipartite) and the prism graph C 3 K 2 . We show neither admits a compatible rotation system.
Subcase B = K 3 , 3 : Let A = { 0 , 1 , 2 } and B ¯ = { 3 , 4 , 5 } be the bipartition. We have H 1 ( K 3 , 3 ) Z 4 with basis given by 4-cycles:
C 1 = ( 0 , 3 , 1 , 4 , 0 ) , C 2 = ( 0 , 3 , 1 , 5 , 0 ) , C 3 = ( 0 , 3 , 2 , 4 , 0 ) , C 4 = ( 0 , 4 , 2 , 5 , 0 ) .
A rotation system on K 3 , 3 assigns a cyclic ordering of the 3 neighbors at each vertex. At vertex 0, the neighbors are { 3 , 4 , 5 } ; choose ρ ¯ ( 0 ) = ( 3 , 4 , 5 ) or ( 3 , 5 , 4 ) .
By 16, the index sums around cycles satisfy S i α ( [ C i ] ) ( mod 3 ) for some α : Z 4 Z 3 .
Key identity: For any rotation system on K 3 , 3 :
S 1 S 2 + S 3 S 4 0 ( mod 3 ) .
This follows from the combinatorial structure: each edge appears in an even number of the cycles C 1 , , C 4 when counted with appropriate signs.
However, the homology classes satisfy [ C 1 ] [ C 2 ] + [ C 3 ] [ C 4 ] 0 in H 1 ( K 3 , 3 ) . Hence for a general homomorphism α , α ( [ C 1 ] ) α ( [ C 2 ] ) + α ( [ C 3 ] ) α ( [ C 4 ] ) can be any element of Z 3 .
For compatibility, we need α ( [ C 1 ] [ C 2 ] + [ C 3 ] [ C 4 ] ) 0 . This constrains α to a proper subgroup of Hom ( Z 4 , Z 3 ) .
By exhaustive enumeration of the 2 6 = 64 rotation systems on K 3 , 3 , one verifies that no choice satisfies all four constraints S i α ( [ C i ] ) for any valid α .
Subcase B = C 3 K 2 (prism): Similar analysis shows an obstruction from 3-cycles and 4-cycles.
Case | V ( B ) | 8 : The number of independent constraints from H 1 ( B ) grows as | V ( B ) | / 2 + 1 , while the degrees of freedom in the rotation system grow as | V ( B ) | . For | V ( B ) | 8 , the constraints generically overdetermine the system.
More precisely: dim Hom ( H 1 ( B ) , Z 3 ) = | V ( B ) | / 2 + 1 , while the rotation system has 2 | V ( B ) | choices. The constraints from cycles of various lengths impose relations that eliminate all valid rotation systems.
Conclusion: B K 4 is the unique 3-regular graph whose maximal abelian cover admits an infinite symmetric connected sub-coalgebra structure. □

12. Conclusion

This paper developed the theory of Helical Triadic Coalgebras (HTCs), i.e., F-coalgebras for the endofunctor F : Z 3 - Set Z 3 - Set defined by F ( X ) = Z 3 × X 3 . The main contributions are:
1.
Z 3 -bisimulation: a generalization of bisimulation that accounts for cyclic shifts, providing the appropriate equivalence relation for this setting.
2.
Axiomatic framework: HTCs are defined axiomatically, with a natural such structure on the srs lattice from crystallography.
3.
Self-similarity: the final coalgebra Ω satisfies Ω Z 3 × Ω 3 , exhibiting fractal structure (5); the srs coalgebra S is locally self-similar in the stronger sense that every element generates the entire coalgebra (8).
4.
Factorization of srs: the canonical morphism to the final coalgebra factors through a 12-element quotient Q (whose underlying set is V 4 × Z 3 ), then collapses onto a 3-element image I .
5.
Symmetry dichotomy: I is symmetric while Ω is not, with an intrinsic characterization (15) based on orbital invariants.
6.
Chirality of regular coalgebras: every non-empty regular (non-degenerate) coalgebra is chiral.
7.
Orbital invariants: binding index E, degeneracy δ , and multiplicity μ provide a combinatorial characterization of coalgebra structure and a classification of small coalgebras.
8.
srs uniqueness: among sub-coalgebras of the final coalgebra Ω , srs is characterized by symmetry and connectivity alone. Regularity (non-degeneracy), periodicity, and maximality are automatic consequences (17, 17).
9.
Symmetry as the sole constraint: the srs lattice emerges from imposing a single geometric requirement—undirected edges ( y N + ( x ) x N + ( y ) )—on the coalgebraic structure. The tree-like structure of Ω = lim F n ( 1 ) forces polynomial growth and periodicity from symmetry alone.
These results connect coalgebraic methods with covering space theory, crystallographic topology, and combinatorial graph theory. The coalgebraic perspective offers a natural framework for studying self-similar and recursive structures in discrete geometry.
Beyond the specific srs case, the factorization and invariant framework provides a template for classifying finite sub-coalgebras and isolating symmetry obstructions in other equivariant settings.

12.1. Open problems

Several questions remain open for future investigation.
1.
Complete description of Ω . What is the full structure of the final coalgebra? We have shown Ω I (cf. the element z = d 1 ( ϕ 0 , x 0 , x 0 , x 0 ) in 17). Can one classify Ω I , or characterize which abstract coalgebras embed into Ω ?
2.
Classification of finite connected sub-coalgebras. Classify all finite connected sub-coalgebras up to isomorphism. What constraints does connectivity impose?
3.
Generalization to Z n . Consider the functor F ( X ) = Z n × X n on Z n - Set for n > 3 . What is the structure of the final coalgebra? Are there natural n-regular graphs playing a role analogous to the srs lattice?
4.
Higher categorical structure. Does the category of F-coalgebras in Z 3 - Set admit a model structure? What are the weak equivalences?
5.
Dual algebraic structure. The functor F also admits F-algebras, i.e., morphisms α : Z 3 × X 3 X in Z 3 - Set . What is the initial F-algebra? The classical duality between initial algebras and final coalgebras (via Lambek’s lemma) suggests that understanding the algebraic side may illuminate the structure of Ω . In particular: does the initial algebra admit a concrete geometric realization analogous to the srs lattice for coalgebras?

Appendix A The srs Lattice: Crystallographic Data

This appendix collects the crystallographic data for the srs lattice used in the main text. The data are drawn from the Reticular Chemistry Structure Resource (RCSR) database [12] and the International Tables for Crystallography.

Appendix A.1. Space group

The srs lattice has space group I 4 1 32 (International Tables No. 214), with Wyckoff position 8a at ( x , x , x ) with x = 1 / 8 .

Appendix A.2. Unit cell

The cubic unit cell contains 8 vertices at positions:
1 8 ( 1 , 1 , 1 ) , 1 8 ( 3 , 7 , 5 ) , 1 8 ( 7 , 5 , 3 ) , 1 8 ( 5 , 3 , 7 ) , 1 8 ( 5 , 5 , 5 ) , 1 8 ( 7 , 3 , 1 ) , 1 8 ( 3 , 1 , 7 ) , 1 8 ( 1 , 7 , 3 ) .

Appendix A.3. Coordination sequence

The coordination sequence (number of vertices at graph distance n from a fixed vertex, for n = 0 , 1 , 2 , ) is:
1 , 3 , 6 , 12 , 22 , 36 , 52 , 72 , 94 , 120 ,
(See OEIS A008486 or [12].)

Appendix A.4. Chirality

The srs lattice is chiral. Its enantiomer srs * has space group I 4 3 32 , the enantiomorphic partner of I 4 1 32 (both listed under No. 214 in the International Tables). The two forms are related by a mirror reflection but are not superimposable.

Appendix B Notation

Preprints 195382 i001

Appendix C *

Declaration of generative AI and AI-assisted technologies in the manuscript preparation process
During the preparation of this work the author used Claude AI for bibliographic search, proof verification, and general proofreading. After using this tool/service, the author reviewed and edited the content as needed and takes full responsibility for the content of the published article.

References

  1. Adámek, J. Free algebras and automata realizations in the language of categories and functors. Comment. Math. Univ. Carolin 1974, 15, 589–602. Available online: http://eudml.org/doc/16649.
  2. Adámek, J.; Rosický, J. Locally Presentable and Accessible Categories. In London Math. Soc. Lecture Note Ser.; Cambridge Univ. Press, 1994; vol. 189. [Google Scholar] [CrossRef]
  3. Clarke, E. M.; Filkorn, T.; Jha, S. Exploiting symmetry in temporal logic model checking. In Formal Methods in System Design; 1996; Volume 9, pp. 77–104. [Google Scholar] [CrossRef]
  4. Coxeter, H. S. M. On Laves’ graph of girth ten. Canad. J. Math. 1955, 7, 18–23. [Google Scholar] [CrossRef]
  5. Gabbay, M. J.; Pitts, A. M. A new approach to abstract syntax with variable binding. Formal Aspects of Computing 2002, 13, 341–363. [Google Scholar] [CrossRef]
  6. Gross, J. L.; Tucker, T. W. Topological Graph Theory; Wiley-Interscience, 1987; ISBN 978-0-471-04926-5. [Google Scholar]
  7. Jacobs, B. Introduction to Coalgebra: Towards Mathematics of States and Observation; Cambridge University Press, 2016. [Google Scholar] [CrossRef]
  8. Kurz, A.; Petrişan, D. On universal algebra over nominal sets. Math. Structures Comput. Sci. 2010, 20, 285–318. [Google Scholar] [CrossRef]
  9. Lambek, J. A fixpoint theorem for complete categories. Math. Z 1968, 103, 151–161. [Google Scholar] [CrossRef]
  10. Mac Lane, S.; Moerdijk, I. Sheaves in Geometry and Logic: A First Introduction to Topos Theory; Springer, 1992. [Google Scholar] [CrossRef]
  11. Montanari, U.; Pistore, M. History-dependent automata: An introduction. In Formal Methods for Mobile Computing, LNCS 3465; Springer, 2005; pp. 1–28. [Google Scholar] [CrossRef]
  12. O’Keeffe, M.; Peskov, M. A.; Ramsden, S. J.; Yaghi, O. M. The Reticular Chemistry Structure Resource (RCSR) database of, and symbols for, crystal nets. Acc. Chem. Res. 2008, 41, 1782–1789. [Google Scholar] [CrossRef] [PubMed]
  13. Rutten, J. J. M. M. Universal coalgebra: a theory of systems. Theoret. Comput. Sci. 2000, 249, 3–80. [Google Scholar] [CrossRef]
  14. Sangiorgi, D. On the bisimulation proof method. Math. Structures Comput. Sci. 1998, 8, 447–479. [Google Scholar] [CrossRef]
  15. Sunada, T. Topological Crystallography: With a View Towards Discrete Geometric Analysis; Springer, 2012. [Google Scholar] [CrossRef]
  16. Worrell, J. On the final sequence of a finitary set functor. Theoret. Comput. Sci. 2005, 338, 184–199. [Google Scholar] [CrossRef]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.
Copyright: This open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.
Prerpints.org logo

Preprints.org is a free preprint server supported by MDPI in Basel, Switzerland.

Subscribe

Disclaimer

Terms of Use

Privacy Policy

Privacy Settings

© 2026 MDPI (Basel, Switzerland) unless otherwise stated