Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Spheres, smooth embeddings Sn↪Sn+1S^n\hookrightarrow S^{n+1}Sn↪Sn+1, and embedded closed balls

Definition
SmoothSchoenflies_basic

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

4-manifoldsdifferential-topologyschoenfliestopology

Basic objects for the smooth Schoenflies problem.

  1. Sn={x∈Rn+1:∥x∥=1}S^n=\{x\in\mathbb R^{n+1}:\|x\|=1\}Sn={x∈Rn+1:∥x∥=1} (Sph n), the unit sphere with its standard smooth manifold structure modelled on Rn\mathbb R^nRn.
  2. A map f:Sn→Sn+1f:S^n\to S^{n+1}f:Sn→Sn+1 is a smooth embedding (IsSmoothEmbeddingSph n f) if it is C∞C^\inftyC∞, injective, and its differential dfx:TxSn→Tf(x)Sn+1df_x:T_xS^n\to T_{f(x)}S^{n+1}dfx​:Tx​Sn→Tf(x)​Sn+1 is injective at every xxx. Since SnS^nSn is compact, this is equivalent to being a smooth embedding; the image is a smooth nnn-dimensional submanifold diffeomorphic to SnS^nSn.
  3. A set K⊆Sn+1K\subseteq S^{n+1}K⊆Sn+1 is a smoothly embedded closed ball (IsSmoothClosedBallIn n K) if there is a C∞C^\inftyC∞ map e:Rn+1→Sn+1e:\mathbb R^{n+1}\to S^{n+1}e:Rn+1→Sn+1 that is injective on Dn+1={∥x∥≤1}D^{n+1}=\{\|x\|\le1\}Dn+1={∥x∥≤1}, has injective differential at every point of Dn+1D^{n+1}Dn+1 (boundary included), and satisfies e(Dn+1)=Ke(D^{n+1})=Ke(Dn+1)=K. This says exactly that KKK, with the smooth structure inherited from Sn+1S^{n+1}Sn+1, is diffeomorphic to Dn+1D^{n+1}Dn+1.
  4. K⊆Sn+1K\subseteq S^{n+1}K⊆Sn+1 is a topological closed ball (IsTopClosedBallIn n K) if KKK is homeomorphic to Dn+1D^{n+1}Dn+1.

These definitions are shared by the goal theorem and all milestones of the mission.

Formalization Note Smoothness is C∞C^\inftyC∞ (ContMDiff … ∞), not analytic. Requiring eee to be smooth on all of Rn+1\mathbb R^{n+1}Rn+1 instead of on a neighbourhood of Dn+1D^{n+1}Dn+1 is no restriction, since one may precompose with a smooth radial map that is the identity on Dn+1D^{n+1}Dn+1.

Definition code
import Mathlib

/-!
# Smooth Schoenflies problem: basic definitions

Spheres, smooth embeddings of `Sⁿ` into `Sⁿ⁺¹`, and smoothly / topologically embedded
closed balls inside `Sⁿ⁺¹`.
-/

open Manifold Metric
open scoped ContDiff

namespace SmoothSchoenflies

/-- The unit sphere `Sⁿ ⊆ ℝⁿ⁺¹`, with its standard smooth manifold structure modelled on `ℝⁿ`. -/
abbrev Sph (n : ℕ) : Type := Metric.sphere (0 : EuclideanSpace ℝ (Fin (n + 1))) 1

/-- `f : Sⁿ → Sⁿ⁺¹` is a smooth embedding: a `C^∞` injective immersion (since `Sⁿ` is
compact, this is the same as a smooth embedding). Its image is a smooth `n`-dimensional
submanifold of `Sⁿ⁺¹` diffeomorphic to `Sⁿ`. -/
def IsSmoothEmbeddingSph (n : ℕ) (f : Sph n → Sph (n + 1)) : Prop :=
  ContMDiff (𝓡 n) (𝓡 (n + 1)) ∞ f ∧ Function.Injective f ∧
    ∀ x, Function.Injective (mfderiv (𝓡 n) (𝓡 (n + 1)) f x)

/-- `K ⊆ Sⁿ⁺¹` is a smoothly embedded closed `(n+1)`-ball, i.e. `K` (with the smooth structure
inherited from `Sⁿ⁺¹`) is diffeomorphic to the closed unit ball `Dⁿ⁺¹ ⊆ ℝⁿ⁺¹`: `K` is the
image of `Dⁿ⁺¹` under a `C^∞` map `ℝⁿ⁺¹ → Sⁿ⁺¹` that is injective on `Dⁿ⁺¹` and has
injective differential at every point of `Dⁿ⁺¹` (boundary points included). -/
def IsSmoothClosedBallIn (n : ℕ) (K : Set (Sph (n + 1))) : Prop :=
  ∃ e : EuclideanSpace ℝ (Fin (n + 1)) → Sph (n + 1),
    ContMDiff 𝓘(ℝ, EuclideanSpace ℝ (Fin (n + 1))) (𝓡 (n + 1)) ∞ e ∧
    Set.InjOn e (closedBall 0 1) ∧
    (∀ x ∈ closedBall (0 : EuclideanSpace ℝ (Fin (n + 1))) 1,
      Function.Injective (mfderiv 𝓘(ℝ, EuclideanSpace ℝ (Fin (n + 1))) (𝓡 (n + 1)) e x)) ∧
    e '' closedBall 0 1 = K

/-- `K ⊆ Sⁿ⁺¹` is homeomorphic to the closed unit ball `Dⁿ⁺¹ ⊆ ℝⁿ⁺¹`. -/
def IsTopClosedBallIn (n : ℕ) (K : Set (Sph (n + 1))) : Prop :=
  Nonempty (closedBall (0 : EuclideanSpace ℝ (Fin (n + 1))) 1 ≃ₜ K)

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
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