TITLE: How can I represent the (haskell, python etc.) zip function in math notation?
QUESTION [6 upvotes]: It is similar to cartesian product of sets $\{a,b\} \times \{c,d\} = \{(a,c), (a,d), (b,c), (b,d)\}$, but applied to (ordered) tuples and without the permutations that don't match, i.e. $\langle a,b\rangle zip \langle c,d\rangle = \langle(a,c), (b,d)\rangle$.

REPLY [4 votes]: Given two families $(a_i\in A\mid i\in I)$ and $(b_i\in B\mid i\in I)$ with the same index set, the zip is a family $\left ((a_i,b_i)\in A\times  B \mid i\in I\right)$