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 . For each and each sign the map , defined on the open unit ball , is a graph chart onto the hemisphere , and the hemispheres cover . On such a chart the polar surface measure has Lebesgue density , and the graphing function satisfies on all of . There exist finitely many nonnegative functions on with , each compactly supported in the image of one of these charts.
Facts & Assumptions
Given: Countable Choice, , the open unit ball , and for each the map and graphing function .
The polar surface set function on is the published Borel surface measure, and the chart surface measure on 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)
In graph coordinates the chart density is ; more precisely the Gram determinant of the tangent columns is . (Chart and partition independence of surface measure)
The one-variable sum, product and quotient derivative rules and the one-variable chain rule hold on open intervals. Applying them on coordinate lines computes partial derivatives; smoothness means continuity of all ordered iterated partials. The gradient and Jacobian conventions are the published ones. (Sums, scalar multiples, products and quotients: , , , and when , The chain rule, in one line from Carathéodory: if is differentiable at and is differentiable at , then is differentiable at with , maps and multi-index derivative notation in Euclidean space, The Jacobian matrix of partial derivatives and the gradient in the scalar-valued case)
Compactness: a subset of is compact if and only if it is closed and bounded; is closed and bounded, hence compact. (For a nonempty subset of with , compactness, closedness and boundedness, pseudocompactness, and attainment of extrema by every continuous real-valued function are equivalent)
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)
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)
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, )
Proof
Calculus for the graph expressions. For , , proving continuity at . Rationalizing the difference quotient gives . By the product and quotient rules in [F3], induction shows that every derivative of is a constant times an integer power of , hence exists and is continuous for . Put . Applying the chain rule on each coordinate line gives . Repeated coordinate product and quotient rules show that every ordered partial of and of its reciprocal is a finite sum of polynomial numerators divided by positive integer powers of . All these expressions are continuous on , where ; thus the graph functions and density are smooth in the sense of [F3].
A rank-one determinant. For every and with , . Indeed the -th column of is , so multilinearity in the columns [F7] expands the determinant over subsets of the column indices: the term for is , where has column in the slots and elsewhere. If two columns are equal to , so the determinant vanishes [F7]; the term is ; and for the matrix has determinant (expanding along the standard basis columns), giving . Summing gives .
The density. Here , so by [F3] hence on . 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 because there.
The charts and the cover. Fix and and put for the coordinate projection. On the hemisphere the map is a left inverse of : ; conversely for , because the removed coordinate is recovered by , which is exactly the defining equation of the sphere with the sign . The coordinates of are smooth by step 1.1, and its inverse is coordinate projection, since on and the coordinates of a unit vector satisfy ; hence is a chart of onto . Every satisfies , so some coordinate is nonzero; then for that , and the hemispheres cover .
The Hessian determinant. Differentiating the gradient of step 1.3 with [F3] gives that is with . Taking determinants and using step 1.2 with , , because and . The value is nonzero for every since .
The smooth structure and compactness. Each is a bijection of the open ball onto its image with smooth inverse and smooth transitions: on overlaps, the transition is , a coordinate selection of a smooth graph map, smooth by [F3]. The ambient coordinate map that deletes and appends has smooth inverse obtained by reinserting in the th slot; near each point of the hemisphere it carries the sphere to . 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 , the sphere is closed; it is bounded by , so it is compact by [F4].
The finite partition. The hemispheres are coordinate balls of the smooth manifold of step 3.1 and form a countable (indeed finite) open cover. By [F5] this cover admits a smooth partition of unity subordinate to it: the supports are locally finite, , and with every . Since is compact by step 3.1, every support, being closed in , is compact; enumerating the pairs as with gives the asserted functions, each compactly supported inside the image of the chart .
Conclusion. Step 2.1 gives the smooth graph charts and their hemisphere cover, step 1.3 computes the density , step 2.2 computes , and step 4.1 produces the finite smooth partition with compactly supported pieces. Each clause holds for every , with the case covered by the same computation ( and the determinant is ).
Depends on
- 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
- Smooth partitions of unity subordinate to an open cover
- Smooth partitions subordinate to a countable coordinate cover
- Embedded submanifolds and slice charts
- Smooth manifolds and their smooth charts
- For a nonempty subset of $\mathbb{R}^n$ with $n\ge1$, compactness, closedness and boundedness, pseudocompactness, and attainment of extrema by every continuous real-valued function are equivalent
- Sums, scalar multiples, products and quotients: $(f+g)'(c) = f'(c) + g'(c)$, $(\alpha f)'(c) = \alpha f'(c)$, $(fg)'(c) = f'(c)g(c) + f(c)g'(c)$, and $(f/g)'(c) = \bigl(f'(c)g(c) - f(c)g'(c)\bigr)/g(c)^{2}$ when $g(c) \ne 0$
- The chain rule, in one line from Carathéodory: if $g$ is differentiable at $c$ and $f$ is differentiable at $g(c)$, then $f \circ g$ is differentiable at $c$ with $(f \circ g)'(c) = f'(g(c))\,g'(c)$
- $C^k$ maps and multi-index derivative notation in Euclidean space
- The Jacobian matrix of partial derivatives and the gradient in the scalar-valued case
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
- 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(A^{\mathsf T})=\det(A)$
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
- Terence Tao, Lecture Notes 8 for Math 247B (standard reference, not scraped)
- John K. Hunter, Notes on Partial Differential Equations (standard reference, not scraped)