Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Raising a graph loop over one puncture adds a small loop around it to the Gauss linking integral

Proved
HryniewiczCriterion.gaussLinkingIntegral_strip_bump_jump

by Mazecto · Oct 9, 2026 · Mathlib 0df444a (Lean v4.33.1)

dynamical-systemsgeometry-topologysymplectic-geometry

Setting. E:R2→R4E:\mathbb R^2\to\mathbb R^4E:R2→R4 is C2C^2C2 near the closed unit disk D‾\overline{\mathbb D}D with ∣E∣=1|E|=1∣E∣=1 on D‾\overline{\mathbb D}D; γ:R→S3\gamma:\mathbb R\to S^3γ:R→S3 is a C2C^2C2 loop of period 111 meeting E(D‾)E(\overline{\mathbb D})E(D) only over a finite set ZZZ; N∈S3N\in S^3N∈S3 misses γ\gammaγ and E(D‾)E(\overline{\mathbb D})E(D). For a centre c∈Dc\in\mathbb Dc∈D use strip coordinates Ψ(μ,s)=c+μ(∂(s)−c)\Psi(\mu,s)=c+\mu(\partial(s)-c)Ψ(μ,s)=c+μ(∂(s)−c), ∂(s)=(cos⁡2πs,sin⁡2πs)\partial(s)=(\cos2\pi s,\sin2\pi s)∂(s)=(cos2πs,sin2πs), and for a 111-periodic hhh with values in [0,1][0,1][0,1] the graph loop ℓh(s)=Ψ(h(s),s)\ell_h(s)=\Psi(h(s),s)ℓh​(s)=Ψ(h(s),s).

Statement. Let z=Ψ(a0,s0)z=\Psi(a_0,s_0)z=Ψ(a0​,s0​) and 0<δ<1/40<\delta<1/40<δ<1/4. Let g,bg,bg,b be C2C^2C2 and 111-periodic with g≥0g\ge0g≥0, b≥0b\ge0b≥0, g+b≤1g+b\le1g+b≤1, b=0b=0b=0 outside s0+(−δ,δ)+Zs_0+(-\delta,\delta)+\mathbb Zs0​+(−δ,δ)+Z, and g(s0)<a0<g(s0)+b(s0)g(s_0)<a_0<g(s_0)+b(s_0)g(s0​)<a0​<g(s0​)+b(s0​). Assume the only point of ZZZ in Ψ([0,1]×[s0−2δ,s0+2δ])\Psi([0,1]\times[s_0-2\delta,s_0+2\delta])Ψ([0,1]×[s0​−2δ,s0​+2δ]) is (possibly) zzz, and that ℓg,ℓg+b\ell_g,\ell_{g+b}ℓg​,ℓg+b​ miss ZZZ. Then for all small ρ>0\rho>0ρ>0

GaussN(E∘ℓg+b,γ)=GaussN(E∘ℓg,γ)+GaussN(E∘(z+ρ ∂),γ).\mathrm{Gauss}_N(E\circ\ell_{g+b},\gamma)=\mathrm{Gauss}_N(E\circ\ell_g,\gamma)+\mathrm{Gauss}_N\big(E\circ(z+\rho\,\partial),\gamma\big).GaussN​(E∘ℓg+b​,γ)=GaussN​(E∘ℓg​,γ)+GaussN​(E∘(z+ρ∂),γ).

Suggested proof (homotopies and a substitution only).

  1. Lens loop. With s(σ)=s0−δ′cos⁡2πσs(\sigma)=s_0-\delta'\cos2\pi\sigmas(σ)=s0​−δ′cos2πσ (δ<δ′<2δ\delta<\delta'<2\deltaδ<δ′<2δ, so b=0b=0b=0 near s0±δ′s_0\pm\delta's0​±δ′) let Λ(σ)=(g(s(σ))+χ(σ) b(s(σ)), s(σ))\Lambda(\sigma)=(g(s(\sigma))+\chi(\sigma)\,b(s(\sigma)),\,s(\sigma))Λ(σ)=(g(s(σ))+χ(σ)b(s(σ)),s(σ)) where χ\chiχ is the indicator of [0,12]+Z[0,\tfrac12]+\mathbb Z[0,21​]+Z; Λ\LambdaΛ is C2C^2C2 and 111-periodic. The outer Gauss integrand depends only on the point and the velocity of the loop and is linear in the velocity, so substituting s=s(σ)s=s(\sigma)s=s(σ) on each half gives Gauss(E∘Ψ∘Λ)=∫s0−δ′s0+δ′(fg+b−fg) ds=Gauss(E∘ℓg+b)−Gauss(E∘ℓg)\mathrm{Gauss}(E\circ\Psi\circ\Lambda)=\int_{s_0-\delta'}^{s_0+\delta'}(f_{g+b}-f_g)\,ds=\mathrm{Gauss}(E\circ\ell_{g+b})-\mathrm{Gauss}(E\circ\ell_g)Gauss(E∘Ψ∘Λ)=∫s0​−δ′s0​+δ′​(fg+b​−fg​)ds=Gauss(E∘ℓg+b​)−Gauss(E∘ℓg​), because ℓg+b=ℓg\ell_{g+b}=\ell_gℓg+b​=ℓg​ off the interval.
  2. Lens to ellipse. The straight-line homotopy (in the first coordinate only) from Λ\LambdaΛ to the ellipse (m+ηsin⁡2πσ, s(σ))(m+\eta\sin2\pi\sigma,\,s(\sigma))(m+ηsin2πσ,s(σ)), m±η=m\pm\eta=m±η= the values g(s0)+b(s0)g(s_0)+b(s_0)g(s0​)+b(s0​) and g(s0)g(s_0)g(s0​), stays in [0,1]×[s0−δ′,s0+δ′][0,1]\times[s_0-\delta',s_0+\delta'][0,1]×[s0​−δ′,s0​+δ′] and keeps the first coordinate >a0>a_0>a0​ at σ=14\sigma=\tfrac14σ=41​ and <a0<a_0<a0​ at σ=34\sigma=\tfrac34σ=43​, the only times with s=s0s=s_0s=s0​; so it misses zzz and, by hypothesis, all of ZZZ. Shrink the ellipse to one centred at (a0,s0)(a_0,s_0)(a0​,s0​) in the same way.
  3. Ellipse to round circle. det⁡DΨ(a0,s0)=2πa0(1−⟨c,∂(s0)⟩)>0\det D\Psi(a_0,s_0)=2\pi a_0(1-\langle c,\partial(s_0)\rangle)>0detDΨ(a0​,s0​)=2πa0​(1−⟨c,∂(s0​)⟩)>0; for a small ellipse Ψ((a0,s0)+rw(σ))\Psi((a_0,s_0)+r w(\sigma))Ψ((a0​,s0​)+rw(σ)) is homotopic to z+r DΨ w(σ)z+r\,D\Psi\, w(\sigma)z+rDΨw(σ) (Taylor, the error is O(r2)O(r^2)O(r2) against a lower bound ≥cr\ge cr≥cr), then within GL+(2)\mathrm{GL}^+(2)GL+(2) (write the linear loop as αe2πiσ+βe−2πiσ\alpha e^{2\pi i\sigma}+\beta e^{-2\pi i\sigma}αe2πiσ+βe−2πiσ with ∣α∣>∣β∣|\alpha|>|\beta|∣α∣>∣β∣, kill β\betaβ, rotate α\alphaα to ∣α∣|\alpha|∣α∣) to z+ρ ∂z+\rho\,\partialz+ρ∂, all inside a small punctured disk around zzz. Homotopy invariance of the Gauss integral (gaussLinkingIntegral_planar_homotopy) finishes the proof.
Preamble
import Definitions.Def_HryniewiczCriterion_GlobalSection
import Definitions.Def_HryniewiczCriterion_SelfLinking

open HryniewiczCriterion
Formal statement
theorem HryniewiczCriterion.gaussLinkingIntegral_strip_bump_jump (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) (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)
    (c : Plane) (hc : c ∈ openUnitDisk) (z : Plane) (a₀ s₀ δ : ℝ)
    (hz : z = c + a₀ • (circlePoint s₀ - c)) (hδ : 0 < δ) (hδ' : δ < 1 / 4)
    (g b : ℝ → ℝ) (hg : ContDiff ℝ 2 g) (hb : ContDiff ℝ 2 b)
    (hgper : ∀ s, g (s + 1) = g s) (hbper : ∀ s, b (s + 1) = b s)
    (hgb : ∀ s, 0 ≤ g s ∧ 0 ≤ b s ∧ g s + b s ≤ 1)
    (hbsupp : ∀ s, b s ≠ 0 → ∃ n : ℤ, |s - s₀ - n| < δ)
    (hlow : g s₀ < a₀) (hhigh : a₀ < g s₀ + b s₀)
    (hstrip : ∀ s μ : ℝ, |s - s₀| ≤ 2 * δ → 0 ≤ μ → μ ≤ 1 →
      c + μ • (circlePoint s - c) ∈ Z → c + μ • (circlePoint s - c) = z)
    (hgZ : ∀ s, c + g s • (circlePoint s - c) ∉ Z)
    (hgbZ : ∀ s, c + (g s + b s) • (circlePoint s - c) ∉ Z) :
    ∃ ρ₀ : ℝ, 0 < ρ₀ ∧ ∀ ρ : ℝ, 0 < ρ → ρ < ρ₀ →
      gaussLinkingIntegral N (fun s => E (c + (g s + b s) • (circlePoint s - c))) γ =
        gaussLinkingIntegral N (fun s => E (c + g s • (circlePoint s - c))) γ +
          gaussLinkingIntegral N (fun s => E (z + ρ • circlePoint s)) γ := by sorry
Source
Residue formula for the Gauss linking integral (homological invariance), e.g. D. Rolfsen, Knots and Links, Publish or Perish 1976, Ch. 5D

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me