Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Ribbon knots are slice (Fox)

Open
SliceRibbon.ribbon_isSlice

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. If KKK bounds a ribbon disc in S3S^3S3 (an immersed disc with only ribbon singularities), then KKK bounds a smoothly embedded disc in B4B^4B4 meeting S3S^3S3 transversally exactly in KKK:

K ribbon ⟹ K slice.K\ \text{ribbon}\ \Longrightarrow\ K\ \text{slice}.K ribbon ⟹ K slice.

This is the known direction of the slice–ribbon problem; the conjecture asks for its converse.

Formalization Note IsRibbon γ → IsSlice γ for every γ with IsKnot γ.

Preamble
import Mathlib
import Definitions.Def_SliceRibbon_basic

open Real Metric
Formal statement
namespace SliceRibbon

theorem ribbon_isSlice (γ : ℝ → R4) (hγ : IsKnot γ) (hr : IsRibbon γ) :
    IsSlice γ := 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; [F] R. H. Fox, Some problems in knot theory, Topology of 3-manifolds and related topics (Proc. Univ. of Georgia Institute, 1961), 1962, pp. 168-176 (every ribbon knot is slice; the converse is asked).
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