Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedjudge pass (gpt-6.1-sol)
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.

Euclidean hypersurface normals, shape operators and curvature

Definition

For n≥2, a smooth embedded hypersurface S⊂Rn has the embedded-submanifold meaning of Embedded submanifolds and slice charts. If X:U⊂Rn−1→S is a smooth local parametrization of rank n−1, define TX(y)S=im⁡DX(y) with its Euclidean inner product. A smooth local unit normal is a smooth map ν:V→Rn on a relatively open subset V⊆S with ∣ν∣=1 and ν⊥TS. Define the Euclidean shape operator by Sνv=−dνp(v) on TpS, and the extrinsic Gaussian (Gauss–Kronecker) curvature by Kν(p)=det⁡Sν(p). Here dνp(DX(y)u)=D(ν∘X)(y)u. Smooth functions and compact supports on S use its subspace topology and these local parametrizations. Nonvanishing curvature means Kν≠0 for either choice of local unit normal at each point. The graph and localization lemma Smooth Euclidean hypersurface graphs and compact localization ↗ proves that these definitions are independent of parametrization, that the derivative takes values in TpS, and that changing the unit normal only changes the sign of the shape operator. This is the Euclidean specialization of the usual Weingarten definition; the equivalence is proved there, without requiring the later Riemannian theory.

Depends on

Used by

Dependency tree · two levels

12 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