M2.1 7 min read Oct 2026

M2.1 From One Leaf to a Cloud: Flow Maps and Pushforwards

Builds on2 notes

A thousand leaves

M2.0 followed one leaf: the velocity field and initial position determine its endpoint.

Now scatter a thousand leaves beneath a bridge, densely near the center and sparsely near the edges. Where will they concentrate a minute later?

All follow the same field, but faster flow stretches the cloud and converging flow compresses it. Can the map from starting points to endpoints determine the transported density? We now follow a distribution.

DiscussionQ1

What mathematical objects describe the initial and final clouds? How do they relate to one endpoint x(60)x(60)?

Show the reasoning

The thousand positions are samples. Their initial density p0p_0 describes the probability of landing at each location.

The initial position is a random variable X0∼p0X_0\sim p_0; the leaves are independent samples.

Each subsequent trajectory is deterministic. Package the ODE solution into a function:

Φt(x0)=the position reached from x0 under v at time t.\Phi_t(x_0)=\text{the position reached from }x_0\text{ under }v\text{ at time }t.

The flow map Φt:Rd→Rd\Phi_t:\mathbb R^d\to\mathbb R^d records the endpoint for every starting point, rather than a single trajectory.

The final cloud has the law ptp_t of Xt=Φt(X0)X_t=\Phi_t(X_0). Previously we evaluated one input; now we transport the whole distribution. This pushforward is written pt=(Φt)#p0p_t=(\Phi_t)_\#p_0.

Deforming jelly

Imagine the cloud as soft jelly. Faster flow ahead stretches it, spreading the same leaves over more area. Converging flow compresses it and raises density.

Under a regular, uniquely solvable flow, distinct starting points cannot merge, and continuous dependence prevents tearing. Each transported piece keeps its probability mass while its volume changes. Density changes inversely with local volume.

A flow map stretches and compresses a cloud of leaves and its grid.

Each small piece retains its points; the Jacobian measures its volume change.

flow map、pushforward、change of variables

Flow-map properties. Assume existence and uniqueness, with solutions defined over the required forward and backward intervals. From M2.0:

  1. Φ0=id\Phi_0=\mathrm{id}. Continuous dependence bounds endpoint differences by eLte^{Lt} times the initial difference; see Grönwall’s inequality in M2.3.
  2. Invertibility: if Φt(a)=Φt(b)\Phi_t(a)=\Phi_t(b), backward uniqueness gives a=ba=b. The inverse follows the reversed field −v(x,t−s)-v(x,t-s) for tt time units. With sufficient smoothness, the map and inverse are differentiable: a diffeomorphism.
  3. For a time-independent field, Φs+t=Φs∘Φt\Phi_{s+t}=\Phi_s\circ\Phi_t.

Pushforward. For a measurable map Φ\Phi, the law Φ#p0\Phi_\#p_0 is obtained by sampling X0∼p0X_0\sim p_0 and applying Φ\Phi. For every measurable region AA:

(Φ#p0)(A)  =  p0(Φ−1(A))(\Phi_\#p_0)(A)\;=\;p_0\big(\Phi^{-1}(A)\big)

The probability of arriving in AA equals the probability of starting in its preimage. Invertibility is unnecessary.

Density by change of variables. Suppose p0p_0 has a density and Φt\Phi_t is a diffeomorphism with nonzero Jacobian determinant. Then:

pt(y)  =  p0(Φt−1(y))  ∣det⁡∇Φt−1(y)∣  =  p0(x)∣det⁡∇Φt(x)∣ ,x=Φt−1(y).p_t(y)\;=\;p_0\big(\Phi_t^{-1}(y)\big)\;\Big|\det\nabla\Phi_t^{-1}(y)\Big| \;=\;\frac{p_0(x)}{\big|\det\nabla\Phi_t(x)\big|}\,,\qquad x=\Phi_t^{-1}(y).

For a small box AA near yy, its preimage near xx has volume approximately ∣det⁡∇Φt−1(y)∣vol⁡(A)|\det\nabla\Phi_t^{-1}(y)|\operatorname{vol}(A). Equal probabilities give pt(y)vol⁡(A)≈p0(x)∣det⁡∇Φt−1(y)∣vol⁡(A)p_t(y)\operatorname{vol}(A)\approx p_0(x)|\det\nabla\Phi_t^{-1}(y)|\operatorname{vol}(A). Cancel the volume and take the local limit. □\square

The determinant ∣det⁡∇Φt∣|\det\nabla\Phi_t| is precisely the jelly’s local volume expansion factor.

DetailsA complete example: xdot = −x with a standard Gaussian start

The flow is Φ_t(x)=e^(−t)x, with inverse e^t y and inverse derivative e^t. Thus p_t(y)=p₀(e^t y)e^t=(2π)^(−1/2)e^t exp(−e^(2t)y²/2), the density of N(0,e^(−2t)). The cloud narrows toward zero. The factor e^t compensates for the shrinking width, keeping total probability one. The next note derives the same answer from a density equation.

What the intuition leaves out

Volume does not determine shape: a determinant-one shear changes a square into a parallelogram. For smooth flows, ∇⋅v=0\nabla\cdot v=0 preserves volume. In general, each material piece retains mass while its density varies inversely with volume.

A pushforward only requires a chosen measurable map. The single-inverse density formula needs stronger assumptions. A many-to-one map needs another treatment; collapsing positive mass to a point can produce an atom without an ordinary density. Nonunique ODEs require selecting a solution before defining a flow map.

Count leaves or evaluate a formula?

For a fixed region, the sampled proportion from NN independent particles has error typically O(N−1/2)O(N^{-1/2}). Histograms also introduce binning error. Change of variables avoids sampling error, but numerical inverse flows and Jacobians can still introduce error.

import numpy as np
t, N = 1.0, 1000
x0 = np.random.randn(N)
xt = np.exp(-t) * x0  # Exact flow for xdot = -x
ys = np.linspace(-2, 2, 200)
p_formula = np.exp(t) * np.exp(-(np.exp(t)*ys)**2/2) / np.sqrt(2*np.pi)
hist, edges = np.histogram(xt, bins=40, range=(-2, 2), density=True)
# Compare the histogram with p_formula; reduce N to 100 to see sampling noise.

Check your understanding

Check your understanding

An invertible geometric transformation warps a photograph’s coordinates. Which tool relates its original and transformed spatial densities?

Check your understanding

A chosen measurable map sends distinct starting points to the same endpoint. What follows?

Check your understanding

For v(x,y)=(−y,x)v(x,y)=(-y,x) and p0=N(0,I)p_0=\mathcal N(0,I), what is ptp_t?

References

  1. Hirsch, M. W., Smale, S., Devaney, R. L. Differential Equations, Dynamical Systems, and an Introduction to Chaos. Academic Press, 3rd ed., 2013.
  2. Villani, C. Topics in Optimal Transportation. AMS Graduate Studies in Mathematics 58, 2003.
  3. Grimmett, G., Stirzaker, D. Probability and Random Processes. Oxford University Press, 3rd ed., 2001.