To keep things mathematically both precise and simple, let's stick with the discrete Fourier transform. Signals are vectors of $N$ complex points, where $N$ is the dataset's length. The dimension of this vector space is $N$.
In this setting, the Fourier transform is simply a resolution of a signal, thought of as a vector, into components with respect to a certain basis of unit vectors. The fact that these basis vectors are periodic is secondary.
The "simplest" and most obvious basis for our vector space is the set of signals
$$\begin{array}{cccccc}
(1,&0,&0,&\cdots,&0,&0)\\
(0,&1,&0,&\cdots,&0,&0)\\
(0,&0,&1,&\cdots,&0,&0)\\
&&\vdots&&&\\
(0,&0,&0,&\cdots,&1,&0)\\
(0,&0,&0,&\cdots,&0,&1)\\
\end{array}$$
These vectors span the vector space i.e. you can write any vector as a superposition of them, and they are linearly independent, which means that none of them is the superposition of the others. So they are a minimal set needed to build all possible signals by superposition out of.
The Fourier transform is simply the change of basis of a vector so that it is now written as a superposition of of signals of the form $\left\{\frac{1}{\sqrt{N}}\,\exp\left(i\,\frac{2\,\pi\,j}{N}\right)\right\}_{j=0}^{N-1}$.
These new basis vectors also span the vector space, and are linearly independent. So in this basis, $\exp\left(i\,\frac{2\,\pi\times 6}{N}\right)$ has only one component: namely $\exp\left(i\,\frac{2\,\pi\times 6}{N}\right)$; it cannot, as a superposition, contain any other components because the basis is linearly independent. So it cannot contain a component of the distinct $\exp\left(i\,\frac{2\,\pi\times 3}{N}\right)$, even though this one has twice the former's period. The periods are irrelevant given the linear independence of the basis.
So think of the Fourier transform as a change of basis in a vector space rather than primarily defined by periodicity. Indeed the Fourier transform is a unitary change of basis insofar that it conserves the power of signals. So it's kind of like a generalized rotation.