Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Smooth Schoenflies theorem for S2⊂S3S^2\subset S^3S2⊂S3 (Alexander)

Open
SmoothSchoenflies.smooth_schoenflies_dim_three

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

4-manifoldsdifferential-topologyschoenfliestopology

Let Sn={x∈Rn+1:∥x∥=1}S^n=\{x\in\mathbb R^{n+1}:\|x\|=1\}Sn={x∈Rn+1:∥x∥=1} be the unit sphere with its standard smooth structure and Dn+1={x∈Rn+1:∥x∥≤1}D^{n+1}=\{x\in\mathbb R^{n+1}:\|x\|\le 1\}Dn+1={x∈Rn+1:∥x∥≤1} the closed unit ball. Let f:S2→S3f:S^2\to S^3f:S2→S3 be a smooth embedding and x∈S3∖f(S2)x\in S^3\setminus f(S^2)x∈S3∖f(S2), with CxC_xCx​ the component of S3∖f(S2)S^3\setminus f(S^2)S3∖f(S2) containing xxx. Then

Cx‾ is diffeomorphic to D3.\overline{C_x}\ \text{is diffeomorphic to}\ D^3.Cx​​ is diffeomorphic to D3.

This is Alexander's theorem, the case n=2n=2n=2 of the statement that every smooth Sn⊂Sn+1S^n\subset S^{n+1}Sn⊂Sn+1 is unknotted.

Formalization Note 'Diffeomorphic to D3D^3D3' is IsSmoothClosedBallIn 2.

Preamble
import Mathlib
import Definitions.Def_SmoothSchoenflies_basic

open Manifold Metric
Formal statement
namespace SmoothSchoenflies

theorem smooth_schoenflies_dim_three (f : Sph 2 → Sph 3) (hf : IsSmoothEmbeddingSph 2 f)
    (x : Sph 3) (hx : x ∉ Set.range f) :
    IsSmoothClosedBallIn 2 (closure (connectedComponentIn (Set.range f)ᶜ x)) := by sorry

end SmoothSchoenflies
Source
Open Problem Garden, 'Smooth 4-dimensional Schoenflies problem' (posted by rybu, Nov 6 2009), https://www.openproblemgarden.org/op/smooth_4_dimensional_schoenflies_problem; 'For n = 2 it's due to Alexander (see Hatcher's 3-manifolds notes for a modern exposition).' Ref [A] Alexander, PNAS 10 (1924) 6-8.
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