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 and there is an analytic polynomial with and . There is also a nonnegative trigonometric polynomial with and . Here “symmetric” refers to the frequency interval and the partial-sum cutoff, not to evenness of .
Facts & Assumptions
Analytic partial sums include the convention Kolmogorov analytic partial sum maximal function.
Arbitrarily large finite atomic averages of Dirichlet kernels have almost-everywhere supremum at least Kolmogorov atomic kernel maxima.
is nonnegative with integral one and satisfies The Fejer kernel is a positive approximate identity.
Measures of increasing unions are limits of their measures Continuity from below for measures.
Assume AC The Axiom of Choice.
Proof
Given: , , and AC.
Choose an atomic configuration from F2 with , and write . Then and , by expanding its finite kernel sum. The increasing measurable sets have union of measure one, so some finite has 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.
Choose so large that . Set . F3 gives and , hence . Expanding the square in F3 yields . For each exactly pairs have , and no pairs give larger . Translating by multiplies this coefficient by . Thus g has coefficients for . Consequently, for every and every x, . For every there is therefore an L with . This proves the nonnegative symmetric-frequency interface by finite coefficient computation alone.
Put , an analytic polynomial of degree at most . Since , . For , direct reindexing gives . At each point of , the L from step 2.1 is at most K and hence at most M; the difference has modulus greater than . 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 throughout , 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
- Grafakos, Classical Fourier Analysis, third edition (standard reference, not scraped)