3
votes
0answers
53 views
+100

Compositions of filters on finite unions of Cartesian products

Let $\Gamma$ be the lattice of all finite unions of Cartesian products $A\times B$ of two arbitrary sets $A,B\subseteq U$ for some set $U$. See this note for other equivalent ways to describe the set ...
0
votes
0answers
52 views

Shortest possible proof of a simple theorem [closed]

I want the shortest proof of the following not so hard theorem. I have not yet proved it, I am going to prove it. But if your proof is shorter than mine, you would win :-) Let $A$, $B$ be sets. I ...
0
votes
0answers
28 views

Product of tuples vs cartesian product of set

If $\left ( X_{i} \right )_{1\leq i\leq n}$ is an ordered n-tuple of sets their Cartesian product is defined as: $$\prod_{i=1}^{n}X_{i}:=\left \{ (x_{i})_{1\leq i\leq n} :x_{i}\in (X_{i}) \; \text{ ...
0
votes
1answer
44 views

tuple of tuples notation

Is the following notation right for indicating a $\mathit{m}-$tuple of $\mathit{n_{j}}-$tuples (I mean that each tuple of the $\mathit{m}-$tuple has a different number of elements)? ...
0
votes
1answer
41 views

Replace $n$ sets with two sets (set theoretic equality)

Let $A_0,\dots,A_{n-1}$ be sets for some whole $n>0$. Take $A'_{0, i} = A_i$ and $A'_{1, i} = \bigcup ( \{ A_0, \ldots A_{n - 1} \} \setminus \{A_i\})$ for $i=0,\dots,n-1$. Prove (or disprove) $$ ...
2
votes
1answer
28 views

Union of Cartesian squares

I am trying to find sufficient and necessary conditions for a relation to be representable as a union of Cartesian squares: $\bigcup_{i\in I}(X_i\times X_i)$ for some family $X_i$ of sets. One ...
1
vote
2answers
62 views

Basic Cartesian prodcuts

I am having some issues grasping basic ideas of Cartesian products. I am reading a PDF my professor gave us explain sets/Cartesian products. If $\mathbb{R}\times \mathbb{R}$ can be written as ...
3
votes
0answers
80 views

Product of Summations for All Subsets

We have a set $X$ of $n$ integers $\{$$x_1$, $x_2$, .. , $x_n$$\}$, for which there are $2^n$ total subsets. The summation $s$ of a subset $X'$ is simply the sum of all integers present in $X'$, ...
0
votes
1answer
42 views

Can we express these sets as Cartesian products of two subsets of $\mathbf{R}$?

Let sets $A$ and $B$ be given as follows: $$A := \{ (x,y) \in \mathbf{R}^2 | \ \ x < y \ \ \} $$ and $$B := \{ (x,y) \in \mathbf{R}^2 |\ \ x^2 + y^2 < 1 \ \ \}.$$ Can we express $A$ or $B$ as ...
3
votes
1answer
129 views

About binary relations under certain conditions and their composition

(I have edited it. The previous version was with errors.) Let $A$ be a set. Let $\pi_0$, $\pi_1$ be projections from $A\times A$. Let $F_0$, $F_1$, $G_0$, $G_1$ be binary relations on $A$. Let ...
8
votes
5answers
795 views

Definition of the Infinite Cartesian Product

(1) If $X$ and $Y$ are two sets, we define the Cartesian product $X \times Y$ as the set of ordered pairs $(x,y)$, such that $x \in X$ and $y \in Y$. (2) On the other hand [Folland, Real Analysis, ...
1
vote
3answers
392 views

set theoretic function, products of sets (product versus Cartesian product)

Regarding the products of functions in axiomatic set theory, two textbooks which I am reading (Halmos; Hrbacek/Jech) have said the following: "There is a natural one-to-one correspondence between ...