I have a lack of mathematical knowledge, and notably in mathematical vocabulary, so maybe a similar question exists but with a different wording.
What I want to know, is actually how to know if a function, given its properties (for example, a polynomial with natural-number coefficients) can be converted to a finite sum of sinuoids, or in other words if the Fourier transform of the function will give a finite sum of frequencies (because, as I understand the FT, which decomposes a signal into sinusoids, an infinite sum of frequencies means that the function is not sinusoidal in its nature and thus can only be approximated to a sinuoid, through an infinite sum of sinuoids).
Is there a theorem or a principle that can told me if a function, as long as it does not involve some specific operations, stay perfectly convertable (= no approximation) to a sinusoid ?
Please avoid complex mathematical notations as possible (unless each indeterminate or non-trivial greek letter is explained), I better understand natural phrasing and analogies, I'm only a beginner in signal processing, which I investigate for the purpose of advancing knowledge in image/graphics processing.
