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.

Sphere graph charts, surface density, and a finite partition

Statement

Assume Countable Choice and let n≥2. For each i∈{1,…,n} and each sign ε∈{±1} the map Xiε(y)=(y1,…,yi−1,ε1−∣y∣2,yi,…,yn−1), defined on the open unit ball B⊆Rn−1, is a C∞ graph chart onto the hemisphere {εxi>0}, and the 2n hemispheres cover Sn−1. On such a chart the polar surface measure σ has Lebesgue density 1+∣∇h∣2=(1−∣y∣2)−1/2, and the graphing function h=ε1−∣y∣2 satisfies det⁡D2h=(−ε)n−1(1−∣y∣2)−(n+1)/2≠0 on all of B. There exist finitely many nonnegative C∞ functions χ1,…,χm on Sn−1 with ∑jχj=1, each compactly supported in the image of one of these charts.

Facts & Assumptions

Given: Countable Choice, n≥2, the open unit ball B⊆Rn−1, and for each i,ε the map Xiε and graphing function hiε=ε1−∣y∣2.

[F1]

The polar surface set function σ on Sn−1 is the published Borel surface measure, and the chart surface measure on Sn−1 equals σ; the chart measure of a compact hypersurface is computed by chart densities and is independent of the charts. (The polar surface set function on the unit sphere, Polar coordinates decompose Lebesgue measure into r^{n-1} dr d sigma, Agreement with the existing polar sphere measure, Surface integration on compact C1 hypersurfaces, Chart and partition independence of surface measure)

[F2]

In graph coordinates X(y)=(y,h(y)) the chart density is 1+∣Dh(y)∣2; more precisely the Gram determinant of the tangent columns is det⁡DXTDX=1+∣Dh(y)∣2. (Chart and partition independence of surface measure)

[F4]

Compactness: a subset of Rn is compact if and only if it is closed and bounded; Sn−1 is closed and bounded, hence compact. (For a nonempty subset of Rn with n≥1, compactness, closedness and boundedness, pseudocompactness, and attainment of extrema by every continuous real-valued function are equivalent)

[F5]

Every countable cover of a smooth manifold by coordinate balls admits a smooth partition of unity subordinate to that cover; subordinate means locally finite supports inside the corresponding cover members summing to one. (Smooth partitions subordinate to a countable coordinate cover, Smooth partitions of unity subordinate to an open cover)

[F6]

Embedded submanifolds and smooth manifolds: a subset that is locally the graph of a smooth function is an embedded submanifold, and compatible charts with smooth transitions define the smooth structure. (Embedded submanifolds and slice charts, Smooth manifolds and their smooth charts)

[F7]

Determinant expansion: the determinant is multilinear and alternating in the columns and in the rows, a matrix with two proportional columns has determinant zero, and transposition preserves the determinant. (The determinant is alternating and multilinear in the rows as well as in the columns, A square matrix with a zero column or two equal columns has determinant zero, For every square matrix over a commutative ring, det⁡(AT)=det⁡(A))

Proof

technique · direct; identify each hemisphere with a graph, compute the density and the Hessian determinant, then subordinate a finite smooth partition to the hemisphere cover of the compact sphere
1.1F3givenalgebra

Calculus for the graph expressions. For t,s>0, ∣t−s∣=∣t−s∣/(t+s)≤∣t−s∣/s, proving continuity at s. Rationalizing the difference quotient gives (⋅)′(s)=1/(2s). By the product and quotient rules in [F3], induction shows that every derivative of t is a constant times an integer power of t, hence exists and is continuous for t>0. Put q(y)=1−∑jyj2. Applying the chain rule on each coordinate line gives ∂jq(y)=−yj/q(y). Repeated coordinate product and quotient rules show that every ordered partial of q and of its reciprocal is a finite sum of polynomial numerators divided by positive integer powers of q. All these expressions are continuous on B, where q>0; thus the graph functions and density are smooth in the sense of [F3].

1.2F7algebra

A rank-one determinant. For every t≥0 and v∈Rm with m≥1, det⁡(I+t vvT)=1+t∣v∣2. Indeed the j-th column of I+t vvT is ej+tvjv, so multilinearity in the columns [F7] expands the determinant over subsets S of the column indices: the term for S is (∏j∈Stvj)det⁡(c(S)), where c(S) has column v in the slots S and ej elsewhere. If ∣S∣≥2 two columns are equal to v, so the determinant vanishes [F7]; the term S=∅ is det⁡I=1; and for S={j} the matrix has determinant vj (expanding along the standard basis columns), giving tvj2. Summing gives 1+t∑jvj2=1+t∣v∣2.

1.3F1F2F3algebra

The density. Here h(y)=ε1−∣y∣2, so by [F3] ∇h(y)=ε⋅−y1−∣y∣2=−ε (1−∣y∣2)−1/2y,∣∇h(y)∣2=∣y∣21−∣y∣2, hence 1+∣∇h(y)∣2=(1−∣y∣2)−1/2 on B. By [F2] this is the chart density of the graph, and by [F1] the chart measure is the polar surface measure σ; the density is finite and strictly positive on B because 1−∣y∣2>0 there.

2.1F3step 1.1givenalgebra

The charts and the cover. Fix i and ε and put πi(x)=(x1,…,xi^,…,xn) for the coordinate projection. On the hemisphere Hiε={x∈Sn−1:εxi>0} the map πi is a left inverse of Xiε: πi(Xiε(y))=y; conversely Xiε(πi(x))=x for x∈Hiε, because the removed coordinate is recovered by xi=ε1−∣πi(x)∣2, which is exactly the defining equation of the sphere with the sign ε. The coordinates of Xiε are smooth by step 1.1, and its inverse is coordinate projection, since 1−∣y∣2>0 on B and the coordinates of a unit vector satisfy ∣xi∣≤1; hence Xiε is a C∞ chart of Sn−1 onto Hiε. Every x∈Sn−1 satisfies ∑kxk2=1, so some coordinate is nonzero; then x∈Hisgn⁡(xi) for that i, and the 2n hemispheres cover Sn−1.

2.2F3step 1.2step 1.3algebra

The Hessian determinant. Differentiating the gradient of step 1.3 with [F3] gives ∂i∂jh(y)=−ε[(1−∣y∣2)−1/2δij+(1−∣y∣2)−3/2yiyj], that is D2h(y)=−ε a[I+a2yyT] with a:=(1−∣y∣2)−1/2>0. Taking determinants and using step 1.2 with t=a2, v=y, det⁡D2h(y)=(−ε)n−1a n−1(1+a2∣y∣2)=(−ε)n−1a n−1⋅11−∣y∣2=(−ε)n−1(1−∣y∣2)−(n+1)/2, because 1+a2∣y∣2=1+∣y∣2/(1−∣y∣2)=1/(1−∣y∣2) and a n−1a2=a n+1. The value is nonzero for every y∈B since 1−∣y∣2>0.

3.1F3F4F6step 2.1

The smooth structure and compactness. Each Xiε is a bijection of the open ball onto its image with smooth inverse and smooth transitions: on overlaps, the transition is πi′∘Xiε, a coordinate selection of a smooth graph map, smooth by [F3]. The ambient coordinate map that deletes xi and appends xi−hiε(πi(x)) has smooth inverse obtained by reinserting hiε(y)+z in the ith slot; near each point of the hemisphere it carries the sphere to z=0. These are slice charts in [F6], so the sphere is an embedded smooth manifold with the displayed graph charts. Being the zero set of the continuous function x↦∣x∣2−1, the sphere is closed; it is bounded by ∣x∣=1, so it is compact by [F4].

4.1F5step 2.1step 3.1

The finite partition. The 2n hemispheres Hiε are coordinate balls of the smooth manifold Sn−1 of step 3.1 and form a countable (indeed finite) open cover. By [F5] this cover admits a smooth partition of unity (χiε)i,ε subordinate to it: the supports are locally finite, supp⁡χiε⊆Hiε, and ∑i,εχiε=1 with every χiε≥0. Since Sn−1 is compact by step 3.1, every support, being closed in Sn−1, is compact; enumerating the 2n pairs (i,ε) as 1,…,m with m=2n gives the asserted functions, each compactly supported inside the image Hiε of the chart Xiε.

5.1step 2.1step 3.1step 1.3step 2.2step 4.1∎

Conclusion. Step 2.1 gives the 2n smooth graph charts and their hemisphere cover, step 1.3 computes the density (1−∣y∣2)−1/2, step 2.2 computes det⁡D2h=(−ε)n−1(1−∣y∣2)−(n+1)/2≠0, and step 4.1 produces the finite smooth partition with compactly supported pieces. Each clause holds for every n≥2, with the case n=2 covered by the same computation (m=n−1=1 and the determinant is −ε(1−∣y∣2)−3/2).

Depends on

Used by

Dependency tree · two levels

76 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