Residue formula for the Gauss linking form: the boundary of a disk links a knot as often as small loops around the crossing points
ProvedHryniewiczCriterion.gaussLinkingIntegral_disk_eq_sum_small_loopsLet be on an open neighbourhood of the closed unit disk with on , and let be a loop of period . Suppose only for in a finite set of interior points of the disk, and let miss and . Then for all small
where is gaussLinkingIntegral (stereographic projection from ). No transversality or injectivity is needed.
This is the residue theorem for the closed -form on , where is the Biot–Savart (linking) form of : .
Suggested proof (homotopy only, no Stokes). Gauss integrals are invariant under homotopies of the first loop in (gaussIntegral_eq_of_homotopy). Choose a centre so that the points of lie on distinct rays from and work with graph loops ; move from to past one point at a time with flat bump functions. Two graph loops that differ only on a short parameter interval differ in Gauss integral by the integral over a closed loop around one point of (fixed-endpoint arc variations leave the partial Gauss integral unchanged), and that loop is homotopic to in . The constant loop at has Gauss integral .
import Definitions.Def_HryniewiczCriterion_GlobalSection import Definitions.Def_HryniewiczCriterion_SelfLinking open HryniewiczCriterion
theorem HryniewiczCriterion.gaussLinkingIntegral_disk_eq_sum_small_loops (E : Plane → R4) (U : Set Plane) (hU : IsOpen U) (hDU : closedUnitDisk ⊆ U)
(hE : ContDiffOn ℝ 2 E U) (hEunit : ∀ v ∈ closedUnitDisk, euclidNorm (E v) = 1)
(γ : ℝ → R4) (hγ : ContDiff ℝ 2 γ) (hγper : ∀ t, γ (t + 1) = γ t)
(hγunit : ∀ t, euclidNorm (γ t) = 1)
(Z : Finset Plane) (hZ : ∀ z ∈ Z, z ∈ openUnitDisk)
(hmiss : ∀ v ∈ closedUnitDisk, v ∉ Z → ∀ t, E v ≠ γ t)
(N : R4) (hN : euclidNorm N = 1) (hNγ : ∀ t, γ t ≠ N)
(hNE : ∀ v ∈ closedUnitDisk, E v ≠ N) :
∃ ρ₀ : ℝ, 0 < ρ₀ ∧ ∀ ρ : ℝ, 0 < ρ → ρ < ρ₀ →
gaussLinkingIntegral N (fun s => E (circlePoint s)) γ =
∑ z ∈ Z, gaussLinkingIntegral N (fun s => E (z + ρ • circlePoint s)) γ := by sorry