Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generated
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.

Fractional Sobolev regularity on a simplex

Definition

Assume Countable Choice. Let U⊂Rd be a bounded open set, 0<r<1, and let q be a measurable real function on U. Define [q]Hr(U)2:=∫U∫U∣q(x)−q(y)∣2∣x−y∣d+2r dx dy, with the diagonal integrand set to zero, and Hr(U):={q∈L2(U):[q]Hr(U)<∞}, using almost-everywhere classes and norm ∥q∥Hr(U)2:=∥q∥L2(U)2+[q]Hr(U)2. For u∈H1(U), write u∈H1+r(U) when each weak derivative ∂ju belongs to Hr(U), and define ∣u∣H1+r(U)2:=∑j=1d[∂ju]Hr(U)2. For vector fields, use the sum of the componentwise squared Hr norms. Use these definitions on each cell K and on the full domain Ω, with ∥u∥H1+r(U)2:=∥u∥H1(U)2+∣u∣H1+r(U)2. At r=1, set H1(U)=W1,2(U), interpret [q]H1(U)2:=∥∇q∥L2(U)2, and set H1+r(U)=W2,2(U) with the integer-order membership of Integer-order Sobolev spaces and their norms, retaining the displayed full-norm rule. Thus ∣u∣H2(U)2=∑j,k∥∂k∂ju∥L2(U)2. This Hessian convention counts mixed derivatives twice: its full norm is equivalent to, rather than identical with, the ordinary multi-index W2,2 norm, with ∥u∥W2,2(U)≤∥u∥H2(U)≤2 ∥u∥W2,2(U). The local seminorm is the restriction of the Slobodeckij convention in The Gagliardo--Slobodeckij space on Euclidean space to U×U.

Depends on

Used by

Dependency tree · two levels

18 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