Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck pass
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

Smooth Euclidean hypersurface graphs and compact localization

Statement

For n≥2, every smooth embedded hypersurface S⊂Rn is locally, after a rigid motion, the graph X(y)=(y,h(y)) of a C∞ function. The tangent, normal, shape operator and curvature of Euclidean hypersurface normals, shape operators and curvature are well defined and agree with their usual Euclidean hypersurface meanings. Every continuous unit normal on S is locally smooth. Every compact K⊂S admits finitely many graph pieces Sj and nonnegative smooth functions χj on S, compactly supported in Sj, whose sum is one on a neighbourhood of K. If S itself is compact, that sum is one everywhere.

Facts & Assumptions

[F1]

The earlier inverse and implicit function theorems supply C1 inverses and their derivative formulas. (The Euclidean inverse function theorem, The Euclidean implicit function theorem with derivative formula)

[F2]

The first-order total chain rule and sum/scalar rules hold. One-variable product and quotient rules apply on coordinate lines; continuous partials give total derivatives, whose columns are the partials. Smoothness is defined by all ordered iterated partials, mixed partials are symmetric at the stated regularity, and the cited determinant and spectral identities hold. (The chain rule for total derivatives: D(g∘f)(a)=Dg(f(a))∘Df(a), Sums and scalar multiples of totally differentiable maps are totally differentiable with the expected derivatives, Sums, scalar multiples, products and quotients: (f+g)′(c)=f′(c)+g′(c), (αf)′(c)=αf′(c), (fg)′(c)=f′(c)g(c)+f(c)g′(c), and (f/g)′(c)=(f′(c)g(c)−f(c)g′(c))/g(c)2 when g(c)≠0, If all partial derivatives exist on a neighbourhood and are continuous at a point, then the map is totally differentiable there with Jacobian derivative, A total derivative computes every directional derivative, and its matrix is the Jacobian, Ck maps and multi-index derivative notation in Euclidean space, Continuous mixed partials of order k are invariant under permutations, Laplace expansion computes the determinant along every row and every column over a commutative ring, For same-sized finite square matrices over a commutative ring, det⁡(AB)=det⁡(A)det⁡(B), Real spectral theorem: a self-adjoint endomorphism of a finite-dimensional real inner product space has an orthonormal eigenbasis)

[F3]

Embedded hypersurfaces have slice charts. (Embedded submanifolds and slice charts)

[F4]

Tangents, normals and curvature have the local Euclidean definitions. (Euclidean hypersurface normals, shape operators and curvature)

[F5]

Smooth cutoffs exist on Euclidean balls. (Explicit compactly supported smooth cutoffs)

Proof

Given: A smooth embedded hypersurface S and, for the localization assertion, a compact subset K⊂S.

1.1F1F2algebra

Smooth inverse bootstrap. On coordinate lines the one-variable rules [F2] give ∂j(uv)=(∂ju)v+u∂jv and ∂j(1/u)=−(∂ju)/u2 where u≠0. Induction on derivative order proves that products and nonvanishing quotients of Cr functions are Cr. For compositions, [F2] gives ∂j(f∘g)=∑k(∂kf∘g)∂jgk; induction using the product rule and continuity proves Cr closure under composition for each finite r. The earlier C1 inverse theorem [F1] gives a C1 inverse g to a smooth map f with invertible derivative, with Dg=(Df∘g)−1. For an invertible finite matrix A, cofactor expansion gives A−1=adj⁡(A)/det⁡A: multiplying either side by A gives the identity by Laplace expansion, including the off-diagonal expansions with two equal rows. Its entries are polynomial quotients with nonzero denominator, hence smooth. If g is Cr and f smooth, the repeated product and chain rules make (Df∘g)−1 Cr, so the displayed derivative makes g Cr+1. Induction from r=1 proves g smooth. The same bootstrap applies to the implicit theorem, whose solution is a component of the inverse of (x,z)↦(x,F(x,z)).

2.1F1F2F3step 1.1algebra

Graphs from slices. In a slice chart θ near p, let F be its last coordinate. Then S∩V=F−1(0) and DF has rank one, because Dθ is invertible by differentiating the chart inverse identities. Apply the real spectral theorem in [F2] to the self-adjoint rank-one orthogonal projection v↦(v⋅u)u, where u=∇F(p)/∣∇F(p)∣. Its eigenvalue-one space is Ru, so, after reordering and changing one sign, its orthonormal eigenbasis has last vector u; in these rigid coordinates ∂nF(p)≠0. The implicit theorem and step 1.1 solve F(y,z)=0 as z=h(y) on a product neighbourhood, with h smooth. Projection onto y is the inverse of X(y)=(y,h(y)); its derivative has independent columns (ej,hj), so X is a smooth parametrization of the relatively open piece.

3.1F2F4step 1.1step 2.1algebra

Coordinate independence and normal derivatives. If two parametrizations overlap, their transition is smooth and has invertible derivative, so the chain rule makes their derivative images identical and makes D(ν∘X)(DX)−1 independent of the parametrization. The positive square root is smooth because it is the inverse of t↦t2 on (0,∞), to which step 1.1 applies. For a graph, νh=(−∇h,1)/1+∣∇h∣2 is therefore smooth, unit, and perpendicular to every (ej,hj). Since the normal space has dimension one, any continuous unit normal is ϵνh with ϵ continuous and valued in {1,−1}, hence constant on a sufficiently small connected piece. It is therefore smooth. Differentiating ∣ν∣2=1 gives dν(v)⋅ν=0, so dν(v)∈TpS. Also differentiating ν⋅Xk=0 gives −∂jν⋅Xk=ν⋅Xjk, a symmetric expression by equality of mixed partials. Thus Sν is self-adjoint.

4.1F2F4step 3.1algebra

Equivalence with the Euclidean Weingarten operator. Cartesian differentiation of an ambient field along a curve is its componentwise derivative; extending a field from a graph by holding its graph coordinates fixed in the last ambient coordinate gives exactly that derivative along tangent vectors, independent of the extension because two extensions agree on every curve in S. Orthogonal projection therefore gives the usual Euclidean second fundamental form (Dvw)⊥=(Dvw⋅ν)ν. The differentiated orthogonality in step 3.1 gives ⟨Sνv,w⟩=⟨(Dvw)⊥,ν⟩ and Sν=−(Dvν)⊤=−dν(v). This is precisely the shape operator for the Euclidean ambient connection. Its self-adjoint eigenvalues are the usual principal curvatures, and their product is its determinant. Replacing ν by −ν replaces Sν by −Sν, so K−ν=(−1)n−1Kν and nonvanishing is independent of local orientation. Rigid motions conjugate the shape operators by their orthogonal derivative and preserve the determinant.

5.1F5F6step 2.1algebra∎

Compact localization. For each point of K, choose a graph neighbourhood and an ambient ball whose closed, slightly larger ball meets S only inside that graph neighbourhood. An ambient smooth bump supported in the larger ball and equal to one on the smaller ball exists by [F5]. Compactness gives finitely many smaller balls covering K, with bumps βj. Their restrictions have supports compact in their graph pieces: inside the larger closed ball the hypersurface is a relatively closed zero set of the defining function from step 2.1. Put B=∑jβj. It has positive minimum on K. Choose a smooth real cutoff η that is zero for B≤c/2 and one for B≥c, where 0<c<min⁡KB. Define χj=η(B)βj/B where B>0, and zero where B=0. These functions are smooth, nonnegative, supported compactly in their graph pieces, and sum to η(B)=1 on a neighbourhood of K. If K=S, the sum is one on S. If K is empty, take the empty family.

Depends on

Used by

Cited to discharge well-definedness by Euclidean hypersurface normals, shape operators and curvature.

Dependency tree · two levels

69 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources