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

The coordinate inequality ∥xjf∥2∥Djf∥2≥12∥f∥22

Statement

Assume Countable Choice. Let n≥1, j∈{1,…,n} and f∈H1(Rn;C) with xf∈L2(Rn;Cn). Here H1=W1,2 under the regular-distribution identification of Integer-order W^{k,2} and H^k agree with equivalent norms, and Djf∈L2 denotes the weak partial derivative. Then ∥xjf∥2 ∥Djf∥2≥12∥f∥22. By the Fourier characterization of H1, this is the coordinate estimate on the natural domain where both ∣x∣f and ∣ξ∣f^ lie in L2. Both sides vanish when f=0; for nonzero f the right side is positive.

Facts & Assumptions

Given: Countable Choice, n≥1, j∈{1,…,n}, and f∈H1(Rn;C) with xf∈L2(Rn;Cn).

[A1]

Countable Choice is the assumption carried by the Sobolev and compact-support integration-by-parts interfaces below (The Axiom of Countable Choice (ACω)).

[F1]

The Fourier characterization identifies H1 with W1,2 under the regular-distribution embedding, so each weak derivative Dkf belongs to L2; its Fourier-side weight is ⟨ξ⟩f^ (Integer-order W^{k,2} and H^k agree with equivalent norms).

[F2]

There is a real smooth cutoff χ with 0≤χ≤1, χ=1 on ∣x∣≤1, χ=0 on ∣x∣≥2, and Dj(χ(x/R))=R−1(Djχ)(x/R) (Explicit compactly supported smooth cutoffs).

[F3]

For u∈W1,2 and a smooth multiplier ρ with bounded derivatives, ρu∈W1,2 and Dj(ρu)=(Djρ)u+ρDju (Weak Leibniz rule with a smooth factor).

[F4]

If u,v∈W1,2(Rn) and one factor is compactly supported as an almost-everywhere class, then ∫uDjv=−∫vDju (Integration by parts for dual-exponent Sobolev functions).

[F5]

Complex L2 satisfies Cauchy–Schwarz, so the product of two L2 functions is integrable (Complex completeness, density, and inner product: the consumer interface).

[F6]

If integrable functions converge almost everywhere under a common integrable majorant, their integrals converge (Dominated convergence).

[F7]

The Sobolev test identity is bilinear and does not conjugate its test function (Integer-order Sobolev spaces and their norms, Complex Lp classes and Euclidean test-function conventions).

Proof

technique · cutoff integration by parts, followed by vanishing $L^2$ tails
1.1A1F1F7given

Since f∈H1=W1,2 by [F1], each weak derivative Dkf lies in L2. Conjugating the bilinear weak-derivative test identity for f shows that f‾∈W1,2 and Dkf‾=Dkf‾: for each ϕ∈Cc∞, apply the identity to ϕ‾ and conjugate it.

2.1F2F3F4step 1.1given

For R≥1 set χR(x)=χ(x/R) and ρR(x)=xjχR(x). By [F2], ρR∈Cc∞; by [F3] and step 1.1, vR:=ρRf‾ belongs to W1,2 and is compactly supported, with DjvR=(χR+xjDjχR)f‾+xjχRDjf‾. Applying [F4] to u=f and v=vR gives ∫fDjvR=−∫vRDjf, hence ∫χR∣f∣2+∫xjDjχR∣f∣2=−2Re⁡∫xjχRf‾Djf. The last identity uses that χR and xj are real-valued, so the two derivative terms are complex conjugates.

3.1F2F5F6step 2.1

Let R→∞ through positive integers. We have χR(x)→1 pointwise and 0≤χR≤1, so dominated convergence [F6] gives ∫χR∣f∣2→∥f∥22. The derivative DjχR vanishes unless R≤∣x∣≤2R, and ∣xjDjχR∣≤2∥Djχ∥∞ there by [F2]; for every fixed x this factor is eventually zero. Since ∣f∣2∈L1, [F6] gives ∫xjDjχR∣f∣2→0. Finally, xjf‾Djf∈L1 by [F5], because xjf,Djf∈L2; dominated convergence with ∣χR∣≤1 yields ∥f∥22=−2Re⁡∫xjf‾Djf.

4.1F5step 3.1∎

By [F5] and ∣Re⁡z∣≤∣z∣, ∥f∥22≤2∫∣xjf∣ ∣Djf∣≤2∥xjf∥2∥Djf∥2. Dividing by 2 proves the inequality. If f=0 both sides vanish; if f≠0 the lower bound is positive.

Depends on

Used by

Dependency tree · two levels

71 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