Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge 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.

Compact curved hypersurfaces admit a finite curved graph cover

Statement

Assume Countable Choice. Let S⊆Rn (n≥2) be a compact embedded C∞ hypersurface with a continuous unit normal field ν and everywhere nonvanishing extrinsic Gaussian curvature K=det⁡Sν≠0. Then there exist finitely many open sets Uj⊆Rn−1, smooth hj:Uj→R with det⁡D2hj≠0 on Uj, embeddings Xj(y)=(y,hj(y)) of graph⁡hj onto relatively open pieces Sj⊆S covering S (after ambient rigid motions), and nonnegative C∞ functions χj on S with ∑jχj=1 and supp⁡χj compactly contained in Sj.

Facts & Assumptions

Given: The compact embedded smooth hypersurface, continuous unit normal and nonzero curvature in the statement, with Countable Choice.

[F1]

Smooth graph charts, compact smooth localization, normal independence and the Euclidean curvature convention are established locally. (Smooth Euclidean hypersurface graphs and compact localization, Euclidean hypersurface normals, shape operators and curvature)

[F2]

The graph curvature is det⁡D2h/(1+∣∇h∣2)(n+1)/2. (Shape operator and Gauss-Kronecker curvature of a graph)

[A1]

Countable Choice is assumed. (The Axiom of Countable Choice (ACω))

Proof

technique · direct; apply the local graph and compact localization constructions
1.1givenF1F2

By [F1], every point has a smooth graph chart after a rigid motion. The given continuous normal is locally smooth and equals either the graph normal or its negative with constant sign on a connected smaller chart. Its shape operator therefore differs by that sign; nonvanishing curvature is unchanged. Formula [F2] implies det⁡D2h≠0 throughout the smaller graph chart. This argument also works with local normals only, without a global orientation.

2.1F1A1step 1.1∎

Apply the compact localization part of [F1] with K=S to the graph neighbourhoods of step 1.1. Its ambient-ball bumps give finitely many pieces covering S and nonnegative smooth χj with compact support inside their pieces and sum one. Their graph functions retain their nondegenerate Hessians on the whole chart. These are all the asserted data. The construction needs only finite choices; the assumed Countable Choice remains available to surface-measure consumers.

Depends on

Used by

Dependency tree · two levels

27 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