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

Sharp Sobolev threshold for a radial power

Sources

  • Juha Kinnunen, Sobolev Spaces, Chapter 1 §1.2, Example 1.10, printed pp. 6–7. For n≥2 and a>0, the example differentiates ∣x∣−a off the origin, integrates by parts on the punctured ball, and bounds the inner boundary term by a constant times εn−1−a; it then computes the Lp and W1,p thresholds for 1≤p<n. The source's weak-derivative argument requires a<n−1, which is implied by its Sobolev range. It does not cover n=1, the Lp threshold for p≥n, or the p=∞ statement. Those cases and the cutoff proof below are supplied here.

Statement

Assume the Axiom of Countable Choice. Let n≥1, a>0, and B=B(0,1)⊆Rn. For an arbitrary finite c∈R, define u:B→R by u(0)=c and u(x)=∣x∣−a for x≠0. For every finite 1≤p<∞, u∈Lp(B)⟺ap<n, and u∈W1,p(B;R)⟺p(a+1)<n. Whenever p(a+1)<n, the weak derivative Diu is the almost-everywhere class represented off the origin by vi(x)=−axi∣x∣−a−2; one may set vi(0)=0. In all dimensions u∉L∞(B), and therefore u∉W1,∞(B;R).

Facts & Assumptions

Given: The Axiom of Countable Choice, n≥1, a>0, the unit ball B, c∈R, and a test function φ∈Cc∞(B;C).

[F1]

The only choice principle assumed is the Axiom of Countable Choice, written ACω: every countable family of nonempty sets has a choice function (The Axiom of Countable Choice (ACω)).

[F2]

For W1,p, the function class and each first weak-derivative class must be in Lp; the zero multi-index is the function itself (Integer-order Sobolev spaces and their norms). Real Lp classes are equivalence classes of measurable representatives with finite p-integral, and L∞ means essentially bounded (The space Lp(μ) as the quotient by null functions, The function space Lp(μ) for 0<p<∞, The space L∞(μ) of essentially bounded measurable functions). The weak first-derivative identity is ∫Bf ∂iφ=−∫Bgφ for every test, with the complex bilinear convention and no conjugation (Weak derivative of a locally integrable function, Test function space d of an open set, Ck maps and multi-index derivative notation in Euclidean space).

[F3]

Under ACω, polar integration for nonnegative Borel functions uses the finite Borel sphere measure σ and density rn−1dr; by definition σ(E)=nλn({rω:ω∈E, 0<r≤1}) (Polar coordinates decompose Lebesgue measure into rn−1 dr dσ, The polar surface set function on the unit sphere). In particular the origin is null, and σ(Sn−1) is positive once the unit ball has positive measure.

[F4]

For real q and 0<R≤1, dyadic annuli give ∫0Rrq dr<∞ exactly when q>−1; in that case the integral is bounded by CqRq+1 for a finite Cq. Indeed, on Ak=(R2−k−1,R2−k], monotonicity of real powers bounds the integral by a constant times Rq+1(2−(q+1))k when q>−1, and bounds it below by such terms when q≤−1. Monotone convergence passes from finite unions of annuli to (0,R], and the geometric series converges exactly for a ratio in (0,1) (Real powers for positive bases, with the zero-base positive-exponent convention, The exponent, product, quotient, and iterated-power laws for positive real bases and real exponents, Continuity and derivatives of positive-base real powers, The mean value theorem, as the case g(x)=x of Cauchy's: for f continuous on [a,b] with a<b and differentiable on (a,b) there is c∈(a,b) with f(b)−f(a)=f′(c)(b−a), The natural logarithm as the inverse of the exponential function, Order, continuity, range, and the product, quotient, and reciprocal laws for the natural logarithm, The exponential is positive and satisfies exp⁡(−x)=1/exp⁡(x), For ∣r∣<1, ∑k≥0rk=1/(1−r), and for ∣r∣≥1 the series diverges, Monotone convergence for the integral). Interval lengths and the integrals of their constant majorants are given by the box and nonnegative simple-integral rules (A box in Rn with parameters ai≤bi is Lebesgue measurable of measure ∏i<n(bi−ai), whichever of its faces are included, Integral over a measurable subset, The integral of a nonnegative simple function, The nonnegative integral agrees with the simple integral on simple functions, Monotonicity and nonnegative homogeneity of the nonnegative integral).

[F7]

A C1 function on an open Euclidean set has its classical first partials as weak derivatives under ACω (Classical derivatives agree with weak derivatives). Weak differentiation restricts to open subsets, and weak derivatives are unique almost everywhere under ACω (Linearity, locality, and commutation of weak derivatives, Uniqueness of a weak derivative as an almost-everywhere class).

[F8]

Complex test pairings are bilinear, with no conjugation, and the complex Lebesgue integral is taken componentwise and is linear on L1 (Complex Lp classes and Euclidean test-function conventions, The Lebesgue integral is linear on L1(μ)).

Proof

technique · polar integrals and a shrinking smooth cutoff
1.1F1F4F5given

For x≠0, coordinate differentiation gives vi(x)=−axi∣x∣−a−2 and ∣∇u(x)∣=a∣x∣−a−1. On B∖{0} these functions are continuous; assigning finite values at 0 and extending by zero off B is finite Borel gluing by [F5]. Hence the representatives, their finite-power integrands, and the radial functions used with [F3] are Borel and Lebesgue measurable under [F1].

2.1F1F3F4F5step 1.1

Put Iq(R)=∫0Rrq dr. By [F4], Iq(R) is finite exactly for q>−1 and then Iq(R)≤CqRq+1. Applying the polar formula [F3] to ∣u∣p and to the candidate gradient magnitude gives ∫B∣u∣p=σ(Sn−1)In−1−ap(1) and ∫B∣∇u∣p=apσ(Sn−1)In−1−p(a+1)(1). The factor σ(Sn−1) is finite and positive by [F3, F5]; for 0<R≤1 the same formulas yield ∫B(0,R)∣u∣≤CRn−a when a<n and ∫B(0,R)∣∇u∣≤CRn−a−1 when a<n−1.

3.1F1F2F3F5givenstep 2.1

The first polar identity in step 2.1 shows that u∈Lp(B) exactly when ap<n, since changing u(0) affects only the null singleton [F3]. For every M>0, choose 0<R<min⁡{1,M−1/a}; then ∣u(x)∣>M on B(0,R)∖{0}, a set of positive measure by [F5] and [F3]. Thus u is essentially unbounded and cannot lie in L∞(B). By [F2], it also cannot lie in W1,∞(B).

3.2F1F2F4F6F7F8step 1.1step 2.1

Suppose 1≤p<∞ and p(a+1)<n. Then a<n−1, so step 2.1 places u and every vi in Lp(B) and gives the small-ball L1 bounds. Fix one bump ρ from [F6], set ηε(x)=ρ(x/ε), and χε=1−ηε for 0<ε<1/2. Then χε=0 on B(0,ε), χε=1 off B(0,2ε), and ∣∂iχε∣≤C/ε. The product wε=χεu, defined as zero near the origin, is C1(B) and has classical partial ∂iwε=χεvi+u∂iχε away from 0 by [F6]. For each real test φ, [F7] gives ∫Bwε∂iφ=−∫B∂iwεφ. The left-side error from replacing wε by u is at most ∥∂iφ∥∞∫B(0,2ε)∣u∣=O(εn−a); the missing vi term is O(εn−a−1), and the cutoff term is at most C∥φ∥∞ε−1∫B(0,2ε)∣u∣=O(εn−a−1). All tend to zero because a<n−1. Thus ∫Bu∂iφ=−∫Bviφ for real tests. Split a complex test into real and imaginary parts and use [F8] to obtain the same identity for every complex test.

3.3F1F2F3F4F7step 1.1step 2.1

Conversely, suppose u∈W1,p(B) for finite p. For each i its weak derivative has an Lp representative. On B∖{0}, locality and classical compatibility in [F7], followed by uniqueness in [F7], identify that representative almost everywhere with vi from step 1.1. The origin is null by [F3]. Pointwise, ∣∇u∣p≤np/2∑i=1n∣Diu∣p, so the gradient magnitude is in Lp(B). The second polar identity in step 2.1 can be finite only if p(a+1)<n; at or above the threshold [F4] gives divergence.

4.1F1F2F3step 3.1step 3.2step 3.3∎

If p(a+1)<n, then ap<p(a+1)<n, so step 3.1 gives u∈Lp; step 3.2 gives all first weak derivatives in Lp, and [F2] gives u∈W1,p. Step 3.3 proves the converse. Since a>0 and p≥1, the condition is impossible when n=1. In the admissible range step 3.2 identifies Diu=[vi]; [F3] makes the chosen value at 0 irrelevant. Together with the p=∞ conclusion of step 3.1, this proves every assertion.

Depends on

Used by

Dependency tree · two levels

184 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