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.
Riesz-product witnesses for a Hadamard-lacunary set
Statement
Let be a finite subset of a positive -Hadamard-lacunary sequence. It is a union of finitely many sets , with each successive ratio in at least . For arbitrary unimodular and each class, the Riesz product
is nonnegative, has integral , and satisfies for .
The lacunary and additive conventions are those of Hadamard-lacunary sequences and lacunary trigonometric series and Hadamard gaps bound the additive representations used in even moments.
Facts & Assumptions
Given: A finite , a ratio , and unimodular numbers as in the Statement.
Proof
Choose with and split the original indices by residues [given, algebra] modulo . Each resulting frequency class has successive ratio at least . Each factor of equals and is nonnegative.
On one such class, a nonempty signed sum with coefficients in [step 1.1, algebra] cannot be zero: its largest frequency exceeds the sum of all smaller possible frequencies, by the ratio-three geometric bound. Therefore the product expansion has constant term only when every factor contributes its . Its integral is consequently .
The same largest-frequency argument says that frequency in [step 1.1, step 2.1, algebra] the expansion occurs only by taking from the factor and elsewhere. Hence , as claimed.
Depends on
Used by
Dependency tree · two levels
3 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
- Loukas Grafakos, Classical Fourier Analysis, 3rd ed., Definition 3.6.5 and proof of Theorem 3.6.6 (standard reference, not scraped)