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.
The conjugate Dirichlet kernel, and the periodic principal-value formula
Statement
Assume Countable Choice, and work on with the conventions of Period-one Fourier coefficients, partial sums, and convolution on the torus. Let and let . Put
the conjugate Dirichlet kernel, and write for the conjugate partial sum. Then:
- is the convolution of with : for almost every , .
- Extend to by the square-summable coefficient family ; the resulting class is the limit of the partial sums .
- If a representative of is on an open interval containing , then
the limit existing for almost every such , and being the symmetric principal value about the singularity.
The finite kernel is not itself a cotangent truncation: equals minus the oscillatory remainder , and only the limit of the convolutions recovers the principal value.
Facts & Assumptions
Given: Countable Choice, , , and the characters .
is defined on trigonometric polynomials coefficientwise by , it is complex-linear, kills constants, and preserves real-valuedness. Conjugate function on the circle
Fourier coefficients, partial sums , characters, and the torus convolution are as defined there, and the torus integral is invariant under the reflections used below. Period-one Fourier coefficients, partial sums, and convolution on the torus
The Dirichlet kernel is . Dirichlet and Fejer kernels
For one-period integrable , for every . Fourier partial sums are Dirichlet convolutions
For and , . Finite sums of the sine harmonics
Parseval: in the finite-subset-supremum sense, so the tails over tend to . The Parseval identity for Fourier series
Every square-summable coefficient family in is the Fourier coefficient family of a unique class, realized as the limit of its symmetric partial sums. Riesz–Fischer: the Fourier coefficient map is onto the space of square-summable families
Riemann-Lebesgue: if is integrable on one period then as . Riemann-Lebesgue lemma for Fourier coefficients
Norm-convergent sequences in have subsequences converging almost everywhere to a representative of the limit. Complex Lp completeness and almost-everywhere subsequences
The real mean value theorem bounds the increment of a real function by the supremum of its derivative times the interval length. Applied separately to the real and imaginary parts, it gives for a complex function on a compact interval about , with . The mean value theorem, as the case of Cauchy's: for continuous on with and differentiable on there is with
Dominated convergence. Dominated convergence
Cosine addition formula: . The addition formulas for sine and cosine
Proof
By [F1] and [F3], is the trigonometric polynomial with coefficients on and elsewhere, so , using . Applying [F5] with gives for , while ; in particular is odd, one-periodic, and .
By [F1], the conjugate partial sum is the trigonometric polynomial . Expanding from 1.1 and substituting in each finite sum as in [F2] and [F4], for every . The bounded finite kernel makes the integral exist for each translate of the representative, and the finite coefficient calculation is exact; this keeps the finite- object a polynomial-level convolution and makes no claim on any cotangent kernel.
Fix a point at which some representative of is on an open interval containing , and put for , so that for a constant and all small by [F10]. Step 1.2 gives ; since is one-periodic, odd, and has by 1.1, that integral equals . The closed form of 1.1 splits the kernel as , so with and , the integrands being defined and measurable off the null point .
Put . Since for every (with ), [F6] gives . Thus [F7] supplies a unique class whose symmetric partial sums are exactly the of 1.2 and which is their limit; by [F9] there is an increasing sequence with for almost every .
For the point of 2.1, [F12] writes , so . Both and are integrable on : the second because is on the finite torus and the quotient is bounded near by ; away from , is bounded and , so the quotient is integrable there as well. Extending them by zero to one period, [F8] gives for these integrable functions, hence as ; the convergence is at every such , and no uniformity in is claimed.
Also at the point of 2.1, for the oddness of gives , and by [F10] the function is integrable on ; [F11] therefore gives as . So the symmetric principal value exists at and equals .
Combining 3.1 and 3.2, for every at which is near the finite convolutions satisfy , so the full sequence converges to the principal value at every such ; by 2.2 it also converges to along a subsequence for almost every . Therefore for almost every in the open set where is near , as asserted.
Depends on
- Conjugate function on the circle
- Period-one Fourier coefficients, partial sums, and convolution on the torus
- Dirichlet and Fejer kernels
- Fourier partial sums are Dirichlet convolutions
- Finite sums of the sine harmonics
- The Parseval identity for Fourier series
- Riesz–Fischer: the Fourier coefficient map is onto the space of square-summable families
- Riemann-Lebesgue lemma for Fourier coefficients
- Complex Lp completeness and almost-everywhere subsequences
- The mean value theorem, as the case $g(x) = x$ of Cauchy's: for $f$ continuous on $[a,b]$ with $a < b$ and differentiable on $(a,b)$ there is $c \in (a,b)$ with $f(b) - f(a) = f'(c)(b-a)$
- Dominated convergence
- The addition formulas for sine and cosine
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
62 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
- Richard S. Laugesen, Harmonic Analysis Lecture Notes (standard reference, not scraped)