Relative compactly supported contact embedding isotopy extension
ProvedContactTopology.relative_compact_contact_embedding_isotopy_extensionLet be a smooth contact form on , so that is nowhere zero. Let be open and let be a jointly smooth family, defined for every real parameter , such that and every is injective with injective derivative. Suppose there is a jointly smooth function , positive on , for which
Let be any set fixed pointwise by every , for all real . No closedness, compactness or openness of is assumed. Let be compact, and let be any open set containing the entire track .
There exist jointly smooth maps , a jointly smooth positive function , and a compact set such that
and, for every ,
In addition, for every and every real time . The inverse identities and common compact support hold for all real times. The contact and agreement conclusions are asserted on the unit interval.
This is relative compactly supported contact isotopy extension in Euclidean dimension three, with an explicit smooth inverse and support control in any prescribed neighborhood of the compact track. The embedding family is supplied as actual maps with pullback and derivative identities; the ambient contact isotopy is constructed. This statement does not assume an ambient extension and does not assert the general contact-manifold version or the Legendrian core classification.
import Mathlib open Set open scoped ContDiff
theorem ContactTopology.relative_compact_contact_embedding_isotopy_extension
(a : (Fin 3 → ℝ) → (Fin 3 → ℝ)) (ha : ContDiff ℝ ∞ a)
(g : ℝ → (Fin 3 → ℝ) → (Fin 3 → ℝ))
(hg : ContDiff ℝ ∞ (fun p : ℝ × (Fin 3 → ℝ) => g p.1 p.2))
(lam : ℝ → (Fin 3 → ℝ) → ℝ)
(hlam : ContDiff ℝ ∞ (fun p : ℝ × (Fin 3 → ℝ) => lam p.1 p.2))
(N : Set (Fin 3 → ℝ)) (hN : IsOpen N)
(hinj : ∀ s, InjOn (g s) N)
(hder : ∀ s x, x ∈ N → Function.Injective (fderiv ℝ (g s) x))
(h0 : ∀ x ∈ N, g 0 x=x)
(S : Set (Fin 3 → ℝ)) (hSN : S ⊆ N) (hstationary : ∀ s y, y ∈ S → g s y=y)
(K U : Set (Fin 3 → ℝ)) (hK : IsCompact K) (hKN : K ⊆ N) (hU : IsOpen U)
(htrack : ∀ s ∈ Icc (0:ℝ) 1, ∀ x ∈ K, g s x ∈ U) :
let B : (Fin 3 → ℝ) → (Fin 3 → ℝ) → ℝ := fun p v => p 0*v 0+p 1*v 1+p 2*v 2
let c : (Fin 3 → ℝ) → (Fin 3 → ℝ) := fun y =>
![fderiv ℝ a y (Pi.single 1 1) 2-fderiv ℝ a y (Pi.single 2 1) 1,
fderiv ℝ a y (Pi.single 2 1) 0-fderiv ℝ a y (Pi.single 0 1) 2,
fderiv ℝ a y (Pi.single 0 1) 1-fderiv ℝ a y (Pi.single 1 1) 0]
(∀ y, B (a y) (c y) ≠ 0) → (∀ s x, x ∈ N → 0 < lam s x) →
(∀ s x, x ∈ N → ∀ v, B (a (g s x)) (fderiv ℝ (g s) x v)=lam s x*B (a x) v) →
∃ ψ ρ : ℝ → (Fin 3 → ℝ) → (Fin 3 → ℝ), ∃ Λ : ℝ → (Fin 3 → ℝ) → ℝ,
∃ C : Set (Fin 3 → ℝ),
ContDiff ℝ ∞ (fun p : ℝ × (Fin 3 → ℝ) => ψ p.1 p.2) ∧
ContDiff ℝ ∞ (fun p : ℝ × (Fin 3 → ℝ) => ρ p.1 p.2) ∧
ContDiff ℝ ∞ (fun p : ℝ × (Fin 3 → ℝ) => Λ p.1 p.2) ∧
IsCompact C ∧ C ⊆ U ∧ (∀ y, ψ 0 y=y) ∧
(∀ t y, ρ t (ψ t y)=y) ∧ (∀ t y, ψ t (ρ t y)=y) ∧
(∀ t y, y ∉ C → ψ t y=y) ∧ (∀ t y, 0 < Λ t y) ∧
(∀ t ∈ Icc (0:ℝ) 1, ∀ y v, B (a (ψ t y)) (fderiv ℝ (ψ t) y v)=Λ t y*B (a y) v) ∧
(∀ t ∈ Icc (0:ℝ) 1, ∀ x ∈ K, ψ t x=g t x) ∧
∀ t y, y ∈ S → ψ t y=y := by sorry