Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: AI-adaptedPipeline-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.

Zero trace, zero boundary values and zero extension agree on an interval

Example

Assume the Axiom of Choice. Let I=(0,1), 1≤p<∞ and u∈W1,p(I;K) with absolutely continuous representative u∗ (One-dimensional W1,p functions have unique absolutely continuous representatives), and let T be the endpoint-pair trace of The trace of a one-dimensional Sobolev function is the pair of endpoint values. The following four statements are equivalent:

(i) Tu=0;

(ii) u∗(0)=u∗(1)=0;

(iii) u∈W01,p(I;K), the W1,p-closure of Cc∞(I) (Zero-boundary Sobolev space as a norm closure);

(iv) the extension of u by zero outside I belongs to W1,p(R;K).

For u(x)=x(1−x) all four hold: the zero extension is the continuous function equal to x(1−x) on [0,1] and to 0 outside, with weak derivative 1−2x on (0,1) and 0 outside. For u≡1 all four fail: Tu=(1,1)≠0, and the zero extension cannot belong to W1,p(R) by the implication proved in step 1.2 below.

Facts & Assumptions

Given: The Axiom of Choice; I=(0,1), 1≤p<∞; a class u∈W1,p(I;K) with unique absolutely continuous representative u∗; and the trace Tu=(u∗(0),u∗(1)) of The trace of a one-dimensional Sobolev function is the pair of endpoint values.

[F1]

On I=(0,1) the trace is the pair (u∗(0),u∗(1)), it depends only on the class, and u∈W01,p(I) if and only if Tu=(0,0), equivalently if and only if u∗(0)=u∗(1)=0. (The trace of a one-dimensional Sobolev function is the pair of endpoint values)

[F2]

Every class u∈W1,p(I;K) has exactly one continuous locally absolutely continuous representative u∗, which extends uniquely to an absolutely continuous function on the closure when I is bounded; on an unbounded interval the same uniqueness holds with absolute continuity on compact subintervals. (One-dimensional W1,p functions have unique absolutely continuous representatives)

[F3]

Assume the Axiom of Choice. For open Ω⊆Rn and 1≤p<∞: u∈W1,p(Ω;K) if and only if u∈Lp has an ACL representative whose classical coordinate derivatives exist a.e., are measurable and lie in Lp; then these represent the weak derivatives. (The ACL characterisation of W1,p)

[F4]

W01,p(I) is the closure in the W1,p(I) norm of Cc∞(I); its elements are Lp classes. (Zero-boundary Sobolev space as a norm closure, Integer-order Sobolev spaces and their norms)

Verification

1.1F2F3algebragiven

Endpoint vanishing implies zero extension in W1,p(R). Assume u∗(0)=u∗(1)=0 and let U be the extension of u∗ by zero outside (0,1). Then U is continuous on R and absolutely continuous on every compact interval: on a compact interval meeting (0,1) any finite family of disjoint subintervals has U-increments equal to the corresponding u∗-increments after intersecting with (0,1), with the increments over pieces crossing an endpoint bounded by ∣u∗∣ evaluated there, so the absolute-continuity modulus of u∗ controls U. Hence U is differentiable a.e. with U′=u′ a.e. on (0,1) and U′=0 a.e. outside, so U′∈Lp(R) with ∥U′∥Lp(R)=∥u′∥Lp(I); also U∈Lp(R) with the same norm as u. By the ACL characterization [F3] applied on R, U∈W1,p(R;K).

1.2F2algebragiven

Zero extension in W1,p(R) implies endpoint vanishing. Conversely, let U∈W1,p(R) be the zero extension of u and let U~ be its unique continuous locally absolutely continuous representative [F2]. Since U=0 a.e. on (−1,0) and on (1,2), continuity of U~ forces U~=0 on (−1,0] and on [1,2): a continuous function vanishing a.e. on an interval vanishes identically there. On (0,1) the classes of U and of u coincide, so U~=u∗ a.e. on (0,1), and as both are continuous they agree identically there; taking the limits at the endpoints gives u∗(0)=U~(0)=0 and u∗(1)=U~(1)=0.

2.1F1F4step 1.1step 1.2algebra

The equivalence chain. By [F1] the conditions (i), (ii) and (iii) are mutually equivalent: Tu=0 means exactly u∗(0)=u∗(1)=0, and this is exactly the criterion for membership in the closure space W01,p(I) of [F4]. Steps 1.1 and 1.2 add (ii)⇔(iv), so all four conditions are equivalent.

3.1F1step 1.2step 2.1algebra∎

The two worked functions. For u(x)=x(1−x) one has u∗=u (a polynomial is its own absolutely continuous representative), u∗(0)=u∗(1)=0 and hence all four conditions hold by step 2.1; explicitly the zero extension is continuous, is absolutely continuous on R with classical derivative 1−2x on (0,1) and 0 outside, so its weak derivative is the zero extension of u′, in agreement with step 1.1. For u≡1 one has u∗≡1, so Tu=(1,1)≠(0,0) and u∗(0)=u∗(1)=1≠0; by [F1] the conditions (i), (ii), (iii) fail, and (iv) fails as well: if the zero extension belonged to W1,p(R), step 1.2 applied to it would force u∗(0)=u∗(1)=0, contradicting u∗≡1.

Source notes

Teschl's Lemma 9.21 with Problem 9.16 (printed pp. 210-211) records both directions of the kernel identification and the zero-extension property of W01,p classes; Laugesen's Corollary 3.15 (printed p. 64) states the zero trace criterion, and Hunter's Theorem 3.44 (printed p. 72) is the half-space model. The equivalence with the zero extension is proved above through the absolutely continuous representative, and the failure for the constant function is the contrapositive of the zero-extension implication in step 1.2.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

57 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