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.
Bounded C1 domains and their outward normals
Definition
Throughout this surface-integration page assume (The Axiom of Countable Choice ()) for the earlier Lebesgue and polar measure machinery. Let . A bounded domain is a nonempty bounded open set whose boundary is locally, after a rigid change of coordinates, the graph of a function, with locally exactly the subgraph . Connectedness is not required. The outward normal in these coordinates is , transported by the orthogonal coordinate map. Its overlap agreement is justified with surface charts below.
The convention means F is continuously differentiable in , and F and its first derivatives extend continuously to its closure. For require the same for derivatives through order two. No ambient extension across the boundary is required. Derivatives use The total (Fréchet) derivative as the linear first-order approximation with remainder; products are the real Euclidean inner products of Real and complex inner product spaces, with the inner product linear in the first argument. Write , and .
Source notes
Hunter, §1.10 Definitions 1.34–1.35 and §1.10.3, printed pp. 13–16 (PDF pp. 19–22). Interior-up-to-boundary regularity is the local convention.
Depends on
Used by
- A box is not a C1-boundary domain Counterexample
- Classical normal derivative Definition
- Specified finite piecewise C1 boundary presentations Definition
- Surface integration on compact C1 hypersurfaces Definition
Dependency tree · two levels
14 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
- Hunter, Notes on Partial Differential Equations (standard reference, not scraped)