Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedprecheck passjudge pass (gpt-6.1-sol)audited 2026-10-02
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 k≥1 and n≥2. A bounded Ck domain in Rn is a nonempty bounded open set Ω⊂Rn with the following local graph property. For every boundary point x∈∂Ω there are an open neighbourhood W⊆Rn of x, a rigid motion R(p)=Qp+b with orthogonal Q and b∈Rn, an open ball B⊆Rn−1, and a function h∈Ck(B;R) such that, after shrinking W so that R(W)⊆B×R, R(Ω∩W)=R(W)∩{(y,s)∈B×R:s<h(y)}. In the coordinates z=R(p) the domain therefore lies locally strictly below the graph s=h(y), 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 h∈Ck is the only strengthening here, and connectedness is not required.

Write R(p)=(y,s). The flattening chart is Φ:W⟶Φ(W)⊆B×R,Φ(p)=(y,s−h(y)), with inverse Φ−1(y,t)=R−1(y,t+h(y)) on Φ(W). Thus Φ(Ω∩W)=Φ(W)∩{t<0}. Both maps are of class Ck; the coordinate shear (y,s)↦(y,s−h(y)) has Jacobian determinant one. If B′⊂B′‾⊂B is a compactly contained concentric ball, then every derivative Dβh with ∣β∣≤k is continuous on B′‾, hence bounded there, and consequently the derivatives through order k of Φ and of Φ−1 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 k on the compact patches used; it does not assert any bound uniform in the chart, the point, or a boundary atlas.

In dimension n=1, 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 R need not have this property. A bounded C1 domain in the sense of Bounded C1 domains and their outward normals is a bounded C1 domain in this sense when n≥2.

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 Cm boundary-graph convention and the local one-sided subgraph placement. Oh, Proposition 11.13 and Remark 11.14, printed pp. 157–159, use Ck boundary charts and record that the extension construction depends on the order k through the chart regularity. The shear determinant and the compact derivative bounds recorded here are immediate from the definition of Ck 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