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.
Kolmogorov block maxima diverge off a null limsup set
Statement
Assume AC. For the sequence and limit f constructed in the preceding gliding-hump lemma, off a measurable null set.
Facts & Assumptions
The blocks have , thresholds , exceptional measures less than and increasing disjoint positive supports; their series converges in and absolutely a.e. Kolmogorov gliding hump series converges in lone.
The blocks' strict good-set maxima are furnished by the local polynomial lemma Kolmogorov block polynomial with large partial sums.
A block contributes nothing below its starting frequency and its internal sums are modulated analytic sums Separated frequency blocks do not disturb earlier partial sum maxima.
Summable exceptional measures imply a null limsup The first Borel-Cantelli lemma for measures.
Fourier coefficients and symmetric partial sums use normalized period-one integration Period-one Fourier coefficients, partial sums, and convolution on the torus.
Assume AC The Axiom of Choice.
Proof
Given: The exact constructed blocks and their limit from F1.
For any integer k and integrable functions u,v, the definition gives , since . Hence the coefficients of F1's partial block sums converge to those of f. For each fixed k, the polynomial coefficients stabilize once the block containing k has been included; if no block contains k, all are zero. Thus f has exactly the prescribed block coefficients and no negative coefficients. In particular every fixed symmetric partial sum is determined by finitely many of these coefficients, with no pointwise infinite-series interchange.
By F4 and F1, . Remove this set and F1's null set on which may be infinite. Fix any remaining x. There is such that for all the point lies in the strict good set of F2, so some has . These witnesses may be taken as least indices; no choice of a measurable family of cutoffs is needed for a pointwise supremum.
Set . At this cutoff every earlier block is completed and every later block is absent. Steps 1.1 and F3 give the exact identity . Consequently . Also , so these are unbounded cutoffs. This proves the assertion. AC is inherited from F1's countable block choice; Borel–Cantelli requires no independence.
Depends on
- Kolmogorov gliding hump series converges in lone
- Kolmogorov block polynomial with large partial sums
- Separated frequency blocks do not disturb earlier partial sum maxima
- The first Borel-Cantelli lemma for measures
- Period-one Fourier coefficients, partial sums, and convolution on the torus
- The Axiom of Choice
Used by
Dependency tree · two levels
21 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
- Grafakos, Classical Fourier Analysis, third edition (standard reference, not scraped)