Contact Us!
CoCalc Logo Icon
StoreFeaturesDocsShareSupportNewsAboutSign UpSign In
Avatar for stephanie's main branch.

Real-time collaboration for Jupyter Notebooks, Linux Terminals, LaTeX, VS Code, R IDE, and more,
all in one place. Commercial Alternative to JupyterHub.

| Download

Research done and presented in relation to "Cubulated Holonomy", our chosen direction of research at the IU Bloomington 2024 REU. Mentor: Seppo Niemi Colvin Collaborator: Josue Molina

Views: 131
Image: ubuntu2204
1
2
%----------------------------------------------------------------------------------------
3
4
\documentclass[12pt]{amsart}
5
\usepackage[T1]{fontenc}
6
\usepackage[utf8]{inputenc}
7
\usepackage{amsmath, amssymb, graphicx, hyperref, comment}
8
\usepackage{tikz-cd}
9
\usepackage{caption, subcaption}
10
\usepackage{adjustbox}
11
\usepackage[margin=1in,marginparwidth=0.75in]{geometry}
12
\usepackage{bm} % Enables bold in math mode
13
14
15
%% TIP: Often times, many definitions/commands will be needed for a project. It can be convenient to keep this in a different file, as to avoid cluttering the main one.
16
\input{defs}
17
18
%% TIP: It is good practice to put all figures and drawings in a seperate folder. Set the below to the relative path of that folder to the current .tex file.
19
\graphicspath{{Figures/}}
20
21
%%%%%%%%%%%%%%%%%
22
\usepackage{amsmath}
23
\usepackage{amsfonts}
24
\usepackage{amsthm}
25
\usepackage{amssymb}
26
\usepackage{graphicx}
27
\usepackage[colorinlistoftodos]{todonotes}
28
\usepackage{pifont}
29
\usepackage{xcolor}
30
\usepackage{enumerate}
31
\usepackage{array}
32
\usepackage{tikz}
33
\usepackage{pgfplots}
34
35
36
%%%%%%%%%%%%%%%%%
37
\hypersetup{
38
colorlinks=true,
39
linkcolor=blue,
40
filecolor=black,
41
urlcolor=blue,
42
citecolor=blue,
43
}
44
45
%----------------------------------------------------------------------------------------
46
% UTILITY PACKAGES/DEFINTIIONS (add/modify according your specific project)
47
%----------------------------------------------------------------------------------------
48
49
50
51
52
53
\begin{document}
54
\title{Cubulated Holonomy}
55
56
% Replace fields below to match your information/research institution's information
57
\author[Atherton]{Stephanie Atherton} % First argument: last name (will appear at the top of each even-numbered page) Second argument: first and last name (will appear in title)
58
\author[Molina]{Josué Molina}
59
\author[Niemi-Colvin]{Seppo Niemi-Colvin}
60
\address{Dept. of Interdisciplinary Studies\\
61
Otis College of Art \&\ Design,
62
Los Angeles, CA 90045
63
}
64
\email{satherton@student.otis.edu}
65
\address{Department of Mathematics and Statistics\\
66
Texas Tech University,
67
Lubbock, TX 79409
68
}
69
\email{josumoli@ttu.edu}
70
\address{Department of Mathematics\\
71
Indiana University Bloomington,
72
Bloomington, IN 47405
73
}
74
\email{smniemic@iu.edu}
75
76
\date{\today} % Can also replace \today with specific date
77
%----------------------------------------------------------------------------------------
78
% PROJECT INFORMATION AND TITLEPAGE
79
%----------------------------------------------------------------------------------------
80
81
\begin{abstract}Holonomy is well-known in the continuous context in studying parallel transport maps, yet here we explore its discrete analogue in "rolling" polyhedra in loops over combinatorial symmetrical surfaces. Extending previous research conducted at Duke University initially introducing "combinatorial holonomy" in terms of the tetrahedron rolled on triangulated surfaces, we apply their approach to the holonomy of the cube on cubulated surfaces. Further, we recognize parameters of surfaces for the holonomy of the cube as contained within the alternating group $A_4$ and discover small subgroups outside of $A_4$ but contained in $S_4$. Our generalizations allow us to formally categorize families of cubulated annuli and further, families of cubulated tori as having holonomy isomorphic to either $A_4$ or $S_4$.
82
83
\end{abstract}
84
85
\maketitle
86
87
%----------------------------------------------------------------------------------------
88
% MAIN CONTENT
89
%----------------------------------------------------------------------------------------
90
91
\section{Introduction}
92
\subsection{The Combinatorial Approach}
93
We begin with a review on the holonomy of combinatorial surfaces and the combinatorial holonomy group, as defined by previous research at Duke University. While the holonomy of \emph{continuous} surfaces is a well-explored theme throughout mathematics, it is not until recently that the consequence has been studied \emph{discretely}. Via parallel transport maps, traditional holonomy is often studied in "sliding" a basis along a Riemannian manifold. Here we "roll" our highly symmetrical structures (i.e. polyhedra) in loops on its combinatorial surface counterpart to realize symmetries as induced by the holonomy of the connection. Specifically, we use the combinatorial fundamental group and local contributions to compute the holonomy group of surfaces. Previous research considered the tetrahedron as rolled on triangulated surfaces, and we hope to generalize these results to the cube on cubulated surfaces throughout this paper. \\
94
95
\subsection{Conclusions and Future Directions}
96
Combinatorial holonomy offers a novel, discrete perspective to the study of holonomy formerly only pursued in the continuous context. Advancing previous research, we have extrapolated combinatorial holonomy as initially considered in the tetrahedral case to the cube on various cubulated surfaces. Further, we succeeded in classifying cubulated annuli and built upon this discovery to categorize families of cubulated tori as having $A_4$ or $S_4$ holonomy. As we found that it is relatively easy to find $A_4$ or $S_4$ holonomy, yet difficult to find subgroups outside of $A_4$ and still in $S_4$, a natural next step may be to attempt to uncover such subgroups on other surfaces. Further, we would like to approach the question of shortest loops for given symmetries of surfaces in understanding elements of the holonomy group. As all previous research in combinatorial holonomy has studied tori in some respect, it would be of particular interest to investigate higher genus surfaces and the possible families of surfaces or symmetries which may arise there. Alternatively, one could define rolling and consider symmetries of higher dimensional $n$-cubes to continue research with cubulated surfaces.
97
\subsection*{Acknowledgements} % Unnumbered subsection to include acknowledgements (advisor, grants, etc.) An example acknowledgement is included for reference.
98
This research was made possible via the support of NSF grant DMS-2051032, which we gratefully acknowledge. We would also like to acknowledge the Indiana University Department of Mathematics for hosting the REU program and our mentor Seppo Niemi-Colvin for believing in us and supporting our success throughout this project.
99
100
101
102
\section{Symmetries of the Cube and Cubulated Symmetrical Surfaces}
103
104
\subsection{Symmetry Group of the Cube}
105
We begin then with an overview of the symmetry group of the cube, with $n$-fold axes of rotational symmetry through opposite vertices, opposite edges, and opposite faces forming respective conjugacy classes. Consider first the identity element in its own conjugacy class, as well as the four 4-fold axes through opposite vertices containing 8 symmetries order 3. Further, there are the three 4-fold axes through opposite centroids, giving 9 elements of symmetry (3 of order 2 and 6 of order 4) and the six 2-fold axes through edges giving 6 elements of order 2. Hence we have a total of 24 rotational isometry-preserving symmetries of our cube $\C$ as isomorphic to $S_4$. The symmetric group $S_4$ on four elements can be seen as a group permuting the four diagonals of the cube. Note in particular $S_4$ as all possible orientation-preserving symmetries of the cube and $A_4$ as its maximal normal subgroup, as it is within these two subgroups that we will most often discover symmetries\cite{alg}.\\
106
\begin{center}
107
\begin{tikzpicture}
108
\draw[violet, very thick] (0,0,0) -- (0,3,0) -- (3,3,0) -- (3,0,0) -- cycle;
109
\draw[violet, very thick] (0,0,3) -- (0,3,3) -- (3,3,3) -- (3,0,3) -- cycle;
110
\draw[violet, very thick] (0,0,0) -- (0,0,3);
111
\draw[violet, very thick] (0,3,0) -- (0,3,3);
112
\draw[violet, very thick] (3,0,0) -- (3,0,3);
113
\draw[violet, very thick] (3,3,0) -- (3,3,3);
114
\end{tikzpicture}
115
\end{center}
116
117
118
\subsection{Cubulated Surfaces}
119
120
Many of the following definitions are abstracted from the previous work and revised to define rolling cubes $\C$ on cubulated surfaces $S$ as will be explored throughout this paper.
121
122
\begin{definition}
123
\emph{(Cubulated surface.)} We define a cubulated surface S = (V, E, F) as nonempty sets:
124
\begin{itemize}
125
\item $V$ of vertices $v$.
126
\item $E$ of edges $e =\{v_1,v_2\}$ such that $v_1, v_2$ are distinct elements of $V$.
127
\item $F$ of square faces $f$ of form $f = \{v_1, v_2, v_3, v_4\}$ such that all vertices and all edges are contained in a face $f$ each with 4 distinct vertices and 4 distinct edges forming a four cycle graph.
128
\end{itemize}
129
130
We also require that:
131
\begin{itemize}
132
\item Every edge $e$ is contained in either 1 or 2 faces $f \in F$.
133
\item Every vertex $v$ is contained in a face $f \in F$.
134
\item Every 2 faces are disjoint or intersect at a single edge $e$.
135
\end{itemize}
136
137
138
139
140
141
142
\end{definition}
143
144
\begin{definition} \emph{(Adjacency of faces)}
145
A single edge $e$ which is contained in 2 faces $f_1$ and $f_2$ asserts that $e$ is an interior edge by which $f_1$ and $f_2$ are adjacent. If $e$ is not an interior edge, then it is a boundary edge. Note that if $f_1 \cap f_2 \neq e$ for any edge $e$, then $f_1$ and $f_2$ are not adjacent.
146
\end{definition}
147
Further, the set of faces $f \in F$ containing a vertex $v$ can be arranged in a sequence $f_1, f_2, . . . f_\delta$ such that $f_i$ and $f_\delta$ are adjacent for $1 \leq i < \delta$.
148
\begin{definition}\label{intvertex} \emph{(Interior Vertex)}
149
If $\delta \neq 2$ and $f_\delta$ is adjacent to $f_1$
150
by an interior edge $e$, then the vertex $v$ is said to be interior.
151
\end{definition}
152
\begin{remark*}
153
Should all edges of a surface be interior, then so are all vertices and we have a surface $S$ without boundary. Boundary edges are constructed purely of boundary vertices.
154
\end{remark*}
155
156
\begin{definition}
157
\emph{(Connectedness)} A cubulated surface $S = (V,E,F)$ is face-connected if for any $f,f' \in F$ there is a sequence of S-faces $S(f) = (f_1, f_2, . . .,f_\delta)$ such that $f_i$ is adjacent to $f_{i+1}$ for $1 \leq i < \delta$ for a connected surface $S$. \cite{Duke}
158
\end{definition}
159
\begin{remark*}
160
This notion of combinatorial connectedness agrees with the traditional topological definition.
161
\end{remark*}
162
163
\begin{definition}
164
\emph{(Automorphism Group)}
165
A bijection $\alpha: V \xrightarrow[]{} V$ is an automorphism of $S = (V,E,F)$ when $\{v_1,v_2, v_3, v_4\} \in F$ if and only if $\{\alpha(v_1), \alpha(v_2), \alpha(v_3), \alpha(v_4) \} \in F$ and $\alpha$ similarly respects edges. Under composition, the set of automorphisms form a group \emph{Aut}$(S)$ \cite{Duke}.
166
167
\end{definition}
168
The automorphisms under our considerations may be assumed to be orientation-preserving.
169
\begin{definition}
170
\emph{(Maximally Symmetric)} A cubulated surface $S = (V, E, F)$ such that $|\emph{Aut}(S)| = 8|F|$ is maximally symmetric, as a fixed face of a cubulated surface S can be mapped to S' in at most 8 ways.
171
\end{definition}
172
173
174
175
\section{The Combinatorial Fundamental Group}
176
Just as we explore the discrete/combinatorial analogue of holonomy, we utilize the combinatorial analogue of the fundamental group in our methods.
177
\subsection{Discrete Analogues of the Fundamental Group}
178
\begin{definition}
179
\emph{(Path)}
180
A path along $S$ is a sequence of faces $f_i \in F, 1 \leq i \leq n$ such that each $f_i$is adjacent to both faces $f_i - 1$ and $f_i + 1$.
181
\end{definition}
182
\begin{definition}
183
\emph{(Loop)}
184
A loop is a path on $S$ crossing a sequence of adjacent faces $f_i \in F$ for $1 \leq i \leq n$ such that $f_1 = f_n$ that starts and ends at the same face.
185
\end{definition}
186
\begin{figure}
187
\centering
188
\includegraphics[width=0.5\linewidth]{Combinatorial Hol. Draft/Figures/Lasso diagram.pdf (1).png}
189
\caption{Lasso around an interior vertex}
190
\label{fig:enter-label}
191
\end{figure}
192
\begin{definition}
193
\emph{(Loop Group)} We define the loop group $L_f(S)$ by classes of loops sharing backtracking equivalence under the operation of concatenation $\star$.
194
\end{definition}
195
196
\begin{definition}
197
198
\emph{(Backtracking Equivalence)} We consider loops $l \simeq l'$ if and only if one can be obtained from the other by replacing some portion (of $l$ in this case) of form \\
199
$(f_i, f_{i +1}, f_{i +2}, . . . f_{i + k}, f_{(i + k)-1}, . . . f_{i +2}, f_{i + 1}, f_i)$ with $f_i$.
200
\end{definition}
201
To illustrate, we would consider loops:
202
\[l = (f_1,f_2,f_3,f_4,f_3,f_5,f_1)\]
203
and
204
\[l' = (f_1,f_2,f_3,f_5,f_1)\]
205
equivalent (assuming adjacency of listed faces), where $f_i = f_3$ in this particular example. The group operation is well-defined on equivalence classes of loops.
206
\begin{remark*}
207
Backtracking allows for inverses, satisfying the requirement of inverse elements for the group $L_f(S)$.
208
\end{remark*}
209
\begin{thm} \label{uptoIso}
210
Assuming our surface $S$ is path-connected, then $L_f(S)$ is independent of the base face up to isomorphism.
211
\end{thm}
212
\begin{proof}
213
This proof follows that of the prior work. \cite{Duke}
214
\end{proof}
215
216
\begin{definition}
217
\emph{(Lasso)} If $h$ is a path from $f_1$ to $f_n$ with $v_n \in f_n$ as an interior vertex, and $l$ is the loop around $v$ beginning and ending at $f_n$ whose existence is guaranteed by Definition \ref{intvertex}, then we have $h^{-1}\star l \star h$ as a lasso based at $f_1$.
218
219
220
\end{definition}
221
\begin{definition}
222
\emph{(Nullhomotopic Loop Group)} The subgroup group $C_f(S)$ of $L_f(S)$ generated by the set of all lassos based at $f$ in $L_f(S)$ is the nullhomotopic loop group based at $f$ under concatenation of loops. As $C(S)$ is preserved under the isomorphism of \ref{uptoIso}, we choose to omit the base face and reference $C(S)$ as our nullhomotopic loop group.
223
\end{definition}
224
\begin{remark*}
225
This definition of nullhomotopy agrees with the standard definition of nullhomotopic loops in a continuous sense; a combinatorial loop on $S$ is nullhomotopic
226
if and only if the same loop, considered instead as a continuous loop in the underlying
227
topological space of S, is nullhomotopic. Similarly, we consider two loops homotopic if their continuous analogues in the underlying topological space are also homotopic.
228
\end{remark*}
229
230
\begin{thm}
231
C(S) is a normal subgroup of L(S).
232
\end{thm}
233
\begin{proof}
234
Suppose $c \in C(S)$ and $l \in L(S)$. Then $lcl^{-1}$ is homotopic to $l1l$ which is equal to the identity $1 \in C(S)$. Thus $lcl^{-1}$ is nullhomotopic, so $lcl^{-1} \in C(S)$. \cite{Duke}
235
\end{proof}
236
\begin{definition} \emph{(Combinatorial Fundamental Group)}
237
We define the fundamental group of a combinatorial symmetric surface $S$ as $\pi_1(S):= L(S)/C(S)$.
238
\begin{remark*}
239
This definition agrees with the traditional notion of a fundamental group in
240
that the fundamental group of a surface is isomorphic to the fundamental group
241
of the surface’s underlying topological space.
242
\end{remark*}
243
For further details please reference the \hyperref[app]{appendix}.
244
\end{definition}
245
246
\section{The Combinatorial Holonomy Group}
247
Rolling our cube $\C$ in loops on the surface $S$ not only induces the holonomy of surface and realizes symmetries of $\C$, but also gives rise to the combinatorial holonomy group we define in this section. First we provide the definitions necessary to describe rolling the cube $\C$ on $S$.
248
\begin{definition}
249
\emph{(Orientation)}
250
Given a face $f = \{ v_1, v_2, v_3, v_4\} \in F$ of a cubulated surface S, an orientation of f is an ordering of the vertices of f (i.e. clockwise or counterclockwise). This ordering depends only on the relative positions of the vertices in the ordering, not on the specific order in which they are listed; that is, the orderings $(v_1, v_2, v_3, v_4)$, $( v_2, v_3, v_4, v_1)$, $( v_3, v_4, v_1, v_2)$, $( v_4, v_1, v_2, v_3)$ are all equivalent and can be denoted $[v_1, v_2, v_3, v_4]$. Similarly, an orientation of an edge $e =\{v_1, v_2\}$ of S is an ordering of the two vertices of $e$. For each edge, there are two possible orientations $[v_1, v_2]$ and $[v_2, v_1]$.\\
251
252
\begin{remark*}
253
The orientation of $S = (V, E, F)$ is a choice of orientation for each face $f \in F$ such that whenever 2 faces share an edge, the two faces f and f' induce opposite orientations.
254
\end{remark*}
255
256
%%automorphisms
257
\end{definition}
258
All of surfaces described throughout this paper are be assumed to be orientable.
259
\begin{definition}\emph{(Position)}
260
Given a cube $\C = (V', E', F')$ and a cubulated surface $S = (V, E, F)$, we define a position
261
\[p = \{(v_i', v_1), (v_{i+1}', v_2), (v_{i+2}', v_3), (v_{i+3}', v_4)\}. \]
262
as a map from some face $f’$ of $\C$ to some face $f$ of $S$ that preserves the structure as cyclic graphs.
263
The set of all possible positions given a pair of surfaces $\C,S$ is then $P(\C, S)$.
264
\end{definition}
265
\begin{definition}
266
\emph{(Face Projections)} There exists natural face projections $\phi': P(S',S) \xrightarrow[]{}F$ and $\phi: P(S',S) \xrightarrow[]{}F'$ which map a position to the face of $S$ or $S'$ (respectively) which positively aligns with the other surface.
267
268
\end{definition}
269
\begin{definition}
270
\emph{(Connected by single roll)}
271
Consider the position
272
\[p = \{(v'_1, v_1), (v'_2, v_2), (v'_3, v_3), (v'_4, v_4)\}\]
273
assuming $\{v_1, v_2\}$, $\{v'_1, v'_2\}$ are internal edges of $S, S'$ (respectively). In other words, there exist faces $f =\{v_1, v_2, v_5, v_6\} \in F$, $f' =\{v'_1, v'_2, v'_5, v'_6\} \in F'$ such that the position
274
\[\tilde{p} = \{(v_1', v_1), (v_2', v_2), (v_5', v_5), (v_6', v_6)\} \]
275
is said to be connected to p by a single roll.
276
\end{definition}
277
The choice of $\tilde{p}$ is determined by $p$ and the internal edge $e = \{v_1, v_2\}.$
278
279
280
\begin{thm}
281
Let S = (V,E,F) be a connected, maximally symmetric triangulated surface without boundary, S'= (V',E',F') a connected symmetric surface, and $f' \in F$ a face of S'. Then each $p \in P(S',S)_{f'}$ gives a unique holonomy homomorphism $h_p: L_ f'(S') \xrightarrow[]{} \emph{Aut}(S)$. Moreover, $h_{\beta(p)} = \beta \circ h_p \circ \beta^{-1}$ for all $\beta \in \emph{Aut}(S)$.
282
283
\end{thm}
284
\begin{proof}
285
The inductive proof follows similarly to that of prior work. \cite{Duke}
286
\end{proof}
287
We now describe the structure of the combinatorial holonomy group and its usefulness in computation of holonomy.
288
289
\begin{definition}
290
291
\emph{(Combinatorial Holonomy Group)}
292
For a maximally symmetric surface $S$ without boundary and another symmetric surface $S'$ without boundary, then let $p \in P(S',S)_f'$ be a position of $S'$ over $S$ based face $f$ of $S$. We define the holonomy group of $S'$ over $S$ based at $p$ as the image $\emph{Hol}_p(S', S) := h_p(L_f(S)) \subset \emph{Aut}(S')$. \
293
\end{definition}
294
\begin{definition}
295
\emph{(Restricted Holonomy Group)}
296
Then the restricted holonomy group is the image $\emph{Hol}_{p0}(S,S'):=h_p(L_f(S)) \unlhd \emph{Hol}_p(S',S).$
297
\end{definition}
298
The initial position $p$ will often be suppressed in the notation.
299
\begin{thm} \label{shortexact}
300
As $\emph{Hol}_0(S',S) \unlhd \emph{Hol}(S',S)$, then for the quotient $Q = \emph{Hol}(S'S)/ \emph{Hol}_0(S',S)$, there exists a unique surjective homorphism $\psi: \pi_1(S') \xrightarrow[]{} Q$.
301
\end{thm}
302
303
\begin{center}
304
\begin{tikzcd}
305
0 \ar[r] & C(S') \ar[r,hook,"i_1"]\ar[d,two heads,"h\mid_{C(S')}"] & L(S') \ar[d,two heads,"h"] \ar[r,two heads,"q_1"] & \pi_1(S') \ar[d,two heads,dashed,"\psi"] \ar[r] & 0 \\
306
0 \ar[r] & \mathrm{Hol}_0(S,S') \ar[r,hook,"i_2"] & \mathrm{Hol}(S,S') \ar[r,two heads,"q_2"] & Q \ar[r] & 0
307
\end{tikzcd}
308
\begin{proof}
309
We see in the diagram above that the top and bottom rows are short exact sequences with $i_1, i_2$ as inclusion homomorphisms and $q_1, q_2$ as quotient homomoprhisms. The remainder of this proof is detailed in the prior work. \cite{Duke}
310
\end{proof}
311
\end{center}
312
313
\begin{thm}
314
Let S be a connected, maximally symmetric surface without boundary, and S' a connected, symmetric surface. If both S and S' are orientable, then \emph{Hol}(S,S') contains only orientation-preserving automorphisms of S.
315
\end{thm}
316
\begin{proof}
317
This proof is detailed in the prior work. \cite{Duke}
318
\end{proof}
319
320
\subsection{Computing Holonomy}
321
After computing the restricted holonomy $\text{Hol}_0(S',S)$ generated by the set of all lassos, we can pick a representative loop $\gamma$ from each holonomy class $[\gamma] \in \pi_1(S)$ and compute the coset $h(\gamma)\text{Hol}_0(S',S)$ such that we have decomposed the holonomy group into the restricted holonomy group $\text{Hol}_0(S',S)$ and the cosets as created by nontrivial homotopy classes of the fundamental group. We can then study holonomy by the restricted holonomy and "fundamental group holonomy".
322
323
\section{The Cube on Cubulated Surfaces}
324
We are now prepared to direct our focus to computing holonomy of the cube on cubulated surfaces, beginning with a description of effective methods of computation.
325
326
\begin{thm}
327
As we assume S to be maximally symmetric, every vertex v
328
of S has the same order. Now suppose every vertex $v$ of $S$ has degree n and let $l$ be a lasso on $S$ around a vertex $v$.
329
Then $|h(l)| = n/gcd(n, \delta (v'))$.
330
\end{thm}
331
\begin{proof}
332
This proof is detailed in the prior work. \cite{Duke}
333
\end{proof}
334
The above result of the prior work effectively speeds up the process of computing holonomy, as does the new approach we developed as detailed below.
335
\begin{definition} \emph{(Face-Adjacent Group)}
336
We define a face-adjacent group $F'(S')$ of a symmetric surface $S'$ as the set of adjacent faces $f' \in F'$ of $S'$ with face projection $\phi: P(S',S) \xrightarrow[]{}F$ such that $p = \{f'_p, f_p\}$ with $\phi'(p) = f'_p \in F'$ and $\phi(p) = f_p \in F$. The action of rolling $S'$ on $S$ then induces a chain of adjacent $S'$-faces $f'_{p1}, f'_{p2}, . . . f'_{p\delta} \in F'$ of the polyhedra $S'$ rolled on the surface $S$ with which we can "trace" the face positions $f_p \in F(S')$ on $S$ in order to realize the symmetry induced.
337
338
\end{definition}
339
340
341
\begin{lemma}\label{lm1} There is a canonical isomorphism $F' \xrightarrow[]{} \Z/n'\Z$ such that rolling $S'$ around a vertex $v$ on $S$ acts as an equivalence class $[n]$.
342
\end{lemma}
343
\begin{proof}
344
345
346
Let the holonomy of $S'$ on $S$ be a subgroup $F' \xrightarrow []{} \mathbb{Z}/n'\mathbb{Z}$ for $n' = |v'|$ be a canonical isomorphism sending a face $f'_p\in F'(S')$ to the position of another adjacent face $f_{
347
} \in F'$ such that a $\mathbb{Z}/n'\mathbb{Z}$ symmetry is induced. Starting with initial position $p$ matching $v'$ to $v$, then $\mathbb{Z}$ as generated by lassos acts on $S'$ such that $f'_{p1}, f'_{p2}, . . . f'_{p\delta} \in F'$ of $S'$ is a chain of relevant adjacent faces rolled on $S$ in a preferred clockwise lasso $c$ once around $v$ and across $n'$ edges as the preferred positive generator of isometry-preserving rotational symmetries.
348
349
Then we have a single lasso around a fixed interior vertex $v$ on $S$ such that $f_1 = f_n$ in $S$ and $f'_{p1}$ is sent to $f'_{p\delta}$ in $F'(S')$ for a $\Z/n'\Z$ symmetry of equivalence class $[n']$.
350
351
\end{proof}
352
\begin{remark*}
353
For every lasso $c$, we roll across $n'$ edges to return to the identity element and only for $n' \mid n$ where $n' = |v'|$ and $n = |v|$ does a trivial holonomy exist by loops on $S$.
354
Note that if $n' \nmid n$ only nontrivial holonomy exists for $\Z$ acting on $F'(S')$.
355
\end{remark*}
356
Combinatorial holonomy, while previously studied via the lens of the tetrahedron, has potential to be generalized to the cube and further polyhedra. Let us consider the case then of rolling any polyhedra on itself.
357
\begin{thm}
358
Any polyhedra rolled in a lasso on itself always results in trivial restricted holonomy.
359
\end{thm}
360
361
\begin{proof}
362
For any polyhedra $S'$ rolled on itself $S$ around any vertex $v$ of $S$, note $n' = n$ and hence $n'|n$ with $v'$ fixed to $v$ such that a single lasso $c$ in the preferred clockwise direction always rolls around $n'$ edges sending $f'_{p1} \in F'(S')$ back to $f'_{p1}\in F'(S')$ by the isomorphism of \ref{lm1} such that the full holonomy induced by lassos $c$ is trivial. By \ref{shortexact}, note that the fundamental group of the surface is trivial, so this completes the proof.
363
\end{proof}
364
\begin{remark*}
365
This fact is clearly true for the cube $\C$ rolled on itself $S$, where $S$ is also a cubulated surface.
366
\end{remark*}
367
368
\begin{thm}\label{A_4}
369
The holonomy group of the cube $\C$ on the infinite square grid $S$ is isomorphic to $A_4$.
370
\end{thm}
371
372
373
\begin{figure}
374
\centering
375
\begin{tikzpicture} [cyan]
376
\draw (-.25,2.25)node{\color{gray}$v_1$} (0,0) -- (2,0) -- (2,2.5) (2.25,2.25)node{\color{gray}$v_2$};
377
\draw (-.25,-.25)node{\color{gray}$v_3$}(0,0) -- (2,0) -- (2,-.5) (2.25,-.25)node{\color{gray}$v_4$};
378
\draw (-.5,0) -- (2.5,0);
379
%%%
380
\draw (2.5,2) -- (-.5,2);
381
\draw (2.5,2) -- (0,2) -- (0,-.5);
382
\draw (2.5,2) -- (0,2) -- (0,2.5);
383
\end{tikzpicture}
384
\caption{Infinite grid}
385
\label{lassos}
386
\end{figure}
387
\begin{figure}
388
389
\centering
390
\begin{tabular}{ | m{1.5cm} | m{3cm}| m{3cm} | }
391
\hline
392
Fixed $v$& Cycles for $h(c)$& Cycles for $h(c^{-1})$\\
393
\hline
394
\hline
395
$v_1$ & (2,3,4)(1)&(2,4,3)(1) \\
396
\hline
397
$v_2$ & (3,4,1)(2)&(3,1,4)(2) \\
398
\hline
399
$v_3$ & (4,1,2)(3)&(4,2,1)(3) \\
400
\hline
401
$v_4$ & (1,2,3)(4)&(1,3,2)(4) \\
402
\hline
403
\end{tabular}
404
405
\caption{Lassos on a cubulated surface $S$}
406
\label{lasstab}
407
\end{figure}
408
409
410
\begin{figure}
411
\centering
412
\begin{tabular}{ | m{6cm} | m{8cm}| m{3cm} | }
413
\hline
414
Cycles for $h(l)$ & Lasso Concatenation\\
415
\hline
416
\hline
417
(1,2)(3,4), (1,3)(2,4), (1,4)(2,3) & $h(c)* h(c'),h(c^{-1})*h(c'^{-1})$ \\
418
\hline
419
$e = (1)(2)(3)(4) $& $h(c)*h(c')*h(c'')$, $h(c^{-1})*h(c'^{-1})*h(c''^{-1})$\\
420
421
\hline
422
\end{tabular}
423
\caption{Loops on a cubulated surface $S$}
424
\label{looptab}
425
\end{figure}
426
\begin{proof}
427
Recall that any plane in $\mathbb{R}^2$ has a trivial fundamental group with a single homotopy class. Then the class of nullhomotopic loops on the \hyperref[lassos]{infinite square grid} $S$ generated by lassos $c$ consists of all loops on the surface, with all loops having a possible decomposition as lassos. Let the holonomy induced by a lasso $c$ around a fixed vertex $v$ of the cube $\C$ on the infinite grid $S$ be $h(c)$ and that of the inverse lasso path be $h(c^{-1})$.
428
Observe then that the holonomy induced by lassos on $S$ yield 3-cycles by \ref{lm1} all of which are contained in $A_4$. Additionally, Table \ref{lasstab} shows that all 3-cycles are actually achieved.
429
As any $A_n$ is generated by 3-cycles and $A_4$ is contained in $S_4$ as the group of even permutations, then it is evident that the holonomy of the cube on the infinite square grid is closed under and isomorphic to $A_4$ such that the holonomy $\text{Hol}(\C,S) \leq A_4$ for the cube $\C$ on any infinitely gridded surface $S'$. Please see tables \ref{lasstab} and \ref{looptab} for all elements of $A_4$ as generated by lassos on $S$.
430
\end{proof}
431
\begin{remark*}
432
Assume $h(c)$ and $h(c^{-1})$ are lasso paths of minimum length such that they each go around 1 vertex and cover 4 faces. For any nontrivial $h(l)$ of minimum length, note that its two distinct consecutive lassos $c$ and $c'$ must be adjacent to one another, share the same directional path, and loop initial/ending faces such that $l(f_1) = c(f_1)=c(f_n) = c'(f_1) = c'(f_n) = l(f_n)$. \\
433
434
This observation of the shortest possible loop on the infinite grid $S$ is useful in considering the below theorem on the smallest grid needed to realize $A_4\leq \text{Hol} (\C,S)$.
435
\end{remark*}
436
437
438
439
440
\begin{thm} \label{6}
441
A cubulated surface $S$ has $ A_4\leq \text{Hol}(\C,S)$ if it contains at least a $2 \times 3$ gridded subsurface.
442
\end{thm}
443
\begin{proof}
444
The proof follows similarly to that of \ref{A_4}.
445
\end{proof}
446
\begin{prop}
447
The restricted holonomy $\text{Hol}_0(\C,S) \leq A_4$ for the cube $\C$ on any cubulated surface $S$.
448
\end{prop}
449
\begin{proof}
450
The proof follows similarly to that of \ref{A_4}.
451
\end{proof}
452
As the above examples attempt to illustrate, it is relatively easy to find $ A_4\leq \text{Hol}(\C,S)$. As $A_4$ is a maximal normal subgroup of $S_4$, our challenge then is to find subgroups outside of $A_4$ yet within $S_4$. We now turn our attention to annuli in our attempt to realize parameters of surfaces for the holonomy subgroups of interest.
453
454
455
\section{Holonomy on Annuli}
456
\begin{definition}
457
\emph{(Annular Strip).} Let a cubulated annular strip $A$ be an $m \times 1$ annulus where $ |m| = |f| \in F$ for a surface $A = (V,E,F)$ be cut such that the cut ends are now identified with each other without boundary. Then we have a connected surface $S$ for which we can only roll in two possible directions (i.e. clockwise or counterclockwise) to form loops under backtracking equivalence.
458
\end{definition}
459
\begin{prop}
460
For the cube $\C$ rolled on any $m \times 1$ annular strip $A$; there is a
461
trivial, disjoint 2-cycle, or 4-cycle holonomy isomorphic to $A$.
462
\end{prop}
463
\begin{proof}
464
Let $\C$ be a cube on an annular strip $A$ of length $m$ and let $f_1'$ denote the face of $\C$ initially touching the surface of $A$. A single roll on this surface fixes two faces and yields a symmetry about the corresponding four-fold axis of symmetry (this subgroup is generated by a 4-cycle, which we can choose to be a single turn in the direction of rolling). As every fourth roll results in $f_1'$ touching the surface, the symmetry that results after one loop will be this 4-cycle to the power of $m$ (mod 4). For $m \in$ [0] we get the identity and $m \in$ [2] a pair of disjoint 2-cycles. If $m \in$ [1] or [3], we get at 4-cycle . The holonomy of $\C$ on an annular strip $A$ can be summarized as in figure \ref{sannuli}.
465
466
%%%TBD
467
\end{proof}
468
\begin{definition}
469
\emph{(L-shaped annular strip).} Let a cubulated L-shaped annular strip be a surface $A$ with a width of $n$ faces and a height of $m$ faces with the extreme faces identified (as shown in figure \ref{lannulus}).
470
\begin{figure}
471
\centering
472
\includegraphics[scale = .5]{Combinatorial Hol. Draft/Figures/lannuli1.png }
473
\caption{L-shaped annulus on the left, alongside an annulus with equivalent holonomy.}
474
\label{lannulus}
475
\end{figure}
476
477
\end{definition}
478
\begin{thm}\label{lannuli_proof}
479
The symmetry resulting from rolling a cube on an L-shaped annulus is even if the parity of $m$ and $n-1$ match.
480
\end{thm}
481
\begin{proof}
482
Consider an L-shaped annulus $A$ with a width $n$ and height $m$. The clockwise loop realized on this surface consists first of $n-1$ rolls to the left, then $m$ rolls upward. The holonomy of our surface $A$ is equivalent to that of two perpendicular annuli, as shown in figure \ref{lannulus}, so we find the resultant permutation (or symmetry) of a loop on the (horizontal) annular strip of length $n-1$ and the same for the (vertical) annular strip of length $m$. Traveling along the horizontal annular strip yields the same permutation as the one you get after one loop along $n-1$ (mod 4). The same applies for traveling on the vertical annular strip, for an annulus of length $m$ (mod 4). Composing these permutations provides the parity of the permutation on the L-shaped annulus. Since an even permutation results only from the composition of two even permutations or two odd permutations, the parity of $n-1$ and $m$ must match in order to produce an even permutation for the L-shaped annulus.
483
\end{proof}
484
485
\begin{figure}
486
\centering
487
\begin{tabular}{ | m{8cm} | m{6cm}| m{3cm} | }
488
\hline
489
Number of rows (mod 4) & Holonomy\\
490
\hline
491
\hline
492
0 & Trivial \\
493
\hline
494
1 or 3 & $\mathbb{Z}$/4$\mathbb{Z}$\\
495
\hline
496
2 & $\mathbb{Z}$/2$\mathbb{Z}$\\
497
\hline
498
\end{tabular}
499
\caption{Summary of holonomy groups for families of straight annuli}
500
\label{sannuli}
501
\end{figure}
502
503
\section{Holonomy on Tori} \label{tori sect}
504
%%%
505
Motivated to study the torus like our previous counterparts, we sought to explore if given a certain $m \times n$ torus with turning number, we could predict a certain holonomy.
506
Beyond computing holonomy groups for particular surfaces, we also generalize the holonomy for families of cubulated $T^2$ tori as will follow.\\
507
508
\subsection{Parity of the $m \times n$ Torus}
509
We begin with the example of the $3 \times 3$ cubulated torus.
510
511
\begin{prop}
512
The holonomy of the cube $\C$ on the 3 x 3 cubulated torus $T$ is isomorphic to $S_4$.
513
\end{prop}
514
\begin{proof}
515
Deconstructing or "ungluing/unfolding" our torus under homotopy, we have a 3 x 3 cubulated square plane with opposite pairs of edges identified with each other. Referencing \ref{6} which proves the minimum grid needed to realize the restricted holonomy, then the holonomy of our cubulated torus with 9 faces has $\text{Hol}_0(S',S) \leq A_4$. As a straight-pathed loop around the torus results in $\Z /4\Z$ holonomy outside of $A_4$, we know by \ref{A_4} that the holonomy of the cube $S'$ on our $3 \times 3$ torus $T$ must be isomorphic to $S_4$.
516
\end{proof}
517
\begin{remark*}
518
We have an $m \times n$ cubulated torus isomorphic to $S_4$ where $m$ and $n$ are both odd.
519
520
\end{remark*}
521
We will soon understand the general reasoning behind this, as detailed in \ref{even_torus}.\\
522
523
For any cubulated torus $T$, we denote the \emph{longitudes} (traveling along columns) as vertical chains of adjacent cube faces along $T$ and \emph{meridians} (traveling along rows) as chains of horizontal adjacent cube faces perpendicular to any longitude on $T$. To illustrate that we can use longitudes and meridians in describing any $m \times n$ cubulated tori $T$, note then that we would have 5 longitudes and 4 meridians for the $5 \times 4$ torus $T$ (for example).
524
525
A quick computation using representative loops from these homotopy classes allows us to generalize beyond the holonomy of this initial example.
526
527
528
529
530
\begin{figure}
531
\centering
532
\includegraphics[scale = .5]{Combinatorial Hol. Draft/Figures/torus with lannulus.png}
533
\caption{Flat torus with turning number $\lambda$ = 1. The loop depicted is a longitude.}
534
\label{fig:}
535
\end{figure}
536
\begin{thm}\label{even_torus}
537
Let $T$ be a cubulated $m \times n$ torus with at least a $2 \times 3$ subsurface. Then $T$ has holonomy isomorphic to $A_4$ if and only if \emph{m} and \emph{n} are of even parity and holonomy isomorphic to $S_4$ if either $m$ or $n$ are odd.
538
\end{thm}
539
\begin{proof}
540
First, assume \emph{m} and \emph{n} are even. As we know by \ref{6} that the restricted holonomy is at least $A_4$, we now pick a representative loop from the homotopy classes of the longitude as one of the generators of the fundamental group in computing full holonomy. (The argument for the classes of the meridian is analogous, so we only consider longitude henceforth.) We roll in a straight line along the column until it reaches the initial face such that the representative loop is equivalent to following an annular strip of length \emph{n}. As \emph{n} is even, the resulting symmetry is either a pair of disjoint 2-cycles or the identity and is (clearly) contained within $A_4$. As a generator for the fundamental group, this representative implies that all other homotopy classes will be also be contained within $A_4$.
541
If the cube takes loops going perpendicular to the rows (to compute the other homotopy classes), this reasoning holds as well since the number of rows is also even.
542
543
Now assume $T$ has holonomy isomorphic to $A_4$. Assume also (toward a contradiction) that either \emph{m} or \emph{n} is odd. Then take a loop equivalent to an annular strip perpendicular to the rows (if \emph{n} is odd) or along the row (if \emph{m} is odd). Since this path is odd, the resulting symmetry is a 4-cycle, which means the torus has $S_4$ holonomy, a contradiction. This also shows that if \emph{m} or \emph{n} is odd, then $T$ has $S_4$ holonomy.
544
\end{proof}
545
546
547
548
\subsection{Parity and Turning Numbers}
549
550
551
We discovered that the parity of both the number of rows and the length of the rows determines the holonomy for any torus. Then it was natural to explore the effect of a turning number on holonomy. In this way, we developed predictions for holonomy on $m \times n$ cubulated tori.
552
553
We prove that the parity of turning number, along with the parity of the row and row-length, provides a general theory for the holonomy of cubulated tori.
554
555
\begin{definition}
556
\emph{(Turning Number)} Let the turning number of an $m \times n$ surface $S$ be a shift in the identification of the sides of the torus. The turning number $\mu$ denotes how many times the edges on the right side of the torus are shifted downward, while $\lambda$ denotes how many times the edges on the bottom of the torus are shifted to the right. Additionally, $\mu$ and $\lambda$ are non-negative integers.
557
\end{definition}
558
\begin{figure}
559
\centering
560
\includegraphics[scale = .5]{Combinatorial Hol. Draft/Figures/torus with lannulus.png }
561
\caption{Flat torus with turning number $\lambda$ = 1, alongside the L-shaped annulus corresponding with the generating loop of the fundamental group shown.}
562
\label{torus_with_lannulus}
563
\end{figure}
564
\begin{thm}
565
Let $T$ be an $ m \times n$ cubulated torus with turning numbers $\mu$ and $\lambda$. Then $T$ has $A_4$ holonomy if the number of rows is of the same parity as $\lambda$ and the number of columns is of the same parity as $\mu$.
566
\end{thm}
567
\begin{proof}
568
As was the case in the proof for Theorem \ref{even_torus}, we know the restricted holonomy is $A_4$, so we must find the permutation resulting from traveling on loops which generate the fundamental group of $T$. We choose one such generator to be the loop $l_1$ which begins at face $f_1$ $\in T$, rolls to the left $\lambda$ times (to counteract the turning effect), and then rolls upward $m$ times. The permutation $\pi$ resulting from this loop is equivalent to that resulting from an L-shaped annulus with height $m$ and width $\lambda + 1$. According to the proof of Theorem \ref{lannuli_proof}, $\pi$ is even if the parity of $m$ and $(\lambda + 1) - 1 = \lambda$ match. Thus, if the parity of $m$ and $\lambda$ match, then the permutation resulting from $l$ is even. The same reasoning holds for the generator of the fundamental group traveling along the meridians - the chosen loop $l_2$ travels downward $\mu$ times and then to the right $n$ times (this is the other generator of the fundamental group). As the parity of $\mu$ and $n$ match, the permutation resulting from $l_2$ is also even. As both $l_1$ and $l_2$ result in even permutations, the holonomy of the cube on $T$ is $A_4$.
569
\end{proof}
570
571
572
573
574
575
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%ENDofResearch4Report
576
577
578
579
580
%% TIP: Only entries which you actually cite with \cite somewhere else in the .tex will appear.
581
\bibliographystyle{amsalpha}
582
\bibliography{bibliography} % the file "bibliography.bib" will be needed
583
\clearpage
584
\textbf{Note:} This appendix was written by Dr. Seppo Niemi-Colvin as a previous contribution to the research conducted at Duke University, but is included here as it has not been published elsewhere. As the Seifert-Van-Kampen theorem is often used to describe the fundamental group of a space $X$ via two open path-connected subspaces which cover $X$, here we apply the theorem to describe the structure of our combinatorial fundamental group. Hence this proves the compatibility of the traditional and combinatorial formulations of the fundamental group.
585
\section{Appendix}\label{app}
586
587
588
Let \(S=(V,F)\) be a combinatorial surface without boundary with vertices \(V\) and faces \(F\).
589
We will now describe the dual surface to \(S\) which we will represent as \(\tilde{S}= (\tilde{V},\tilde{F})\). While it is not necessarily a triangulated surface it can be described as a polygonal surface, whereby each face is a polygon.
590
The vertices of \(\tilde{S}\) are made up of the faces of \(S\), so \(\tilde{V} = F\).
591
Two vertices in \(\tilde{V}\) are connected by an edge, if those faces shared an edge in \(S\).
592
The faces in \(\tilde{S}\) correspond to the vertices in \(S\), and thus each face will have the number of sides equal to the degree of the corresponding veretex in \(S\).
593
594
\subsection{Realizing the dual surface as a triangulation}
595
596
While \(\tilde{S}\) is not a priori a triangulated surface (and the decomposition above will be most useful for our work), it can be naturally triangulated in a way which illustrates that it's geometric realization \(|\tilde{S}|\) is homeomorphic to \(|S|\).
597
This triangulation will give the barrycentric subdivision \(\sd S\) for \(S\) which we will discuss now before associating each face of \(\tilde{S}\) with a collection of faces in \(\sd S\).
598
This is not necessary to understand the fundamental group calculation beyond confirming that \(\pi_1 (|\tilde{S}|,\ast) \cong \pi_1(|S|)\).
599
600
The vertices \(\sd V\) of \(\sd S\) correspond to \(V\cup E\cup F\) where \(E\) is the set of edges in \(S\).
601
One can think of the vertex coming from an edge as representing the midpoint of that edge, and the vertex coming from a face to represent the center of that face.
602
We call the new vertices associated to edges and faces, their barrycenters.
603
The faces \(\sd F\) of \(\sd S\) are chains \(v\subset e \subset f\) where \(v\in E,e\in E,f\in F\).
604
Taking the barrycentric subdivision does not change the homeomorphism type of \(|S|\).
605
606
For each face of \(\tilde{S}\) we have a corresponding vertex \(u\) in \(S\), which is also a vertex in \(\sd S\).
607
One can then take the star \(\st u\) in \(\sd S\), which is the union of all the faces (and edges) of \(\sd S\), which contain \(u\).
608
We will consider the star closed and thus it contains any edges and vertices that are in faces of \(\st u\) even if those edges and vertices do not contain \(u\) themselves.
609
610
611
For an edge \(e\) of \(\tilde{S}\) is determined by an edge \(e'\) of \(S\) connecting two faces \(f_1\) and \(f_2\), which share two vertices \(v_1\) and \(v_2\) in \(S\).
612
We can then associate to \(e\) the intersection of \(\st v_1\) and \(\st v_2\).
613
This is an edge from the barryenter of \(f_1\) to the barrycenter of \(e'\) to the barrycenter of \(f_2\).
614
615
Finally we can associate to a vertex \(v \in \tilde{S}\) a face \(f\) in \(S\) and thus three vertices \(v_1,v_2,v_3\) in \(S\), and in \(\sd S\) this becomes \(\st v_1 \cap \st v_2 \cap \st v_3\), which will be just the barrycenter of \(f\).
616
617
\subsection{The graph of the dual surface}
618
619
Before we compute the fundamental group of the entire surface, let us compute the fundamental group of the graph of \(\tilde{S}\), by which I mean the union of the vertices and edges of \(\tilde{S}\) but no faces attached.
620
I will denote the graph as \(K_1\).
621
622
\begin{thm}\label{backtrackloop}
623
The group \(\pi_1(|K_1|,v_0)\) is isomorphic to the group \(L\) given by considering combinatorial loops in \(K_1\) up to adding and subtracting backtracking.
624
\end{thm}
625
\begin{proof}
626
The elements of \(L\) are lists of vertices of \(\tilde{S}\) (and thus faces of \(S\))
627
\[v_0,v_1,v_2,\ldots, v_{n-1},v_n=v_0,\]
628
where consecutive vertices must be related by an edge in \(|K_1|\)
629
Multiplication is given by concatenation where the duplicate vertex is given by concatenation with the doubled vertex \(v_0\) in the middle reduced to a singleton.
630
Concatination is naturally associative and the identity is given by the singleton \(v_0\)..
631
Equivalence under backtracking means that given a configuration \(\ldots, v_{i-1}, v_i,v_{i+1},v_{i},v_{i+2},\ldots\) we can replace it with a configuration \(\ldots, v_{i-1},v_{i},v_{i+2},\ldots\) and vice versa.
632
Under this equivalence, the inverse of a loop \(v_0,v_1,\ldots, v_{n-1},v_n,v_0\) is \(v_0,v_n,v_{n-1},\ldots, v_1,v_0\).
633
Let \(\varphi:L\to \pi_1(|K_1|,v_0)\) take a combinatorial loop \(v_0,v_1,\ldots, v_n=v_0\) to the class \([\gamma_l]\) where \(\gamma_l:[0,1]\to |K_1|\) is defined to be \([\frac{i-1}{n},\frac{i}{n}]\) to the edge connecting \(v_{i-1}\) and \(v_i\).
634
Note that the backtracking equivalence can be given by a homotopy so this map is well defined.
635
636
Meanwhile given some loop \(\gamma\) based at \(v_0\), homotopy can cut out partial excursions onto edges and reparamaterize the rest to achieve a path \(\gamma'\) of the form above.
637
638
\begin{figure}
639
\centering
640
\includegraphics[width=.6\textwidth]{Combinatorial Hol. Draft/Figures/trivalentGraph.png}
641
\caption{The start of the infinite trivalent graph. These branches continue indifinitely and once branched no two vertices get identified. It is a covering space for every connected trivalent graph}
642
\label{fig:trivalent}
643
\end{figure}
644
645
Now assume that there is some loop \(l\) such that \(\varphi(l)=e\), and suppose that we can write \(l\) as \(v_0,v_1,\ldots, v_n=v_0\).
646
The universal covering space of \(|K_1|\) will be an infinite trivalent tree \(T\) (see Figure \ref{fig:trivalent}), and \(\gamma_l\) lifts to a loop in \(T\) based at a particular lift \(v_0'\) of \(v_0\).
647
However, note that \(T\) is contractible via a contraction that, providing a metric on \(T\), has every points distance to the base point decreasing.
648
This provides a specific homotopy of \(\gamma_l\) that can be acheived via repeated uses of backtracking.. %revisit (what does the infinite trivalent tree look like)
649
\end{proof}
650
651
Note that a rooted trivalent tree \((T,v_0)\) can be thought of as three rooted binary trees, whose roots are all connected to the base root \(v_0\).
652
This coincides with our discussion that once we decide an initial direction to move, a path is subsequently determined by a series of choices of left and right.
653
This provides a proof that our intuition about rolling up to backtracking coincides with the fundamental group.
654
We will now compute the fundamental group of \(|K_1|\).
655
The
656
657
\begin{thm}
658
Let \(n:= |\tilde{E}|-|\tilde{V}|+1 \), where \(\tilde{V}\) and \(\tilde{E}\) are resectively the set of verties and edges for \(\tilde{S}\).
659
Then, \(\pi_1(|K_1|,v_0)\cong \ast_n\Z\)
660
\end{thm}
661
\begin{proof}
662
Let \(T\) (not the same as in the proof of \ref{backtrackloop}) be a spanning tree for $K_0$, i.e. a subgraph that contains all the vertices and no cycles.
663
Note that the number of edges in \(T\) must be \(|V|-1\).
664
As such the number of edges not in \(T\) is \(n\), and denote the set of such edges as \(E'\).
665
The rest of the proof follows similarly to example 1.22 in Hatcher.
666
\end{proof}
667
668
\subsection{The fundamental group of the dual surface}
669
670
We now show that the subgroup generated by lassos in \(L\) is the subgroup of contractible loops, i.e. the kernel of the map \(L\to \pi_1(|\tilde{S}|,v_0)\).
671
672
\begin{definition}
673
A \emph{lasso} \(l\) is a loop in \(L\) that consists of a path \(\gamma\) from \(v_0\) to a particular vertex \(v\in \tilde{V}\), then doing a loop \(\lambda\) around one of the faces \(f\) incident to \(v\), before returning along \(\gamma^{-1}\) to \(v_0\).
674
We will write this as \(\gamma^{-1}\cdot \lambda\cdot \gamma\).
675
Here \(\cdot\) is concatenation on paths written in the order of function composition.
676
The loop above is specifically \emph{a lasso around f}.
677
\end{definition}
678
679
The following two lemmas will be helpful in identifying the subgroup generated by lassos as the kernel of the map \(i: \pi_1(|K_1|,v_0)\to \pi_1(\tilde{S},v_0)\), since the Seifert-van Kampen theorem will present it to us in a particular way.
680
As an intermediate step we will need similar results about the subgroup generated by lassos around a particular face.
681
682
\begin{lemma}\label{normLoop}
683
Let \(l\) be a lasso around a face \(f\) and let \(N_l\) be the smallest normal subgroup of \(L\) containing \(l\).
684
Then \(N_l\) is generated by all the lassos going around \(f\).
685
Furthermore the smallest normal subgroup \(N\) containing all lassos is the subgroup generated by those lassos.
686
\end{lemma}
687
\begin{proof}
688
Let \(H_f\) be the subgroup generated by all of lassos going around \(f\).
689
First, we will show that \(H_f\) is normal and therefore \(N_l\subseteq H_l\).
690
First note that for an individual lasso \(h\) around \(f\), and an element \(g \in L\), we have that \(ghg^{-1}\) is a lasso around \(f\) since we can let \(\gamma'= \gamma \cdot g\) be the path from \(v_0\) to \(v\).
691
As such \(ghg^{-1}\in H_f\).
692
693
Now, given a general element \(h \in H_f\) we know that \(h = h_1\cdot h_2\cdots h_n\) where each \(h_i\) is a lasso around \(f\).
694
Given \(g \in L\) we have that
695
\begin{align*}
696
ghg^{-1} &= g\left(h_1\cdot h_2 \cdots h_n\right)g^{-1}\\
697
&=(gh_1g^{-1})\cdot(gh_2g^{-1})\cdots(gh_ng^{-1}) \in H_f,
698
\end{align*}
699
as needed to show that \(H_f\) is normal.
700
701
Now let \(h_1\) and \(h_2\) be loops around the face \(f\).
702
We will show that \(h_2\) is conjugate to \(h_1\) and thus is in
703
\(N_{h_1}\)
704
Then each \(h_i\) can be constructed using a path \(\gamma_i\) to some vertex \(v_i\) incident to \(f\) and a path \(\lambda_i\) traveling once around \(f\) starting and ending at \(v_i\). %what all the lambdas are
705
706
\begin{figure}
707
\centering
708
\includegraphics[width=.5\textwidth]{Combinatorial Hol. Draft/Figures/twolassos.png}
709
\caption{A figure representing some of the paths that occur in \ref{normLoop}.
710
Here orange is \(\gamma_1\) and purple is \(\gamma_2\).
711
The red can represent \(\lambda_1\) or \(\lambda_2\) depending on which vertex is considered the starting and ending point.
712
The blue represents \(\lambda'\).
713
}
714
\label{fig:my_label}
715
\end{figure}
716
717
Because we are ultimately trying to show that \(h_2 \in N_{h_1}\) can assume without loss of generality that both \(\lambda_i\) induce the same orientation on \(f\), and consider \(\lambda'\) to be the path connecting \(v_1\) to \(v_2\) in this direction. If these were oriented in opposite directions, we can show that \(h_2^{-1}\), which will induce the same orientation on \(f\) is conjugate to \(h_1\), which will force \(h_2^{-1} \in N_{h_1}\) and thus \(h_2 \in N_{h_1}\).
718
Note that \(\lambda_2= \lambda'\cdot \lambda_2\cdot \lambda'^{-1}\).
719
Let \(g := \gamma_2^{-1}\cdot \lambda' \cdot \gamma_1\).
720
Then,
721
\begin{align*}
722
gh_1g^{-1} =& (\gamma_2^{-1}\cdot \lambda' \cdot \gamma_1) \cdot (\gamma_1^{-1} \cdot\lambda_1 \cdot \gamma_1) \cdot (\gamma_1^{-1} \cdot \lambda'^{-1} \cdot \gamma_2) \\
723
&= \gamma_2^{-1}\cdot \lambda' \cdot \lambda_1\cdot \lambda'^{-1} \cdot \gamma_2 \\
724
&=\gamma_2^{-1} \cdot \lambda_2 \cdot \gamma_2 \\
725
&=h_2,
726
\end{align*}
727
as needed.
728
729
To show that \(N\) is generated by the lassos, we merely need to show that the subgroup \(H\) generated by all the lassos is normal.
730
The proof follows similarly to above in that the conjugate of a lasso is a lasso.
731
\end{proof}
732
733
734
735
\begin{thm}\label{continuousFund}
736
Let \(S\) represent a polyhedral surface and \(\tilde{S}\) it's dual with 1-skeleton \(K_1\).
737
Then, the kernel of the map induced by inclusion \(i:\pi_1(|K_1|,v_0) \to \pi_1(|\tilde{S}|,v_0)\) is the subgroup \(N\) generated by loops around the faces of \(\tilde{S}\), i.e. around the vertices of \(S\).
738
Furthermore this map is surjective.
739
\end{thm}
740
\begin{proof}
741
The proof will proceed in two parts.
742
For a given face \(f\in \tilde{S}\), we first show that \(\pi_1(|K_1| \cup f,v_0) \cong \pi_1(|K_1|,v_0)/N_f\) with the inclusion from \(|K_1|\) to \(|K_1|\cup f\) inducing the canonical projection.
743
To see this let \(U_1\) be \(|K_1|\) union the face \(f\) sans a single point on the interior, and let \(U_2\) be an open neighborhood of the new face \(f\) union a path \(\gamma\) from \(f\) to \(v_0\).
744
We can set it up so that \(U_1\) retracts onto \(|K_1|\), \(U_2\) retracts onto \(f\) with the path to \(v_0\) and
745
\(U_1\cap U_2\) tracts onto the image of the lasso around \(f\) defined using \(\gamma\).
746
As such, combining the Seifert-van Kampen theorem and Lemma \ref{normLoop} gets the desired result.
747
748
Now for the second part, for each face \(f \in \tilde{S}\) let \(U_f\) be a neighborhood of \(|K_1| \cup f\) in \(\tilde{S}\).
749
In particular, letting \(p_f\) be a point in face \(f\), we can set \(U_f = \tilde{S}- \cup_{f'\neq f}p_{f'}\).
750
In this way we have the \(U_f\) deformation retracts onto \(|K_1|\cup f\).
751
Furthermore for any collection of faces \(A\) containing more than one eleemnt, we have that \(\cap_{f\in A}U_f = \tilde{S} - \cup_{f\in \tilde{F}}p_f\) which deformation retracts onto \(|K_1|\).
752
So in particular double and tripple intersections are path connected.
753
754
This allows us to use the Seifert-van Kampen theorem to write \(\pi_1(\tilde{S},v_0)\) as the free amalgamation of the \(\pi_1(|K_1|\cup f,v_0)\) along \(\pi_1(|K_1|,v_0)\).
755
Note that the free amalgamation has the universal property of the pushout.
756
In particular, what this means is that given a group \(P\) and maps \(j_f:\pi_1(|K_1|\cup f,v_0)\to P\), where given any collection of homomorphisms \(\psi_f:\pi_1(|K_1|\cup f,v_0)\to G\) such that the diagram below commutes there exists a unique \(\psi:P \to G\) commuting as below, then there exists a canonical isomoprhism between \(P\) and \(\pi_1(\tilde{S},v_0)\).
757
Note that the diagram only contains the maps for two faces to prevent it from getting too crowded.
758
759
% https://q.uiver.app/?q=WzAsNyxbMCwyLCJcXHBpXzEofEtfMXwsdl8wKSJdLFsyLDIsIlAiXSxbMSwwLCJcXHBpXzEofEtfMXxcXGN1cCBmXzEsdl8wKSJdLFsyLDNdLFsxLDQsIlxccGlfMSh8S18xfFxcY3VwIGZfbix2XzApIl0sWzEsMiwiXFx2ZG90cyJdLFs1LDIsIkciXSxbMCwyLCJpX3tmXzF9Il0sWzAsNCwiaV97Zl9ufSIsMl0sWzIsMSwial97Zl8xfSIsMl0sWzQsMSwial97Zl9ufSJdLFsxLDYsIlxccHNpIiwwLHsic3R5bGUiOnsiYm9keSI6eyJuYW1lIjoiZGFzaGVkIn19fV0sWzIsNiwiXFxwc2lfe2ZfMX0iXSxbNCw2LCJcXHBzaV97Zl9ufSIsMl1d
760
\[\begin{tikzcd}
761
& {\pi_1(|K_1|\cup f_1,v_0)} \\
762
\\
763
{\pi_1(|K_1|,v_0)} & \vdots & P &&& G \\
764
&& {} \\
765
& {\pi_1(|K_1|\cup f_n,v_0)}
766
\arrow["{i_{f_1}}", from=3-1, to=1-2]
767
\arrow["{i_{f_n}}"', from=3-1, to=5-2]
768
\arrow["{j_{f_1}}"', from=1-2, to=3-3]
769
\arrow["{j_{f_n}}", from=5-2, to=3-3]
770
\arrow["\psi", dashed, from=3-3, to=3-6]
771
\arrow["{\psi_{f_1}}", from=1-2, to=3-6]
772
\arrow["{\psi_{f_n}}"', from=5-2, to=3-6]
773
\end{tikzcd}\]
774
775
Now let \(P:= \pi_1(|K_1|,v_0)/N\), which is possible because by \ref{normLoop}, \(N\) is normal.
776
Because \(N_f\trianglelefteq N\), there exists canonical projections \(j_f:\pi_1(|K_1|\cup f,v_0)\to \pi_1(|K_1|,v_0)/N\).
777
These commute with the inclusion maps from \(i_f:\pi_1(|K_1|,v_0) \to \pi_1(|K_1|\cup f,v_0)\), since those maps canonically identify \(\pi_1(|K_1|\cup f,v_0)\) with \(\pi_1(|K_1|,v_0)/N_f\).
778
Furthermore, assume we have some collection of maps \(\psi_f: \pi_1(|K_1|\cup f,v_0)\to G\) for some group \(G\) that commute as above.
779
780
The fact that the diagram commutes as above means that there is a single homomorphism \(\tilde{\psi}:\pi_1(|K_1|,v_0)\to G\) such that \(\psi_{f}\circ i_{f} =\tilde{\psi}\) for all faces \(\).
781
Furthermore, \(\tilde{\psi}\) must have \(N\) in its kernel.
782
We can see this because each \(\iota_{f}\) has \(N_f\) in its kernel thus forcing \(N_f\) to be in the kernel of \(\tilde{\psi}= \psi_{f}\circ \iota_{f}\)
783
Therefore, the smallest normal subgroup containing the \(N_f\), which is \(N\), must be in the kernel of \(\tilde{\psi}\).
784
785
As such, by the universal property of the quotient we have that \( \tilde{\psi} = \psi \circ j\) where \(j\) is the projection from \(\pi_1(|K_1|,v_0) \to P\) and a unique map \(\psi: P \to G\).
786
That this commutes with the rest of the diagram, comes down to \(j\) factoring as \(j_{f}\circ i_{f}\) for any face \(f\).
787
788
789
As such, we have shown that \(P\) satisfies the same universal property as \(\pi_1(\tilde{S},v_0)\) and thus they must be canonically isomorphic.
790
\end{proof}
791
792
From this theorem we get the following corollary.
793
794
\begin{corollary}
795
The combinatorial fundamental group given by \(L/N\) is isomorphic to \(\pi_1(\tilde{S},v_0)\cong \pi_1(S,v_0)\)
796
\end{corollary}
797
\begin{proof}
798
Combine Theorem \ref{backtrackloop} with Theorem \ref{continuousFund}.
799
The isomorphism in Theorem \ref{backtrackloop} between \(L\) and \(\pi_1(|K_1|,v_0)\) identifies combinatorial lassos with continuous lassos as needed.
800
The identification of \(\pi_1(\tilde{S},v_0)\) with \(\pi_1(S,v_0)\) comes from them representing homeormorphic spaces and in fact are equivalent after subdivision.
801
\end{proof}
802
803
I didn't end up needing this lemma but I'm keeping it here for your reference.
804
805
\begin{lemma}\label{smallestNorm}
806
Let \(G\) be a group. For a collection of subsets \(\{A_1,A_2,\ldots, A_n\}\subset G\), let \(N_i\) be the smallest normal subgroup of \(G\) containing \(A_i\) and let \(N\) be the smallest normal subgroup containing \(\cup_i A_i\).
807
Then \(N\) is the smallest normal subgroup containing all the \(N_i\).
808
\end{lemma}
809
\begin{proof}
810
Note that the smallest normal subgroup \(N_A\) containing a collection \(A\) is the intersection of all the normal subgroups containing \(A\).
811
The collection of normal subgroups containing \(A\) is the same as the collection of normal subgroups containing \(N_A\).
812
As such exchanging each \(A_i\) for \(N_i\) dose not change set of normal subgroups we are intersecting when we compute \(N\).
813
\end{proof}
814
815
816
\end{document}
817