Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedprecheck pass
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

Compactness gives a compactly supported time-dependent velocity field

Statement

Assume ACω. Let M be a compact smooth manifold, N a smooth manifold, and let F:M×I→N be a smooth isotopy of embeddings that is constant near the ends: for some ε∈(0,12), F(x,t)=F(x,0) for all x and t≤ε, and F(x,t)=F(x,1) for all x and t≥1−ε. Let W⊆N be an open neighbourhood of the compact image F(M×I) with W‾ compact. Then there is a smooth horizontal map G:N×I→TN with G(y,t)∈TyN, whose time-first version H(t,y):=G(y,t) is a time-dependent vector field on N (Time-dependent vector fields and their evolution operators), such that:

  1. ⋃t∈Isupp⁡Gt is contained in a compact subset of W, where Gt=G(⋅,t); its closure is therefore compact;
  2. Gt(F(x,t))=∂tF(x,t) for every (x,t)∈M×I;
  3. Gt=0 for t≤ε/2 and for t≥1−ε/2.

Facts & Assumptions

Given: Countable choice, a compact M, a smooth isotopy F constant near the ends with parameter ε, a compact image F(M×I) and an open neighbourhood W of it with W‾ compact.

[F1]

The track S=F‾(M×I) is a compact closed smoothly embedded track in N×I, with time endpoint faces; the horizontal velocity Y is a smooth vector field along S with values in TN⊕0; the projection of S to N is the compact image F(M×I) (The velocity field of an isotopy extends to a neighbourhood, Smooth maps are continuous).

[L1]

Under ACω the velocity extends to a smooth horizontal map Y~:Ω→TN on an open neighbourhood Ω of S, and for every open neighbourhood of S such an extension exists with Ω inside it (The velocity field of an isotopy extends to a neighbourhood).

[L3]

A compact set inside an open set admits a smooth cutoff equal to one near that set, with support in the open set. On N×I take finitely many restricted Euclidean chart bumps as in The velocity field of an isotopy extends to a neighbourhood, step 1.1, equal to one on smaller chart neighbourhoods covering the compact set. Compose their sum with a smooth scalar function zero near zero and one above 1/2. This finite construction applies also at product corners. The boundaryless and boundary suppliers are A smooth Urysohn lemma for a closed set in an open set and Smooth partitions of unity exist on manifolds with boundary.

[L4]

A time-dependent vector field on N over I is a smooth map H:I×N→TN with H(t,y)∈TyN. Its space-first representation is G(y,t):=H(t,y), with slices Gt=H(t,⋅); supp⁡Gt is the support of the section Gt (Time-dependent vector fields and their evolution operators, Smooth sections, local sections, and support, Open cover, subcover, and compact topological space; a compact subset is a subspace that is compact in its own right).

[A1]

Countable choice is used exactly for the cutoffs and the partition-of-unity selections of [L1] and [L3]; no further selection is made (The Axiom of Countable Choice (ACω)).

Proof

technique · direct
1.1F1L2

A relatively compact neighbourhood of the track inside W×I: S is compact by [F1] and S⊆F(M×I)×I⊆W×I, which is open. Since N×I is locally compact Hausdorff and S is compact, [L2] applied at each point of S yields finitely many open sets with compact closure covering S and contained in W×I; their union Ω0 is an open neighbourhood of S with Ω0‾ compact and Ω0‾⊆W×I.

1.2L3A1

Choose a smooth cutoff ψ:N→[0,1] with ψ=1 on the compact image F(M×I) and supp⁡ψ⊆W by [L3], applied to the closed set F(M×I) inside the open set W; and choose a smooth function β:I→[0,1] with β=1 on [ε,1−ε] and β=0 on [0,ε/2]∪[1−ε/2,1], which exists by the smooth Urysohn lemma on the interval.

2.1L1L3step 1.1

Apply [L1] with the prescribed neighbourhood Ω0: there is an open neighbourhood Ω⊆Ω0 of S and a smooth horizontal Y~:Ω→TN extending Y. By [L3] applied to the closed set S inside the open set Ω, choose a smooth cutoff ρ:N×I→[0,1] with ρ=1 on a neighbourhood of S and supp⁡ρ⊆Ω.

3.1L1L4step 1.2step 2.1construct

Define G on Ω by G(y,t):=ρ(y,t) β(t) ψ(y) Y~(y,t), and define G:=0 on the complement of the closed set supp⁡(ρβψ)⊆Ω. The two definitions agree on the overlap, where ρβψ=0, so G is a well-defined smooth map on all of N×I: at a point outside supp⁡(ρβψ) it vanishes on a whole neighbourhood, and on Ω it is a product of smooth functions with the smooth map Y~. It lies in TyN at (y,t) by construction. Thus H:I×N→TN, H(t,y):=G(y,t), is smooth by composition with the factor-swap map and has H(t,y)∈TyN, so it is a time-dependent vector field on N by [L4], with slices Ht=Gt.

4.1F1step 1.2step 3.1

Clause 2: let (x,t)∈M×I. Since F‾(x,t)∈S and ρ=1 near S and ψ=1 on F(M×I), one has ρβψ Y~(F‾(x,t))=β(t) ∂tF(x,t). The isotopy is constant near the ends, so ∂tF(x,t)=0 for t≤ε and for t≥1−ε, while β=1 on [ε,1−ε]; in all cases β(t) ∂tF(x,t)=∂tF(x,t). Hence Gt(F(x,t))=∂tF(x,t).

4.2step 1.2step 3.1

Clause 3: for t≤ε/2 and for t≥1−ε/2 one has β(t)=0, so Gt=ρβψY~(⋅,t)=0 by step 3.1.

4.3L4step 1.1step 2.1step 3.1

Put K:=pr⁡N(supp⁡ρ). The support of ρ is closed and contained in the compact set Ω0‾, so it is compact, and its continuous projection K is compact and contained in W. Off K the field Gt vanishes for every t. Since K is closed, every supp⁡Gt lies in K. Thus their union and its closure lie in the compact subset K⊆W, proving clause 1. Containment alone would not prove that the union itself is closed.

5.1step 3.1step 4.1step 4.2step 4.3∎

Clauses 1, 2 and 3 are steps 4.3, 4.1 and 4.2; the field is smooth and horizontal, and countable choice was used only as declared in [A1].

Depends on

Used by

Dependency tree · two levels

61 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources