Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6-luna)verified 2026-10-22 (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.

Sequence compactness in L1 by finite cell averages

Statement

Assume Countable Choice. Let (vk) be a sequence in real L1(Rn), with sup⁡k∥vk∥1<∞, all zero almost everywhere outside one bounded set. If lim⁡r↓0sup⁡k, ∣h∣≤r∥vk(⋅+h)−vk∥1=0, then a subsequence converges in L1(Rn). This assertion does not require Dependent Choice.

Statement references

Facts & Assumptions

Given: The sequence and uniform translation continuity in the Statement; write M=sup⁡k∥vk∥1.

[A1]

Countable Choice allows choosing measurable representatives for a countable sequence of L1 classes. (The Axiom of Countable Choice (ACω))

[F3]

Ordinary recursion on a set with a specified initial value and deterministic successor rule constructs a unique sequence; this uses no dependent-choice instance. (The recursion theorem)

Proof

Given: The hypotheses above.

1.1F1F2givenconstructalgebra

For δ>0, tile Rn by the half-open cubes Q=δ(z+[0,1)n), z∈Zn, and let Aδv equal δ−n∫Qv on Q. The triangle inequality, followed by [F1] and the substitution y=x+h using [F2], gives ∥v−Aδv∥1≤δ−n∑Q∫Q∫Q∣v(x)−v(y)∣ dy dx≤δ−n∫[−δ,δ]n∥v(⋅+h)−v∥1 dh. Thus, writing ω(r)=sup⁡k,∣h∣≤r∥vk(⋅+h)−vk∥1, one has sup⁡k∥vk−Aδvk∥1≤2nω(nδ)→0 as δ↓0.

1.2F3givenconstruct

For each m≥1, only finitely many cubes of side 2−m meet a fixed ball containing the common supports; all other cell averages vanish. Enumerate all these cells at all levels by first increasing m and then lexicographic order of their integer coordinates. Each cell-average coefficient aj(k) is a bounded real sequence, with bound M divided by that cell's volume. Set S0=N and initialize k0=0. Recursively, at stage m≥1, partition the bounded ranges of the first m coefficients into finitely many half-open dyadic bins of width 2−m, adding an endpoint bin if necessary. Among the finitely many vector bins containing infinitely many indices in Sm−1, take the lexicographically first; let Sm be exactly that infinite set of indices. The finite pigeonhole principle guarantees existence and the specified order makes the rule unique. Then let km be the least member of Sm larger than km−1; such a member exists because Sm is infinite. This deterministic successor rule and initial pair (S0,k0) define the sequence recursively by [F3], with no dependent-choice instance. For fixed j and m≥j, all selected indices kq with q≥m lie in Sm, so their jth coefficients differ by at most 2−m. Consequently every coefficient converges and, at each fixed cell level ℓ, (A2−ℓvkm)m is Cauchy in L1, being a finite weighted sum of these coefficients.

2.1step 1.1step 1.2choosealgebra

Given ε>0, choose a cell level ℓ for which 2nω(n2−ℓ)<ε/3, using step 1.1. For sufficiently large a,b, step 1.2 gives ∥A2−ℓvka−A2−ℓvkb∥1<ε/3. The two approximation errors from step 1.1 then show ∥vka−vkb∥1<ε. Thus the subsequence is Cauchy.

3.1A1F1step 2.1constructalgebra∎

For completeness at exactly the stated axiom strength, choose representatives of this countable sequence by [A1]. Select a further subsequence gj with ∥gj+1−gj∥1<2−j, always choosing the least sufficiently late index, which exists by the Cauchy property. By [F1], ∑j∣gj+1−gj∣ is integrable and finite almost everywhere. Hence gj has a measurable almost-everywhere limit g; moreover ∣g∣≤∣g1∣+∑j∣gj+1−gj∣, so g∈L1, and ∥g−gj∥1≤∑i≥j2−i→0. The original Cauchy subsequence also converges to this L1 class by the triangle inequality. This proves the assertion using only [A1].

Depends on

Used by

Dependency tree · two levels

48 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