Alphabeta Math
CounterexampleConstruction: 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.

Expanding bumps lose tightness

Statement refuted

Refuted claim. On Rn a bounded family in W1,p(Rn) that is uniformly translation continuous is relatively compact in Lp(Rn); in other words the tightness condition of the Fr'echet--Kolmogorov criterion would be automatic for W1,p-bounded families.

The witness spreads one unit of mass over balls of radius tending to infinity. The Lp norm and the translation modulus are controlled, but no fixed ball carries any of the mass in the limit, and no subsequence can converge in Lp(Rn).

Facts & Assumptions

Given: Countable Choice; n≥1, 1≤p<∞, a nonzero φ∈Cc∞(Rn) with ∥φ∥Lp(Rn)=1 (for instance a normalised smooth bump), and fj(x):=j−n/pφ(x/j) for j≥1.

[F1]

Scaling. For every measurable nonnegative h and j>0, ∫Rnh(x/j)j−n dx=∫Rnh(y) dy; equivalently ∫Rnh(jx)jn dx=∫h. (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)

[F2]

Segment bound. For φ∈C1 and y,y′∈Rn, φ(y)−φ(y′)=∫01∇φ(y′+t(y−y′))⋅(y−y′) dt; hence ∣φ(y)−φ(y′)∣≤∣y−y′∣∫01∣∇φ(y′+t(y−y′))∣ dt. (Newton–Leibniz needs only continuity on [a,b], differentiability on (a,b), and a Riemann-integrable extension of the interior derivative)

[F3]

Minkowski and Tonelli. For measurable F on a product of sigma-finite spaces with ∫∥F(⋅,t)∥p dt<∞, ∥∫F(⋅,t) dt∥p≤∫∥F(⋅,t)∥p dt, and the iterated integral of a nonnegative measurable function may be computed in either order. (Minkowski's integral inequality, Tonelli and Fubini for the completed product, with only almost-everywhere section measurability)

[F4]

Dominated convergence. If ∣hj∣≤g with g integrable and hj→h pointwise almost everywhere, then ∫hj→∫h. (Dominated convergence)

[F5]

Translation and balls. (τhf)(x)=f(x−h) and B(0,r)={∣x∣<r}; a ball of radius r has finite Lebesgue measure. (Translation of a function on Rn, Open ball, closed ball and sphere in a metric space, The space Lp(μ) as the quotient by null functions)

Counterexample

technique · direct
1.1F1F4F5given

By [F1] applied to ∣φ∣p and to ∣Dφ∣p, ∥fj∥Lp=j−n/p⋅jn/p∥φ∥Lp=1 and ∥Dfj∥Lp=j−1∥Dφ∥Lp≤∥Dφ∥Lp, and the same scaling holds for every derivative component. The classical derivatives are the weak derivatives by Classical derivatives agree with weak derivatives, so (fj) is bounded in Lp and in W1,p(Rn); moreover ∫B(0,R)∣fj∣p dx=∫B(0,R/j)∣φ(y)∣p dy→0 as j→∞ for each fixed R by [F4], since ∣φ∣p1B(0,R/j)≤∣φ∣p and the indicators tend to zero except at the null point 0.

1.2F1F2F3given

For fixed h the segment bound [F2] applied to φ at y=(x−h)/j and y′=x/j gives ∣fj(x−h)−fj(x)∣≤j−n/p∣h∣j−1∫01∣∇φ((x−th)/j)∣ dt; taking Lp norms and applying [F3] together with the translation and scaling identities of [F1] yields ∥τhfj−fj∥Lp≤∣h∣j−1∥Dφ∥Lp≤∣h∣ ∥Dφ∥Lp, a bound independent of j that tends to 0 with ∣h∣; hence the family is uniformly translation continuous.

2.1F4F5step 1.1step 1.2∎

The family is not tight: by [F1], ∫∣x∣>R∣fj∣p dx=∫∣y∣>R/j∣φ(y)∣p dy→∫Rn∣φ∣p=1 for every fixed R by [F4], so no R makes the tails uniformly small; and it is not relatively compact, because if a subsequence converged in Lp(Rn) to some g, then ∥g∥Lp=1 by continuity of the norm, while step 1.1 forces g=0 almost everywhere on each ball B(0,R) and hence on all of Rn, a contradiction. So boundedness and uniform translation continuity alone do not give relative compactness on Rn. Countable Choice is inherited through the scaling, Sobolev and completed-product interfaces.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

84 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