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 polynomial with large partial sums

Statement

Assume AC. For every H>0 and 0<η<1 there is an analytic polynomial P with P1=1 and m{AP>H}>1η. There is also a nonnegative trigonometric polynomial g=kdbkek with g1=1 and m{supN0SNg>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 A1=0 Kolmogorov analytic partial sum maximal function.

[F2]

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

[F3]

FM is nonnegative with integral one and satisfies FM=(M+1)1j=0Mej2 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.1

Choose an atomic configuration from F2 with clogn>2H+2, and write bk=n1jek(tj). Then bk1 and BL=kLbkek, by expanding its finite kernel sum. The increasing measurable sets EK={x:max1LKBL(x)>2H+2} have union of measure one, so some finite K1 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.

F2F4F5
2.1

Choose MK so large that K(K+1)/(M+1)<1. Set g(x)=n1jFM(xtj). F3 gives g0 and g=1, hence g1=1. Expanding the square in F3 yields FM=(M+1)1r,s=0Mers. For each kM exactly M+1k pairs have rs=k, and no pairs give larger k. Translating by tj multiplies this coefficient by ek(tj). Thus g has coefficients bk(1k/(M+1)) for kM. Consequently, for every 1LK and every x, SLg(x)BL(x)kLk/(M+1)=L(L+1)/(M+1)<1. For every xEK there is therefore an L with SLg(x)>2H+1>H. This proves the nonnegative symmetric-frequency interface by finite coefficient computation alone.

F3step 1.1
3.1

Put P=eMg, an analytic polynomial of degree at most 2M. Since eM=1, P1=1. For 0LM, direct reindexing gives eMSLg=AM+LPAML1P. 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 A2MP>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.

F1F5step 1.1step 2.1

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