Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedjudge pass (gpt-6.1-sol)
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 C1 boundary

Definition

Assume Countable Choice (The Axiom of Countable Choice (ACω)) and the boundary conventions of Bounded C1 domains and their outward normals. Let Ω⊂Rn, n≥2, be a bounded C1 domain, let 0<s<1, 1≤p<∞ and K∈{R,C}. Fix a finite family of boundary charts: for each j let Wj⊆Rn be open and Φj:Wj→Φj(Wj)⊆Bj×R a flattening chart as in Bounded C^k domains and boundary charts, so that Φj(Ω∩Wj)=Φj(Wj)∩{t<0} and the boundary corresponds to the graph {t=0}; write Ψj:=π∘Φj∣∂Ω∩Wj for the induced parametrisation of ∂Ω∩Wj by an open subset Vj:=Ψj(∂Ω∩Wj)⊆Rn−1, and assume the ∂Ω∩Wj cover ∂Ω. Fix a subordinate finite ambient partition: nonnegative χj∈Cc∞(Rn) with supp⁡χj⊆Wj and ∑jχj=1 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 Lp(∂Ω;K) (The space Lp(μ) as the quotient by null functions).

For a Borel function g:∂Ω→K put ∥g∥Ws,p(∂Ω):=∑j∥(χjg)∘Ψj−1∥Ws,p(Rn−1), where the chart representation (χjg)∘Ψj−1 is read in graph coordinates and extended by zero off Vj, and the norm on the right is that of The Gagliardo--Slobodeckij space on Euclidean space. The fractional Sobolev space of the boundary is Ws,p(∂Ω;K):={g∈Lp(∂Ω;K):∥g∥Ws,p(∂Ω)<∞}. The right-hand side is a finite sum of finite norms of compactly supported chart representations, so Ws,p(∂Ω;K) is exactly the set of Lp(∂Ω) 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 Lp(∂Ω) class: g is an almost-everywhere class with respect to the surface measure, and the chart representations are classes in Ws,p(Rn−1); 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 χjg is supported in the interior of the chart, so the localisations are compactly supported and no boundary behaviour of Ψj−1 outside Vj enters. Third, on this page the exponent used is the trace exponent s=θ=1−1/p for 1<p<∞.

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 Cl domains with a partition of unity. The finite atlas and partition used below are exactly the data fixed by these constructions.

Depends on

Used by

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