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 be a sequence in real , with , all zero almost everywhere outside one bounded set. If , then a subsequence converges in . This assertion does not require Dependent Choice.
Statement references
Facts & Assumptions
Given: The sequence and uniform translation continuity in the Statement; write .
Countable Choice allows choosing measurable representatives for a countable sequence of classes. (The Axiom of Countable Choice ())
Tonelli applies to nonnegative functions on completed Euclidean products and to sums of such functions. (Tonelli's theorem for nonnegative measurable functions on a sigma-finite product, Tonelli and Fubini for the completed product, with only almost-everywhere section measurability, The Euclidean Lebesgue measure is the completion of the product of the factor Lebesgue measures)
Translation preserves Lebesgue measure. (Lebesgue outer measure, Lebesgue measurability and Lebesgue measure are unchanged by translation)
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.
For , tile by the half-open cubes , , and let equal on . The triangle inequality, followed by [F1] and the substitution using [F2], gives . Thus, writing , one has as .
For each , only finitely many cubes of side meet a fixed ball containing the common supports; all other cell averages vanish. Enumerate all these cells at all levels by first increasing and then lexicographic order of their integer coordinates. Each cell-average coefficient is a bounded real sequence, with bound divided by that cell's volume. Set and initialize . Recursively, at stage , partition the bounded ranges of the first coefficients into finitely many half-open dyadic bins of width , adding an endpoint bin if necessary. Among the finitely many vector bins containing infinitely many indices in , take the lexicographically first; let be exactly that infinite set of indices. The finite pigeonhole principle guarantees existence and the specified order makes the rule unique. Then let be the least member of larger than ; such a member exists because is infinite. This deterministic successor rule and initial pair define the sequence recursively by [F3], with no dependent-choice instance. For fixed and , all selected indices with lie in , so their th coefficients differ by at most . Consequently every coefficient converges and, at each fixed cell level , is Cauchy in , being a finite weighted sum of these coefficients.
Given , choose a cell level for which , using step 1.1. For sufficiently large , step 1.2 gives . The two approximation errors from step 1.1 then show . Thus the subsequence is Cauchy.
For completeness at exactly the stated axiom strength, choose representatives of this countable sequence by [A1]. Select a further subsequence with , always choosing the least sufficiently late index, which exists by the Cauchy property. By [F1], is integrable and finite almost everywhere. Hence has a measurable almost-everywhere limit ; moreover , so , and . The original Cauchy subsequence also converges to this class by the triangle inequality. This proves the assertion using only [A1].
Depends on
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
- Tonelli and Fubini for the completed product, with only almost-everywhere section measurability
- The Euclidean Lebesgue measure is the completion of the product of the factor Lebesgue measures
- The space $L^p(\mu)$ as the quotient by null functions
- Tonelli's theorem for nonnegative measurable functions on a sigma-finite product
- Lebesgue outer measure, Lebesgue measurability and Lebesgue measure are unchanged by translation
- The recursion theorem
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
- Glaucio Terra, Introduction to Geometric Measure Theory, Theorems 1.80 and 7.49 (standard reference, not scraped)