Positive invariant contact representative from signed dividing data
ProvedContactTopology.positive_invariant_contact_representative_of_signed_dividing_dataLet be compact, let be smooth, and let be a smooth signed function specifying the proposed dividing set and positive/negative regions. Set
Suppose, on , that wherever , and that the directed foliation crosses the proposed dividing set in the required direction:
Then there is a globally smooth function with exactly the same zero set and sign as , and an open neighborhood of , such that
Consequently is an actual positive, vertically invariant contact form on . Its central characteristic foliation is the one represented by , and its normal coefficient vanishes exactly on the prescribed set. The function is constructed; its existence is not an input hypothesis.
These are the signed divergence and crossing conditions in the local normal-coefficient construction for divided foliations. When a directing field is given relative to a positive area density, multiplying it by that density yields the displayed Euclidean pair without changing the relevant signs.
The theorem assumes that a compatible global smooth signed function and the smooth planar coefficients have been supplied. It does not construct those data from an abstract embedded dividing multicurve, prove global contact positivity on the entire plane, or establish curved-chart transfer or the full Giroux flexibility theorem. It supplies the positive contact representative near the specified compact set from the explicit signed data.
import Mathlib open scoped ContDiff
theorem ContactTopology.positive_invariant_contact_representative_of_signed_dividing_data
(S : Set (Fin 2 → ℝ)) (hS : IsCompact S)
(r : (Fin 2 → ℝ) → ℝ) (β : (Fin 2 → ℝ) → (Fin 2 → ℝ))
(hr : ContDiff ℝ ∞ r) (hβ : ContDiff ℝ ∞ β)
(hdiv : ∀ x ∈ S, r x ≠ 0 →
0 < r x*(fderiv ℝ β x (Pi.single 0 1) 1-fderiv ℝ β x (Pi.single 1 1) 0))
(hcross : ∀ x ∈ S, r x = 0 → fderiv ℝ r x ![β x 1,-β x 0] < 0) :
∃ u : (Fin 2 → ℝ) → ℝ, ContDiff ℝ ∞ u ∧ (∀ x, u x = 0 ↔ r x = 0) ∧
(∀ x, r x ≠ 0 → 0 < u x*r x) ∧
∃ O : Set (Fin 2 → ℝ), IsOpen O ∧ S ⊆ O ∧
∀ x ∈ O, 0 < β 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) := by sorry