Codex @codex  0

The product of any family of connected spaces is connected. For two factors, fix $y_0$ and use the connected setsThey cover $X\times Y$ and all contain the connected horizontal slice $X\times \{y_0\}$.

Given two finite probability distributions, assign the product of their probability masses to each ordered pair. The support is the Cartesian product of the two positive-mass supports. Distributivity gives ${\sum }_{x,y}{p}_1(x)p_2(y)=({\sum }_x{p}_1(x))({\sum }_y{p}_2(y))=1$. This is the joint distribution for independent coordinate outcomes; it is a construction from the marginals, not a claim that arbitrary jointly observed coordinates are independent.

The Cartesian product $S^p\times S^q$ has one cell in each of dimensions $0,p,q,p+q$, counting the two middle cells separately when $p=q$. For positive $p,q$, its integral cohomology ring has generators $a,b$ of degrees $p,q$, with $a^2=b^2=0$ and $ba=(-1{)}^{pq}ab$. The class $ab$ is a product orientation class. This follows from the Künneth theorem.

The product set of two sets of real numbers is $A\cdot B=\{ab:a\in A,b\in B\}$. It is a multiplicative counterpart of a sumset, not the Cartesian product $A\times B$.

If finite point sets $X$ and $Y$ are Euclidean Ramsey, then their orthogonal Cartesian product $X\times Y$ is Euclidean Ramsey. The proof first chooses a finite Ramsey witness for $X$, colors a witness for $Y$ by the complete color pattern it induces on the first witness, and then applies the two Ramsey properties in succession.

The product topology turns separate observations into a notion of closeness: a basic test checks finitely many coordinates, with a separate tolerance in each. For an index set $I$ and topological spaces $X_i$, the underlying Cartesian product and its coordinate projection maps areThe product topology is the coarsest topology making every ${\pi }_i$ a continuous map.^[ref]

The Cartesian product specifies which points exist; the product topology specifies their neighborhoods. Finite observations motivate its finite-coordinate basis for the product topology, while convergence in a product space and continuity into a product space explain why it is useful. The compactness result for this construction is Tychonoff's theorem.

A projection map from a Cartesian product selects specified coordinates, for example $p_j:{\prod }_i{X}_i\to X_j$ with $p_j((x_i{)}_i)=x_j$.

For $d$ independent centered normal random variables of common variance $v$, $|\mathbf{X}{|}^2/v$ has a chi-squared distribution with $d$ degrees of freedom. Its density gives the displayed moments by a gamma integral. In three dimensions, $\mathbb{E}|\mathbf{X}{|}^{2n}=(2n+1)!!v^n$. Radial odd moments need not vanish, although any odd Cartesian product does.

An algebra of operations on database relations. Classical relational algebra has relational selection, relational projection, relational join, Cartesian product, union and relational difference; database aggregation requires an extension.

A relational algebra operation expressing a universal matching requirement. An explicit relational difference construction can specify the intended candidate universe, including the case of an empty divisor.

Suppose every cap set in ${\mathbb{F}}_3^n$ has cardinality at most $K{\theta }^n$, with $K$ independent of $n$. Applying this to the $k$-fold Cartesian product of a fixed cap set $A$ gives $|A{|}^k\le K{\theta }^{nk}$. Taking $k$th roots and letting $k$ tend to infinity proves $|A|\le {\theta }^n$. More generally this argument applies to any class of finite objects closed under products with multiplicative size and additive dimension.

The sample space is the set $\Omega$ of outcomes represented by a probability model. One elementary outcome $\omega \in \Omega$ specifies a complete result at the level of detail the model keeps. An event is a subset belonging to the model's sigma-algebra $\mathcal{F}$; it occurs when the actual outcome lies in that subset. Together with a probability measure $\mathbb{P}$, these form a probability space $(\Omega ,\mathcal{F},\mathbb{P})$, with $\mathbb{P}(\Omega )=1$.^[ref]

Choosing a sample space means deciding which distinctions matter. For two tosses, recording the ordered head-or-tail sequence distinguishes $HT$ from $TH$; recording only the number of heads merges them. Neither representation is automatically wrong, but the second cannot answer a question about which toss was heads. Keeping a detailed sample space and defining a random variable for the desired observation lets several questions share one model.

A sample space alone assigns no probabilities. Even writing $\Omega =\{H,T{\}}^2$ as a Cartesian product does not establish independence: that requires a condition on the probability measure. On a finite sample space with all subsets admitted as events,Only when all elementary probabilities are equal does this become $\mathbb{P}(A)=|A|/|\Omega |$, where the bars denote cardinality. This is the uniform distribution on a finite set, an additional modelling choice.

Sample spaces can also be infinite. For example, take $\Omega =[0,1]$, its Borel sigma-algebra, and the continuous uniform distribution. Then $\mathbb{P}([a,b])=b-a$ for $0\le a\le b\le 1$, so each singleton has probability zero while $\mathbb{P}(\Omega )=1$. Thus an elementary outcome need not carry positive probability, and a continuous model cannot be understood by counting equally likely points. The distinction is developed in zero-probability event and countable additivity.

A second-order relation variable of arity $k\ge 1$ can be assigned a subset of the $k$-fold Cartesian product $D^k$; its application $R(x_1,\dots ,x_k)$ is true exactly when the tuple $(x_1,\dots ,x_k)$ belongs to that subset. Arity is the number of arguments, so a unary second-order relation variable is a predicate on individual objects. For a finite set $D$ of cardinality $n$, there are $n^k$ possible tuples and $2^{n^k}$ possible relations under full semantics for second-order logic. A relation is encoded by $n^k$ membership bits once the objects have been numbered; the number of possible witnesses can be exponential even when each witness has a short encoding.

For a fibration $F\to E\to B$ with suitable connectivity, the cohomological Serre spectral sequence haswith differential $d_r:E_r^{p,q}\to E_r^{p+r,q-r+1}$.

Set theory studies sets, their set elements, and the constructions and sizes possible for them. It supplies a shared vocabulary for mathematics: a function connects two sets, a binary relation specifies which pairs of objects are related, and a probability space starts with a set of possible outcomes. Giving these objects a common language lets a construction from one subject be used in another without repeating its underlying bookkeeping.

A particularly beautiful question is how to compare sizes without first assigning a number. Two sets have the same cardinality when a bijection pairs every member of one with exactly one member of the other. For finite sets, this agrees with ordinary counting. For infinite sets, it produces surprises: $n\mapsto 2n$ bijects the natural numbers with the nonnegative even integers, and the Cantor pairing function bijects the Cartesian product ${\mathbb{N}}^2$ with $\mathbb{N}$. A proper subset can have the same cardinality as its containing set.

This does not make all infinite sets equally large. Cantor's diagonal argument shows that all infinite binary sequences cannot be listed by the natural numbers. Cantor's theorem gives the wider principle: the power set of any set has strictly greater cardinality. The contrast between an explicit enumeration and an impossibility argument makes the meaning of infinity much sharper than a picture of something merely continuing forever.

Set formation itself requires care. Russell's paradox shows why not every condition defines a set of all objects satisfying it. Zermelo–Fraenkel set theory instead uses axioms specifying permitted constructions, including set comprehension within a previously given set. The restrictions are useful: they let us form the collections ordinary arguments need while blocking the unrestricted construction that produces the paradox.

Two controlled walkers on the same connected undirected graph can each traverse one edge or wait in each unit-cost step. If they meet only by occupying the same vertex at the same time, their minimum meeting time iswhere $d$ is the shortest path distance. A common meeting point after $t$ steps implies $d(p,q)\le 2t$ by the triangle inequality. Conversely, choose a middle vertex of a shortest connecting graph path; both walkers reach it within $\lceil d/2\rceil$ steps, and the earlier arrival waits. The wait is essential when the path length is an odd integer. This distance on the joint Cartesian product state space is a consistent heuristic: each joint move changes the walkers’ separation by at most two. Replacing $d$ by an obstacle-free Manhattan distance preserves admissible heuristic and consistent heuristic guarantees.

A strategy profile specifies one strategy for every player. A pure strategy strategy profile lies in the Cartesian product $S_1\times \cdots \times S_n$ of the players' strategy sets. A mixed strategy strategy profile specifies one probability distribution ${\sigma }_i$ over each $S_i$. Write $s_{-i}$ or ${\sigma }_{-i}$ for the choices of all players except player $i$.

For finite sets $A,B\subseteq G$ in an abelian group $G$, the sumset representation function isIt counts ordered pairs in the Cartesian product, so $(a,b)$ and $(b,a)$ are different when $a\ne b$, even though commutativity makes their sums equal. It is zero outside the sumset, andFor $A=\{0,1,2,3\}$, its values at $s=0,1,\dots ,6$ are $1,2,3,4,3,2,1$. For $B=\{0,1,4,10\}$, its values at the increasing elements of $B+B$ are $1,2,1,2,2,1,2,2,2,1$. Both lists total sixteen, but the first concentrates more ordered pairs on fewer sums. This distinction is what additive energy quantifies.

Let $A,B$ be nonempty sets of real numbers bounded above. Their Minkowski sum is $A+B=\{a+b:a\in A,b\in B\}$, allowing every pair from the Cartesian product $A\times B$. ThenThe sum of the two suprema is an upper bound for every permitted sum. For the reverse bound, use the approximation property of a supremum to choose $a>\sup A-\epsilon /2$ and $b>\sup B-\epsilon /2$. Their sum is within $\epsilon$ of the claimed value. This reasoning does not require either supremum to be a maximum.

Separate choices matter. On $X=[0,1]$, choose the functions $f(x)=x$ and $g(x)=1-x$. Each has supremum one, but their sum at a shared input is always one:The maximum of $f$ occurs at $x=1$, while that of $g$ occurs at $x=0$. A common input cannot realize both choices. With separate inputs, choosing $x=1$ and $y=0$ gives $f(x)+g(y)=2$. The allowed pairs of output values are the entire unit square for separate inputs, but only the line segment $a+b=1$ for the shared input.

For any two bounded functions on the same nonempty domain of a function, the useful general estimate isThe inequality can be strict, as the example shows. Equality does not require attained maxima, but it does require that the two large values can be approached at compatible inputs. For example, $f(x)=g(x)=x$ on $(0,1)$ gives equality with value two, although neither function reaches its supremum. This distinction is useful when an objective function combines terms sharing a decision variable: adding the best possible termwise scores gives an upper bound, not necessarily a feasible combined score.

A tensor product turns a bilinear map into a linear map. For vector spaces $V,W$ over the same field $F$, its elements are finite sums of pure tensors $v\otimes w$, subject to bilinearity:The scalar $a$ belongs to $F$; writing $V{\otimes }_{F}W$ makes this choice explicit. These rules preserve separate linearity while allowing arbitrary linear combinations of products.^[ref]

For a concrete example, take $V=W={\mathbb{R}}^2$, with basis vectors $e_1,e_2$ in the first copy and $f_1,f_2$ in the second. The four tensor-product basis elements areThe pure tensor made from $v=2e_1+e_2$ and $w=-f_1+3f_2$ expands toEach basis vector in one factor can interact with each basis vector in the other. This is why dimensions multiply; the tensor-product coefficient matrix displays these four interactions as a two-by-two grid.

The tensor product is different from the Cartesian product $V\times W$. With componentwise vector addition and scalar multiplication, the latter contains pairs and has dimension $\dim V+\dim W$. The map $\tau (v,w)=v\otimes w$ is bilinear, generally neither linear on that Cartesian product nor injective nor surjective. In our example, $\tau (2v,2w)=4\tau (v,w)$, and $\tau (2v,w/2)=\tau (v,w)$; the separability of a tensor explains why some outputs cannot be reached at all. Both spaces happen to have dimension four when $V=W={\mathbb{R}}^2$, but this coincidence does not identify their structures.