\documentclass[12pt,titlepage]{article}

\usepackage{amsmath}
\usepackage{mathrsfs}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsthm}
\usepackage{mathtools}
\usepackage{graphicx}
\usepackage{color}
\usepackage{ucs}
\usepackage[utf8x]{inputenc}
\usepackage{xparse}
\usepackage{hyperref}

%----Macros----------
%
% Unresolved issues:
%
%  \righttoleftarrow
%  \lefttorightarrow
%
%  \color{} with HTML colorspec
%  \bgcolor
%  \array with options (without options, it's equivalent to the matrix environment)

% Of the standard HTML named colors, white, black, red, green, blue and yellow
% are predefined in the color package. Here are the rest.
\definecolor{aqua}{rgb}{0, 1.0, 1.0}
\definecolor{fuschia}{rgb}{1.0, 0, 1.0}
\definecolor{gray}{rgb}{0.502, 0.502, 0.502}
\definecolor{lime}{rgb}{0, 1.0, 0}
\definecolor{maroon}{rgb}{0.502, 0, 0}
\definecolor{navy}{rgb}{0, 0, 0.502}
\definecolor{olive}{rgb}{0.502, 0.502, 0}
\definecolor{purple}{rgb}{0.502, 0, 0.502}
\definecolor{silver}{rgb}{0.753, 0.753, 0.753}
\definecolor{teal}{rgb}{0, 0.502, 0.502}

% Because of conflicts, \space and \mathop are converted to
% \itexspace and \operatorname during preprocessing.

% itex: \space{ht}{dp}{wd}
%
% Height and baseline depth measurements are in units of tenths of an ex while
% the width is measured in tenths of an em.
\makeatletter
\newdimen\itex@wd%
\newdimen\itex@dp%
\newdimen\itex@thd%
\def\itexspace#1#2#3{\itex@wd=#3em%
\itex@wd=0.1\itex@wd%
\itex@dp=#2ex%
\itex@dp=0.1\itex@dp%
\itex@thd=#1ex%
\itex@thd=0.1\itex@thd%
\advance\itex@thd\the\itex@dp%
\makebox[\the\itex@wd]{\rule[-\the\itex@dp]{0cm}{\the\itex@thd}}}
\makeatother

% \tensor and \multiscript
\makeatletter
\newif\if@sup
\newtoks\@sups
\def\append@sup#1{\edef\act{\noexpand\@sups={\the\@sups #1}}\act}%
\def\reset@sup{\@supfalse\@sups={}}%
\def\mk@scripts#1#2{\if #2/ \if@sup ^{\the\@sups}\fi \else%
  \ifx #1_ \if@sup ^{\the\@sups}\reset@sup \fi {}_{#2}%
  \else \append@sup#2 \@suptrue \fi%
  \expandafter\mk@scripts\fi}
\def\tensor#1#2{\reset@sup#1\mk@scripts#2_/}
\def\multiscripts#1#2#3{\reset@sup{}\mk@scripts#1_/#2%
  \reset@sup\mk@scripts#3_/}
\makeatother

% \slash
\makeatletter
\newbox\slashbox \setbox\slashbox=\hbox{$/$}
\def\itex@pslash#1{\setbox\@tempboxa=\hbox{$#1$}
  \@tempdima=0.5\wd\slashbox \advance\@tempdima 0.5\wd\@tempboxa
  \copy\slashbox \kern-\@tempdima \box\@tempboxa}
\def\slash{\protect\itex@pslash}
\makeatother

% math-mode versions of \rlap, etc
% from Alexander Perlis, "A complement to \smash, \llap, and lap"
%   http://math.arizona.edu/~aprl/publications/mathclap/
\def\clap#1{\hbox to 0pt{\hss#1\hss}}
\def\mathllap{\mathpalette\mathllapinternal}
\def\mathrlap{\mathpalette\mathrlapinternal}
\def\mathclap{\mathpalette\mathclapinternal}
\def\mathllapinternal#1#2{\llap{$\mathsurround=0pt#1{#2}$}}
\def\mathrlapinternal#1#2{\rlap{$\mathsurround=0pt#1{#2}$}}
\def\mathclapinternal#1#2{\clap{$\mathsurround=0pt#1{#2}$}}

% Renames \sqrt as \oldsqrt and redefine root to result in \sqrt[#1]{#2}
\let\oldroot\root
\def\root#1#2{\oldroot #1 \of{#2}}
\renewcommand{\sqrt}[2][]{\oldroot #1 \of{#2}}

% Manually declare the txfonts symbolsC font
\DeclareSymbolFont{symbolsC}{U}{txsyc}{m}{n}
\SetSymbolFont{symbolsC}{bold}{U}{txsyc}{bx}{n}
\DeclareFontSubstitution{U}{txsyc}{m}{n}

% Manually declare the stmaryrd font
\DeclareSymbolFont{stmry}{U}{stmry}{m}{n}
\SetSymbolFont{stmry}{bold}{U}{stmry}{b}{n}

% Manually declare the MnSymbolE font
\DeclareFontFamily{OMX}{MnSymbolE}{}
\DeclareSymbolFont{mnomx}{OMX}{MnSymbolE}{m}{n}
\SetSymbolFont{mnomx}{bold}{OMX}{MnSymbolE}{b}{n}
\DeclareFontShape{OMX}{MnSymbolE}{m}{n}{
    <-6>  MnSymbolE5
   <6-7>  MnSymbolE6
   <7-8>  MnSymbolE7
   <8-9>  MnSymbolE8
   <9-10> MnSymbolE9
  <10-12> MnSymbolE10
  <12->   MnSymbolE12}{}

% Declare specific arrows from txfonts without loading the full package
\makeatletter
\def\re@DeclareMathSymbol#1#2#3#4{%
    \let#1=\undefined
    \DeclareMathSymbol{#1}{#2}{#3}{#4}}
\re@DeclareMathSymbol{\neArrow}{\mathrel}{symbolsC}{116}
\re@DeclareMathSymbol{\neArr}{\mathrel}{symbolsC}{116}
\re@DeclareMathSymbol{\seArrow}{\mathrel}{symbolsC}{117}
\re@DeclareMathSymbol{\seArr}{\mathrel}{symbolsC}{117}
\re@DeclareMathSymbol{\nwArrow}{\mathrel}{symbolsC}{118}
\re@DeclareMathSymbol{\nwArr}{\mathrel}{symbolsC}{118}
\re@DeclareMathSymbol{\swArrow}{\mathrel}{symbolsC}{119}
\re@DeclareMathSymbol{\swArr}{\mathrel}{symbolsC}{119}
\re@DeclareMathSymbol{\nequiv}{\mathrel}{symbolsC}{46}
\re@DeclareMathSymbol{\Perp}{\mathrel}{symbolsC}{121}
\re@DeclareMathSymbol{\Vbar}{\mathrel}{symbolsC}{121}
\re@DeclareMathSymbol{\sslash}{\mathrel}{stmry}{12}
\re@DeclareMathSymbol{\bigsqcap}{\mathop}{stmry}{"64}
\re@DeclareMathSymbol{\biginterleave}{\mathop}{stmry}{"6}
\re@DeclareMathSymbol{\invamp}{\mathrel}{symbolsC}{77}
\re@DeclareMathSymbol{\parr}{\mathrel}{symbolsC}{77}
\makeatother

% \llangle, \rrangle, \lmoustache and \rmoustache from MnSymbolE
\makeatletter
\def\Decl@Mn@Delim#1#2#3#4{%
  \if\relax\noexpand#1%
    \let#1\undefined
  \fi
  \DeclareMathDelimiter{#1}{#2}{#3}{#4}{#3}{#4}}
\def\Decl@Mn@Open#1#2#3{\Decl@Mn@Delim{#1}{\mathopen}{#2}{#3}}
\def\Decl@Mn@Close#1#2#3{\Decl@Mn@Delim{#1}{\mathclose}{#2}{#3}}
\Decl@Mn@Open{\llangle}{mnomx}{'164}
\Decl@Mn@Close{\rrangle}{mnomx}{'171}
\Decl@Mn@Open{\lmoustache}{mnomx}{'245}
\Decl@Mn@Close{\rmoustache}{mnomx}{'244}
\makeatother

% Widecheck
\makeatletter
\DeclareRobustCommand\widecheck[1]{{\mathpalette\@widecheck{#1}}}
\def\@widecheck#1#2{%
    \setbox\z@\hbox{\m@th$#1#2$}%
    \setbox\tw@\hbox{\m@th$#1%
       \widehat{%
          \vrule\@width\z@\@height\ht\z@
          \vrule\@height\z@\@width\wd\z@}$}%
    \dp\tw@-\ht\z@
    \@tempdima\ht\z@ \advance\@tempdima2\ht\tw@ \divide\@tempdima\thr@@
    \setbox\tw@\hbox{%
       \raise\@tempdima\hbox{\scalebox{1}[-1]{\lower\@tempdima\box
\tw@}}}%
    {\ooalign{\box\tw@ \cr \box\z@}}}
\makeatother

% \mathraisebox{voffset}[height][depth]{something}
\makeatletter
\NewDocumentCommand\mathraisebox{moom}{%
\IfNoValueTF{#2}{\def\@temp##1##2{\raisebox{#1}{$\m@th##1##2$}}}{%
\IfNoValueTF{#3}{\def\@temp##1##2{\raisebox{#1}[#2]{$\m@th##1##2$}}%
}{\def\@temp##1##2{\raisebox{#1}[#2][#3]{$\m@th##1##2$}}}}%
\mathpalette\@temp{#4}}
\makeatletter

% udots (taken from yhmath)
\makeatletter
\def\udots{\mathinner{\mkern2mu\raise\p@\hbox{.}
\mkern2mu\raise4\p@\hbox{.}\mkern1mu
\raise7\p@\vbox{\kern7\p@\hbox{.}}\mkern1mu}}
\makeatother

%% Fix array
\newcommand{\itexarray}[1]{\begin{matrix}#1\end{matrix}}
%% \itexnum is a noop
\newcommand{\itexnum}[1]{#1}

%% Renaming existing commands
\newcommand{\underoverset}[3]{\underset{#1}{\overset{#2}{#3}}}
\newcommand{\widevec}{\overrightarrow}
\newcommand{\darr}{\downarrow}
\newcommand{\nearr}{\nearrow}
\newcommand{\nwarr}{\nwarrow}
\newcommand{\searr}{\searrow}
\newcommand{\swarr}{\swarrow}
\newcommand{\curvearrowbotright}{\curvearrowright}
\newcommand{\uparr}{\uparrow}
\newcommand{\downuparrow}{\updownarrow}
\newcommand{\duparr}{\updownarrow}
\newcommand{\updarr}{\updownarrow}
\newcommand{\gt}{>}
\newcommand{\lt}{<}
\newcommand{\map}{\mapsto}
\newcommand{\embedsin}{\hookrightarrow}
\newcommand{\Alpha}{A}
\newcommand{\Beta}{B}
\newcommand{\Zeta}{Z}
\newcommand{\Eta}{H}
\newcommand{\Iota}{I}
\newcommand{\Kappa}{K}
\newcommand{\Mu}{M}
\newcommand{\Nu}{N}
\newcommand{\Rho}{P}
\newcommand{\Tau}{T}
\newcommand{\Upsi}{\Upsilon}
\newcommand{\omicron}{o}
\newcommand{\lang}{\langle}
\newcommand{\rang}{\rangle}
\newcommand{\Union}{\bigcup}
\newcommand{\Intersection}{\bigcap}
\newcommand{\Oplus}{\bigoplus}
\newcommand{\Otimes}{\bigotimes}
\newcommand{\Wedge}{\bigwedge}
\newcommand{\Vee}{\bigvee}
\newcommand{\coproduct}{\coprod}
\newcommand{\product}{\prod}
\newcommand{\closure}{\overline}
\newcommand{\integral}{\int}
\newcommand{\doubleintegral}{\iint}
\newcommand{\tripleintegral}{\iiint}
\newcommand{\quadrupleintegral}{\iiiint}
\newcommand{\conint}{\oint}
\newcommand{\contourintegral}{\oint}
\newcommand{\infinity}{\infty}
\newcommand{\bottom}{\bot}
\newcommand{\minusb}{\boxminus}
\newcommand{\plusb}{\boxplus}
\newcommand{\timesb}{\boxtimes}
\newcommand{\intersection}{\cap}
\newcommand{\union}{\cup}
\newcommand{\Del}{\nabla}
\newcommand{\odash}{\circleddash}
\newcommand{\negspace}{\!}
\newcommand{\widebar}{\overline}
\newcommand{\textsize}{\normalsize}
\renewcommand{\scriptsize}{\scriptstyle}
\newcommand{\scriptscriptsize}{\scriptscriptstyle}
\newcommand{\mathfr}{\mathfrak}
\newcommand{\statusline}[2]{#2}
\newcommand{\tooltip}[2]{#2}
\newcommand{\toggle}[2]{#2}

% Theorem Environments
\theoremstyle{plain}
\newtheorem{theorem}{Theorem}
\newtheorem{lemma}{Lemma}
\newtheorem{prop}{Proposition}
\newtheorem{cor}{Corollary}
\newtheorem*{utheorem}{Theorem}
\newtheorem*{ulemma}{Lemma}
\newtheorem*{uprop}{Proposition}
\newtheorem*{ucor}{Corollary}
\theoremstyle{definition}
\newtheorem{defn}{Definition}
\newtheorem{example}{Example}
\newtheorem*{udefn}{Definition}
\newtheorem*{uexample}{Example}
\theoremstyle{remark}
\newtheorem{remark}{Remark}
\newtheorem{note}{Note}
\newtheorem*{uremark}{Remark}
\newtheorem*{unote}{Note}

%-------------------------------------------------------------------

\begin{document}

%-------------------------------------------------------------------


\section*{propagating flow}

[[!redirects propagating flows]]

\hypertarget{context}{}\subsubsection*{{Context}}\label{context}

\hypertarget{mapping_space}{}\paragraph*{{Mapping space}}\label{mapping_space}

[[!include mapping space - contents]]

\hypertarget{contents}{}\section*{{Contents}}\label{contents}

\noindent\hyperlink{idea}{Idea}\dotfill \pageref*{idea} \linebreak
\noindent\hyperlink{definition}{Definition}\dotfill \pageref*{definition} \linebreak
\noindent\hyperlink{construction}{Construction}\dotfill \pageref*{construction} \linebreak
\noindent\hyperlink{references}{References}\dotfill \pageref*{references} \linebreak


\hypertarget{idea}{}\subsection*{{Idea}}\label{idea}

[[smooth mapping space|Smooth mapping spaces]] are very nice examples of [[infinite dimensional smooth manifolds]]. One reason for their nice behaviour is that it is often possible to use the structure of the [[target space]] (a finite [[dimension]]al [[manifold]]) to study the mapping space. This provides a route from finite dimensional [[differential topology]] to that of infinite dimensions. It is usually the case that one needs stronger structure on the target space to do this than would be needed just for the finite dimensional result, but as the target space is a finite dimensional manifold that stronger structure is usually there anyway.

An example of this is the concept of a [[tubular neighbourhood]] of an [[embedding]]. As shown at [[A Not-So-Nice Submanifold]], not all embeddings of infinite dimensional manifolds - even of mapping spaces - admit tubular neighbourhoods. However, if the embedding is of a coincidental nature then it is possible to use structure on the target manifold to find tubular neighbourhoods in infinite dimensions.

By ``coincidental nature'', we mean that the submanifold is defined by taking those smooth maps with some condition imposed that says that certain ``coincidences'' happen. That is, that the values of the map at certain points coincide, or are constrained to lie in some submanifold of the target space.

Let us consider, for an example, the simplest case: the inclusion of based loops in [[smooth loop space|smooth loops]]. So let $M$ be a smooth finite dimensional manifold, $L M$ its smooth [[free loop space]] and $\Omega M$ its smooth [[based loop space]]. Let $x_0$ be the basepoint of $M$, and $1$ the basepoint of the [[circle]], $S^1$. To get a tubular neighbourhood of this, we need to start by finding a suitable neighbourhood. To do this, we choose a [[chart]] $\phi \colon \mathbb{R}^n \to U \subseteq M$ at $x_0$ (so that $\phi(0) = x_0$). We define the neighbourhood of $\Omega M$ to be those loops $\alpha \in L M$ such that $\alpha(1) \in U$. To make this a \emph{tubular} neighbourhood, we need to find a way to project these loops on to $\Omega M$. That is, given a loop $\alpha \colon S^1 \to M$ with $\alpha(1) \in U$ we need to produce a loop $\pi(\alpha) \colon S^1 \to M$ with $\pi(\alpha)(1) = x_0$. It is obvious how to move the basepoint: simply scale it to $x_0$ using the scalar multiplication coming from the chart. However, that just moves $\alpha(1)$. We need to move the whole of $\alpha$ with it - or at least, drag that part of it near $1$. We cannot assume that all of $\alpha$ lies in $U$. The solution is to define a diffeomorphism $\Psi$ of $M$ with the property that $\Psi(\alpha(1)) = x_0$. Then we can define $\pi(\alpha) = \Psi \circ \alpha$. As we vary $\alpha$, so we also vary $\alpha(1)$, and thus must vary the diffeomorphism $\Psi$. The trick is to choose $\Psi$ so that it varies smoothly with $\alpha(1)$.

In the above example, this is straightforward because everything happens in the chart, and thus effectively on $\mathbb{R}^n$. There are more complicated examples. One such is the basic construction in [[string topology]]. Within $L M \times L M$ we consider those pairs of loops $(\alpha,\beta)$ such that $\alpha(1) = \beta(1)$. Then for $(\alpha,\beta)$ with $\alpha(1)$ \emph{near} to $\beta(1)$ we want to project the pair $(\alpha,\beta)$ to a pair where these values coincide. Now although the points $\alpha(1)$ and $\beta(1)$ are near (in some vague not-yet-defined sense), they may, as a pair, roam all over the manifold. Thus local solutions are not applicable here. Nonetheless, the question still comes down to the ability to choose diffeomorphisms consistently according to some conditions.

\hypertarget{definition}{}\subsection*{{Definition}}\label{definition}

One way to choose these diffeomorphisms is to use the notion of a \textbf{propagating flow}. The term was coined by [[Veronique Godin]] in (\hyperlink{Godin}{Godin, 07}) and is based on an idea due to [[Andrew Stacey]] in (\hyperlink{Stacey}{Stacey, 05}), though there are probably antecedents. The basic idea is contained in the following definition.

\begin{definition}
\label{propflow}\hypertarget{propflow}{}
Let $\pi \colon E \to M$ be a [[vector bundle]] over a [[smooth manifold]]. Everything here is assumed to be finite dimensional. We consider the space $Diff_{fc}(E)$ of [[diffeomorphisms]] of $E$ which preserve the [[fibres]] of $E$ and have [[compact support]]. A \textbf{propagating flow} is a [[smooth map]]

\begin{displaymath}
\phi \colon E \to Diff_{fc}(E)
\end{displaymath}
with the property that

\begin{displaymath}
\phi(v) : v \mapsto \pi(v)
\end{displaymath}
where we identify $\pi(v)$ with the zero vector in the corresponding fibre of $E$.

\end{definition}
\hypertarget{construction}{}\subsection*{{Construction}}\label{construction}

The original definition of a propagating flow in \hyperlink{Stacey}{Stacey, 05} and \hyperlink{Godin}{Godin, 07} used the exponentiation map from vector fields to diffeomorphisms to get the actual diffeomorphism. The idea of that was that it is much easier to build a vector field with the required properties than a diffeomorphism because vector fields are more easily manipulated. But the diffeomorphisms used here are simple enough that they can be constructed directly. This makes it easier to generalise to situations where the exponentiation map cannot be assumed to exist.

Let us consider the linear situation first. We start with a vector space, $V$, and a vector $v \in V$. We want to define a diffeomorphism $\phi_v \colon V \to V$ with the property that $\phi_v(v) = 0$. This is simple enough:

\begin{displaymath}
\phi_1(w) = w - v.
\end{displaymath}
The problem with this is that we do not want just any diffeomorphism. We want one that is the identity ``near infinity''. Let us start by fixing the diffeomorphism in the $v$-direction.

Choose a smooth function $\sigma \colon \mathbb{R} \to [-1,0]$ with the following properties:

\begin{enumerate}%
\item $\sigma(t) = \begin{cases} 0 & t \le -2 \\ - 1 & 0 \le t \le 1 \\ 0 & 2 \le t \end{cases}$
\item $\sigma'(t) \gt -1$ (note that this is possible as we have given ourselves an interval of length $2$ to get from $0$ at $t = -2$ to $-1$ at $t = 0$.

\end{enumerate}
We are actually interested in the function $t \mapsto t + h \sigma(t)$ for $|h| \le 1$. The first property of $\sigma$ tells us that this agrees with the identity outside $[-2,2]$ and that it is $t \mapsto t - h$ on $[0,1]$. The second property tells us that its derivative is strictly bigger than $1 - h$ and so, for $h \le 1$, is a diffeomorphism.

On $V$, we choose a ``dual functional'' to $v$. That is, we choose some continuous linear functional $f \colon V \to \mathbb{R}$ with $f(v) = 1$ (we need to assume that $v \ne 0$ for this part, we shall correct for that later). Then we define a diffeomorphism on $V$ by:

\begin{displaymath}
\phi_2(w) = w + \sigma(f(w))v =  (w - f(w)v) + (f(w) + \sigma(f(w)))v.
\end{displaymath}
The second expression shows that what we have done is used $f$ to identify $V$ with $\ker f \oplus \mathbb{R}$ and then applied $t \mapsto t + \sigma(t)$ on the $\mathbb{R}$-factor.

This fixes our diffeomorphism in the $v$-direction. To fix it in the other direction, we choose a smooth function $\widehat{\tau} \colon \ker f \to [0,1]$ which is $0$ ``near infinity'' and $1$ at $0$. Then we mix this in to the above as follows:

\begin{displaymath}
\phi_3(w) = w + \widehat{\tau}(w - f(w)v) \sigma(f(w))v = (w - f(w)v) + (f(w) + \widehat{\tau}(w - f(w)v) \sigma(f(w)) v.
\end{displaymath}
As before, the second expression makes it clear that this is a diffeomorphism. When $\widehat{\tau}(w - f(w)v) = 0$ then it is the identity.

This will do, but there are a few too many choices in the above. To simplify these, we assume that $V$ admits a smooth inner product, $g$. Let us write $q$ for the square of the associated norm. Then we can choose $f$ to be evaluation of the inner product at $v$ and $\tau$ to be composition of the inner product with a suitable bump function on $\mathbb{R}$. We shall write $\tau$ for that bump function. To make the final formula cleaner, we assume that $\tau(t) = 1$ for $|t| \le 2$. This leads us to:

\begin{displaymath}
\begin{aligned}
\phi_v(w) &= w + \tau\left(\frac{q(w)}{1 + q(v)}\right) \sigma\left(\frac{g(w,v)}{q(v)}\right) v
&= w - \frac{g(w,v)}{q(v)}v + \left(\frac{g(w,v)}{q(v)} + \tau\left(\frac{q(w)}{q(v)}\right) \sigma\left(\frac{g(w,v)}{q(v)}\right) \right)v.
\end{aligned}
\end{displaymath}
As written, this makes sense only for $v \ne 0$. But it extends to the identity at $v = 0$. To see that this extension is smooth, we need merely point out that as $v \to 0$, so $q(v) \to 0$ and thus $\sigma\left(\frac{g(w,v)}{q(v)}\right) \to 0$. The second expression again shows that, for $v \ne 0$, this is a diffeomorphism.

This, then, is our required linear diffeomorphism. For $w$ with $q(w) \ge 2(1 + q(v))$ it is the identity, and thus will extend ``at infinity'', whilst $\phi_v(v) = 0$.

The next step is to extend this to a bundle over a manifold. So let $\pi \colon E \to M$ be a smooth vector bundle over a smooth manifold. We wish to extend the above formula so that it is valid for $E$. That is, $v$ is an arbitrary point in $E$ and we wish to define $\phi_v \colon E \to E$ such that $\phi_v(v) = 0_{\pi(v)}$. So also we must take $w$ to be an arbitrary point in $E$. And thereby lies the problem: in the formula $v$ and $w$ interact but they may be in different fibres. The solution is to extend one of them to a vector field. Since $v$ is static in the formula for $\phi_v$, that is the obvious choice.

We should also note that the explicit formula requires the existence of a smooth [[orthogonal structure]] on $E$.

Thus we want to define a smooth function $X \colon E \to \Gamma(E)$ with the property that $X_v(\pi(v)) = v$. This is easy if $E$ is trivial, and the condition is convex, so a standard [[partition of unity]] argument will suffice. Specifically, let $\{\rho_\lambda : \lambda \in \Lambda\}$ be a partition of unity on $M$ with the property that for each $\lambda \in \lambda$ there is an open set $U_\lambda$ containing the support of $\rho_\lambda$ over which $E$ is trivial. Let $E_\lambda$ denote the restriction of $E$ to $U_\lambda$ and let $\psi_\lambda \colon E_\lambda \to U_\lambda \times V$ be a trivialisation. Let $p_\lambda \colon E_\lambda \to V$ be the composition of this trivialisation with the projection on to the $V$-factor. We define $X_\lambda \colon E_\lambda \to \Gamma(E_\lambda)$ by

\begin{displaymath}
X_{\lambda,v}(p) = \psi_\lambda^{-1}(p,p_\lambda(v)).
\end{displaymath}
Now we define $X \colon E \to \Gamma(E)$ by

\begin{displaymath}
X_v(p) = \sum_\lambda \rho_\lambda(p) X_{\lambda,v}(p).
\end{displaymath}
Notice that $X_v(p) = 0$ if $p$ is ``sufficiently far'' from $\pi(v)$.

Thus our diffeomorphism $\phi_v$ at $w$, with $p = \pi(w)$, is:

\begin{displaymath}
\phi_v(w) = \begin{cases} w + \tau\left(\frac{q(w)}{1 + q(X_v(p))}\right) \sigma \left(\frac{g(w,X_v(p))}{q(X_v(p))}\right) X_v(p) & X_v(p) \ne 0 \\
w & X_v(p) = 0 \end{cases}.
\end{displaymath}
\hypertarget{references}{}\subsection*{{References}}\label{references}

The idea goes back to

\begin{itemize}%
\item [[Andrew Stacey]], \emph{The differential topology of smooth loops} (\href{http://arxiv.org/abs/math/0510097}{arXiv:math/0510097})

\end{itemize}
The term \emph{propagating flow} was coined in

\begin{itemize}%
\item [[Veronique Godin]], \emph{Higher string topology operations} (2007)(\href{http://arxiv.org/abs/0711.4859}{arXiv:0711.4859})

\end{itemize}
and used for the construction of [[umkehr maps]] to construct [[string topology]] operations.



\end{document}