Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)
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 L1 limit f constructed in the preceding gliding-hump lemma, supN0SNf(x)= off a measurable null set.

Facts & Assumptions

[F1]

The blocks have aj=2j, thresholds j2j, exceptional measures less than 2j and increasing disjoint positive supports; their series converges in L1 and absolutely a.e. Kolmogorov gliding hump series converges in lone.

[F2]

The blocks' strict good-set maxima are furnished by the local polynomial lemma Kolmogorov block polynomial with large partial sums.

[F3]

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.

[F4]

Summable exceptional measures imply a null limsup The first Borel-Cantelli lemma for measures.

[F5]

Fourier coefficients and symmetric partial sums use normalized period-one integration Period-one Fourier coefficients, partial sums, and convolution on the torus.

[F6]

Proof

Given: The exact constructed blocks and their limit from F1.

1.1

For any integer k and integrable functions u,v, the definition gives u^(k)v^(k)uv, since ek=1. 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.

F1F3F5
1.2

By F4 and F1, m(lim supjEj)=0. Remove this set and F1's null set on which G(x)=jQj(x) may be infinite. Fix any remaining x. There is j0(x) such that for all jj0(x) the point lies in the strict good set of F2, so some 0rjdj has ArjPj(x)>j2j. These witnesses may be taken as least indices; no choice of a measurable family of cutoffs is needed for a pointwise supremum.

F1F2F4F6
2.1

Set Nj=mj+rj. At this cutoff every earlier block is completed and every later block is absent. Steps 1.1 and F3 give the exact identity SNjf(x)=i<jQi(x)+ajemj(x)ArjPj(x). Consequently SNjf(x)>ji<jQi(x)jG(x). Also Njmjj, so these are unbounded cutoffs. This proves the assertion. AC is inherited from F1's countable block choice; Borel–Cantelli requires no independence.

F1F3F6step 1.1step 1.2

Depends on

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