Cartesian product of index family of sets

chipotleaway
Messages
174
Reaction score
0
Cartesian product of indexed family of sets

The definition of a Cartesian product of an indexed family of sets (X_i)_{i\in I} is \Pi_{i\in I}X_i=\left\{f:I \rightarrow \bigcup_{i \in I} \right\}

So if I understand correctly, it's a function that maps every index i to an element f(i) such that f(i) \in X_i…my question is, is there supposed to be a notion of 'order' implied in the definition here?

The 'usual' Cartesian product is \Pi^n_{i=1}X_i=\left\{ (x_i)^n_{i=1}: x_i \in X_i \right\} and here, there seems to be some notion of 'order' cause the first element is in X_1, second in X_2 etc.

But for the first, if the index set is I={1,2,3}, then couldn't we have have X_1 \times X_2 \times X_3 or X_2\times X_1\times X_3 (any reordering of indices in the index set)? Then the definition of the Cartesian product could be ((f(1), f(2), f(3)) or (f(2), f(1), f(3))...
 
Last edited:
Physics news on Phys.org
hi chipotleaway! :smile:
chipotleaway said:
… is there supposed to be a notion of 'order' implied in the definition here?

yes and no

there's only an order if the index set, I, has an order :wink:
 
hmm...so the case if I={1,2,3,4}, it would only reduce to the 'usual definition', n running from 1 to 4 to we somehow define the order to be 1,2,3,4
 
yes, eg spacetime coordinates are sometimes written (x0, x1, x2, x3), and sometimes (x1, x2, x3, x4)

ie sometimes with t (or ct) at the beginning and sometimes with t at the end :wink:
 
  • Like
Likes 1 person
Hi all, I've been a roulette player for more than 10 years (although I took time off here and there) and it's only now that I'm trying to understand the physics of the game. Basically my strategy in roulette is to divide the wheel roughly into two halves (let's call them A and B). My theory is that in roulette there will invariably be variance. In other words, if A comes up 5 times in a row, B will be due to come up soon. However I have been proven wrong many times, and I have seen some...
Thread 'Detail of Diagonalization Lemma'
The following is more or less taken from page 6 of C. Smorynski's "Self-Reference and Modal Logic". (Springer, 1985) (I couldn't get raised brackets to indicate codification (Gödel numbering), so I use a box. The overline is assigning a name. The detail I would like clarification on is in the second step in the last line, where we have an m-overlined, and we substitute the expression for m. Are we saying that the name of a coded term is the same as the coded term? Thanks in advance.
Back
Top