Foliation realization in a globally invariant contact collar
ProvedContactTopology.global_invariant_collar_foliation_realizationLet and be smooth. Suppose the two invariant forms
are positive contact forms on , and outside a compact set . In coordinates , positivity means
Then there is a smooth ambient isotopy of , with a jointly smooth inverse family , a compact set outside which is the identity, and jointly smooth positive functions , such that and
For every point with , both and keep the horizontal coordinates fixed. These families extend smoothly to all real times.
Thus embeds the invariant unit collar for into the original contact space . Its central plane has the characteristic foliation prescribed by , with the dividing locus tracked by .
This statement concerns a globally invariant product model. It gives no prescribed bound on the size of or on the image of the collar. In particular, it is not a realization theorem inside an arbitrarily small given neighborhood, and it does not establish bypass existence or tight-solid-torus classification.
import Mathlib open Set Function open scoped ContDiff
theorem ContactTopology.global_invariant_collar_foliation_realization
(u : (Fin 2 → ℝ) → ℝ) (β₀ β₁ : (Fin 2 → ℝ) → (Fin 2 → ℝ))
(hu : ContDiff ℝ ∞ u) (h₀ : ContDiff ℝ ∞ β₀) (h₁ : ContDiff ℝ ∞ β₁)
(K : Set (Fin 2 → ℝ)) (hK : IsCompact K)
(heq : ∀ x, x ∉ K → β₁ x = β₀ x) :
let Q : (((Fin 2 → ℝ) → (Fin 2 → ℝ))) → (Fin 2 → ℝ) → ℝ := fun β x =>
β x 0*fderiv ℝ u x (Pi.single 1 1)-β x 1*fderiv ℝ u x (Pi.single 0 1)+
u x*(fderiv ℝ β x (Pi.single 0 1) 1-fderiv ℝ β x (Pi.single 1 1) 0)
let I : (((Fin 2 → ℝ) → (Fin 2 → ℝ))) → (Fin 3 → ℝ) → (Fin 3 → ℝ) :=
fun β y => ![β ![y 0,y 1] 0,β ![y 0,y 1] 1,u ![y 0,y 1]]
let B : (Fin 3 → ℝ) → (Fin 3 → ℝ) → ℝ := fun a v => a 0*v 0+a 1*v 1+a 2*v 2
(∀ x, 0 < Q β₀ x) → (∀ x, 0 < Q β₁ x) →
∃ H G : ℝ → (Fin 3 → ℝ) → (Fin 3 → ℝ), ∃ σ : ℝ → (Fin 3 → ℝ) → ℝ,
∃ C : Set (Fin 3 → ℝ),
ContDiff ℝ ∞ (fun p : ℝ × (Fin 3 → ℝ) => H p.1 p.2) ∧
ContDiff ℝ ∞ (fun p : ℝ × (Fin 3 → ℝ) => G p.1 p.2) ∧
ContDiff ℝ ∞ (fun p : ℝ × (Fin 3 → ℝ) => σ p.1 p.2) ∧
IsCompact C ∧ (∀ y, H 0 y = y) ∧
(∀ t y, H t (G t y) = y) ∧ (∀ t y, G t (H t y) = y) ∧
(∀ t y, y ∉ C → H t y = y) ∧ (∀ t y, 0 < σ t y) ∧
(∀ t y, u ![y 0,y 1] = 0 →
(H t y 0 = y 0 ∧ H t y 1 = y 1) ∧ (G t y 0 = y 0 ∧ G t y 1 = y 1)) ∧
∀ y, |y 2| ≤ 1 → ∀ v,
B (I β₀ (H 1 y)) (fderiv ℝ (H 1) y v) = σ 1 y*B (I β₁ y) v := by sorry