Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passaudited 2026-10-02
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 T=R/Z with the conventions of Period-one Fourier coefficients, partial sums, and convolution on the torus. Let f∈L2(T;C) and let N≥1. Put

KN(t):=2∑k=1Nsin⁡(2πkt)=cos⁡(πt)−cos⁡((2N+1)πt)sin⁡(πt)(t∉Z),

the conjugate Dirichlet kernel, and write CSNf=∑0<∣k∣≤N(−isgn⁡k)f^(k)ek for the conjugate partial sum. Then:

  1. CSNf is the convolution of f with KN: for almost every x, CSNf(x)=∫01KN(t)f(x−t) dt.
  2. Extend C to L2(T;C) by the square-summable coefficient family (−isgn⁡kf^(k))k∈Z; the resulting class Cf is the L2 limit of the partial sums CSNf.
  3. If a representative of f is C1 on an open interval containing x, then

Cf(x)=lim⁡ε↓0∫ε<∣t∣<1/2f(x−t)cot⁡(πt) dt,

the limit existing for almost every such x, and being the symmetric principal value about the singularity.

The finite kernel KN is not itself a cotangent truncation: KN equals cot⁡(πt) minus the oscillatory remainder cos⁡((2N+1)πt)/sin⁡(πt), and only the limit N→∞ of the convolutions recovers the principal value.

Facts & Assumptions

Given: Countable Choice, f∈L2(T;C), N≥1, and the characters ek(x)=e2πikx.

[F1]

C is defined on trigonometric polynomials coefficientwise by Cg^(k)=−isgn⁡(k)g^(k), it is complex-linear, kills constants, and preserves real-valuedness. Conjugate function on the circle

[F2]

Fourier coefficients, partial sums SNf, characters, and the torus convolution (f∗g)(x)=∫01f(x−t)g(t)dt 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

[F3]

The Dirichlet kernel is DN(t)=∑∣k∣≤Nek(t). Dirichlet and Fejer kernels

[F4]

For one-period integrable f, SNf(x)=∫01f(x−t)DN(t) dt=(f∗DN)(x) for every x. Fourier partial sums are Dirichlet convolutions

[F5]

For N≥1 and x∉2πZ, ∑n=1Nsin⁡(nx)=cos⁡(x/2)−cos⁡((N+1/2)x)2sin⁡(x/2). Finite sums of the sine harmonics

[F6]

Parseval: ∥f∥22=∑k∈Z∣f^(k)∣2 in the finite-subset-supremum sense, so the tails over {∣k∣>N} tend to 0. The Parseval identity for Fourier series

[F7]

Every square-summable coefficient family in ℓ2(Z;C) is the Fourier coefficient family of a unique L2 class, realized as the L2 limit of its symmetric partial sums. Riesz–Fischer: the Fourier coefficient map is onto the space of square-summable families

[F8]

Riemann-Lebesgue: if g is integrable on one period then g^(k)→0 as ∣k∣→∞. Riemann-Lebesgue lemma for Fourier coefficients

[F9]

Norm-convergent sequences in L2 have subsequences converging almost everywhere to a representative of the limit. Complex Lp completeness and almost-everywhere subsequences

[F10]

The real mean value theorem bounds the increment of a real C1 function by the supremum of its derivative times the interval length. Applied separately to the real and imaginary parts, it gives ∣g(t)−g(0)∣≤C∣t∣ for a complex C1 function on a compact interval about 0, with C=∥Re⁡g′∥∞+∥Im⁡g′∥∞. 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∈(a,b) with f(b)−f(a)=f′(c)(b−a)

[F11]

Dominated convergence. Dominated convergence

[F12]

Cosine addition formula: cos⁡(A+B)=cos⁡Acos⁡B−sin⁡Asin⁡B. The addition formulas for sine and cosine

Proof

technique · direct
1.1F1F3F5

By [F1] and [F3], KN:=CDN is the trigonometric polynomial with coefficients −isgn⁡(k) on 0<∣k∣≤N and 0 elsewhere, so KN(t)=∑0<∣k∣≤N(−isgn⁡k)ek(t)=2∑k=1Nsin⁡(2πkt), using ek−e−k=2isin⁡(2πkt). Applying [F5] with x=2πt gives 2∑k=1Nsin⁡(2πkt)=cos⁡(πt)−cos⁡((2N+1)πt)sin⁡(πt) for t∉Z, while KN(0)=0; in particular KN is odd, one-periodic, and ∫−1/21/2KN(t) dt=0.

1.2F1F2F4

By [F1], the conjugate partial sum is the trigonometric polynomial CSNf=∑0<∣k∣≤N(−isgn⁡k)f^(k)ek. Expanding KN from 1.1 and substituting u=x−t in each finite sum as in [F2] and [F4], ∫01KN(t)f(x−t) dt=∑0<∣k∣≤N(−isgn⁡k)f^(k)ek(x)=CSNf(x) for every x. The bounded finite kernel makes the integral exist for each translate of the L1 representative, and the finite coefficient calculation is exact; this keeps the finite-N object a polynomial-level convolution and makes no claim on any cotangent kernel.

2.1step 1.1step 1.2F10

Fix a point x at which some representative of f is C1 on an open interval containing x, and put g(t):=f(x−t)−f(x) for ∣t∣<1/2, so that ∣g(t)∣≤C∣t∣ for a constant C and all small t by [F10]. Step 1.2 gives CSNf(x)=∫01KN(t)f(x−t) dt; since KN is one-periodic, odd, and has ∫−1/21/2KN=0 by 1.1, that integral equals ∫∣t∣<1/2KN(t)g(t) dt. The closed form of 1.1 splits the kernel as cot⁡(πt)−cos⁡((2N+1)πt)/sin⁡(πt), so CSNf(x)=A(x)−RN(x) with A(x):=∫∣t∣<1/2cot⁡(πt)g(t) dt and RN(x):=∫∣t∣<1/2cos⁡((2N+1)πt)sin⁡(πt)g(t) dt, the integrands being defined and measurable off the null point t=0.

2.2step 1.2F6F7F9

Put ak:=−isgn⁡(k)f^(k). Since ∣ak∣≤∣f^(k)∣ for every k (with a0=0), [F6] gives ∑k∣ak∣2≤∥f∥22<∞. Thus [F7] supplies a unique class Cf∈L2(T;C) whose symmetric partial sums are exactly the CSNf of 1.2 and which is their L2 limit; by [F9] there is an increasing sequence Nj→∞ with CSNjf(x)→Cf(x) for almost every x.

3.1step 2.1F8F10F12

For the point x of 2.1, [F12] writes cos⁡((2N+1)πt)=cos⁡(2πNt)cos⁡(πt)−sin⁡(2πNt)sin⁡(πt), so RN(x)=∫∣t∣<1/2cos⁡(2πNt)cos⁡(πt)g(t)sin⁡(πt) dt−∫∣t∣<1/2sin⁡(2πNt)g(t) dt. Both t↦cos⁡(πt)g(t)/sin⁡(πt) and t↦g(t) are integrable on (−1/2,1/2): the second because f is L1 on the finite torus and the quotient is bounded near 0 by C; away from 0, 1/sin⁡(πt) is bounded and g∈L1, so the quotient is integrable there as well. Extending them by zero to one period, [F8] gives h^(N)→0 for these integrable functions, hence RN(x)→0 as N→∞; the convergence is at every such x, and no uniformity in x is claimed.

3.2step 2.1F10F11

Also at the point x of 2.1, for 0<ε<1/2 the oddness of cot⁡ gives ∫ε<∣t∣<1/2cot⁡(πt)f(x−t) dt=∫ε<∣t∣<1/2cot⁡(πt)g(t) dt, and by [F10] the function cot⁡(πt)g(t) is integrable on (−1/2,1/2); [F11] therefore gives ∫ε<∣t∣<1/2cot⁡(πt)g(t) dt→A(x) as ε↓0. So the symmetric principal value exists at x and equals A(x).

4.1step 2.2step 3.1step 3.2∎

Combining 3.1 and 3.2, for every x at which f is C1 near x the finite convolutions satisfy CSNf(x)=A(x)−RN(x)→A(x), so the full sequence CSNf(x) converges to the principal value at every such x; by 2.2 it also converges to Cf(x) along a subsequence for almost every x. Therefore Cf(x)=lim⁡ε↓0∫ε<∣t∣<1/2f(x−t)cot⁡(πt) dt for almost every x in the open set where f is C1 near x, as asserted.

Depends on

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