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 simultaneous phase approximation

Statement

Let r≥0 be an integer such that 1,x1,…,xr are linearly independent over Q. For every ε>0 and z1,…,zr∈C of modulus one, there is a positive integer L such that ∣e2πiLxj−zj∣<ε for all 1≤j≤r.

Facts & Assumptions

[F1]

Period-one characters and their Fourier coefficient normalization are fixed Period-one Fourier coefficients, partial sums, and convolution on the torus.

[F2]

Every continuous one-periodic function is uniformly approximated by its finite Fejer polynomials Fejer means converge uniformly for continuous periodic functions.

Proof

Given: The rational independence, unimodular targets and positive epsilon.

1.1F1given

For r=0, take L=1. Otherwise put bj(t)=max⁡(0,1−2∣e2πit−zj∣/ε). This continuous periodic function lies between zero and one and is positive only when ∣e2πit−zj∣<ε/2. It equals one at an argument of zj, and continuity makes its integral βj strictly positive. Set b(t1,…,tr)=∏jbj(tj) and β=∏jβj>0.

2.1F1F2step 1.1

By F2, approximate each bj uniformly within ρ≤1 by a trigonometric polynomial pj. Then ∣pj∣≤2, and telescoping products yields sup⁡∣∏jpj−∏jbj∣≤r2r−1ρ. The constant coefficient of p=∏jpj as a polynomial in r coordinates is the product of the individual constant coefficients. Each differs from βj by at most ρ, by the integral definition in F1. Thus that coefficient differs from β by at most r2r−1ρ as well. This argument needs no multivariable approximation theorem or interchange of infinite series.

3.1F1step 2.1

For each nonzero integer vector k∈Zr, independence gives k⋅x∉Z. Put u=e2πik⋅x≠1. Then M−1∑L=1MuL=u(1−uM)/(M(1−u))→0. The zero vector gives average one. Applying these identities to the finitely many terms of p proves that M−1∑L=1Mp(Lx1,…,Lxr) tends to its constant coefficient. Step 2.1 bounds the limsup of the absolute difference between the corresponding average of b and β by 2r2r−1ρ. Since every positive ρ≤1 is allowed, the average of b tends to β>0.

4.1step 1.1step 3.1∎

Some positive integer L therefore has b(Lx1,…,Lxr)>0. Every factor is positive, so step 1.1 gives all the required strict phase inequalities (indeed with epsilon/2). Positivity of L follows from using averages indexed from one, not from a symmetry argument about negative times. Only finitely many approximants are selected for each fixed rho; the proof uses no axiom of choice.

Depends on

Used by

Dependency tree · two levels

11 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