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 C^k domains and boundary charts
Definition
Assume Countable Choice for the Sobolev interfaces used by consumers of this definition. Let and . A bounded domain in is a nonempty bounded open set with the following local graph property. For every boundary point there are an open neighbourhood of , a rigid motion with orthogonal and , an open ball , and a function such that, after shrinking so that , In the coordinates the domain therefore lies locally strictly below the graph , and the boundary is that graph. The graph convention, including the requirement that the domain occupy exactly the one-sided subgraph, is the one of Bounded C1 domains and their outward normals; the regularity is the only strengthening here, and connectedness is not required.
Write . The flattening chart is with inverse on . Thus . Both maps are of class ; the coordinate shear has Jacobian determinant one. If is a compactly contained concentric ball, then every derivative with is continuous on , hence bounded there, and consequently the derivatives through order of and of are bounded on the corresponding compact patch. This is the precise sense in which a boundary chart is said to have bounded derivatives through order on the compact patches used; it does not assert any bound uniform in the chart, the point, or a boundary atlas.
In dimension , the bounded sets satisfying this local one-sided condition are finite disjoint unions of bounded open intervals. Each endpoint has an interval neighbourhood on which the domain occupies one side; the coordinate is the identity or its reflection, and the graph function and derivative bounds are vacuous. General bounded open subsets of need not have this property. A bounded domain in the sense of Bounded C1 domains and their outward normals is a bounded domain in this sense when .
This definition asserts no extension theorem, no trace operator, and no uniformity of chart constants: it fixes only the regularity of the boundary and the exact one-sided graph convention that later local statements use.
Source notes
Laugesen, Definition 3.10, printed pp. 58–59, fixes the boundary-graph convention and the local one-sided subgraph placement. Oh, Proposition 11.13 and Remark 11.14, printed pp. 157–159, use boundary charts and record that the extension construction depends on the order through the chart regularity. The shear determinant and the compact derivative bounds recorded here are immediate from the definition of and are used by C^k boundary flattening preserves local W^{k,p}.
Depends on
Used by
Dependency tree · two levels
10 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
- Richard S. Laugesen, Linear Analysis and Partial Differential Equations (2020), Definition 3.10 (standard reference, not scraped)
- Sung-Jin Oh, Lecture Notes for Math 222A (2024), Remark 11.14 (standard reference, not scraped)