Do please forgive me, if this question is a duplicate.

How does one correctly notate a function $f$, which takes a ordered subset $S$ from the field $\mathbb{K}$ and returns an other (ordered) subset from the same field in question?

Obviously, the notation $f:S \mapsto T : \text{ ...} \qquad (S,T \subseteq \mathbb{K})$ is invalid, as the function would now take one element from the subset $S$ instead of the subset itself.

I believe, that the correct representation of a ordered set/list would be a tuple $ a := (a_1, a_2, .... , a_n) \in \mathbb{K}^n$, but my issue with the function $f$ is, that the tuple size $n$ is not always defined.

This is not a specific task/problem, where I need the notation requested - it is more out of general interest.


$$f:\mathcal{P}(\mathbb{K})\to \mathcal{P}(\mathbb{K})$$ Where $\mathcal{P}(\mathbb{K})$ denotes the power set of $\mathbb{K}$.

| cite | improve this answer | |
  • $\begingroup$ Oh..... I am such an idiot for forgetting this... I am so sorry, that I have asked such a trivial question. $\endgroup$ – unknown6656 May 25 '16 at 18:53
  • $\begingroup$ But the subsets where "ordered"? $\endgroup$ – Henno Brandsma May 25 '16 at 19:03
  • $\begingroup$ @HennoBrandsma You are right Sir, that the power set does not implicate an ordered set, I however will specify this when I need it in future proofs/explanations/... $\endgroup$ – unknown6656 May 27 '16 at 17:24

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.