
\documentclass[12pt ]{article}
\setlength{\textwidth}{14 true cm} \setlength{\textheight}{20 true
cm}

\usepackage{hangul}
\usepackage{amscd,amsmath}
\usepackage{amsfonts}
\usepackage{amssymb,theorem}
\usepackage{longtable}
\usepackage{floatflt}
\usepackage{texdraw, epic, pstcol ,pstricks ,pst-3d, pst-poly,pst-grad,pst-node, pst-text}
\usepackage{floatflt}

\newcommand{\Aff}{\mbox{\it Aff}}
\newcommand{\aff}{\mbox{\it aff}}


\newcommand{\alp}{\alpha}
\newcommand{\bet}{\beta}
\newcommand{\del}{\delta}
\newcommand{\gam}{\gamma}
\newcommand{\vep}{\varepsilon}
\newcommand{\eps}{\epsilon}
\newcommand{\lam}{\lambda}
\newcommand{\kap}{\kappa}
\newcommand{\sig}{\sigma}
\newcommand{\ome}{\omega}
\newcommand{\Gam}{\Gamma}
\newcommand{\Ome}{\Omega}
\newcommand{\Sig}{\Sigma}
\newcommand{\Del}{\Delta}
\newcommand{\Lam}{\Lambda}
\newcommand{\disi}{\displaystyle{\sum_{i=1}^n}}
\newcommand{\disj}{\displaystyle{\sum_{j=1}^m}}
\newcommand{\pa}{\partial}
\newcommand{\cb}{\mathbb{C}}
\newcommand{\cc}{\mathcal{C}}
\newcommand{\ccn}{\mathcal{C}^{\infty}}
\newcommand{\sbb}{\mathbb{S}}
\newcommand{\rb}{\mathbb{R}}
\newcommand{\zb}{\mathbb{Z}}
\newcommand{\bd}{\partial}
\newcommand{\key}[1]{\emph{\textbf{#1}}}
\newcommand{\td}[1]{\widetilde{#1}}
\newcommand{\ssx}[1][p]{\triangle^{#1}}
\newcommand{\sg}[2][X]{S_{#2}({#1})}
\newcommand{\sgi}[2][X]{S_{#2}({#1}\times I)}
\newcommand{\sgp}[1][X]{S_{p}({#1})}
\newcommand{\sgip}[1][X]{S_{p}({#1}\times I)}
\newcommand{\iosh}{i_{0\sharp}}
\newcommand{\ish}{i_{1\sharp}}
\newcommand{\ios}{i_{0*}}
\newcommand{\is}{i_{1*}}

\newtheorem{thm}{����}
\newtheorem{cor}[thm]{��������}
\newtheorem{lem}[thm]{��������}
\newtheorem{prop}[thm]{����}
\newtheorem{cl}{Claim}


{\theorembodyfont{\rm}
\newtheorem{ex}{��}
\newtheorem{que}{����}
\newtheorem{notation}{Notation}[section]
\newtheorem{defn}{����}
\newtheorem{rem}{��}
\newtheorem{note}{Note}
}
\renewcommand{\thenote}{}
\renewcommand{\therem}{}

\newenvironment{proof}{{\bf ����}}{\hfill\framebox[2mm]{}\\}
\newenvironment{proof1}{{\bf ��������}}{\hfill\framebox[2mm]{}}

\begin{document}
\parindent=0cm
\section*{VII.5 Relation between $\pi_1$ and $H_1$}

\begin{thm}
There exists a natural homomorphism $\chi :
$\raisebox{-1.7ex}{\parbox{5cm}{$\pi_1(X,x_0) \to  H_1(X)$\\ \hspace*{4ex}$ [\alp]\mapsto \{\alp\}$}} \\
and if $X$ is path connected, $\chi$ is onto and $ker
\chi=[\pi_1,\pi_1]$ a commutator subgroup of $\pi_1$ (i.e.,
$H_1=\pi_1/[\pi_1,\pi_1]$ is an abelianization of $\pi_1$.)
\end{thm}
\begin{proof}
(1) $\chi$ is well-defined i.e., $\alp \overset{F}{\simeq} \bet
 \Rightarrow \{\alp\}=\{\bet\}(\alp\sim\bet)$.\\

\psset{unit=2cm}
\begin{pspicture}(4,3.6)%
\rput(.2,2.3){\pspolygon[fillstyle=solid,fillcolor=lightgray](0,0)(1,0)(1,1)(0,1)
    \psline{->}(0,0)(0,0.55)
    \psline{->}(0,0)(.55,0)
    \psline{->}(0,1)(.55,1)
    \psline{->}(1,0)(1,0.55)
    \rput(1.2,.5){$x_0$}
    \rput(.5,-.2){$\alp$}
    \rput(-.2,.5){$x_0$}
    \rput(.5,1.2){$\bet$}
}

\rput(2,3){F} \rput(2,2.8){$\longrightarrow$}

\rput(0.2,0.2){\pspolygon[fillstyle=solid,fillcolor=lightgray](0,0)(1,0)(.5,.866)
\psline{-<}(.5,.866)(0.25,0.433) \psline{->}(0,0)(.5,0)
\psline{->}(1,0)(.75,0.433) \rput(.5,1){$e_2$}
\rput(-0.1,-0.1){$e_0$}\rput(1.1,-0.1){$e_1$}
\rput(0.1,.5){$\bet$} \rput(.5,-0.2){$\alp$} \rput(.9,.5){$x_0^1$}
}

\rput(0.7,1.6){$\downarrow q$}

\rput(2.5,2.3){
\psbezier[fillstyle=solid,fillcolor=lightgray](0,0)(2.5,0.1)(0.1,2.5)(0,0)
\psbezier[fillstyle=solid,fillcolor=white](0,0)(1.5,0.2)(0.2,1.5)(0,0)
\rput(.5,.5){$\alp$}\rput(1.1,1.1){$\bet$} }
\psline{->}(1.5,1.2)(2.2,2.1) \rput(2.2,1.4){$\overline{F}=\sig$}

\end{pspicture}
\raisebox{3cm}{\parbox{5.5cm}{
$\sig$�� �׸��� ���� �����ϸ� $\bd \sig=x_0^1-\bet+\alp$\\
and $\bd x_0^2=x_0^1-x_0^1+x_0^1=x_0^1$ \\ where $x_0^p : \ssx\to
\{x_0\}$ is constant map.\\
����, $\alp\sim\bet$.}}\\

(2) $\chi$ is a homomorphism i.e.,
$[\alp*\bet]\mapsto\{\alp\}+\{\bet\}$\\

\psset{unit=3cm}

\begin{pspicture}(1.5,1.2)%
\rput(0.2,0.2){
\pspolygon[fillstyle=solid,fillcolor=lightgray](0,0)(1,0)(.5,.866)
\psline(1,0)(0.25,0.433) \psline{->}(0,0)(0.125,0.216)
\psline{->}(0.25,0.433)(0.375,0.65)

\psline(0,0)(.625,.216)(.5,.866) \psline{->}(0,0)(0.3125,0.108)
\psline{->}(.625,.216)(.5625,.541)

\rput(.3,.2){$\alp$} \rput(.48,.55){$\bet$}

\psline{->}(0,0)(.5,0) \psline{->}(1,0)(.75,0.433)
\rput(.5,.95){$e_2$}
\rput(-0.05,-0.05){$e_0$}\rput(1.05,-0.05){$e_1$}
\rput(-.1,.6){$\alp*\bet$} \rput(.5,-0.1){$\alp$}
\rput(.9,.5){$\bet$} \rput(0,0.3){$\alp$} \rput(0.25,0.7){$\bet$}

}
\end{pspicture}
\raisebox{1cm}{\parbox{9cm}{ $\sig$�� �׸��� ���� �����ϸ� $\bd
\sig=\bet -\alp*\bet +\alp$�̹Ƿ�, $\alp*\bet \sim\alp+\bet$.}}


\newpage
$X$�� path connected�� �����ϸ�, \\
(3) $\chi$ is onto :\\
Given $z\in Z_1(X)$, $z=\sum n_i\alp_i$, $\bd z=\sum
n_i(\alp_i(1)-\alp_i(0))=0$. \\
Fix paths $\eta_i^0$ and $\eta_i^1$ from $x_0$ to $\alp_i(0)$ and
$\alp_i(1)$ for each $i$ such that $\alp_i(0)=\alp_j(1)
\Rightarrow \eta_i^0=\eta_j^1$.\\
Let $\gam_i=\eta_i^0*\alp_i*\overline{\eta_i^1}$. Then,\\
$$\chi (\Pi[\gam_i]^{n_i})=\{\Sigma n_i\gam_i\}=\{\Sigma n_i( \eta_i^0+\alp_i-\eta_i^1 )\}
=\{\Sigma n_i \alp_i\}=\{z\}$$

(4) $ker \chi = [\pi_1,\pi_1]$.\\
$ker \chi \supset [\pi_1,\pi_1]$ : clear since $H_1$ is abelian.\\
$ker \chi \subset [\pi_1,\pi_1]$ :\\
Suppose $\chi[\gam]=\{\gam\}=0$, i.e., $\gam=\bd c$, $c=\sum
n_i\sig_i\in S_2(X)$.\\
Then, $\gam=\bd c=\sum n_i\bd\sig_i=\sum n_i
(\sig_i^{(0)}-\sig_i^{(1)}+\sig_i^{(2)})$.\\

\psset{unit=2cm}
\begin{pspicture}(3,1.2)%

\rput(1.5,0.2){ \pcarc(0,0)(1,0) \pcarc(.5,.866)(0,0)
\pcarc(1,0)(.5,.866) \rput(.5,1){$2$}
\rput(-0.1,-0.1){$0$}\rput(1.1,-0.1){$1$}
\rput(0.15,.6){$\sig_i^{(1)}$} \rput(.5,-0.1){$\sig_i^{(2)}$}
\rput(1,.55){$\sig_i^{(0)}$} }

\rput(0.3,0.7){$x_0$}

\pcarc(0.4,0.7)(1.5,.2)
\pcarc(0.4,0.7)(2.5,.2)\pcarc(0.4,0.7)(2,1.066)

\rput(1,1.1){$\eta_i^2$} \rput(1,.7){$\eta_i^1$}
\rput(.9,.3){$\eta_i^0$}
\end{pspicture}
\raisebox{1cm}{\parbox{8cm}{Fix paths $\eta_i^0,\eta_i^1,\eta_i^2$
for each vertex of $\sig_i$
as before. \\
Let $\bet_i^0=\eta_i^1 \sig_i^{(0)} \overline{\eta_i^2}$,
$\bet_i^1=\eta_i^0 \sig_i^{(1)} \overline{\eta_i^2}$,
$\bet_i^2=\eta_i^0 \sig_i^{(2)} \overline{\eta_i^1}$. \\
Then $\bet_i:=\beta_i^0 \overline{\beta_i^1} \bet_i^2 \simeq
\eta_i^1 \sig_i^{(0)}
\overline{\sig_i^{(1)}}\sig_i^{(2)}\overline{\eta_i^1}\simeq
x_0$.}} \\

Now compare $\gam$ and $\prod \bet_i^{n_i}$. \\ Note that
$[\gam]=[\gam][\bet_i^{n_i}]^{-1}=[\gam*\overline{\bet_i^{n_i}}]\in
[\pi_1,\pi_1]$ by the following claim.\\

\underline{Claim}  Let $\del=\prod \alp_i^{\eps_i}$ ($\alp_i$:
paths and $\eps_i=\pm 1$) be a loop. \\
\hspace*{6ex} $exp(\alp_i)=0 \Rightarrow [\del]\in[\pi_1,\pi_1]$ ($exp(\alp_i)$�� $\alp_i$�� ���� ��)\\
\underline{proof of Claim}\\[1mm]
Define $\eta_i^0,\eta_i^1$ as before. Then,
$$ \del =\Pi \alp_i^{\eps_i}\simeq \Pi
(\eta_i^0*\alp_i*\overline{\eta_i^1})^{\eps_i}$$

Let $\overline{\del}$ be the coset of $[\del]$ in
$\pi_1/[\pi_1,\pi_1]$. Then writing
$\bet_i=\eta_i^0*\alp_i*\overline{\eta_i^1}$ we have
$$ \overline{\del}=\sum_i\eps_i
\overline{\bet_i}=\sum_{\bet_i}exp(\alp_i)\overline{\bet_i}=0$$
where the last summation is over distinct $\bet_i$'s (i.e., over $\alp_i$'s).\\
Therefore, $[\del]\in[\pi_1,\pi_1]$
\end{proof}


{\bf ���� 23.} Compare $\pi_1(\Sigma_g)$ and $H_1(\Sigma_g)$ using
the earlier computations of these.

\end{document}
