Are all single valued functions, of one variable, symmetric. Where symmetric is taken to mean invariant under permutation of the distinct $n$ variables.
Presumably as there is no variable to permute, any function of one variable is symmetric in this sense? ie, $F(x)=F(x)\,\text{where}\,,F(x)\in \mathbb{R}$.
Secondly, what about the 1st degree, elementary symmetric functions of one variable. Is this just taken the the $k$th (first power sum of the one and only variable) so that $F(x)=x^k=x$ as $k=1$ ; ie does the permutation just mean, (in the one variable case), just swapping the 1st element of the domain with the first element of the domain (ie,itself), so that given the permutation, $F(x)=x$ ?, which is the original function value, and thus, $F$ is symmetric?.
I know that,that this is trivial if this is what is meant, so am just checking that I am, correct that permutation symmetry is not re-defined to mean something else, in the case of a single variable function, simply because there does not exist a distinct permutation of the domain elements, to begin with?
Ie, does a permutation, of an element of the domain, $x$ (or in general), have to be distinct,to count as a permutation of that $x$ ie is $\langle x \rangle$, considered, non-distinct, permutation of $\langle x\rangle$, formally?. That is, formally, is it acceptable to use the term, 'a permutation of $x$', in the case that where the permutation, simply returns '$x$', that is leaves the entity permuted, invariant. Which, incidentally, will always be the case for a one variable function, and thus will be symmetric as per my question . And am I correct, that this applies in general. For example,in cases where each element of the domain, is an ordered set of 2 or more elements of reals, that, it is still acceptable to call the identity transformation, of some element of the domain, a 'permutation', of that element of the domain?
ie $\langle x,y\rangle$, a 'permutation' of $\langle x,y\rangle$, despite the fact that it returns the very same ordered set, must a 'permutation' return a distinct ordering of the elements of that ordered set, for the term, 'permutation of that ordered set', to be correctly used?