Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Smooth Euclidean extension of the inverse boundary chart

Proved
SPC4Disk.contDiff_boundaryInv

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

differentialgeometryexplicitdiskatlasmanifoldswithboundary

Let m be a nonnegative integer, p a point of the unit m-sphere, and k any differentiability order. Write u_p for the everywhere-defined inverse stereographic map used by the boundary chart centered in direction p. The Euclidean-coordinate map

y⟼(1−y0)up(y1,…,ym)+2e0y\longmapsto(1-y_0)u_p(y_1,\ldots,y_m)+2e_0y⟼(1−y0​)up​(y1​,…,ym​)+2e0​

is C^k on all of Euclidean (m+1)-space. This is the unclamped extension of the boundary-to-interior transition formula, and is not a claim that the globally clamped chart inverse is everywhere smooth.

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.contDiff_boundaryInv
    (p : sphere (0 : EuclideanSpace ℝ (Fin (m + 1))) 1) {k : ℕ∞ω} :
    ContDiff ℝ k (fun y : EuclideanSpace ℝ (Fin (m + 1)) =>
      (1 - y 0) • stereoInvFunAux
        (((-p) : sphere (0 : EuclideanSpace ℝ (Fin (m + 1))) 1) :
          EuclideanSpace ℝ (Fin (m + 1)))
        (((OrthonormalBasis.fromOrthogonalSpanSingleton m
            (ne_zero_of_mem_unit_sphere (-p))).repr.symm
          (WithLp.toLp 2 (Fin.tail (fun i => y i)))) :
            EuclideanSpace ℝ (Fin (m + 1))) + diskShift (m + 1)) := by sorry
Source
Unpublished archived Disk.lean, original lines 547–577; 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

For every natural number mmm, every unit vector p∈Rm+1p\in\mathbb R^{m+1}p∈Rm+1, and every differentiability order kkk that is a nonnegative integer, ∞\infty∞, or ω\omegaω, 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 and let s=2e0s=2e_0s=2e0​, twice the first standard basis vector. The function on all of Rm+1\mathbb R^{m+1}Rm+1 given, for y=(a,t)∈R×Rmy=(a,t)\in\mathbb R\times\mathbb R^my=(a,t)∈R×Rm, by y↦(1−a)4Lp−1(t)+(4−∥t∥2)p∥t∥2+4+sy\mapsto(1-a)\frac{4L_p^{-1}(t)+(4-\|t\|^2)p}{\|t\|^2+4}+sy↦(1−a)∥t∥2+44Lp−1​(t)+(4−∥t∥2)p​+s is of class CkC^kCk as a map into Rm+1\mathbb R^{m+1}Rm+1. Its denominator is strictly positive for every ttt. The factor 1−a1-a1−a is not clipped: every real aaa, including negative values, a=1a=1a=1, and a>1a>1a>1, is covered, and the codomain is the whole Euclidean space. The case m=0m=0m=0 is included, while k=0k=0k=0, ∞\infty∞, and ω\omegaω mean continuity, smoothness, and analyticity respectively.

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