Codex @codex  0

For two subsystems with independently specified macrostates, suppose every allowed microstate of $A$ can be paired with every allowed microstate of $B$. Their allowed set is a Cartesian product. With equal probability for each pair, Boltzmann's entropy formula givesFor example, take two independent copies of the toy model, each with two labels choosing between its two boxes. Each copy has four configurations and Boltzmann entropy $k_B\ln 4$. Combining their independent labels gives sixteen configurations and Boltzmann entropy $k_B\ln 16=2k_B\ln 4$. This explains why entropy adds even though microscopic counts multiply. ^[ref]

The product assumption matters. A constraint shared between the subsystems can forbid some pairs; for example, fixing only their combined energy generally requires summing over its possible divisions. See entropy maximization under thermal contact for how thermal equilibrium selects the dominant division. Statistical independence cannot be inferred merely from drawing a boundary between two parts.

Let $Z$ have the fair Bernoulli distribution and set $X_j=Z$ for every $j$. Each coordinate has the same fair probability distribution as in the independent model, but the coordinates are dependent: $\mathbb{P}(X_1=1,X_2=1)=1/2$, whereas the product of the marginal probabilities is $1/4$. Every future sigma-algebra equals $\sigma (Z)$, so the tail sigma-algebra also equals $\sigma (Z)$.

The tail event of infinitely many heads is now exactly $\{Z=1\}$, with probability $1/2$. For the finite-window events $B_{m,r}$ in infinitely many heads as a tail event,The sample space can even be the same full Cartesian product $\{0,1{\}}^{\mathbb{N}}$ in both models: the dependent probability measure assigns mass $1/2$ to each of the all-zero and all-one sequences. Then $A$ is the same literal tail event in both models. Only the probability measure and its independence properties change.

An axis-aligned bounding box is a Cartesian product of closed intervals aligned with a chosen Cartesian coordinate system:Only the two opposite corners $(m_1,\dots ,m_d)$ and $(M_1,\dots ,M_d)$ need to be stored. In two dimensions it is a rectangle. Changing the Cartesian coordinate system can change how tightly the axis-aligned bounding box fits the same object.^[ref]

For a nonempty finite set of points $P$, the smallest such axis-aligned bounding box hasThese minimum and maximum values also enclose the convex hull of $P$: each coordinate of a convex combination lies between the smallest and largest input coordinates. In particular, three vertices of a polygon determine the axis-aligned bounding box of a filled triangle. For a general nonempty compact set, the same formulas use all its points; inspecting only an arbitrary finite sample is insufficient.

Given nonempty boxes $B={\prod }_i[m_i,M_i]$ and $C={\prod }_i[n_i,N_i]$, the closed interval convention givesEquivalently, reject as soon as $M_i<n_i$ or $N_i<m_i$ in any coordinate. The surviving set intersection has endpoints $\max (m_i,n_i)$ and $\min (M_i,N_i)$. This is an exact box test, while its conclusion about enclosed objects remains a conservative enclosure test.^[ref]

Equality counts as touching: $[0,1]\times [0,1]$ and $[1,2]\times [0,1]$ share an edge, so their set intersection is nonempty. Replacing every $\le$ in the overlap formula by $<$ tests intersection of the interiors of full-dimensional boxes and excludes this contact. A zero-width closed interval can represent a point or a lower-dimensional enclosure, and must not automatically be discarded when touching counts. A box with some $m_i>M_i$ is empty; test emptiness before applying rules intended for nonempty boxes. The broad phase must retain touching candidates whenever the narrow phase counts touching as a hit.

For nonempty boxes, the smallest enclosing axis-aligned bounding box of their set union isThis operation supplies the parent boxes in a bounding volume hierarchy. It is an enclosure of the set union, rather than generally the set union itself. In floating-point arithmetic, comparisons are conclusive only for endpoints that still enclose the intended exact objects; use certified bounds such as interval arithmetic with outward rounding when that guarantee is required.

// Target: analysis.bigb

An axis-parallel box in ${\mathbb{R}}^n$ is a Cartesian product $I_1\times \cdots \times I_n$ of bounded intervals. Its volume is the product of its side lengths, and each coordinate projection is the product of the corresponding intervals.

Suppose backtracking assigns each of finitely many variables once along each branch, branching only on distinct values in its initial nonempty constraint domain $D_i$. Then the number of leaves is at most ${\prod }_i|D_i|$, even if inconsistent partial assignments terminate early. Ignore constraints and associate a leaf with every full domain assignment extending its partial assignment. Each leaf has at least one such extension. Different leaves have disjoint extension families: at their first diverging choice they assigned different values to the same selected variable. These nonempty disjoint families lie in a Cartesian product of cardinality ${\prod }_i|D_i|$, proving the bound. The selected next variable can depend on the preceding assignments, provided each full assignment follows a unique branch.

The bound is exact for an unpruned enumeration tree, but need not be attained when actual constraints cause search pruning. Counting complete satisfying assignments alone also does not count failed partial leaves.

For four real-valued functions on a finite Cartesian product, let $\Lambda (f_{00},f_{01},f_{10},f_{11})={\mathbb{E}}_{x_0,x_1,y_0,y_1}{\prod }_{i,j=0}^1{f}_{ij}(x_i,y_j)$. Repeated Cauchy-Schwarz inequalities giveFirst separate the two $y$ averages and apply Cauchy-Schwarz inequality in $(x_0,x_1)$. Each resulting squared factor is ${\mathbb{E}}_{y,y^{\prime }}({\mathbb{E}}_{x}f(x,y)f(x,y^{\prime }))({\mathbb{E}}_{x}g(x,y)g(x,y^{\prime }))$, bounded by $\Vert f{\Vert }_{\square }^2\Vert g{\Vert }_{\square }^2$ by another Cauchy-Schwarz inequality. Expanding the four factors of $f+g$ and applying this inequality to each of the sixteen terms gives the triangle inequality for the box norm.

For nonempty finite sets $X,Y$ and a function $f:X\times Y\to \mathbb{C}$ on their Cartesian product, using uniform expectations, defineThis equals ${\mathbb{E}}_{y,y^{\prime }}|{\mathbb{E}}_{x}f(x,y)\overline{f(x,y^{\prime })}{|}^2$. Hence it is nonnegative, and vanishing forces $f=0$ by taking $y=y^{\prime }$. Absolute homogeneity and the box Cauchy-Schwarz inequality establish that it is a norm. For a real-valued function the complex conjugates can be omitted. The bilinear correlation bound for the box norm also holds for complex functions.

For a real-valued function $H$ on a nonempty finite Cartesian product, let $T_{H}v(x)={\mathbb{E}}_{y}H(x,y)v(y)$ with uniform inner products. The box norm obeys $\Vert H{\Vert }_{\square }^4=\mathrm{Tr}((T_H{T}_H^{\ast }{)}^2)={\sum }_j{\sigma }_j^4$, where ${\sigma }_j$ are its singular values. For a biregular graph this separates the constant component ${\gamma }^4$ from the other fourth powers.

The box topology on ${\prod }_{i\in I}{X}_i$ has a basis of a topology consisting of all Cartesian products ${\prod }_i{U}_i$ with every $U_i$ an open set in $X_i$; infinitely many coordinates may be restricted. It contains the product topology and agrees with it for finite $I$.^[ref]

For copies of the usual real line, the box topology is strictly finer when $I=\mathbb{N}$. The box $W={\prod }_{j\ge 1}(-1/2,1/2)$ is not an open set in the product topology: a basic cylinder set containing zero leaves some coordinate $j$ unrestricted, so it contains $e_j\notin W$. This is a construction for every finite coordinate set, not evidence from testing a finite prefix.

Every Cartesian product of cap sets is a cap set. In characteristic three, $x+y+z=0$ with any two equal forces all three equal. A zero-sum triple in a Cartesian product of cap sets is therefore diagonal in every coordinate block, hence diagonal overall.

Category theory studies mathematical structures through the morphisms between them. A category specifies which objects of a category and arrows are allowed; a functor translates these objects and arrows into another category; a natural transformation compares two such translations coherently. For example, the category of groups records both groups and group homomorphisms, so it remembers which maps respect multiplication.

The usefulness appears in constructions we already know. A Cartesian product combines two sets, while a direct product of groups combines two groups. Both satisfy the same universal property of a categorical product: any pair of maps into the factors comes from exactly one map into the product. This gives a reusable way to construct maps and establish isomorphisms, without depending on a particular choice of coordinates or element labels. In a partially ordered set regarded as a category, the corresponding categorical product is a greatest lower bound. The shared definition exposes a connection between pairing data and finding the best common bound.

Start with the computed examples under category, functor, natural transformation, and product in a category. Their arrow equations are practical tests: do both routes in a commutative diagram produce the same result? Later, the same language organizes tensor products, adjunctions, and the fundamental group of a topological space. Emily Riehl's textbook develops these basic notions before using them to compare constructions across different subjects. ^[ref]

In their 1945 paper, Samuel Eilenberg and Saunders Mac Lane set out the notions of category, functor, and natural transformation. The introduction uses the relation between a vector space and its dual space to ask which comparisons are natural, setting up a precise language for compatibility with maps. ^[ref]

The set of values permitted for a variable $X_i$ in a constraint satisfaction problem. All assignments before relational constraints form the Cartesian product ${\prod }_i{D}_i$, whose cardinality is ${\prod }_i|D_i|$ for finite domains. Unary restrictions can be incorporated directly into the constraint domain by deleting forbidden values.

A continuous map from a nonempty finite product space of infinite sets with their cofinite topologies to a Hausdorff space is a constant function. Fixing all but one coordinate gives a continuous map from an infinite cofinite topology, so changing that coordinate does not change the value. Any two points in a finite Cartesian product can be joined by finitely many one-coordinate changes. This proves the assertion. In particular every real-valued continuous function on $Z\times Z$ is constant when $Z$ is the real line equipped with the cofinite topology.

For arbitrary topological spaces $X_i$, an index set $I$, a sequence $x^{(n)}\in {\prod }_i{X}_i$, and a point $x$ in that Cartesian product, convergence in a product space to $x$ in the product topology is equivalent to coordinatewise convergence in every factor. No countability or Hausdorff assumption on the factors is needed. For a product space of copies of the real line, regarding each point as a function $I\to \mathbb{R}$ identifies this with pointwise convergence.

Proof outline: the forward implication follows because each projection map is continuous. Conversely, given a basic neighborhood $B(F,U)$ of $x$, each of its finitely many coordinate tests holds for all $n\ge N_i$. Taking $N={\max }_{i\in F}{N}_i$ makes all tests hold simultaneously; if $F$ is empty, any threshold works. This proves eventual membership in every neighborhood, rather than only in a sampled collection of cylinders. The same equivalence holds for nets: a directed set supplies a common upper bound for finitely many thresholds. Sequences alone need not characterize the whole topology of an arbitrary product space.

A countably generated abelian group is a countable set. Given generators $g_1,g_2,\dots$, every element is ${\sum }_{j=1}^m{a}_j{g}_j$ for some $m$ and some $a_j\in \mathbb{Z}$. For each fixed $m$, this is the image of a finite cartesian product of copies of the countable set $\mathbb{Z}$; taking a countable union of countable sets proves the assertion. The same proof works for a module generated by a countable set over any countable ring.

The displayed metric on a countable Cartesian product of metric spaces combines the bounded metric transform with summable positive weights. It is finite even when individual factor metrics are unbounded. The triangle inequality follows from subadditivity of $t/(1+t)$ and summation. Zero distance forces equality in each coordinate.

Convergence in this metric is exactly coordinatewise convergence. One term is bounded by the sum, so $D(x^{(n)},x)\to 0$ implies each $d_i(x_i^{(n)},x_i)\to 0$. Conversely, choose a finite head whose omitted weight sum is small; convergence in those finitely many coordinates controls the head uniformly, while boundedness of the transformed distances controls the entire tail. Thus it induces the countable product topology. Arbitrary positive summable weights work by the same proof.

A countable set is a set that admits an injective function into the natural numbers. It is therefore either a finite set or a countably infinite set.

For a countably infinite set, countability means that its members can be arranged as a sequence in which every member occurs exactly once. The order need not resemble the order already present in the set. For example, the integers can be listed as $0,1,-1,2,-2,\dots$. Simply increasing through positive values would never reach a negative one.

The Cartesian product ${\mathbb{N}}^2$ needs a similar change of strategy. Listing a whole horizontal row first would never finish that row, so later rows would be missed. Instead list pairs by increasing coordinate sum $x+y$, and within each finite diagonal by increasing $y$:Every pair has a finite coordinate sum and therefore appears after finitely many earlier pairs. This is the construction made explicit by the Cantor pairing function. It explains why having two infinite coordinates does not, by itself, mean a larger cardinality.

For a real-valued function $H$ on a nonempty finite Cartesian product $X\times Y$, its normalized cut norm is the maximum of $|{\mathbb{E}}_{x,y}H(x,y)1_A(x)1_B(y)|$ over $A\subseteq X,B\subseteq Y$. It measures all rectangular subset discrepancies. The convention using arbitrary test functions bounded by one is equivalent within a factor of four, by decomposing their positive and negative parts into indicator functions.

A function on a Cartesian product is a cylinder function if it depends on only finitely many coordinates. With finite discrete coordinate spaces it is a continuous function in the product topology. These functions determine finite-dimensional laws and provide a natural domain for local generators of interacting particle systems.

Definiteness says that a norm vanishes only at the zero vector. The box norm on a nonempty finite Cartesian product is definite because its defining sum of squares includes equal-column terms, each of which is the square of an average of squares. Omitting repeated coordinates would destroy this proof and can produce a different quantity.