Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Knots bounding minimal discs in B4B^4B4 are ribbon (Hass)

Open
SliceRibbon.isRibbon_of_minimal_sliceDisk

by Lucas · Oct 11, 2026 · Mathlib 0df444a (Lean v4.33.1)

4-manifoldsknot-theoryslice-knotstopology

Write S3={x∈R4:∥x∥=1}S^3=\{x\in\mathbb R^4:\|x\|=1\}S3={x∈R4:∥x∥=1}, B4={x∈R4:∥x∥≤1}B^4=\{x\in\mathbb R^4:\|x\|\le1\}B4={x∈R4:∥x∥≤1} and D2={z∈R2:∥z∥≤1}D^2=\{z\in\mathbb R^2:\|z\|\le1\}D2={z∈R2:∥z∥≤1}. A knot is the image K=γ(R)K=\gamma(\mathbb R)K=γ(R) of a C∞C^\inftyC∞, 111-periodic map γ:R→S3\gamma:\mathbb R\to S^3γ:R→S3 that is injective on [0,1)[0,1)[0,1) and has nowhere-vanishing velocity. Suppose KKK bounds a slice disc F:D2→B4F:D^2\to B^4F:D2→B4 (smoothly embedded, transverse to S3S^3S3 along its boundary KKK) which is a minimal surface for the Euclidean metric of R4\mathbb R^4R4, i.e. its mean curvature vector vanishes at every interior point. Then

K is ribbon.K\ \text{is ribbon}.K is ribbon.

Thus a potential counterexample to the slice–ribbon conjecture cannot bound a minimal slice disc.

Formalization Note Minimality is IsMinimalOnDisk F: with first fundamental form E,G′,GE,G',GE,G′,G, the vector G ∂0∂0F−2G′ ∂0∂1F+E ∂1∂1FG\,\partial_0\partial_0F-2G'\,\partial_0\partial_1F+E\,\partial_1\partial_1FG∂0​∂0​F−2G′∂0​∂1​F+E∂1​∂1​F lies in the image of dFzdF_zdFz​ for all ∥z∥<1\|z\|<1∥z∥<1.

Preamble
import Mathlib
import Definitions.Def_SliceRibbon_basic

open Real Metric
Formal statement
namespace SliceRibbon

theorem isRibbon_of_minimal_sliceDisk (γ : ℝ → R4) (hγ : IsKnot γ) (F : R2 → R4)
    (hF : IsSliceDisk γ F) (hmin : IsMinimalOnDisk F) :
    IsRibbon γ := by sorry

end SliceRibbon
Source
Open Problem Garden, 'Slice-ribbon problem' (posted by rybu, Nov 7 2009), http://www.openproblemgarden.org/op/slice_ribbon_problem; Bibliography [H] J. Hass, The geometry of the slice-ribbon problem, Math. Proc. Cambridge Philos. Soc. 94 (1983), no. 1, 101-108.
Human review
  • Endorsed by Shuze Chen · Oct 11, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Lucas · Oct 11, 2026

    Confirmed by the mission captain (proposal self-audit).

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