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 be an integer such that are linearly independent over . For every and of modulus one, there is a positive integer such that for all .
Facts & Assumptions
Period-one characters and their Fourier coefficient normalization are fixed Period-one Fourier coefficients, partial sums, and convolution on the torus.
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.
For , take . Otherwise put . This continuous periodic function lies between zero and one and is positive only when . It equals one at an argument of , and continuity makes its integral strictly positive. Set and .
By F2, approximate each uniformly within by a trigonometric polynomial . Then , and telescoping products yields . The constant coefficient of as a polynomial in coordinates is the product of the individual constant coefficients. Each differs from by at most , by the integral definition in F1. Thus that coefficient differs from by at most as well. This argument needs no multivariable approximation theorem or interchange of infinite series.
For each nonzero integer vector , independence gives . Put . Then . The zero vector gives average one. Applying these identities to the finitely many terms of proves that tends to its constant coefficient. Step 2.1 bounds the limsup of the absolute difference between the corresponding average of and by . Since every positive is allowed, the average of tends to .
Some positive integer therefore has . Every factor is positive, so step 1.1 gives all the required strict phase inequalities (indeed with epsilon/2). Positivity of 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
4 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)