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.

High frequencies destroy uniform translation control

Statement refuted

Refuted claim. For 1≤p<∞, a bounded family in Lp(R) whose supports lie in one fixed bounded set (that is, a tight family) is uniformly translation continuous and relatively compact.

The witness oscillates faster and faster inside the same interval: the mass stays in a fixed bounded set, but an arbitrarily small shift reverses the sign of the oscillation and changes the function by order one.

Facts & Assumptions

Given: Countable Choice; 1≤p<∞, cp:=(∫02π∣sin⁡x∣p dx)−1/p, and fj(x):=cp1(0,2π)(x)sin⁡(jx) on R for j≥1.

[F1]

Scaling the sine power. For every j≥1, ∫02π∣sin⁡(jx)∣pdx=∫02π∣sin⁡y∣pdy=cp−p, by the substitution y=jx and 2π-periodicity. (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]

Quarter-turn shift. sin⁡(y+π)=−sin⁡y for every y. (Quarter-turn values and shifts by pi/2 and pi)

[F3]

The necessity of translation continuity. Under Countable Choice, a relatively compact family in Lp(R) is uniformly translation continuous: sup⁡g∥τhg−g∥p→0 as ∣h∣→0. (Relative compactness forces uniform translation continuity in Lp, The Axiom of Countable Choice (ACω))

[F4]

Norms and supports of classes. ∥f∥Lp=(∫∣f∣p)1/p, and supp⁡fj⊆[0,2π] for every j. (The space Lp(μ) as the quotient by null functions)

Counterexample

technique · direct
1.1F1F4given

By [F1] and [F4], ∥fj∥Lpp=cpp∫02π∣sin⁡(jx)∣pdx=1, and all supports lie in the fixed bounded set [0,2π], so the family is bounded and tight.

1.2F1F2F4

Put hj:=π/j. For x∈(hj,2π) both x and x−hj lie in (0,2π), so [F2] gives fj(x−hj)−fj(x)=−2cpsin⁡(jx) and hence ∣fj(x−hj)−fj(x)∣p=2pcpp∣sin⁡(jx)∣p; integrating over (hj,2π) and using [F1] with the trivial bound ∫0hj∣sin⁡(jx)∣pdx≤hj gives ∥τhjfj−fj∥Lpp≥2pcpp(cp−p−hj)=2p(1−cpphj)→2p.

2.1F3step 1.1step 1.2∎

Hence lim inf⁡j∥τhjfj−fj∥Lp≥2>0 although hj=π/j→0, so the family is not uniformly translation continuous; by [F3] it is not relatively compact in Lp(R), and the refuted claim is false. Countable Choice is used by the scaling interface [F1] and the necessity lemma [F3].

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

54 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