Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-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.

A reference simplex is an integer-order Sobolev extension domain

Statement

Assume the Axiom of Choice. Let d≥2. For every integer k≥0 and 1≤p≤∞, there is a bounded linear operator Ek,p:Wk,p(S^d)⟶Wk,p(Rd) whose restriction to S^d is the input class. Consequently S^d is a Wk,p-extension domain in the sense of Sobolev extension domains and extension operators. The operator may be chosen with support in one fixed bounded set.

Facts & Assumptions

Given: d≥2, the reference simplex, k∈N0, 1≤p≤∞, and the Axiom of Choice.

[F1]

Affine pullback and pushforward preserve Wk,p, with weak derivatives and norm bounds controlled by the fixed affine matrix. (Affine pullback of weak derivatives and Sobolev seminorms)

[F2]

On a half-space, for every integer k and p there is an explicit bounded extension built from finitely many reflected values; its coefficients satisfy ∑jaj(−j)r=1 for 0≤r<k, so normal derivatives through order k−1 match at the reflecting hyperplane. Its proof verifies the weak derivative identity by ACL sections, integration by parts and Fubini, and gives a bound depending only on k,p,d. (Integer-order Sobolev extension from a half-space)

[F3]

Smooth cutoffs with compact support in a prescribed chart exist; the weak Leibniz rule bounds localized Sobolev norms; and a function supported away from the artificial edge of an open chart can be extended by zero across that edge by the weak test identity. (Test function cutoffs and euclidean localization, Weak Leibniz rule with a smooth factor, Compactly supported Sobolev functions extend by zero in every integer order)

[F5]

The Axiom of Choice implies each finite sequence of affine charts, cutoffs and local extension maps needed below can be selected; the local half-space extension theorem itself assumes this axiom. (The Axiom of Choice)

[F6]

A Wk,p-extension domain admits a bounded linear operator to Wk,p(Rd) whose restriction is the input almost-everywhere class. (Sobolev extension domains and extension operators)

Proof

1.1givenalgebra

Let z∈S^d‾. Define the barycentric affine coordinates by λ0(x)=1−∑i=1dxi and λi(x)=xi for 1≤i≤d; they sum to one and are nonnegative exactly on the closed simplex. The active set I(z)={i:λi(z)=0} has at most d elements, and the gradients of the corresponding coordinates are linearly independent. Complete these affine coordinates to an invertible affine coordinate system y=(λi)i∈I(z),ym+1,…,yd, where m=∣I(z)∣. Because every inactive barycentric coordinate is strictly positive at z, a sufficiently small neighbourhood Uz meets the simplex exactly in the orthant chart y1>0,…,ym>0; for m=0 it is an interior chart.

2.1F3F4step 1.1

The charts Uz cover the compact closure, so [F4] gives a finite subcover. Shrink them to open sets Vj still covering the closure, with V‾j⊂Uj. Use [F3] to choose smooth cutoffs θj supported compactly in Uj and equal to one on Vj. Their sum S is positive on a neighbourhood N of the closed simplex. Choose a smooth cutoff χ supported compactly in N and equal to one near the closed simplex, and set ηj=χθj/S on N, zero outside N. Then each ηj is smooth and supported in its chart, and their sum is one near the simplex. Each localized input ηju has norm bounded by a fixed multiple of ∥u∥Wk,p(S^d) by the product rule in [F3].

3.1F3step 2.1

In an interior chart, the localized function is zero near the chart edge. Its zero extension to Rd has the same weak derivatives: for any test function, multiply that test by a cutoff equal to one on the localized support, apply the weak identity on the chart, and note that all derivatives of the cutoff product agree on that support. This is the zero-extension part of [F3]. In a boundary chart with m active faces, the localized function is a Wk,p function on the orthant Om=(0,∞)m×Rd−m and vanishes near the artificial edge of the chart; extend by zero across only that artificial edge using the same test-function argument.

4.1F1F2step 3.1

Extend from Om to Rd one coordinate at a time. At each stage, apply the reflected half-space formula in [F2] to the coordinate being extended, with the other m−1 positive coordinates as tangential variables. For clarity, the coordinate formula on t<0 is ∑j=1kajw(x′,−jt), with ∑jaj(−j)r=1 for 0≤r<k; for k=0 use even reflection. For a test compactly supported in Om−1×R, apply the half-space proof's normal ACL trace and integration-by-parts identity on each compact tangential subdomain and then exhaust the test support by finitely many such subdomains. Tangential weak derivatives pass through the finite reflection sum by the weak test identity, and the displayed moment equations cancel every normal interface term. The change of variable s=−jt bounds each reflected derivative in Lp by the same finite coefficient sum as in [F2] (and by the corresponding essential supremum sum at p=∞). Thus this explicit operator is bounded on Wk,p(Om) and extends one orthant coordinate. Repeating at most m≤d times gives the required extension. Pulling back through the affine chart changes the bound by a finite factor from [F1].

5.1F5F6step 2.1step 4.1∎

Apply these local bounded linear extensions to the finitely many localized pieces and add them. Their sum is bounded and linear, and on S^d its restriction is ∑jηju=u. There are finitely many charts, all have bounded coordinate images and the reflection operators add support only by fixed finite factors, so the sum is supported in a fixed bounded set. The definition of extension domain in [F6] gives the conclusion.

Depends on

Used by

Dependency tree · two levels

61 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