Alphabeta Math
LemmaStatement: AI-generatedProof: AI-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.

Uniform endpoint localization in a smooth boundary chart

Statement

Assume AC. Let n≥1 be an integer, 1<q<∞, K∈{R,C}, and let Ω⊆Rn be open. All function spaces below consist of Lebesgue almost-everywhere classes with values in K; W1,q uses weak derivatives and the norm ∥v∥W1,q(D)q=∥v∥Lq(D)q+∑j=1n∥∂jv∥Lq(D)q on each indicated open set D.

Fix the following local graph data. Let A(x)=Qx+c be a rigid motion, let B∗⊆Rn−1 be an open ball, and let h∈C∞(B∗;R). Let W⊆Rn be open with A(W)⊆B∗×R. For A(x)=(y,s) define the ambient chart and its inverse by Φ:W⟶V:=Φ(W),Φ(x)=(y,s−h(y)),Ψ(y,t)=A−1(y,h(y)+t). Require the exact one-sided identity Φ(Ω∩W)=V∩H+, where H+=Rn−1×(0,∞). Choose open balls B0,B⊆Rn−1 with B0‾⊂B and B‾⊂B∗, and numbers 0<b<a, so that C=B×(−a,a) satisfies C‾⊂V. Put C+=B×(0,a), U=Ψ(C) and K=B0‾×[−b,b]. Thus K⊂C is compact and U‾⊂W is compact. These are local graph hypotheses only; Ω need not be bounded. For n=1, all bases are the one-point space R0, h is constant and the same interval conventions apply.

Let ρ,ψ∈Cc∞(U;R), regarded as ambient smooth functions by zero extension, with supp⁡ρ⊆Ψ(K). For u∈Lq(Ω;K) define (Lρu)(y,t)={ρ(Ψ(y,t))u(Ψ(y,t)),(y,t)∈C+,0,(y,t)∈H+∖C+, and, writing (Rf)(y,t)=f(y,∣t∣) for t≠0 and (Rf)(y,0)=0, define (Tρ,ψu)(x)={ψ(x)(RLρu)(Φ(x)),x∈U,0,x∈Rn∖U. These formulas give well-defined linear maps Lρ:Lq(Ω;K)→Lq(H+;K) and Tρ,ψ:Lq(Ω;K)→Lq(Rn;K). Their restrictions map W1,q(Ω;K) boundedly into W1,q(H+;K) and W1,q(Rn;K), respectively. More precisely, for X0(D)=Lq(D;K) and X1(D)=W1,q(D;K) there are constants M0,M1, depending only on the fixed chart, cutoffs and n,q, such that ∥Lρu∥Xj(H+)+∥Tρ,ψu∥Xj(Rn)≤Mj∥u∥Xj(Ω)(j=0,1). If ψ=1 on supp⁡ρ, then (Tρ,ψu)∣Ω=ρu almost everywhere. Such ψ exists. The formulas use the same geometric data at both endpoints and may be fixed independently of q; the bounds may depend on q.

Facts & Assumptions

Given: The hypotheses and conventions of the Statement.

[F1]

Assume the Axiom of Choice The Axiom of Choice. Its countable instances supply the choice assumptions of the Sobolev, weak-chain-rule, multiplication, zero-extension, change-of-variables, null-set and measurability inputs; reflection is used under its stated AC hypothesis. The local formulas are explicit.

[F2]

Ck boundary flattening preserves local Wk,p supplies the k=1, p=q weak chain rule and Sobolev composition bounds on matched compactly contained patches. Its Statement is for diffeomorphisms of arbitrary open sets; it does not require those sets to be bounded domains. The separate inputs [F8]–[F10] below supply the claims for arbitrary Lq inputs.

[F3]

Test function cutoffs and euclidean localization supplies smooth cutoffs on compact subsets of open sets, including a ψ equal to 1 near supp⁡ρ. Weak Leibniz rule with a smooth factor bounds multiplication by the fixed cutoffs on W1,q; on Lq their supremum norms suffice.

[F4]

One flat reflection with simultaneous Lq and W1q bounds gives the stated single map R:Lq(H+;K)→Lq(Rn;K), bounded on W1,q as well, with its compact-cylinder almost-everywhere vanishing assertion.

[F5]

Compactly supported Sobolev functions extend by zero in every integer order gives zero extension for support compactly inside an open set, at orders 0 and 1. Before reflection, support can approach t=0; only the artificial edges are crossed, and the local test argument below establishes that partial extension directly.

[F6]

Integer-order Sobolev spaces and their norms supplies the real and complex almost-everywhere class conventions, W0,q=Lq, the weak test identity with bilinear pairing and no conjugation, and the displayed first-order norm, on arbitrary open subsets of Rn.

[F7]

The graph-chart convention is a local adaptation of Bounded Ck domains and boundary charts: only its one-sided graph geometry is used. Reversing the normal rigid coordinate converts its subgraph convention to the supergraph convention in the Statement. We impose the displayed local identity on W, not the supplier's global bounded-domain property on Ω. The smooth graph shear and its inverse have absolute Jacobian determinant 1 and bounded first derivatives on the fixed compact patches.

[F8]

A C¹ diffeomorphism satisfies the change-of-variables formula for nonnegative Lebesgue measurable functions gives ∫D2a=∫D1(a∘S)∣det⁡DS∣ for every nonnegative Lebesgue measurable a on D2, when S:D1→D2 is a C1 diffeomorphism between open subsets of Rn, under Countable Choice. We use a=∣w∣q, including for weak derivative classes, and the graph charts have absolute Jacobian determinant 1.

[F9]

A C¹ diffeomorphism maps Lebesgue null sets to Lebesgue null sets says, under Countable Choice, that a C1 diffeomorphism between open subsets of Rn maps Lebesgue null sets to null sets. Applying it to the inverse diffeomorphism also gives null preimages, which ensure independence from almost-everywhere representatives.

[F10]

A C¹ diffeomorphism maps Lebesgue measurable sets to Lebesgue measurable sets says, under Countable Choice, that a C1 diffeomorphism between open subsets of Rn maps Lebesgue measurable sets to Lebesgue measurable sets. Applying it to the inverse diffeomorphism gives measurable preimages and hence measurability of compositions of real or complex Lebesgue measurable functions with the chart maps.

Proof

Given: The hypotheses and data in the Statement.

Goal: Establish the two bounded endpoint maps and their restriction identity.

1.1F1F6F7F8F9F10given

The given graph formulas make Φ and Ψ smooth inverses on the ambient open sets W,V, with ∣det⁡DΦ∣=∣det⁡DΨ∣=1. Smoothness on neighborhoods of U‾ and C‾ bounds both first derivatives there. The exact one-sided identity gives Ω∩U=Ψ(C+). Thus Ψ:C+→Ω∩U and Φ:U→C are C1 diffeomorphisms between open sets, as are their inverses. AC supplies Countable Choice for [F8]–[F10]. For any such restriction S:D1→D2, [F10] applied to S−1 makes preimages of Lebesgue measurable sets measurable; in particular w∘S is measurable for every real or complex measurable w on D2. If two representatives differ on a null set N⊂D2, their compositions differ only on S−1(N), which is null by [F9] applied to S−1. Finally [F8] applied to the nonnegative measurable function ∣w∣q gives ∥w∘S∥Lq(D1)q=∥w∥Lq(D2)q, since ∣det⁡DS∣=1. This proves the chart composition assertions for arbitrary Lq classes in both directions on the positive and doubled patches.

2.1F1F2F6F7F8step 1.1

Apply [F2] with k=1, p=q on matched compactly contained subpatches of C+ and Ω∩U. Every compact weak test support is contained in such a pair, so the weak chain rule holds throughout C+, and in the reverse direction throughout Ω∩U. In particular ∂i(w∘Ψ)=∑j=1n((∂jw)∘Ψ)∂iΨj there. Integrating this finite sum using the fixed first-derivative bounds and the Lq identity in step 1.1 for each ∂jw gives ∥w∘Ψ∥W1,q(C+)≤C∥w∥W1,q(Ω∩U). The reverse composition bound follows in the same way. The same reasoning on C,U gives the doubled-chart Sobolev composition bounds. These are restrictions of the same well-defined Lq compositions from step 1.1.

3.1F3F5F6step 1.1step 2.1

Multiplication by ρ and steps 1.1 and 2.1 bound g=(ρu)∘Ψ on C+ at both endpoints. It vanishes almost everywhere outside K∩C+, so it misses the artificial lateral and top edges. Here is the weak test argument for its zero extension f=Lρu to H+. Choose θ∈Cc∞(C) equal to 1 near K. For any φ∈Cc∞(H+), θφ∈Cc∞(C+), because φ stays away from t=0. The weak derivatives of g vanish on the open set C+∖K: there g=0 and the weak test identity and uniqueness of its derivative classes give zero derivatives. Consequently the terms containing derivatives of θ vanish, and the weak identity for g tested against θφ becomes ∫H+f ∂jφ=−∫H+E+(∂jg)φ, where E+ denotes zero extension from C+ to H+. This proves the partial extension with unchanged component norms. No test crosses the actual boundary t=0 and no zero boundary condition is assumed. Thus Lρ has the asserted Lq and W1,q bounds.

4.1F2F3F4F5F6F7step 1.1step 2.1step 3.1∎

By [F4], Rf is bounded at both endpoints and vanishes almost everywhere outside K, since the positive support lies in B0‾×[0,b]. In particular its reflected support remains compactly inside C. Pull it back to U by Φ, multiply by ψ, and extend by zero outside U. Steps 1.1 and 2.1, [F3] and [F5] give the asserted bounds for this same Tρ,ψ formula, because the multiplied support is compactly inside U. On Ω∩U the coordinate lies in C+, so reflection is the identity and Tρ,ψu=ψρu there. Outside U both sides vanish. If ψ=1 on supp⁡ρ, this is ρu throughout Ω; [F3] supplies such a ψ. All operations are linear on almost-everywhere classes, and the W1,q maps are restrictions of the same Lq formulas. The geometric data and formulas do not involve q, proving the final assertion.

Depends on

Used by · 1

Dependency tree · 2 levels

Each result is drawn at its shortest distance from this item. Arrows run from prerequisites to the items that use them; this item has a heavier outline. External source nodes link directly to the cited text. The view shows up to two dependency steps; open a prerequisite to continue.