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.

Hölder spaces Ck,α, closure and interior scaled norms, and Ck,α domains

Definition

Let n≥1 be an integer, let k≥0 be an integer, let 0<α<1 and let K∈{R,C}. Fix an open set Ω⊆Rn and a function u∈Ck(Ω;K), where Ck and the canonical-order derivatives Dβu are those of Ck maps and multi-index derivative notation in Euclidean space. Put [u]k,α;Ω:=∑∣β∣=k sup⁡x,y∈Ωx≠y∣Dβu(x)−Dβu(y)∣∣x−y∣α,∥u∥Ck,α(Ω):=∑j=0k sup⁡x∈Ω max⁡∣β∣=j∣Dβu(x)∣+[u]k,α;Ω, where the sums and maxima run over the finitely many multi-indices of the stated order. The quantity [u]k,α;Ω is the k-th order α-Hölder seminorm of u and the quantity ∥u∥Ck,α(Ω) the Ck,α norm of u; both are taken in [0,+∞], so the "norm" may be +∞ and only the class below carries a genuine normed-space structure.

The local Hölder class Clock,α(Ω;K) consists of the u∈Ck(Ω;K) with [u]k,α;Ω′<+∞ for every Ω′⋐Ω. The bounded class Ck,α(Ω;K)=Cbk,α(Ω;K) consists of the u∈Ck(Ω;K) with ∥u∥Ck,α(Ω)<+∞. Thus Ck,α(Ω;K)⊆Clock,α(Ω;K), and the inclusion may be strict: on Ω=Rn the function u(x)=sin⁡(∣x∣2) lies in the local class (it is C1, hence locally α-Hölder on every compact set), while [u]0,α;Rn=+∞, because at the points xj=2πj e1 and yj=xj+(22πj)−1e1 the difference quotients are ≍(22πj)α→∞. On the bounded class the displayed formula is a norm, and the assignment u↦∥u∥Ck,α(Ω) is that norm.

Scaled interior norm. For a ball BR(x0)⊆Ω of radius R>0 and centre x0, write [v]0,α;B:=sup⁡{∣v(x)−v(y)∣/∣x−y∣α:x,y∈B, x≠y} for the plain Hölder seminorm on a set B, and put ∥u∥k,α;BR(x0)∗:=∑j=0kRjmax⁡∣β∣=j sup⁡BR(x0)∣Dβu∣+Rk+αmax⁡∣β∣=k[Dβu]0,α;BR(x0). On every ball, C2,α(BR(x0)) therefore agrees with the finite-scaled-norm class of that dependency. This is the scaled interior norm of u on the ball; for k=2 it is exactly the scaled quantity of Local Hölder and scaled C-two-alpha norms on balls, and it takes values in [0,+∞] as well. It is read off the open ball alone.

Bounded Ck,α domains. A bounded Ck,α domain in Rn is a bounded nonempty open set Ω⊆Rn with the following local graph property: for every x∈∂Ω there are an open neighbourhood W of x, a rigid motion R(p)=Qp+b with orthogonal Q and b∈Rn, an open ball B⊆Rn−1 and a function φ∈Ck,α(B;R) such that, after shrinking W so that R(W)⊆B×R, R(Ω∩W)=R(W)∩{y=(y′,yn)∈B×R: yn<φ(y′)}. This generalises the integer-order notion of Bounded C^k domains and boundary charts to the Hölder scale, with the same one-sided graph convention; the regularity φ∈Ck,α(B) is the only strengthening, connectedness is not required, and no boundary seminorm is attached to the interior norms above. In dimension n=1 the corresponding sets are finite disjoint unions of bounded open intervals.

The boundary-extension class. Let Ω be bounded and let u∈Cbk,α(Ω;K). Say that u lies in Ck,α(Ω‾;K) when each derivative field Dβu with ∣β∣≤k extends continuously to Ω‾. The extension of each field is then unique, since Ω is dense in Ω‾, and the sup and Hölder quantities formed with the extended fields and suprema over Ω‾ agree with those displayed above, formed over Ω: a supremum over the dense subset Ω already computes the supremum of the extension, and for the seminorm the inequality [v~]0,α;Ω‾≤[v]0,α;Ω follows by approximating a pair in Ω‾ by pairs in Ω, so the two seminorms are equal. We equip Ck,α(Ω‾;K) with this common norm. This is the Hölder-scale analogue of the interior-up-to-boundary convention for integer order Cm(Ω‾) fixed in Bounded C1 domains and their outward normals.

Remarks

  • Scaling. If R>0, x0∈Rn and v(z):=u(x0+Rz) on B1(0), then Dβv(z)=R∣β∣Dβu(x0+Rz), and consequently ∥v∥k,α;B1(0)∗=∥u∥k,α;BR(x0)∗. The powers Rj and Rk+α are exactly what makes this identity hold; the same computation with k=2 is the one recorded in Local Hölder and scaled C-two-alpha norms on balls.
  • Boundary extension. For k=0, every element of Cb0,α(Ω) is uniformly continuous and extends uniquely to Ω‾: for any boundary point choose an interior sequence converging to it, use the Hölder bound to make its values Cauchy, and compare two sequences by the same bound. For k≥1, boundedness of the lower-order fields need not give their boundary limits on an arbitrary open set. For example, let Ω=((0,1)×(0,2))∪((1,2)×(0,2)) and let u equal 0 on the first component and 1 on the second. All positive-order derivatives vanish, so ∥u∥Ck,α(Ω)=1 for k≥1, but u has no limit at (1,1). This set fails the one-sided boundary graph condition at the removed interface. The definitions assert no trace theorem, completeness or compactness.
  • Local versus bounded. The local class tests compactly contained subsets; the bounded class additionally controls all derivative suprema and the global top-order seminorm. On arbitrary bounded open sets, lower-order suprema can also fail: on the disjoint intervals Ij=(2−j,2−j+2−j−2), the function equal to j on Ij is locally smooth with every positive-order derivative zero, but is unbounded. Thus boundedness of the domain alone does not identify the two classes.
  • Choice. The definition itself uses no choice principle; later completeness, approximation and embedding statements on this page state their own Countable Choice hypotheses.

Depends on

Used by

Dependency tree · two levels

17 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