Flow of a vector field

There is a better approach in @lee2013smooth page 314.
(I have to fix the notation)
What follows is from @warner prop 1.48:
Related: flow of a non-autonomous vector field

Given a vector field, we have a local group of transformations ϕt associated to it. The existence is guaranteed by the following theorem:

Flow theorem

Proposition
Let X be a vector field on a manifold M. For each p∈M, there exist a(p),b(p)∈R∪{±∞} and a differentiable curve

γp:(a(p),b(p))⟶M

such that:

  1. 0∈(a(p),b(p)) and γp(0)=p
  2. γp is an integral curve of X (i.e. d(γp)s(ddt)=X(γp(s)))
  3. Uniqueness: If μ:(c,d)⟶M is another curve satisfying the above conditions, then (c,d)⊆(a(p),b(p)) and γp|(c,d)=μ.
  4. For each t∈R, we define a transformation Xt with domain Dt={q∈M:t∈(a(q),b(q))} by the expression Xt(q)=γq(t), so that for each p∈M, there exists an open neighborhood V and an ϵ>0 such that the map
(t,q)⟶Xt(q)

is defined on (ϵ,ϵ)×V. This transformation is called the flow of X and is usually denoted by ϕX(t,q).
5. Dt is open for each t.
6. ⋃t>0Dt=M.
7. Xt:Dt⟶D−t is a diffeomorphism with inverse X−t.
8. Let s,t∈R. The domain of Xs∘Xt is contained in Dt+s (but in general, it is not equal to Dt+s). It is equal to Dt+s if s and t have the same sign. Moreover, in the domain of Xs∘Xt, we have Xs∘Xt=Xt+s. Therefore, we have a local group of transformations.

Important facts

Flow of the sum

See flow of the sum of two vector fields

Flow of the Lie bracket

See Lie bracket#Useful formula.

Re-scaling of the flow

Proposition
Let X be a vector field, and k a constant. Let's denote ϕX and ϕkX the flow of X and kX respectively. It is satisfied that:

ϕkX(t,q)=ϕX(kt,q).

Proof
We only have to check that ϕ^(t,q)=ϕX(kt,q) satisfies 1. and 2. for the vector field kX, and then we will have the result. In fact:

  1. ϕ^(0,q)=ϕX(0,q)=q.
  2. ϕ^(t,q) are integral curves of kX:
ddtϕ^(t,q)=ddtϕX(kt,q)=kXϕX(kt,q)

◼

Jacobian of the flow

See Jacobian of the flow: first the Jacobian matrix d(ϕt)x, then the formula for its determinant.