Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: AI-adaptedPipeline-generatedprecheck passaudited 2026-10-02
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.

Even reflection on the half-line

Example

Assume the Axiom of Choice. Let u∈W1,p(0,∞), 1≤p≤∞, and define the even reflection Eu(x):=u(∣x∣) for almost every x∈R. Then Eu∈W1,p(R), with weak derivative (Eu)′(x)=u′(x)  (x>0),(Eu)′(x)=−u′(−x)  (x<0), and the norms satisfy ∥Eu∥W1,p(R)=21/p∥u∥W1,p(0,∞)  (1≤p<∞),∥Eu∥W1,∞(R)=∥u∥W1,∞(0,∞). The finite-p factor is 21/p and not 2: the printed factor two in the source's Example 2.39 is a typographical slip for p>1, while the p=∞ normalisation genuinely has factor one.

Facts & Assumptions

Given: the Axiom of Choice; a class u∈W1,p(0,∞) with 1≤p≤∞; and the even reflection Eu(x)=u(∣x∣).

[L1]

Under the assumed Axiom of Choice, half-space extension for n=1 gives a bounded linear operator Wk,p(0,∞)→Wk,p(R) for every k≥0 and 1≤p≤∞, equal to u on (0,∞). For k≥1, its value at t<0 is ∑j=1kaju(−jt), where ∑j=1kaj(−j)m=1 for m=0,…,k−1; for k=0 it is even reflection (Integer-order Sobolev extension from a half-space).

[L2]

Norm conventions: ∥w∥W1,p(0,∞)=(∥w∥Lpp+∥w′∥Lpp)1/p for 1≤p<∞ and ∥w∥W1,∞(0,∞)=max⁡{∥w∥∞,∥w′∥∞}, and likewise on R (Integer-order Sobolev spaces and their norms).

[L3]

Linear change of variables: for the reflection x↦−x and nonnegative measurable f, ∫−∞0f(x) dx=∫0∞f(−y) dy, and ∫R∣w(∣x∣)∣p dx=2∫0∞∣w(y)∣p dy (A linear map T of Rn sends Lebesgue measurable sets to Lebesgue measurable sets, with λn(T[E])=∣det⁡T∣ λn(E) when T is invertible and T[E] Lebesgue null when it is not).

Verification

technique · direct
1.1L1given

Take k=1 in [L1]. The moment system for k=1 is the single equation ∑j=11aj(−j)0=1, so a1=1 is the unique coefficient, and the extension operator of [L1] is E1,pu(x)=u(x) for x>0 and E1,pu(x)=a1u(−x)=u(−x) for x<0; this is the even reflection Eu(x)=u(∣x∣). Hence Eu∈W1,p(R) for every 1≤p≤∞, and its weak derivative satisfies (Eu)′=u′ on (0,∞) and (Eu)′(x)=−u′(−x) on (−∞,0), as the k=1 instance of the reflection formula.

2.1L2L3step 1.1

Finite p. By [L3] and step 1.1, ∥Eu∥Lp(R)p=2∥u∥Lp(0,∞)p and ∥(Eu)′∥Lp(R)p=∫0∞∣u′(x)∣pdx+∫−∞0∣u′(−x)∣pdx=2∥u′∥Lp(0,∞)p; adding the two components and using [L2] gives ∥Eu∥W1,p(R)p=2∥u∥W1,p(0,∞)p, that is, ∥Eu∥W1,p(R)=21/p∥u∥W1,p(0,∞).

3.1L2step 2.1∎

Case p=∞ and the source comparison. Both x↦∣Eu(x)∣ and x↦∣(Eu)′(x)∣ are even and agree on (0,∞) with ∣u∣, respectively ∣u′∣, so their essential suprema coincide with those of u and u′; by [L2] the maximum norm is unchanged: ∥Eu∥W1,∞(R)=∥u∥W1,∞(0,∞). The displayed identity in the cited reflection example, which prints factor 2 for 1≤p<∞ and factor 1 for p=∞, agrees with the computation at p=1 and p=∞; the correct finite-p factor is the 21/p of step 2.1.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

49 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