Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

The manifold boundary of the explicit disk is the unit sphere

Proved
SPC4Disk.diskBoundary_eq

by ryanshin · Sep 6, 2026 · Mathlib 0df444a (Lean v4.33.1)

differentialgeometryexplicitdiskatlasmanifoldswithboundary

Let m be a nonnegative integer and let D be the closed unit ball in Euclidean (m+1)-space, with the explicit radial–stereographic atlas SPC4DiskCharts. Its manifold boundary is exactly

∂D={z∈D:∥z∥=1}.\partial D=\{z\in D:\|z\|=1\}.∂D={z∈D:∥z∥=1}.

This identifies the boundary defined by the half-space charts with the usual unit sphere as a subset of the ball. It is not a theorem about arbitrary boundaries or a smooth four-dimensional Poincaré claim.

Preamble
import Mathlib
import Definitions.Def_SPC4DiskCharts

set_option autoImplicit false

open Set Metric SPC4Disk
open scoped ContDiff Manifold

noncomputable section
variable {m : ℕ}

local instance : Fact (Module.finrank ℝ (EuclideanSpace ℝ (Fin (m + 1))) = m + 1) :=
  ⟨finrank_euclideanSpace_fin⟩
Formal statement
theorem SPC4Disk.diskBoundary_eq :
    (𝓡∂ (m + 1)).boundary
      (closedBall (0 : EuclideanSpace ℝ (Fin (m + 1))) 1) =
      { z : closedBall (0 : EuclideanSpace ℝ (Fin (m + 1))) 1 |
        ‖z.val‖ = 1 } := by sorry
Source
Unpublished archived Disk.lean, original lines 885–898; SHA-256 889a9eccf9d2350aee7051ab7b6895e565f9f1a0c84e7120fb45c15acae0097e. Declaration and proof ranges were extracted by the supplied Lean graph and sketch oracle.
Read-back

What the Lean code literally says, in plain math · Codex independent blind auditor; exact model identifier unavailable

Let mmm be any natural number, D={x∈Rm+1:∥x∥≤1}D=\{x\in\mathbb R^{m+1}:\|x\|\leq1\}D={x∈Rm+1:∥x∥≤1}, H={y∈Rm+1:y0≥0}H=\{y\in\mathbb R^{m+1}:y_0\geq0\}H={y∈Rm+1:y0​≥0}, and s=2e0s=2e_0s=2e0​. For each unit vector ppp, let Lp:(−p)⊥→RmL_p:(-p)^\perp\to\mathbb R^mLp​:(−p)⊥→Rm be the coordinate isometry from the orthonormal basis selected by the construction, put Sp(u)=Lp(21+⟨p,u⟩(u−⟨p,u⟩p))S_p(u)=L_p\bigl(\frac{2}{1+\langle p,u\rangle}(u-\langle p,u\rangle p)\bigr)Sp​(u)=Lp​(1+⟨p,u⟩2​(u−⟨p,u⟩p)) and Up(t)=4Lp−1(t)+(4−∥t∥2)p∥t∥2+4U_p(t)=\frac{4L_p^{-1}(t)+(4-\|t\|^2)p}{\|t\|^2+4}Up​(t)=∥t∥2+44Lp−1​(t)+(4−∥t∥2)p​, and define Np(0)=pN_p(0)=pNp​(0)=p, Np(x)=x/∥x∥N_p(x)=x/\|x\|Np​(x)=x/∥x∥ for x≠0x\ne0x=0. In these total formulas a reciprocal of zero is zero. The interior chart has forward map x↦x+sx\mapsto x+sx↦x+s, inverse y↦min⁡{1,∥y−s∥−1}(y−s)y\mapsto\min\{1,\|y-s\|^{-1}\}(y-s)y↦min{1,∥y−s∥−1}(y−s), source {x∈D:∥x∥<1}\{x\in D:\|x\|<1\}{x∈D:∥x∥<1}, and target {y∈H:∥y−s∥<1}\{y\in H:\|y-s\|<1\}{y∈H:∥y−s∥<1}. The chart indexed by ppp has forward map x↦(1−∥x∥,Sp(Np(x)))x\mapsto(1-\|x\|,S_p(N_p(x)))x↦(1−∥x∥,Sp​(Np​(x))), inverse (a,t)↦max⁡{0,min⁡{1,1−a}}Up(t)(a,t)\mapsto\max\{0,\min\{1,1-a\}\}U_p(t)(a,t)↦max{0,min{1,1−a}}Up​(t), source {x∈D:x≠0, x≠∥x∥(−p)}\{x\in D:x\ne0,\ x\ne\|x\|(-p)\}{x∈D:x=0, x=∥x∥(−p)}, and target {(a,t)∈H:a<1}\{(a,t)\in H:a<1\}{(a,t)∈H:a<1}. Give DDD the charted-space structure with that atlas and preferred chart equal to the interior chart when ∥x∥<1\|x\|<1∥x∥<1 and otherwise equal to the chart indexed by Ne0(x)N_{e_0}(x)Ne0​​(x), with e0e_0e0​ the first standard unit vector. For the half-space model I:H→Rm+1I:H\to\mathbb R^{m+1}I:H→Rm+1 given by inclusion, with total inverse replacing the first coordinate by its maximum with zero, the set of points whose preferred extended-chart image lies in the frontier of I(H)I(H)I(H) is exactly {x∈D:∥x∥=1}\{x\in D:\|x\|=1\}{x∈D:∥x∥=1}. Equivalently, the boundary defined by this model and these preferred charts consists precisely of the disk points with norm one. Equality is of subsets of the closed disk. No positive lower bound on mmm is required, so the case m=0m=0m=0 is included and the right-hand set consists of the two endpoints of the interval [−1,1][-1,1][−1,1].

Human review
  • Endorsed by Shuze Chen · Sep 6, 2026

  • Endorsed by ryanshin · Sep 6, 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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me