Talk:Elementary invariants of Heegaard diagrams (Ex)
The Heegaard diagram naturally gives a handle structure on . The handlebody consists of the -handle and -handles, whose belt spheres are the curves. The handlebody consists of the -handle and -handles (this is a relative handle decomposition of ). The attaching spheres of the -handles are the curves.
We will give group presentations for and with generators corresponding to the curves (which are in correspondence with the -handles). We obtain a relation for each -handle (which are in correspondence with the curves). The curves describe the attaching maps of the -handles; thus we can compute and by investigating the intersections of the and curves, as each intersection marks a -handle attaching circle traveling geometrically once over a -handle.
Let indicate the algebraic intersection of with . Then .
Now pick a basepoint for each . Traveling once around starting at , say that intersects in order (with each entry indicating one intersection), with sign . Let . Then .
In particular, under these identifications of and with group presentations, we can write the Hurewicz map as the map
We will give group presentations for and with generators corresponding to the curves (which are in correspondence with the -handles). We obtain a relation for each -handle (which are in correspondence with the curves). The curves describe the attaching maps of the -handles; thus we can compute and by investigating the intersections of the and curves, as each intersection marks a -handle attaching circle traveling geometrically once over a -handle.
Let indicate the algebraic intersection of with . Then .
Now pick a basepoint for each . Traveling once around starting at , say that intersects in order (with each entry indicating one intersection), with sign . Let . Then .
In particular, under these identifications of and with group presentations, we can write the Hurewicz map as the map
We will give group presentations for and with generators corresponding to the curves (which are in correspondence with the -handles). We obtain a relation for each -handle (which are in correspondence with the curves). The curves describe the attaching maps of the -handles; thus we can compute and by investigating the intersections of the and curves, as each intersection marks a -handle attaching circle traveling geometrically once over a -handle.
Let indicate the algebraic intersection of with . Then .
Now pick a basepoint for each . Traveling once around starting at , say that intersects in order (with each entry indicating one intersection), with sign . Let . Then .
In particular, under these identifications of and with group presentations, we can write the Hurewicz map as the map
We will give group presentations for and with generators corresponding to the curves (which are in correspondence with the -handles). We obtain a relation for each -handle (which are in correspondence with the curves). The curves describe the attaching maps of the -handles; thus we can compute and by investigating the intersections of the and curves, as each intersection marks a -handle attaching circle traveling geometrically once over a -handle.
Let indicate the algebraic intersection of with . Then .
Now pick a basepoint for each . Traveling once around starting at , say that intersects in order (with each entry indicating one intersection), with sign . Let . Then .
In particular, under these identifications of and with group presentations, we can write the Hurewicz map as the map
We will give group presentations for and with generators corresponding to the curves (which are in correspondence with the -handles). We obtain a relation for each -handle (which are in correspondence with the curves). The curves describe the attaching maps of the -handles; thus we can compute and by investigating the intersections of the and curves, as each intersection marks a -handle attaching circle traveling geometrically once over a -handle.
Let indicate the algebraic intersection of with . Then .
Now pick a basepoint for each . Traveling once around starting at , say that intersects in order (with each entry indicating one intersection), with sign . Let . Then .
In particular, under these identifications of and with group presentations, we can write the Hurewicz map as the map