\documentclass[8pt]{beamer}
\usepackage[ansinew]{inputenc}
\usepackage{amsmath,amssymb, xcolor}
\usepackage{graphicx}
\usepackage{pgf,tikz}
\usepackage{mathrsfs}
\usetikzlibrary{arrows}
\usepackage{beamerthemesplit}
%\usepackage[french]{babel}
\usepackage{blindtext}
\usepackage{hyperref}

\def\R{\mathbb{R}}
\def\Z{\mathbb{Z}}
\def\H{\mathbb{H}}
\def\eps{\epsilon}
\def\pcite#1{\textcolor{red}{(#1)}}
\def\ncite#1{\textcolor{red}{#1}}

\newtheorem{proposition}{Proposition}


\title{Coarse median preserving RAAG automorphisms, after Fioravanti}
\date{October 22nd, 2025}

\author{Pierre Pansu, Universit\'e Paris-Saclay}


\mode<presentation>{\usetheme{Warsaw}}

\begin{document}

\begin{frame}
\titlepage
\end{frame}

\begin{frame}

\frametitle{Bibliography}

Elia Fioravanti, \emph{Coarse-median preserving automorphisms}, Geometry \& Topology \textbf{28} (2024) 161-266.

\bigskip

Herman Servatius, \emph{Automorphisms of graph groups}. J. Algebra, \textbf{126} (1989) 34--60, 

\smallskip

Michael Laurence, \emph{A generating set for the automorphism group of a graph group}, J. London Math. Soc. \textbf{52} (1995) 318--334.

\smallskip

Matthew Day, \emph{Peak reduction and finite presentations for automorphism groups of right-angled Artin groups}, Geometry \& Topology \textbf{13} (2009) 817--855. 

\smallskip

Ruth Charney, Nathaniel Stambaugh, Karen Vogtmann, \emph{Outer space for untwisted automorphisms of right-angled Artin groups}, Geometry \& Topology \textbf{21} (2017) 1131--1178.

\smallskip

Elia Fioravanti, \emph{Convex cores for actions on finite-rank median algebras}, Ann. Inst. Fourier \textbf{74} (2024) 1895--1942.

\smallskip

Adrien Abgrall, \emph{Géom\'etrie de l'outre-espace des groupes d'Artin \`a angles droits}, Th\`ese, Rennes (2025).

\bigskip

\emph{+ Adrien's explanations!}

\end{frame}

\begin{frame}

\frametitle{The Servatius-Laurence Theorem}

standard generators of the group $A_\Gamma$ = vertices of the graph $\Gamma$.

\begin{theorem}[\ncite{Servatius, Laurence}]
The automorphism group of a RAAG is generated by:
\begin{enumerate}
  \item \textbf{graph automorphisms}, acting by permuting standard generators,
  \item \textbf{inversions}: one standard generator is mapped to its inverse, the others are unchanged,
  \item \textbf{partial conjugations}: pick a vertex $v$, remove its star; pick a union $P$ of connected components of the resulting graph; define an automorphism conjugating by $v$ the vertices of $P$ and fixing all other vertices,
  \item \textbf{transvections}: pick two distinct vertices $v$ and $w$, assuming that $\mathrm{link}(v)\subset\mathrm{star}(w)$; define an automorphism mapping $v$ to $vw^{\pm 1}$ or to $w^{\pm 1}v$ and fixing all other vertices.
\end{enumerate}
\end{theorem}


\end{frame}

\begin{frame}

\frametitle{Fioravanti's theorem}

\begin{definition}[Untwisted automorphisms, \ncite{Day, CSV}]
Say a transvection is a \textbf{twist} if the vertices $v$ and $w$ are adjacent, a \textbf{fold} otherwise. Say a RAAG automorphism is \textbf{untwisted} (Day says \textbf{long range}) if it admits an expression as a product of Laurence generators that does not contain twists.
\end{definition}

\begin{minipage}{3cm}
\begin{center}
\definecolor{qqqqff}{rgb}{0.,0.,1.}
\begin{tikzpicture}[line cap=round,line join=round,>=triangle 45,x=0.3cm,y=0.3cm]
\clip(-4.6088139002103885,1.3993098310353917) rectangle (3.2851009905305344,6.596137134106496);
\draw [line width=2.8pt] (-4.,6.)-- (-4.,2.);
\begin{scriptsize}
\draw [fill=qqqqff] (-4.,6.) circle (2.5pt);
\draw[color=qqqqff] (-3.1944874822859735,5.905419581166665) node {$a_1$};
\draw [fill=qqqqff] (-4.,2.) circle (2.5pt);
\draw[color=qqqqff] (-3.1615961702412196,2.221592632154237) node {$a_2$};
\draw [fill=qqqqff] (-2.,4.) circle (2.5pt);
\draw[color=qqqqff] (-1.71437844027205,4.688441035510774) node {$b_1$};
\draw [fill=qqqqff] (0.,4.) circle (2.5pt);
\draw[color=qqqqff] (0.29199159445793443,4.688441035510774) node {$b_2$};
\draw [fill=qqqqff] (2.,4.) circle (2.5pt);
\draw[color=qqqqff] (2.298361629187919,4.688441035510774) node {$b_3$};
\end{scriptsize}
\end{tikzpicture}
\end{center}
\end{minipage}\hskip.5cm\begin{minipage}{7cm}
\textbf{Examples}

The transvection $b_1\to b_1a_1$, others fixed, is a fold.

The transvection $a_1\to a_1a_2$, others fixed, is a twist.

\end{minipage}




\pause


\begin{theorem}[\ncite{E. Fioravanti 2024}]
An automorphism of a RAAG preserves the coarse median structure $\iff$ it is untwisted.
\end{theorem}\pause

\begin{minipage}{3cm}
\begin{center}
\definecolor{qqqqff}{rgb}{0.,0.,1.}
\definecolor{cqcqcq}{rgb}{0.7529411764705882,0.7529411764705882,0.7529411764705882}
\begin{tikzpicture}[line cap=round,line join=round,>=triangle 45,x=0.3cm,y=0.3cm]
\draw [color=cqcqcq,, xstep=0.6cm,ystep=0.6cm] (-4.740379148389415,-2.7449954866035844) grid (4.896775280723464,4.820006283689797);
\clip(-4.740379148389415,-2.7449954866035844) rectangle (4.896775280723464,4.820006283689797);
\draw [line width=2.8pt] (-4.,-2.)-- (-2.,-2.);
\draw [line width=2.8pt] (-2.,-2.)-- (-2.,0.);
\draw [line width=2.8pt] (-2.,0.)-- (0.,0.);
\draw [line width=2.8pt] (0.,0.)-- (0.,2.);
\draw [line width=2.8pt] (0.,2.)-- (2.,2.);
\draw [line width=2.8pt] (2.,2.)-- (2.,4.);
\draw [line width=2.8pt] (2.,4.)-- (4.,4.);
\begin{scriptsize}
\draw [fill=qqqqff] (-4.,-2.) circle (2.5pt);
\draw [fill=qqqqff] (-2.,-2.) circle (2.5pt);
\draw [fill=qqqqff] (-2.,0.) circle (2.5pt);
\draw [fill=qqqqff] (0.,0.) circle (2.5pt);
\draw [fill=qqqqff] (0.,2.) circle (2.5pt);
\draw [fill=qqqqff] (2.,2.) circle (2.5pt);
\draw [fill=qqqqff] (2.,4.) circle (2.5pt);
\draw [fill=qqqqff] (4.,4.) circle (2.5pt);
\end{scriptsize}
\end{tikzpicture}
\end{center}
\end{minipage}\hskip.5cm\begin{minipage}{7cm}
The transvection $a_1\to a_1a_2$, others fixed, does not preserve the coarse median structure. It maps $a_1$, whose axis is median convex, to $a_1a_2$, whose axis $\alpha$ is very far from convex (the set of its median points $\mu(\alpha,\alpha,X)$ is a whole plane).

\end{minipage}

\end{frame}

\begin{frame}

\frametitle{Scheme of proof of $\implies$}

The proof of $\implies$, i.e. that coarse median structure preserving automorphisms are untwisted, follows Laurence's proof, with the following additional input:
\begin{enumerate}
  \item An element $g$ is label-irreducible $\iff$ it generates a convex-cocompact subgroup (Lemma 3.11 (2) in Fioravanti).
  \item A subgroup is convex-cocompact $\iff$ it is quasiconvex, a notion which is defined for coarse median spaces (Haglund 2008).
\end{enumerate}\pause

It follows that coarse median preserving automorphisms preserve label-irreducible elements. \pause

\bigskip

Laurence's Isomorphism Theorem for RAAGs puts such an automorphism in simple form. \pause

\smallskip

Laurence then composes with inversions, folds and partial conjugations to get a conjugating automorphism, i.e. which maps each vertex to one of its conjugates. \pause

\smallskip

Finally, he shows that conjugating automorphisms are products of partial conjugations.

\end{frame}

\begin{frame}

\frametitle{Scheme of proof of $\implies$}

The proof of $\implies$, i.e. that coarse median structure preserving automorphisms are untwisted, follows Laurence's proof, with the following additional input:
\begin{enumerate}
  \item An element $g$ is \textcolor{red}{label-irreducible} $\iff$ it generates a convex-cocompact subgroup (Lemma 3.11 (2) in Fioravanti).
  \item A subgroup is convex-cocompact $\iff$ it is quasiconvex, a notion which is defined for coarse median spaces (Haglund 2008).
\end{enumerate}

It follows that coarse median preserving automorphisms preserve \textcolor{red}{label-irreducible} elements.

\bigskip

Laurence's Isomorphism Theorem for RAAGs puts such an automorphism in \textcolor{red}{simple} form.

\smallskip

Laurence then postcomposes with inversions, folds and partial conjugations to get a conjugating automorphism, i.e. which maps each vertex to one of its conjugates.

\smallskip

Finally, he shows that conjugating automorphisms are products of partial conjugations.

\end{frame}

\begin{frame}

\frametitle{Explanation of terms}

In $\Z^2\star F_3$, the element $a_1 a_2$ (translation by $(1,1)$) has a nonhyperbolic behaviour: the convex hull of any of its axes is a whole plane. More generally, label-irreducibility has to do with the possibility of dividing the set of graph vertices occurring in a group element into two disjoint and commuting subsets, in which case the element can be written as a commuting product.

\bigskip

Formally, for $g$ a group element, $\Gamma(g)$ denotes the subset of graph vertices appearing in the cyclically reduced words representing conjugates of $g$. Equivalently, appearing as labels of hyperplanes crossed by the axes of $g$.\pause

\smallskip

A group element $g$ is \textbf{label-irreducible} if the subgraph spanned by $\Gamma(g)$ is not a join (i.e. the opposite graph is connected).

\smallskip

\begin{minipage}{3cm}
\begin{center}
\definecolor{qqqqff}{rgb}{0.,0.,1.}
\begin{tikzpicture}[line cap=round,line join=round,>=triangle 45,x=0.3cm,y=0.3cm]
\clip(-4.6088139002103885,1.3993098310353917) rectangle (3.2851009905305344,6.596137134106496);
\draw [line width=2.8pt] (-4.,6.)-- (-4.,2.);
\begin{scriptsize}
\draw [fill=qqqqff] (-4.,6.) circle (2.5pt);
\draw[color=qqqqff] (-3.1944874822859735,5.905419581166665) node {$a_1$};
\draw [fill=qqqqff] (-4.,2.) circle (2.5pt);
\draw[color=qqqqff] (-3.1615961702412196,2.221592632154237) node {$a_2$};
\draw [fill=qqqqff] (-2.,4.) circle (2.5pt);
\draw[color=qqqqff] (-1.71437844027205,4.688441035510774) node {$b_1$};
\draw [fill=qqqqff] (0.,4.) circle (2.5pt);
\draw[color=qqqqff] (0.29199159445793443,4.688441035510774) node {$b_2$};
\draw [fill=qqqqff] (2.,4.) circle (2.5pt);
\draw[color=qqqqff] (2.298361629187919,4.688441035510774) node {$b_3$};
\end{scriptsize}
\end{tikzpicture}
\end{center}
\end{minipage}\hskip.5cm\begin{minipage}{7cm}

In $\Z^2\star F_3$, all elements are label-irreducible except conjugates of elements of $\Z^2\star\{e\}$ with both coordinates nonzero.

\end{minipage}

An automorphism $\phi$ is \textbf{simple} if for each standard generator $v$, $\phi(v)$ is label-irreducible and $v\in \Gamma(\phi(v))$.

\end{frame}

\begin{frame}

\frametitle{Proof of the characterization of label-irreducibility in terms of quasiconvexity I}

When $g$ is label-irreducible, in order to collect all labels in $\Gamma(g)$, it suffices to consider hyperplanes separating $w$ from $g^{4r}w$, for an arbitrary hyperplane $w$ crossing the axes of $g$. 

\medskip

Indeed, $w$ separates a point $y$ of an axis from $gy$. Let $x=g^{2r}y$. Let $w'$ separate $x$ from $gx$. Being a connected subgraph of the opposite graph $\Gamma^o$, $\Gamma(g)^o$ has bounded diameter ($\le 2r$). Whence a bounded sequence of nonconnected labels and walls $w_i$ from $w$ to $w'$, with $w_i$ separating $g^i y$ from $g^{i+1}y$, all crossed by the axis, such that $w_i$ and $w_{i+1}$ are not transverse. So each $w_i$ separates previous walls from later walls, showing that $w$ and $w'$ are not transverse. Similarly, $w'$ is not transverse to $g^{2r}w$, so $w'$ separates $w$ from $g^{4r}w$.

\begin{center}
\definecolor{ffqqqq}{rgb}{1.,0.,0.}
\definecolor{xdxdff}{rgb}{0.49019607843137253,0.49019607843137253,1.}
\definecolor{qqqqff}{rgb}{0.,0.,1.}
\begin{tikzpicture}[line cap=round,line join=round,>=triangle 45,x=0.4cm,y=0.4cm]
\clip(-5.76000982177678,-0.3768210193813147) rectangle (22.592301160801043,5.905419581166664);
\draw [domain=-5.76000982177678:22.592301160801043] plot(\x,{(--29.59447548983049--2.861544147893583*\x)/22.760787934969663});
\draw (17.5599304179537,5.313375964361096) node[anchor=north west] {$\text{axis of }g$};
\draw [domain=-5.76000982177678:22.592301160801043] plot(\x,{(-25.653618721076814-8.650415067770256*\x)/-0.9538480492978616});
\draw (-3.523400602733518,4.688441035510773) node[anchor=north west] {$w$};
\draw [domain=-5.76000982177678:22.592301160801043] plot(\x,{(--129.63239324870653-8.420175883456979*\x)/1.0525219854321222});
\draw (15.58645169526847,1.1690706467221148) node[anchor=north west] {$w'$};
\draw [color=ffqqqq,domain=-5.76000982177678:22.592301160801043] plot(\x,{(--3.2724231638209336-8.880654252083533*\x)/0.7236088649845848});
\draw [color=ffqqqq,domain=-5.76000982177678:22.592301160801043] plot(\x,{(--30.427457393239507-8.876560734782606*\x)/-0.8464642576484858});
\draw (-1.0236608873322253,3.8990495464366814) node[anchor=north west] {$w_2$};
\draw (2.528600813501191,4.326636603018481) node[anchor=north west] {$w_3$};
\begin{scriptsize}
\draw [fill=qqqqff] (-4.444357339986626,0.7414835901403236) circle (2.5pt);
\draw[color=qqqqff] (-4.214118155673349,1.333527206945884) node {$Y$};
\draw [fill=xdxdff] (-1.550180719276931,1.1053468358075826) circle (2.5pt);
\draw[color=xdxdff] (-1.2210087596007484,1.6953316394381759) node {$gY$};
\draw [fill=xdxdff] (16.345163771160777,3.355195059316368) circle (2.5pt);
\draw[color=xdxdff] (16.67186499274535,3.9319408584814353) node {$gX$};
\draw [fill=xdxdff] (13.612884731937113,3.0116859893561676) circle (2.5pt);
\draw[color=xdxdff] (13.843212156896517,3.603027738033897) node {$X$};
\draw [fill=xdxdff] (1.7690004484378559,1.5226427340607422) circle (2.5pt);
\end{scriptsize}
\end{tikzpicture}
\end{center}

\end{frame}

\begin{frame}

\frametitle{Proof of the characterization of label-irreducibility in terms of quasiconvexity II}


This implies that the convex hull of any axis of $g$ has finite width (at most $8r$ times the translation length of $g$). 

\begin{center}
\definecolor{ffqqqq}{rgb}{1.,0.,0.}
\definecolor{qqqqff}{rgb}{0.,0.,1.}
\begin{tikzpicture}[line cap=round,line join=round,>=triangle 45,x=0.2cm,y=0.2cm]
\clip(-5.299531453150225,-11.198062682105316) rectangle (34.82786924144948,1.4322011430801538);
\draw (-4.,-10.)-- (0.,-10.);
\draw (0.,-10.)-- (0.,-8.);
\draw (0.,-8.)-- (6.,-8.);
\draw (6.,-8.)-- (6.,-6.);
\draw (6.,-6.)-- (14.,-6.);
\draw (14.,-6.)-- (14.,-4.);
\draw (14.,-4.)-- (20.,-4.);
\draw (22.789649033069566,0.5412775796050757) node[anchor=north west] {$\alpha=\text{axis of }g$};
\draw [color=qqqqff](11.442146377629486,-6.001235379034211) node[anchor=north west] {$d(x,p)=d(x,y)$};
\draw (-5.135074892926456,-2.679212862514074) node[anchor=north west] {$\mu(x,y,p)=m$};
\draw [color=ffqqqq,domain=-5.299531453150225:34.82786924144948] plot(\x,{(-52.-0.*\x)/26.});
\draw [color=qqqqff] (10.,-11.198062682105316) -- (10.,1.4322011430801538);
\draw (20.,-4.)-- (20.,0.);
\draw (20.,0.)-- (32.,0.);
\begin{scriptsize}
\draw [fill=qqqqff] (0.,-10.) circle (2.5pt);
\draw[color=qqqqff] (1.344513579890053,-9.750844952136147) node {$X$};
\draw [fill=qqqqff] (14.,-4.) circle (2.5pt);
\draw[color=qqqqff] (15.125973326641917,-5.178952577915365) node {$Y$};
\draw [fill=ffqqqq] (6.,0.) circle (2.5pt);
\draw[color=ffqqqq] (4.3047316639179,0.37967915764803134) node {$p$};
\draw [fill=black] (6.,-4.) circle (2.5pt);
\end{scriptsize}
\end{tikzpicture}
\end{center}
\pause

Indeed, $p$ roughly splits the axis $\alpha$ of $g$ into a left and a right side. Pick $x\in\alpha$ far on the left. On the right of $x$, pick $y\in\alpha$ such that $d(x,y)=d(x,p)$. Assume that $d(p,y)$ is too large. Then $m=\mu(x,y,p)$ satisfies $d(m,y)=d(p,m)=\frac12 d(p,y)$ is too large as well. By construction, half-spaces separating $p$ from $m$ are transverse from those separating $m$ from $y$. Indeed, their complements all intersect $\alpha$ along right half-lines, and thus pairwise intersect along right half-lines on $\alpha$. Both sets of half-spaces, mod $g^{4r}$, have cardinality bounded. By the previous argument, each contains all labels in $\Gamma(g)$. So the same label appears in each. This contradicts transversality.

\bigskip

Thus the cyclic group $\langle g \rangle$ acts cocompactly on this hull, and on its essential core which is a restriction quotient of the hull.

\end{frame}


\begin{frame}

\frametitle{Completion of the proof of $\implies$}


\bigskip

Conversely, if $g$ is non label-irreducible, the essential core splits as a nontrivial product, the $\langle g \rangle$ action cannot be cocompact.\pause

\bigskip

\textbf{An example of Laurence's algorithm}.

\medskip

Given automorphism
$$
\phi:
\begin{matrix}
a_1\\a_2\\b_1\\b_2\\b_3
\end{matrix}
\mapsto
\begin{matrix}
a_2\\a_1^{-1}\\b_2a_2\\b_3\\a_1^{-1}b_1a_1
\end{matrix},
$$\pause
postcompose to simplify as follows:
$$
\phi:
\begin{matrix}
a_1\\a_2\\b_1\\b_2\\b_3
\end{matrix}
\stackrel{\phi}{\mapsto}
\begin{matrix}
a_2\\a_1^{-1}\\b_2a_2\\b_3\\a_1^{-1}b_1a_1
\end{matrix}
\stackrel{permutation}{\mapsto}
\begin{matrix}
a_1\\a_2^{-1}\\b_1a_1\\b_2\\a_2^{-1}b_3a_2
\end{matrix}
\stackrel{inversion}{\mapsto}
\begin{matrix}
a_1\\a_2\\b_1a_1\\b_2\\a_2b_3a_2^{-1}
\end{matrix}
\stackrel{fold}{\mapsto}
\begin{matrix}
a_1\\a_2\\b_1\\b_2\\a_2b_3a_2^{-1}
\end{matrix}
$$
which is a partial conjugation.
\end{frame}

\begin{frame}

\frametitle{Scheme of the proof of $\Leftarrow$ I}

The proof of $\Leftarrow$, i.e. that folds and partial conjugations preserve the standard coarse median structure uses CSV blowups (suggestion by Ric Wade).\pause

\bigskip

Every fold or partial conjugation $\phi$ can be embedded in a blow up, i.e. an action on a $CAT(0)$ cube complex $Y$ with two restriction-quotient maps (i.e. collapsing walls): $Y\to X_\Gamma$, the CCC associated to the graph $\Gamma$, the first equivariant with respect to the standard action of $A_\Gamma$, and the other with the action twisted by $\phi$. \pause

\bigskip


Charney, Stambaugh and Vogtmann's blowup construction for the fold $b_1\mapsto a_1 b_1$.

\begin{center}
\definecolor{ttzzqq}{rgb}{0.2,0.6,0.}
\definecolor{qqzzqq}{rgb}{0.,0.6,0.}
\definecolor{ffqqqq}{rgb}{1.,0.,0.}
\definecolor{ttffcc}{rgb}{0.2,1.,0.8}
\definecolor{ffwwqq}{rgb}{1.,0.4,0.}
\definecolor{ccqqww}{rgb}{0.8,0.,0.4}
\definecolor{qqqqff}{rgb}{0.,0.,1.}
\begin{tikzpicture}[line cap=round,line join=round,>=triangle 45,x=0.2cm,y=0.2cm]
\clip(-6.821695366532321,-9.346287257541592) rectangle (40.27145288411708,13.789249414223619);
\draw [rotate around={0.:(4.,-6.)}] (4.,-6.) ellipse (0.8068619009435065cm and 0.10500536745412639cm);
\draw [rotate around={0.:(4.,-6.)}] (4.,-6.) ellipse (1.683245391198016cm and 0.5227954159988054cm);
\draw [rotate around={0.:(-2.,-6.)},line width=1.6pt,color=ccqqww] (-2.,-6.) ellipse (0.4582444160504207cm and 0.22357983997084885cm);
\draw [rotate around={-0.26587177850360294:(4.090938135627007,-5.968344066989457)},line width=1.6pt,color=ffwwqq] (4.090938135627007,-5.968344066989457) ellipse (1.4630790975384134cm and 0.3618332861767794cm);
\draw [rotate around={0.:(28.,-6.)}] (28.,-6.) ellipse (0.8071965376054497cm and 0.10754650306861445cm);
\draw [rotate around={0.:(28.,-6.)}] (28.,-6.) ellipse (1.6892965886799036cm and 0.5419621430741686cm);
\draw [rotate around={-0.4341967950427057:(34.24447468652599,-5.986696087162859)},line width=1.6pt,color=ccqqww] (34.24447468652599,-5.986696087162859) ellipse (0.44164096061682534cm and 0.2678897035736309cm);
\draw [rotate around={-0.12704143152350333:(28.128753547580867,-6.021306414166066)},line width=1.6pt,color=ttffcc] (28.128753547580867,-6.021306414166066) ellipse (1.4940624532384426cm and 0.3960077881120436cm);
\draw [rotate around={0.:(16.,2.)}] (16.,2.) ellipse (0.8076740231039783cm and 0.11107352338427352cm);
\draw [rotate around={0.:(16.,2.)}] (16.,2.) ellipse (1.71211566455033cm and 0.6093767708065552cm);
\draw [rotate around={0.:(10.,2.)},line width=1.6pt,color=ccqqww] (10.,2.) ellipse (0.5073789271213291cm and 0.3121431974059179cm);
\draw [rotate around={0.:(22.,2.)},line width=1.6pt,color=ccqqww] (22.,2.) ellipse (0.5056257544815487cm and 0.3092853109913794cm);
\draw [rotate around={0.:(16.08630793437463,1.980371639171237)},line width=1.6pt,color=ffwwqq] (16.08630793437463,1.980371639171237) ellipse (1.5475968040169559cm and 0.4760359620157269cm);
\draw [rotate around={-55.336554146499374:(-3.590473226726255,-2.4916240792607893)},line width=1.6pt,color=qqqqff] (-3.590473226726255,-2.4916240792607893) ellipse (0.5862791085308465cm and 0.4587548814252033cm);
\draw [rotate around={-73.52600606181078:(-2.754166040811858,-2.142001599825791)},line width=1.6pt,color=ffqqqq] (-2.754166040811858,-2.142001599825791) ellipse (0.5771595311232117cm and 0.3975796358927368cm);
\draw [rotate around={-89.64741503834178:(-1.7862739573316286,-1.6892778833592303)},line width=1.6pt,color=qqzzqq] (-1.7862739573316286,-1.6892778833592303) ellipse (0.6434730242949245cm and 0.39576607781721873cm);
\draw [rotate around={87.01571785640701:(33.7967362180995,-2.0747500266886973)},line width=1.6pt,color=qqqqff] (33.7967362180995,-2.0747500266886973) ellipse (0.5189405066985092cm and 0.3640979886554591cm);
\draw [rotate around={65.18280719969295:(35.01649992557658,-2.1268128768693972)},line width=1.6pt,color=ffqqqq] (35.01649992557658,-2.1268128768693972) ellipse (0.5776051009098818cm and 0.33764394887625826cm);
\draw [rotate around={31.643492136327513:(36.36853777604999,-3.2731195297528926)},line width=1.6pt,color=qqzzqq] (36.36853777604999,-3.2731195297528926) ellipse (0.6117652314173099cm and 0.39535863407616895cm);
\draw [rotate around={-74.83737601000318:(9.033745589222052,8.185350859861837)},line width=1.6pt,color=qqqqff] (9.033745589222052,8.185350859861837) ellipse (0.9664048186724818cm and 0.5559956414664405cm);
\draw [shift={(16.134222174214976,3.545570140622446)},line width=1.6pt,color=ffqqqq]  plot[domain=0.:3.141592653589793,variable=\t]({1.*5.781651607401397*cos(\t r)+0.*5.781651607401397*sin(\t r)},{0.*5.781651607401397*cos(\t r)+1.*5.781651607401397*sin(\t r)});
\draw [->] (10.847842730014461,-1.1546687915179736) -- (8.94956867765224,-3.360771068587571);
\draw [->] (21.878354115362512,-0.7955358626926904) -- (23.62271405537104,-3.2068569562338776);
\draw [shift={(16.134222174214976,-16.350688338794825)},line width=2.pt,color=ttffcc]  plot[domain=1.2879948598847977:1.8535977937049957,variable=\t]({1.*20.719280798067068*cos(\t r)+0.*20.719280798067068*sin(\t r)},{0.*20.719280798067068*cos(\t r)+1.*20.719280798067068*sin(\t r)});
\draw [rotate around={72.48988147881154:(11.855448158192184,8.302344387384512)},line width=1.6pt,color=ttzzqq] (11.855448158192184,8.302344387384512) ellipse (0.9926033723132621cm and 0.4810481158590498cm);
\begin{scriptsize}
\draw [fill=qqqqff] (-1.9117263125405792,-4.882930769512579) circle (2.5pt);
\draw[color=qqqqff] (-2.7700404671622354,-1.7127345485835272) node {$A$};
\draw [fill=black] (33.638891129220305,-4.695679111916573) circle (2.5pt);
\draw[color=black] (38.0401067076524,-3.23944509037514) node {$B''$};
\draw [fill=black] (10.352570566813577,3.545570140622446) circle (2.5pt);
\draw[color=black] (8.386690415161189,7.153930521052378) node {$A'$};
\draw [fill=black] (21.915873781616373,3.545570140622446) circle (2.5pt);
\draw[color=black] (24.358431467750513,6.508014522602081) node {$B'$};
\end{scriptsize}
\end{tikzpicture}
\end{center}

\end{frame}

\begin{frame}

\frametitle{Proof of $\Leftarrow$ II}

Blowup for the automorphism obtained by composing the flip $b_1\mapsto a_1 b_1$ and the partial conjugation $b_3\mapsto a_1^{-1}b_3a_1$:

\begin{center}
\definecolor{qqzzqq}{rgb}{0.,0.6,0.}
\definecolor{ffqqqq}{rgb}{1.,0.,0.}
\definecolor{ttffcc}{rgb}{0.2,1.,0.8}
\definecolor{ffwwqq}{rgb}{1.,0.4,0.}
\definecolor{ccqqww}{rgb}{0.8,0.,0.4}
\definecolor{qqqqff}{rgb}{0.,0.,1.}
\begin{tikzpicture}[line cap=round,line join=round,>=triangle 45,x=0.2cm,y=0.2cm]
\clip(-6.441842557717141,-9.260812042145806) rectangle (39.732391148391024,13.467171882082837);
\draw [rotate around={0.:(4.,-6.)}] (4.,-6.) ellipse (0.8068619009435065cm and 0.10500536745412639cm);
\draw [rotate around={0.:(4.,-6.)}] (4.,-6.) ellipse (1.683245391198016cm and 0.5227954159988054cm);
\draw [rotate around={0.:(-2.,-6.)},line width=1.6pt,color=ccqqww] (-2.,-6.) ellipse (0.4582444160504207cm and 0.22357983997084885cm);
\draw [rotate around={-0.26587177850360294:(4.090938135627007,-5.968344066989457)},line width=1.6pt,color=ffwwqq] (4.090938135627007,-5.968344066989457) ellipse (1.4630790975384134cm and 0.3618332861767794cm);
\draw [rotate around={0.:(28.,-6.)}] (28.,-6.) ellipse (0.8071965376054497cm and 0.10754650306861445cm);
\draw [rotate around={0.:(28.,-6.)}] (28.,-6.) ellipse (1.6892965886799036cm and 0.5419621430741686cm);
\draw [rotate around={-0.4341967950427057:(34.24447468652599,-5.986696087162859)},line width=1.6pt,color=ccqqww] (34.24447468652599,-5.986696087162859) ellipse (0.44164096061682534cm and 0.2678897035736309cm);
\draw [rotate around={-0.12704143152350333:(28.128753547580867,-6.021306414166066)},line width=1.6pt,color=ttffcc] (28.128753547580867,-6.021306414166066) ellipse (1.4940624532384426cm and 0.3960077881120436cm);
\draw [rotate around={0.:(16.,2.)}] (16.,2.) ellipse (0.8076740231039783cm and 0.11107352338427352cm);
\draw [rotate around={0.:(16.,2.)}] (16.,2.) ellipse (1.71211566455033cm and 0.6093767708065552cm);
\draw [rotate around={0.:(10.,2.)},line width=1.6pt,color=ccqqww] (10.,2.) ellipse (0.5073789271213291cm and 0.3121431974059179cm);
\draw [rotate around={0.:(22.,2.)},line width=1.6pt,color=ccqqww] (22.,2.) ellipse (0.5056257544815487cm and 0.3092853109913794cm);
\draw [rotate around={0.:(16.08630793437463,1.980371639171237)},line width=1.6pt,color=ffwwqq] (16.08630793437463,1.980371639171237) ellipse (1.5475968040169559cm and 0.4760359620157269cm);
\draw [rotate around={-55.336554146499374:(-3.590473226726255,-2.4916240792607893)},line width=1.6pt,color=qqqqff] (-3.590473226726255,-2.4916240792607893) ellipse (0.5862791085308465cm and 0.4587548814252033cm);
\draw [rotate around={-73.52600606181078:(-2.754166040811858,-2.142001599825791)},line width=1.6pt,color=ffqqqq] (-2.754166040811858,-2.142001599825791) ellipse (0.5771595311232117cm and 0.3975796358927368cm);
\draw [rotate around={-89.64741503834178:(-1.7862739573316286,-1.6892778833592303)},line width=1.6pt,color=qqzzqq] (-1.7862739573316286,-1.6892778833592303) ellipse (0.6434730242949245cm and 0.39576607781721873cm);
\draw [rotate around={87.01571785640701:(33.7967362180995,-2.0747500266886973)},line width=1.6pt,color=qqqqff] (33.7967362180995,-2.0747500266886973) ellipse (0.5189405066985092cm and 0.3640979886554591cm);
\draw [rotate around={65.18280719969295:(35.01649992557658,-2.1268128768693972)},line width=1.6pt,color=ffqqqq] (35.01649992557658,-2.1268128768693972) ellipse (0.5776051009098818cm and 0.33764394887625826cm);
\draw [rotate around={31.64349213632753:(36.36853777604999,-3.2731195297528908)},line width=1.6pt,color=qqzzqq] (36.36853777604999,-3.2731195297528908) ellipse (0.61176523141731cm and 0.39535863407616895cm);
\draw [rotate around={-74.83737601000318:(9.033745589222052,8.185350859861837)},line width=1.6pt,color=qqqqff] (9.033745589222052,8.185350859861837) ellipse (0.9664048186724818cm and 0.5559956414664405cm);
\draw [rotate around={57.50599888093236:(24.46171029982146,7.572871416271982)},line width=1.6pt,color=qqzzqq] (24.46171029982146,7.572871416271982) ellipse (0.950590143469098cm and 0.5155823176404424cm);
\draw [shift={(16.134222174214976,3.545570140622446)},line width=1.6pt,color=ffqqqq]  plot[domain=0.:3.141592653589793,variable=\t]({1.*5.781651607401397*cos(\t r)+0.*5.781651607401397*sin(\t r)},{0.*5.781651607401397*cos(\t r)+1.*5.781651607401397*sin(\t r)});
\draw [->] (10.847842730014461,-1.1546687915179736) -- (8.94956867765224,-3.360771068587571);
\draw [->] (21.878354115362512,-0.7955358626926904) -- (23.62271405537104,-3.2068569562338776);
\draw [shift={(16.134222174214973,-16.350688338794836)},line width=2.pt,color=ttffcc]  plot[domain=1.2879948598847977:1.8535977937049954,variable=\t]({1.*20.71928079806708*cos(\t r)+0.*20.71928079806708*sin(\t r)},{0.*20.71928079806708*cos(\t r)+1.*20.71928079806708*sin(\t r)});
\begin{scriptsize}
\draw [fill=qqqqff] (-1.9117263125405792,-4.882930769512579) circle (2.5pt);
\draw[color=qqqqff] (-2.69659915711059,-2.1294581697580375) node {$A$};
\draw [fill=black] (33.638891129220305,-4.695679111916573) circle (2.5pt);
\draw[color=black] (37.474984167203516,-3.4120757727054776) node {$B''$};
\draw [fill=black] (10.352570566813577,3.545570140622446) circle (2.5pt);
\draw[color=black] (8.641740452944859,6.694950938520352) node {$A'$};
\draw [fill=black] (21.915873781616373,3.545570140622446) circle (2.5pt);
\draw[color=black] (24.08445639243215,6.130599193223478) node {$B'$};
\end{scriptsize}
\end{tikzpicture}
\end{center}

Since both blowup and restriction quotient preserve coarse median structures, folds and partial conjugations preserve the canonical coarse median structure of the universal cover $X_\Gamma$ of the Salvetti complex. 

\end{frame}

\end{document}


Fioravanti's Theorem (Proposition A (1) page 164. Proof on pages 198-199 and 201-202)



