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.
The fractional Sobolev space on a compact boundary
Definition
Assume Countable Choice (The Axiom of Countable Choice ()) and the boundary conventions of Bounded C1 domains and their outward normals. Let , , be a bounded domain, let , and . Fix a finite family of boundary charts: for each let be open and a flattening chart as in Bounded C^k domains and boundary charts, so that and the boundary corresponds to the graph ; write for the induced parametrisation of by an open subset , and assume the cover . Fix a subordinate finite ambient partition: nonnegative with and on a neighbourhood of (Finite ambient partitions near compact sets). Finally let carry the chart-independent surface measure of Surface integration on compact C1 hypersurfaces, which fixes the meaning of almost-everywhere equality and of (The space as the quotient by null functions).
For a Borel function put where the chart representation is read in graph coordinates and extended by zero off , and the norm on the right is that of The Gagliardo--Slobodeckij space on Euclidean space. The fractional Sobolev space of the boundary is The right-hand side is a finite sum of finite norms of compactly supported chart representations, so is exactly the set of classes whose chart representations all lie in the Euclidean space of The Gagliardo--Slobodeckij space on Euclidean space; that the resulting space and the topology of the norm do not depend on the choices of atlas and partition, up to equivalence of norms, is proved in Chart independence of the fractional boundary norm ↗ and is not assumed here.
Three conventions belong to the definition. First, membership is a property of the class: is an almost-everywhere class with respect to the surface measure, and the chart representations are classes in ; representative independence for the Euclidean factor is established together with the well-definedness lemma on this page and is not presupposed here. Second, the norm is a finite sum over a finite atlas, and each is supported in the interior of the chart, so the localisations are compactly supported and no boundary behaviour of outside enters. Third, on this page the exponent used is the trace exponent for .
Source notes
Schikorra, Section V.1, printed pp. 96-97, patches the local Slobodeckij norms over the boundary through finitely many charts. Gagliardo, printed pp. 286-289, defines the boundary norm through finitely many local representations and their incremental quotients, and Kampanou, Theorems 3.4-3.5, printed pp. 27-31, carries out the same localisation on domains with a partition of unity. The finite atlas and partition used below are exactly the data fixed by these constructions.
Depends on
- The Gagliardo--Slobodeckij space on Euclidean space
- Bounded C1 domains and their outward normals
- Bounded C^k domains and boundary charts
- Surface integration on compact C1 hypersurfaces
- Finite ambient partitions near compact sets
- The space $L^p(\mu)$ as the quotient by null functions
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
Used by
- A jump boundary datum is outside the trace range for p≥2 Counterexample
- The trace of an affine function on a ball is its classical restriction Example
- Chart independence of the fractional boundary norm Lemma
- A bounded right inverse of the trace, supported in a prescribed collar Theorem
- The sharp trace theorem: boundedness and range in the fractional space Theorem
Dependency tree · two levels
27 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
- Armin Schikorra, Partial Differential Equations (University of Pittsburgh, version 4 December 2019) (standard reference, not scraped)
- Emilio Gagliardo, Caratterizzazioni delle tracce sulla frontiera relative ad alcune classi di funzioni in $n$ variabili, Rend. Sem. Mat. Univ. Padova 27 (1957), 284-305 (standard reference, not scraped)
- Maria Kampanou, Trace Theorems for Sobolev Spaces (master's thesis, National and Kapodistrian University of Athens, July 2018) (standard reference, not scraped)