Do tuples exist which aren't elements of a cartesian product of sets?

bentley4
Messages
66
Reaction score
0
Do tuples exist which aren't elements of a cartesian product of sets?
Can you just write an ordered list of elements which does not necessarily have to be defined in sets? (or does every tuple need to be defined through sets in order for it to rigourously exist in mathematics?)
 
Physics news on Phys.org
it's not clear what you're asking.

normally, an ordered tuple is a subset of SOME set AxBxC, but the sets involved might be unusual.
 
The answer is yes.

Suppose you give me the triple (a, b, c). Then this is an element (in fact, the only element) of {a}x{b}x{c}.

This works for all (finite) tuples. (For infinite tuples, which are actually just sequences, we need to assume the axiom of choice to guarantee that there such a set exists.)
 
bentley4 said:
Can you just write an ordered list of elements which does not necessarily have to be defined in sets? (or does every tuple need to be defined through sets in order for it to rigourously exist in mathematics?)
An natural question, particularly for a mathematically interested programmer: Wheras defining arrays (i.e. tuples) of any length is commonplace in all sensible programming languages, sets are absent from wide spread languages such as C.
Actually one can build the foundations of mathematics in a way that tuples are closer to the grounds than sets.
Most professors in mathematics probably feel that it would create more trouble than benefits if one would deviate from the narrow set based presentation of mathematics in courses.
Others feel that the strengthening role of computers, computing, and computation in science asks for a redesign of the taught foundations of mathematics.

You are on a good way; keep your eyes open an look behind the omnipresent orthodoxy.
 
##\textbf{Exercise 10}:## I came across the following solution online: Questions: 1. When the author states in "that ring (not sure if he is referring to ##R## or ##R/\mathfrak{p}##, but I am guessing the later) ##x_n x_{n+1}=0## for all odd $n$ and ##x_{n+1}## is invertible, so that ##x_n=0##" 2. How does ##x_nx_{n+1}=0## implies that ##x_{n+1}## is invertible and ##x_n=0##. I mean if the quotient ring ##R/\mathfrak{p}## is an integral domain, and ##x_{n+1}## is invertible then...
The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...
When decomposing a representation ##\rho## of a finite group ##G## into irreducible representations, we can find the number of times the representation contains a particular irrep ##\rho_0## through the character inner product $$ \langle \chi, \chi_0\rangle = \frac{1}{|G|} \sum_{g\in G} \chi(g) \chi_0(g)^*$$ where ##\chi## and ##\chi_0## are the characters of ##\rho## and ##\rho_0##, respectively. Since all group elements in the same conjugacy class have the same characters, this may be...

Similar threads

Back
Top