Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-12
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 polynomial with large partial sums

Statement

Assume AC. For every H>0 and 0<η<1 there is an analytic polynomial P with ∥P∥1=1 and m{A∗P>H}>1−η. There is also a nonnegative trigonometric polynomial g=∑∣k∣≤dbkek with ∥g∥1=1 and m{sup⁡N≥0∣SNg∣>H}>1−η. Here “symmetric” refers to the frequency interval and the partial-sum cutoff, not to evenness of g.

Facts & Assumptions

[F1]

Analytic partial sums include the convention A−1=0 Kolmogorov analytic partial sum maximal function.

[F2]

Arbitrarily large finite atomic averages of Dirichlet kernels have almost-everywhere supremum at least clog⁡n Kolmogorov atomic kernel maxima.

[F3]

FM is nonnegative with integral one and satisfies FM=(M+1)−1∣∑j=0Mej∣2 The Fejer kernel is a positive approximate identity.

[F4]

Measures of increasing unions are limits of their measures Continuity from below for measures.

[F5]

Proof

Given: H>0, 0<η<1, and AC.

1.1F2F4F5

Choose an atomic configuration from F2 with clog⁡n>2H+2, and write bk=n−1∑je−k(tj). Then ∣bk∣≤1 and BL=∑∣k∣≤Lbkek, by expanding its finite kernel sum. The increasing measurable sets EK={x:max⁡1≤L≤K∣BL(x)∣>2H+2} have union of measure one, so some finite K≥1 has m(EK)>1−η by F4. Strict inequality in the chosen logarithmic threshold ensures that a finite cutoff attains the threshold used here, even if the original supremum is not attained.

2.1F3step 1.1

Choose M≥K so large that K(K+1)/(M+1)<1. Set g(x)=n−1∑jFM(x−tj). F3 gives g≥0 and ∫g=1, hence ∥g∥1=1. Expanding the square in F3 yields FM=(M+1)−1∑r,s=0Mer−s. For each ∣k∣≤M exactly M+1−∣k∣ pairs have r−s=k, and no pairs give larger ∣k∣. Translating by tj multiplies this coefficient by e−k(tj). Thus g has coefficients bk(1−∣k∣/(M+1)) for ∣k∣≤M. Consequently, for every 1≤L≤K and every x, ∣SLg(x)−BL(x)∣≤∑∣k∣≤L∣k∣/(M+1)=L(L+1)/(M+1)<1. For every x∈EK there is therefore an L with ∣SLg(x)∣>2H+1>H. This proves the nonnegative symmetric-frequency interface by finite coefficient computation alone.

3.1F1F5step 1.1step 2.1∎

Put P=eMg, an analytic polynomial of degree at most 2M. Since ∣eM∣=1, ∥P∥1=1. For 0≤L≤M, direct reindexing gives eMSLg=AM+LP−AM−L−1P. At each point of EK, the L from step 2.1 is at most K and hence at most M; the difference has modulus greater than 2H+1. The triangle inequality implies one of its two terms has modulus greater than H. If the second index is -1, that term is zero by F1, and the first supplies the bound. Thus A∗2MP>H throughout EK, proving the analytic interface with the same measure bound. AC is propagated from F2; the subsequent K and M may be chosen as least integers, and no Recorded block theorem is used.

Depends on

Used by

Dependency tree · two levels

15 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